Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
The interface message processor for the ARPA computer network
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
Analytic and simulation methods in computer network design
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
A study of asynchronous time division multiplexing for time-sharing computer systems
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Computer communication network design: experience with theory and practice
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
IEEE Transactions on Computers
A Quantization Approximation for Modeling Computer Network Nodal Queueing Delay
IEEE Transactions on Computers
Standards and protocols: Steady-state and transient delay analysis of ARQ protocols
Computer Communications
| Hi-index | 0.02 |
Equilibrium behavior of a store-and-forward network node with finite buffer capacity is studied via a network-of-queues model. The positive acknowledgment protocol is explicitly modeled and consumes part of the buffer pool. The principal results are the buffer overflow probability, the mean delays, and the distribution of queue lengths as functions of the buffer capacity and traffic levels.