Abstract
For a two-class two-node bandwidth sharing network called parking lot network we investigate the tail behavior of the queue length and sojourn time under light-tailed assumptions. These results extend previous results in the literature obtained for a single-node network. Explicit conditions are given that indicate whether congestion at the second node influences the large deviations behavior or not. To overcome the complexities that arise when moving away from the single node case, we rely on recent results on overloaded bandwidth sharing networks obtained by Borst et al. (2009), and a comparison with the modified proportional fairness discipline, as introduced by Massoulié (Ann Appl Probab 17: 809–839, 2007). Specifically, our results include upper bounds for the distribution of the number of flows in the network, finiteness of the moment generating function of the workload, and large-deviations asymptotics for the sojourn time assuming flow size distributions having a bounded hazard rate.
Similar content being viewed by others
References
Asmussen S (2003) Applied probability and queues. Springer, New York
Bonald T, Proutière A (2003) Insensitive bandwidth sharing in data networks. Queueing Syst 44: 69–100
Bonald T., Proutière A. (2004) On stochastic bounds for monotonic processor-sharing networks. Queueing Syst 47: 81–106
Borst SC, Núnez-Queija R, Zwart AP (2006) Sojourn time asymptotics in processor-sharing queues. Queueing Syst 53: 31–51
Borst SC, Egorova R, Zwart AP (2008) Fluid limits for bandwidth-sharing networks in overload. Under revision at Mathematics of Operations Research
Dembo A, Zeitouni O (1998) Large deviation techniques and applications. Springer, New York
Egorova R (2009) Sojourn time tails in processor-sharing systems. PhD Thesis, Eindhoven University of Technology
Egorova R, Mandjes MRH, Zwart AP (2007) Sojourn time asymptotics in processor sharing queues with varying service rate. Queueing Syst 56: 169–181
Mandjes M, Zwart AP (2006) Large deviations for sojourn times in processor sharing queues. Queueing Syst 52: 237–250
Massoulié L (2007) Structural properties of proportional fairness: stability and insensitivity. Ann Appl Probab 17: 809–839
Massoulié L, Roberts JW (1999) Bandwidth sharing: objectives and algorithms. In: Proceedings of IEEE Infocom, New York, 1395–1403
Roberts JW, Massoulié L (1998) Bandwidth sharing and admission control for elastic traffic. In: Proceedings of ITC Specialist Seminar, Yokohama
Sarangapani J (2007) Wireless ad hoc and sensor networks: protocols, performance, and control. CRC Press, Boca Raton
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Egorova, R., Zwart, B. Sojourn time asymptotics in a parking lot network. Math Meth Oper Res 74, 163–190 (2011). https://doi.org/10.1007/s00186-011-0351-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-011-0351-8