Sojourn times in finite-capacity Processor-Sharing queues

NGI 2005 - Next Generation Internet Networks: Traffic Engineering

Volumn 2005, Issue , 2005, Pages 53-60

  Borst, Sem ^a,b   Boxma, Onno ^c   Hegde, Nidhi ^d  

^a CWI   (Netherlands)

^b LUCENT TECHNOLOGIES   (United States)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d EURANDOM   (Netherlands)

Author keywords

Processor Sharing; Sojourn time distribution; Wireless data systems

Indexed keywords

FINITE-CAPACITY PROCESSOR-SHARING QUEUES; PROCESSOR SHARING; SOJOURN TIME DISTRIBUTION; WIRELESS DATA SYSTEMS;

CHANNEL CAPACITY; DATABASE SYSTEMS; LINEAR EQUATIONS; PROGRAM PROCESSORS; QUALITY OF SERVICE; WEBSITES;

RADIO COMMUNICATION;

EID: 33744476173     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NGI.2005.1431647     Document Type: Conference Paper

References (34)

1. R. Agrawal, A. Bedekar, R. La, and V. Subramanian, "Class and channel condition based weighted proportional fair scheduler," in Teletraffic Engineering in the Internet Era, Proc. ITC-17, Salvador da Bahia, J. de Souza, N. da Fonseca, and E. de Souza e Silva, Eds. North-Holland, Amsterdam, 2001, pp. 553-565.
2. D. M. Andrews, K. Kumaran, K. Ramanan, A. L. Stolyar, R. Vijayakumar, and P. A. Whiting, "Scheduling in a queueing system with asynchronously varying service rates," Prob. Eng. Inf. Sc., vol. 18, pp. 191-217, 2004.
3. S. C. Borst and P. A. Whiting, "Dynamic rate control algorithms for HDR throughput optimization," in Proc. IEEE Infocom, 2001, pp. 976-985.
4. X. Liu, E. K. P. Chong, and N. B. Shroff, "A framework for opportunistic scheduling in wireless networks," Computer Networks, vol. 41, pp. 451-474, 2003.
5. S. Shakkottai and A. L. Stolyar, "Scheduling algorithms for a mixture of real-time and non-real-time data in HDR," in Teletraffic Engineering in the Internet Era, Proc. ITC-17, Salvador da Bahia, J. de Souza, N. da Fonseca, and E. de Souza e Silva, Eds. North-Holland, Amsterdam, 2001, pp. 793-804.
6. V. Tsibonis, L. Georgiadis, and L. Tassiulas, "Exploiting wireless channel state information for throughput maximization," in Proc. IEEE Infocom, 2003.
7. P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushayana, and A. Viterbi, "CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users," IEEE Commun. Mag., vol. 38, pp. 70-77, 2000.
8. E. F. Chaponniere, P. J. Black, J. M. Holtzman, and D. N. C. Tse, "Transmitter directed code division multiple access system using path diversity to equitably maximize throughput," US Patent 6,449,490, 2002.
9. J. M. Holtzman, "CDMA forward link waterfilling power control," in Proc. IEEE VTC 2000 Spring Conf., 2000, pp. 1663-1667.
10. A. Jalali, R. Padovani, and R. Pankaj, "Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system," in Proc. IEEE VTC 2000 Spring Conf., 2000, pp. 1854-1858.
11. S. C. Borst, "User-level performance of channel-aware scheduling algorithms in wireless data networks," in Proc. IEEE Infocom, 2003, pp. 321-331.
12. R. Litjens, F. Roijers, J. L. van den Berg, R. J. Boucherie, and M. J. Fleuren, "Performance analysis of wireless LANs: an integrated packet/flow level approach," in Providing Quality of Service in Heterogeneous Environments, Proc. ITC-18, Berlin, J. Charzinski, R. Lehnert, and P. Tran-Gia, Eds. North-Holland, Amsterdam, 2003, pp. 931-940.
13. T. Bonald, S. C. Borst, and A. Proutière, "How mobility impacts the flow-level performance of wireless data networks," in Proc. IEEE Infocom, 2004, pp. 1872-1881.
14. T. Bonald, S. C. Borst, N. Hegde, and A. Proutière, "Wireless data performance in multi-cell scenarios," in Proc. ACM Sigmetrics / Performance, 2004, pp. 378-388.
15. T. Bonald and A. Proutière, "Wireless downlink data channels: user performance and cell dimensioning," in Proc. ACM Mobicom, 2003, pp. 339-352.
16. R. Prakash and V. V. Veeravalli, "A time-scale separation technique for the analysis of random access systems with incremental redundancy," in Proc. ISIT, 2002.
17. I. E. Telatar and R. G. Gallager, "Combining queueing theory with information theory for multi-access," IEEE J. Select. Areas Commun., vol. 13, pp. 963-969, 1995.
18. E. M. M. Winands, T. J. J. Denteneer, J. A. C. Resing, and R. Rietman, "A finite-source feedback queueing network as a model for the IEEE 802.11 distributed coordination function," in Proc. European Wireless Conf, 2004, pp. 551-557.
19. E. G. Coffman, R. R. Jr., Muntz, and H. Trotter, "Waiting time distribution for processor-sharing systems," Journal of the ACM, vol. 17, pp. 123-130, 1970.
20. B. Sengupta and D. L. Jagerman, "A conditional response time of the M/M/1 processor-sharing queue," AT&T Technical Journal, vol. 64, pp. 409-421, 1985.
21. J. A. Morrison, "Response-time distribution for a processor-sharing system," SIAM Journal of Applied Mathematics, vol. 45, pp. 152-167, 1985.
22. S. F. Yashkov, "Processor-sharing queues: Some progress in analysis," Queueing Systems, vol. 2, pp. 1-17, 1987.
23. _, "Mathematical problems in the theory of processor-sharing queueing systems," J. Soviet Math., vol. 58, pp. 101-147, 1992.
24. V. Ramaswami, "The sojourn time in the GI/M/1 queue with processor sharing," Journal of Applied Probability, vol. 21, pp. 437-442, 1984.
25. D. L. Jagerman and B. Sengupta, "The GI/M/1 processor-sharing queue and its heavy traffic analysis," Stochastic Models, vol. 7, pp. 379-395, 1991.
26. J. W. Cohen, "The multiple phase service network with general-ized processor sharing," Acta Informatica, vol. 12, pp. 245-284, 1979.
27. S. C. Borst, O. J. Boxma, J. A. Morrison, and R. Núñez Queija, "The equivalence between processor sharing and service in random order," Operations Research Letters, vol. 31, pp. 254-262, 2003.
28. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge University Press, 1985.
29. M. Marcus and H. Mine, A Survery of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Inc., Boston, 1964.
30. P. Kühn, "On a combined delay and loss system with different queue disciplines," in Information Theory, Statistical Decision Functions, Random Processes. Transactions of the Sixth Prague Conference, 1971, pp. 501-528.
31. R. Syski, "Markovian queues," in Proc. the Symposium on Congestion Theory, W. L. Smith and W. E. Wilkinson, Eds., The University of North Carolina, Chapel Hill, August 24-26 1964, pp. 170-222.
32. M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach. Johns Hopkins, 1982.
33. F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, "Open, closed, and mixed networks of queues with different classes of customers," Journal of the ACM, vol. 22, no. 2, pp. 248-260, 1975.
34. S. C. Borst, O. J. Boxma, and N. Hegde, "Sojourn times in finite-capacity processor-sharing queues," EURANDOM, Tech. Rep., 2005.