Approximate analysis of a discrete-time tandem network of cut-through queues with blocking and bursty traffic

DOI10.1016/0166-5316(93)90042-SMaRDI QIDQ5286386zbMATH OpenOpenAlexFDO

Authors Todd D. Morris, Harry G. Perros

Publication date 29 June 1993

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(93)90042-s

zbMATH Keywords

blockingbursty trafficdiscrete-time tandem network of cut-through queuesfinite capacity queues

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Recommendations

• Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss
• Approximate analysis of single-server tandem queues with finite buffers
• An approximate analysis of open tandem queueing networks with blocking and general service times
• An approximate analysis of tandem queues with general blocking nodes
• Approximation of throughput in tandem queues with multiple servers and blocking

Cited in

(1)

• Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss

This page was built for publication: Approximate analysis of a discrete-time tandem network of cut-through queues with blocking and bursty traffic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286386)