On stochastic bounds for monotonic processor sharing networks

Queueing Systems

Volumn 47, Issue 1-2, 2004, Pages 81-106

  Bonald, T ^a   Proutiere A ^a  

^a ORANGE LABS   (France)

Author keywords

Balance; Insensitivity; Monotonicity; Processor sharing networks; Stochastic bounds

Indexed keywords

BALANCING; SALES;

DISCRIMINATORY PROCESSOR-SHARING; GENERALIZED PROCESSOR SHARING; INSENSITIVITY; MONOTONICITY; POISSON ARRIVAL PROCESS; PROCESSOR SHARING; SERVICE TIME DISTRIBUTION; STOCHASTIC BOUND;

STOCHASTIC SYSTEMS;

EID: 3142727746     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/b:ques.0000032802.41986.c6     Document Type: Article

References (25)

1. F. Baskett, K.M. Chandy, R.R. Muntz and F.G. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. Assoc. Comput. Mach. 22 (1975) 248-260.
2. D. Bertsekas and R. Gallager, Data Networks (Prentice Hall, New York, 1987).
3. D. Bertsimas, I.C. Paschalidis and J.N. Tsitsiklis, Large deviation analysis of the generalized processor sharing policy, Queueing Systems 32 (1999) 319-349.
4. P. Billingsley, Convergence of Probability Measures (Wiley, New York, 1968).
5. T. Bonald and L. Massoulié, Impact of fairness on Internet performance, in: Proc. of ACM SIGMET-RICS, 2001.
6. T. Bonald and A. Proutière, Insensitivity in processor-sharing networks, Perform. Eval. 49 (2002) 193-209.
7. T. Bonald and A. Proutière, Insensitive bandwidth sharing in data networks, Queueing Systems 44(1) (2003) 69-100.
8. S. Borst, O.J. Boxma and P. Jelenkovic, Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows, Queueing Systems 43(4) (2003) 273-306.
9. G.L. Choudhury, A. Mandelbaum, M.I. Reiman and W. Whitt, Fluid and diffusion limits for queues in slowly changing environments, Stochastic Models 13 (1997) 121-146.
10. J.W. Cohen, The multiple phase service network with generalized processor sharing, Acta Inform. 12 (1979) 245-284.
11. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications (Jones & Barlett, Boston, MA, 1993).
12. G. Fayolle, I. Mitrani and R. Iasnogorodski, Sharing a processor among many classes, J. Assoc. Comput. Mach. 27 (1980) 519-532.
13. P.R. Jelenkovic, The effect of multiple time scales and subexponentiality on the behavior of a broadband network multiplexer, Ph.D. Thesis, Columbia University, New York (October 1996).
14. F.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).
15. F.P. Kelly, A. Maulloo and D. Tan, Rate control for communication networks: Shadow prices, proportional fairness and stability, J. Oper. Res. Soc. 49 (1998) 237-252.
16. F.P. Kelly and R.J. Williams, Fluid models for a network operating under a fair bandwidth-sharing policy, to appear in Ann. Appl. Probab.
17. L. Kleinrock, Queueing Systems, Vol. 2 (Wiley, New York, 1975).
18. H.J. Kushner, Heavy-Traffic of Controlled Queueing and Commmunication Networks (Springer, Berlin, 2001).
19. L. Massoulié, Large deviation estimates for polling and weighted fair queueing systems, Adv. Perform. Anal. (1999).
20. L. Massoulié and J.W. Roberts, Bandwidth sharing and admission control for elastic traffic, Telecom. Systems 15 (2000) 185-201.
21. L. Massoulié and J.W. Roberts, Bandwidth sharing: objectives and algorithms, IEEE/ACM Trans. Networking 10(3) (2002) 320-328.
22. R. Núñez Queija, Processor-sharing models for integrated-services networks, Ph.D. Thesis, Eind-hoven University of Technology (1999).
23. R.F. Serfozo, Introduction to Stochastic Networks (Springer, Berlin, 1999).
24. W. Whitt, Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Applications to Queues (Springer, Berlin, 2002).
25. G.G. Yin and Q. Zhang, Continuous-Time Markov Chains and Applications: A Singular Perturbation Approach (Springer, Berlin, 1998).