Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks

DOI10.1109/TIT.2005.855621zbMath1318.90018MaRDI QIDQ3547425

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

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

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

Related Items (7)

Controlled mobility in stochastic and dynamic wireless networks ⋮ Asymptotically tight steady-state queue length bounds implied by drift conditions ⋮ Scheduling with pairwise XORing of packets under statistical overhearing information and feedback ⋮ Stability with file arrivals and departures in multichannel cellular wireless networks ⋮ A decentralized routing control scheme for data communication networks ⋮ 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