Sojourn time asymptotics in a parking lot network

DOI10.1007/S00186-011-0351-8zbMath1261.90007OpenAlexW2022228332MaRDI QIDQ1935899

Bert Zwart, Regina Egorova

Publication date: 20 February 2013

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

Full work available at URL: https://doi.org/10.1007/s00186-011-0351-8

zbMATH Keywords

large deviationsbandwidth sharing networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Insensitive bandwidth sharing in data networks
• Bandwidth sharing and admission control for elastic traffic
• On stochastic bounds for monotonic processor sharing networks
• Sojourn time asymptotics in processor sharing queues with varying service rate
• Structural properties of proportional fairness: stability and insensitivity
• Large deviations of sojourn times in processor sharing queues
• Sojourn time asymptotics in processor-sharing queues
• Applied Probability and Queues
• Fluid Limits for Bandwidth-Sharing Networks in Overload
• Wireless Ad hoc and Sensor Networks

This page was built for publication: Sojourn time asymptotics in a parking lot network