A TANDEM FLUID QUEUE WITH GRADUAL INPUT
Probability in the Engineering and Informational Sciences
ON THE STEADY-STATE DISTRIBUTION OF NUMBER IN THE QUEUE Geom/G/1
Probability in the Engineering and Informational Sciences
A study of TCP performance in wireless environment using fixed-point approximation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Loss probability in an overloaded discrete-time GI/G/1/K system with very large K
Operations Research Letters
On the impact of finite buffers on per-flow delays in FIFO queues
Proceedings of the 24th International Teletraffic Congress
| Hi-index | 0.00 |
Discrete-time queueing systems are frequently encountered in telecommunication networks. These systems usually involve finite buffers. The purpose of this paper is to present a generally applicable method to compute the loss probability in discrete-time finite-buffer queues by using only the state probabilities in the corresponding infinite-buffer queue.