Fluid Limits for Processor-Sharing Queues with Impatience

References

• Barrer D. Queueing with impatient customers and ordered service. Oper. Res. (1957) 5:650–656Link, Google Scholar
• Billingsley P.Probability and Measure (1986) 2nd ed.(John Wiley & Sons, New York) Google Scholar
• Bonald T., Massoulié L. Impact of fairness on Internet performance. Proc. ACM Sigmetrics (2001) Cambridge, MA:82–91Crossref, Google Scholar
• Bonald T., Roberts J. Congestion at flow level and the impact of user behaviour. Comput. Networks (2003) 42:521–536Crossref, Google Scholar
• Boots N., Tijms H. A multi-server queueuing system with impatient customers. Management Sci. (1999) 45:444–448Link, Google Scholar
• Bramson M. Stability of networks for max-min fair routing. 13th INFORMS Appl. Probab. Conf. (2005) Ottawa, CanadaGoogle Scholar
• Coffman E., Puhalskii A., Reiman M., Wright P. Processor shared buffers with reneging. Performance Eval. (1994) 19:25–46Crossref, Google Scholar
• de Veciana G., Konstantopoulos T., Lee T.-J. Stability and performance analysis of networks supporting elastic services. IEEE/ACM Trans. Networking (2001) 9(1):2–14Crossref, Google Scholar
• Doytchinov B., Lehoczky J., Shreve S. Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. (2001) 11(2):332–378Crossref, Google Scholar
• Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management (2002) 5:79–141Link, Google Scholar
• Gromoll H. C., Robert P., Zwart B., Bakker R. The impact of reneging in processor sharing queues. Proc. ACM Sigmetrics (2006) (June)Saint Malo, FranceACM/IFIP WG 7.3Crossref, Google Scholar
• Gromoll H. C., Kruk Ł. Heavy traffic limit for a processor sharing queue with soft deadlines. Ann. Appl. Probab. (2007) 17:1049–1101Crossref, Google Scholar
• Gromoll H. C., Williams R. J. Fluid approximation for an Internet congestion control model with fair bandwidth sharing and general document size distributions. (2006) . PreprintGoogle Scholar
• Guillemin F., Robert P., Zwart B. Tail asymptotics for processor-sharing queues. Adv. Appl. Probab. (2004) 36:525–543Crossref, Google Scholar
• Hale J., Verduyn Lunel S.An Introduction to Functional Differential Equations (1993) (Springer Verlag, New York) Crossref, Google Scholar
• Jean-Marie A., Robert P. On the transient behavior of some single server queues. Queueing Systems—Theory Appl. (1994) 17:129–136Crossref, Google Scholar
• Kallenberg O.Random Measures (1986) (Academic Press, New York) Google Scholar
• Kelly F. P., Williams R. J. Fluid model for a network operating under a fair bandwidth sharing policy. Ann. Appl. Probab. (2004) 14:1055–1083Crossref, Google Scholar
• Key P., Massoulié L., Bain A., Kelly F. Fair internet traffic integration: Network flow models and analysis. Ann. Telecomm. (2004) 59:1338–1352Crossref, Google Scholar
• Kruk Ł., Lehoczky J., Shreve S. Second order approximation for the customer time in queue distribution under the FIFO service discipline. Ann. Univ. Marie Curie-Skłodowska, Sect. AI Inform (2003) 1:37–48Google Scholar
• Kruk Ł., Lehoczky J., Shreve S. Accuracy of state space collapse for earliest-deadline-first queues. Ann. Appl. Probab. (2006) 13(2):516–581Crossref, Google Scholar
• Massoulié L., Roberts J. Bandwidth sharing: Objectives and algorithms. INFOCOM'99. 18th Annual Joint Conf. IEEE Comput. Comm. Societies (1999) New York:1395–1403Crossref, Google Scholar
• Mo J., Walrand J. Fair end-to-end window-based congestion control. IEEE/ACM Trans. Networking (2000) 8(5):556–567Crossref, Google Scholar
• Puha A. L., Stolyar A. L., Williams R. J. The fluid limit of an overloaded processor sharing queue. Math. Oper. Res. (2006) 31(2):316–350Link, Google Scholar
• Roberts J., Massoulié L. Bandwidth sharing and admission control for elastic traffic. Telecomm. Systems (2000) 15:185–201Crossref, Google Scholar
• Stanford R. E. Reneging phenomena in single channel queues. Math. Oper. Res. (1979) 4:162–178Link, Google Scholar
• Stanford R. E. On queues with impatience. Adv. Appl. Probab. (1990) 22(3):768–769Crossref, Google Scholar
• van der Vaart A., Wellner J. A.Weak Convergence and Empirical Processes (1996) (Springer-Verlag, New York) Crossref, Google Scholar
• Ward A., Glynn P. A diffusion approximation for a markovian queue with reneging. Queueing Systems (2003) 43:103–128Crossref, Google Scholar