Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kuan-Tsae Huang

dblp:11/1560 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 100%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 77% Data models and query languages · 23%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
queueing models
0.021991
Token-passing Systems with Batch Arrivals and their Application to Multimedia File Transfer over Token-ring LANs · INFOCOM 1991
Analysis of Token Ring Networks with Both Finite and Infinite Buffer Capacity Stations · INFOCOM 1991
Performance modeling and evaluation › queueing models
finite buffer queue
0.011991
Analysis of Token Ring Networks with Both Finite and Infinite Buffer Capacity Stations · INFOCOM 1991
Data models and query languages › query interface
query by example
0.011987
Office-by-Example: An Integrated Office System and Database Manager · ACM Trans. Inf. Syst. 1987

Methods — techniques the papers use, named apart from their topics

queueing analysis · 0.0laplace-stieltjes transform · 0.0example elements · 0.0
YearPublicationVenuePosition
1993 Performance of a token-passing system with batch arrivals and its application to file transfers
Robert H. Deng, Xian-Yu Zhang, Kuan-Tsae Huang
Comput. Commun.3
1991 Analysis of Token Ring Networks with Both Finite and Infinite Buffer Capacity Stations
abstract
The effects of station buffer capacity on the performance of token-ring networks are investigated. The network is modeled as a multi-queue system with a single cyclic server, one finite buffer queue and an arbitrary number of infinite buffer queues, a nonexhaustive service discipline, constant station walking time, Poisson arrival processes, and general message service time distributions. For the particular cases of exponentially distributed and constant message service times, approximate average message delays for both the finite and infinite buffer stations and the probability of message blocking at the finite buffer station are given in explicit expressions. Several numerical results are presented. Interesting conclusions are obtained from comparing network performance in the case when the network traffic load is completely balanced with the case when the finite buffer station is much more heavily loaded than the individual infinite buffer stations.>
Robert H. Deng, Wendy C. L. Chiew, Kuan-Tsae Huang
INFOCOM3
1991 Token-passing Systems with Batch Arrivals and their Application to Multimedia File Transfer over Token-ring LANs
abstract
The performance of token-passing systems with limited service and Poisson arrivals is investigated. For pure Poisson arrivals, a Laplace-Stieltjes transform (LST) of an approximate customer/packet waiting time distribution is derived and expressed as a functional equation, from which the approximate mean and the variance of waiting time are obtained; for batch Poisson arrivals, an approximate mean of waiting time is derived. Mean waiting time approximations are compared against both simulation results and other results presented in the literature, while the variance approximation is evaluated by comparing it to simulation results only since no other results on variance have been reported so far. As application examples of the analytical results, multimedia file transfers over token-passing LANs are modeled and studied.>
Robert H. Deng, Xian-Yu Zhang, Kuan-Tsae Huang
INFOCOM3
1987 Office-by-Example: An Integrated Office System and Database Manager
abstract
Office-by-Example (OBE) is an integrated office information system that has been under development at IBM Research. OBE, an extension of Query-by-Example, supports various office features such as database tables, word processing, electronic mail, graphics, images, and so forth. These seemingly heterogeneous features are integrated through a language feature called example elements . Applications involving example elements are processed by the database manager, an integrated part of the OBE system. In this paper we describe the facilities and architecture of the OBE system and discuss the techniques for integrating heterogeneous objects.
Kyu-Young Whang, Arthur C. Ammann, Anthony Bolmarcich, Maria Hanrahan, Guy Hochgesang, Kuan-Tsae Huang, Al Khorasani, Ravi Krishnamurthy, Gary H. Sockut, Paula Sweeney, Vance E. Waddle, Moshé M. Zloof
ACM Trans. Inf. Syst.6