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

J. Hsu

dblp:272/5800 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1976
—ORCID · none

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

Computer networks · 3 · 3 first-author

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
3 papers
Performance modeling and evaluation · 100%
Computer networks
3 papers
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
queueing models
0.031976
Behavior of Tandem Buffers with Geometric Input and Markovian Output · IEEE Trans. Commun. 1976
Buffer Behavior with Poisson Arrival and Geometric Output Processes · IEEE Trans. Commun. 1974
A General Queuing Model for Buffer Storage Problems · IEEE Trans. Commun. 1973
Performance modeling and evaluation › queueing models › queueing network model
discrete-time queueing network
0.011976
Behavior of Tandem Buffers with Geometric Input and Markovian Output · IEEE Trans. Commun. 1976
Performance modeling and evaluation › queueing models › buffer analysis
buffer occupancy distribution
0.011974
Buffer Behavior with Poisson Arrival and Geometric Output Processes · IEEE Trans. Commun. 1974
Performance modeling and evaluation › queueing models › single server queue
GI/G/1 queue
0.011973
A General Queuing Model for Buffer Storage Problems · IEEE Trans. Commun. 1973
Internet architecture and protocols
buffer management
0.021976
Behavior of Tandem Buffers with Geometric Input and Markovian Output · IEEE Trans. Commun. 1976
A General Queuing Model for Buffer Storage Problems · IEEE Trans. Commun. 1973
Internet architecture and protocols › buffer management
packet buffering
0.011974
Buffer Behavior with Poisson Arrival and Geometric Output Processes · IEEE Trans. Commun. 1974

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

z-transform · 0.0stochastic equilibrium analysis · 0.0queueing theory · 0.0probability density analysis · 0.0markov chain analysis · 0.0equilibrium analysis · 0.0
YearPublicationVenuePosition
1976 Behavior of Tandem Buffers with Geometric Input and Markovian Output
abstract
A discrete-time system of infinite-capacity buffers in tandem is studied. The input process to the first buffer consists of individual arrivals characterized by a geometric distribution of the time between arrivals; and the probability that the output channel of each buffer, except the last, is transmitting at any epoch depends only on the number of digits in the buffer at that epoch. The transmitting state of the last buffer may depend more generally on the history of that buffer. The analysis shows that in equilibrium, the input processes to the subsequent buffers in the system are geometric with the same parameter as the input process to the first buffer. Therefore, each buffer in the system can be analyzed separately. Furthermore, the equilibrium state probabilities for a given buffer at a given epoch are independent of those for any other buffer in the system at the same epoch.
J. Hsu, P. J. Burke
IEEE Trans. Commun.1
1974 Buffer Behavior with Poisson Arrival and Geometric Output Processes
abstract
A discrete buffered system with infinite buffer size, Poisson arrival process, and the output channel available only periodically according to a geometric density function is analyzed. Under the assumption that a stochastic equilibrium is reached, theZtransform of the density function of the buffer occupancy is obtained as the result of this study.
J. Hsu
IEEE Trans. Commun.1
1973 A General Queuing Model for Buffer Storage Problems
abstract
A mathematical model for a general buffered telecommunication system with the output channel available only periodically is constructed and analyzed in this paper. Under the assumptions that certain system parameters are continuous variables, it is shown that the probability density functions for the peaks and valleys of the buffer content are exactly the same as the density functions for the response time and the waiting time, respectively, for aGI/G/1queuing system, with the density functions for the arrival processGIand the service processGobtained from the statistical functions for the parameters of the original buffered system.
J. Hsu
IEEE Trans. Commun.1