Numerical analysis of a discrete-time finite capacity queue with a burst arrival

DOI10.1007/BF02031593zbMath0798.90061MaRDI QIDQ1319825

Hideaki Yamashita

Publication date: 19 April 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

Markov chainwaiting time distributionmean queue lengthburst arrivaldiscrete-time, multi-server, finite capacity queue

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25)

Related Items (1)

Discrete-time analysis of a classified multi-server queue with burst arrivals and a shared buffer

Cites Work

• Unnamed Item
• A single server model for packetwise transmission of messages
• Loss Probability of a Burst Arrival Finite Queue with Synchronized Service
• On viterbi's formula for the mean delay in a queue of data packets
• The stationary work in system of a G/G/1 gradual input queue

This page was built for publication: Numerical analysis of a discrete-time finite capacity queue with a burst arrival