Some algorithms for discrete time queues with finite capacity

Authors:
Vinod Sharma;Nandyala D. Gangadhar
Affiliations:
INRS-Telecommunications, University du Quebec, Quebec H3E 1H6, Canada E-mail: vinod@inrs-telecom.uquebec.ca;Department of Electrical Engineering, Indian Institute of Science, Bangalore 560 012, India E-mail: ndg@ee.iisc.ernet.in
Venue:
Queueing Systems: Theory and Applications
Year:
1997

Citing 4
Cited 3

On packet loss processes in high-speed networks

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
Performance of discrete-time queueing systems

Computers and Operations Research
Discrete-Time Models for Communication Systems Including ATM

Discrete-Time Models for Communication Systems Including ATM
Asymptotics for transient and stationary probabilities for finite and infinite buffer discrete time queues

Queueing Systems: Theory and Applications

Asymptotics for transient and stationary probabilities for finite and infinite buffer discrete time queues

Queueing Systems: Theory and Applications
Performance analysis of a slotted-ALOHA protocol on a capture channel with fading

Queueing Systems: Theory and Applications
Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks

Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals. Efficient algorithms are developed to calculate the moments and the distributions of the first time to overflow and the regeneration length. Results are extended to the multiserver queue. Some illustrative numerical examples are provided.