Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks

DOI10.1109/TIT.2005.855621MaRDI QIDQ3547425zbMATH OpenFDO

Authors Michael J. Neely, C. E. Rohrs, Eytan Modiano

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Stochastic network models in operations research (90B15)

Recommendations

• A simple analysis of average queueing delay in tree networks
• An Algebra for Queueing Networks with Time-Varying Service and Its Application to the Analysis of Integrated Service Networks
• scientific article; zbMATH DE number 3856163
• Queueing systems with random service rate
• Treelike queueing networks: Asymptotic stationarity and heavy traffic

Cited in

(7)

• Stability with file arrivals and departures in multichannel cellular wireless networks
• A decentralized routing control scheme for data communication networks
• Asymptotically tight steady-state queue length bounds implied by drift conditions
• Controlled mobility in stochastic and dynamic wireless networks
• Scheduling with pairwise XORing of packets under statistical overhearing information and feedback
• Reduction of a polling network to a single node
• Stability and probability. I: Convergence for queueing networks via Lyapunov optimization

This page was built for publication: Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks

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