Sojourn time asymptotics in a parking lot network

DOI10.1007/S00186-011-0351-8MaRDI QIDQ1935899zbMATH OpenOpenAlexFDO

Authors Regina Egorova, Bert Zwart

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

bandwidth sharing networkslarge deviations

Mathematics Subject Classification ID

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

Recommendations

• Large deviations of the sojourn time for queues in series
• On the exact asymptotics for the stationary sojourn time distribution in a tandem of queues with light-tailed service times
• Large deviations of sojourn times in processor sharing queues
• Travel times in queueing networks and network sojourns
• Sojourn time asymptotics in processor-sharing queues

Cites work

• Applied Probability and Queues
• Bandwidth sharing and admission control for elastic traffic
• Fluid limits for bandwidth-sharing networks in overload
• scientific article; zbMATH DE number 1158743 (Why is no real title available?)
• Insensitive bandwidth sharing in data networks
• Large deviations of sojourn times in processor sharing queues
• On stochastic bounds for monotonic processor sharing networks
• Sojourn time asymptotics in processor sharing queues with varying service rate
• Sojourn time asymptotics in processor-sharing queues
• Structural properties of proportional fairness: stability and insensitivity
• Wireless Ad hoc and Sensor Networks

Cited in

(3)

• Reliability evaluation for stochastic and time-dependent networks with multiple parking facilities
• Kinetics of random sequential parking on a line
• An invariance property of sojourn times in cyclic networks

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

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