Monotonicity properties for multi-class queueing systems

Discrete Event Dynamic Systems: Theory and Applications

Volumn 20, Issue 4, 2010, Pages 473-509

  Verloop, Ina Maria ^a   Ayesta, Urtzi ^b,c   Borst, Sem ^a,d,e  

^a CWI   (Netherlands)

^b LAAS CNRS   (France)

^c BCAM BASQUE CENTER FOR APPLIED MATHEMATICS   (Spain)

^d LUCENT TECHNOLOGIES   (United States)

^e EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Bandwidth sharing networks; c rule; DPS; GPS; Mean number of users; Monotonicity; Multi class queueing systems; Sample path comparisons; Weighted fair policies

Indexed keywords

BANDWIDTH-SHARING NETWORKS; DPS; GPS; MEAN NUMBER OF USERS; MONOTONICITY; MULTI-CLASS QUEUEING SYSTEMS; SAMPLE-PATH COMPARISONS;

BANDWIDTH; COMPUTER NETWORK PERFORMANCE EVALUATION; LINEAR NETWORKS; QUEUEING THEORY; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

QUEUEING NETWORKS;

EID: 77956776468     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10626-009-0069-4     Document Type: Article

References (41)

1. E Altman KE Avrachenkov U Ayesta 2006 A survey on discriminatory processor sharing Queueing Syst 53 53 63 1114.90014 10.1007/s11134-006-7586-8 2230013 (Pubitemid 43742144)
2. Avrachenkov KE, Ayesta U, Brown P, Núñez-Queija R (2005) Discriminatory processor sharing revisited. In: Proceedings of IEEE INFOCOM, Miami
3. T Bonald SC Borst A Proutière 2006 Inter-cell coordination in wireless data networks Eur Trans Telecommun 17 303 312 10.1002/ett.1118 (Pubitemid 44023460)
4. Bonald T, Massoulié L (2001) Impact of fairness on internet performance. In: Proceedings of ACM SIGMETRICS/Performance, Boston, pp 82-91
5. T Bonald A Proutière 2004 On stochastic bounds for monotonic processor sharing networks Queueing Syst 47 81 106 1073.68018 10.1023/B:QUES.0000032802.41986.c6 2074674
6. SC Borst M Jonckheere L Leskelä 2008 Stability of parallel queueing systems with coupled service rates Discret Event Dyn Syst 18 447 472 1184.90048 10.1007/s10626-007-0021-4
7. SC Borst M Mandjes MJG van Uitert 2003 Generalized processor sharing queues with heterogeneous traffic classes Adv Appl Probab 35 806 845 1064.60183 10.1239/aap/1059486830
8. SK Cheung JL van den Berg RJ Boucherie 2006 Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue Queueing Syst 53 7 18 1123.60070 10.1007/s11134-006-7583-y 2230010
9. JG Dai 1995 On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models Ann Appl Probab 5 49 77 0822.60083 10.1214/aoap/1177004828 1325041
10. Demers A, Keshav S, Shenker S (1989) Analysis and simulation of a fair queueing algorithm. In: Proceedings of ACM SIGCOMM, pp 1-12
11. El-Taha M, Stidham S (1999) Sample-path analysis of queueing systems. Kluwer, Dordrecht
12. G Fayolle I Mitrani R Iasnogorodski 1980 Sharing a processor among many job classes J ACM 27 519 532 0475.68012 10.1145/322203.322212 581982
13. Kang WN, Kelly FP, Lee NH, Williams RJ (2004) Fluid and Brownian approximations for an internet congestion control model. In: Proceedings of IEEE CDC, pp 3938-3943
14. Kang WN, Kelly FP, Lee NH, Williams RJ (2009) State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. Ann Appl Probab (in press)
15. Kelly FP (1979) Stochastic networks and reversibility. Wiley, Chichester
16. FP Kelly 2003 Fairness and stability of end-to-end congestion control Eur J Control 9 159 176 10.3166/ejc.9.159-176 (Pubitemid 44642218)
17. FP Kelly RJ Williams 2004 Fluid model for a network operating under a fair bandwidth-sharing policy Ann Appl Probab 14 1055 1083 1066.60093 10.1214/105051604000000224 2071416 (Pubitemid 41449211)
18. van Kessel G, Núñez-Queija R, Borst SC (2005) Differentiated bandwidth sharing with disparate flow sizes. In: Proceedings of IEEE INFOCOM, Miami
19. B Kim J Kim 2006 Comparison of DPS and PS systems according to DPS weights IEEE Commun Lett 10 7 558 560 10.1109/LCOMM.2006.1673012 (Pubitemid 44275421)
20. L Kleinrock 1967 Time-shared systems: a theoretical treatment J ACM 14 242 261 0173.20001 10.1145/321386.321388 273994
21. Lieshout P, Borst SC, Mandjes M (2006) Heavy-traffic approximations for linear networks operating under alpha-fair bandwidth-sharing policies. In: Proceedings of ValueTools, Pisa
22. Liu J, Proutière A, Yi Y, Chiang M, Poor VH (2007) Flow-level stability of data networks with non-convex and time-varying rate regions. In: Proceedings of ACM SIGMETRICS, San Diego, pp 239-250
23. Z Liu P Nain D Towsley 1995 Sample path methods in the control of queues Queueing Syst 21 293 335 0855.60094 10.1007/BF01149166 1375680
24. FJ López G Sanz 2002 Markovian couplings staying in arbitrary subsets of the state space J Appl Probab 39 197 212 1007.60074 10.1239/jap/1019737997 1895152
25. WA Massey 1987 Stochastic orderings for Markov processes on partially ordered spaces Math Oper Res 12 350 367 0622.60098 10.1287/moor.12.2.350 888982
26. L Massoulié JW Roberts 2000 Bandwidth sharing and admission control for elastic traffic Telecommun Syst 15 185 201 1030.68774 10.1023/A:1019138827659 (Pubitemid 33226231)
27. L Massoulié JW Roberts 2002 Bandwidth sharing: objectives and algorithms IEEE/ACM Trans Netw 10 320 328 10.1109/TNET.2002.1012364 (Pubitemid 34798788)
28. Meyn SP, Tweedie RL (1993) Markov chains and stochastic stability. Springer, Berlin Heidelberg New York
29. J Mo J Walrand 2000 Fair end-to-end window-based congestion control IEEE/ACM Trans Netw 8 556 567 10.1109/90.879343 (Pubitemid 32017921)
30. Muller AM, Stoyan D (2002) Comparison methods for stochastic models and risks. Wiley, New York
31. P Nain D Towsley 1994 Optimal scheduling in a machine with stochastic varying processing rate IEEE Trans Automat Contr 39 1853 1855 0824.90064 10.1109/9.317111 1293423
32. AK Parekh RG Gallager 1993 A generalized processor sharing approach to flow control in integrated services networks: the single-node case IEEE/ACM Trans Netw 1 344 357 10.1109/90.234856
33. R Righter JG Shanthikumar 1989 Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures Probab Eng Inf Sci 3 323 333 1134.90413 10.1017/S0269964800001194
34. LE Schrage LW Miller 1966 The queue M/G/1 with the shortest remaining processing time discipline Oper Res 14 670 684 0147.16702 10.1287/opre.14.4.670 195173
35. Shaked M, Shanthikumar JG (1993) Stochastic orders and their applications. Academic, London
36. DR Smith 1978 A new proof of the optimality of the shortest remaining processing time discipline Oper Res 26 197 199 0373.60124 10.1287/opre.26.1.197
37. Verloop IM (2005) Efficient flow scheduling in resource-sharing networks. Master Thesis, Utrecht University. www.cwi.nl/~maaike/articles/thesisVerloop. pdf
38. Verloop IM, Ayesta U, Borst SC (2008) Comparison of bandwidth-sharing policies in a linear network. In: Proceedings of ValueTools, Athens
39. IM Verloop 2009 Núñez-Queija R Assessing the efficiency of resource allocations in bandwidth-sharing networks Perform Eval 66 59 77 10.1016/j.peva.2008.09.002
40. H Viswanathan K Kumaran 2005 Rate scheduling in multiple antenna downlink wireless systems IEEE Trans Commun 53 645 655 10.1109/TCOMM.2005.844961 (Pubitemid 40736749)
41. Wierman A, Harchol-Balter M, Osogami T (2005) Nearly insensitive bounds on SMART scheduling. In: Proceedings of ACM SIGMETRICS