Analysis of generalized processor-sharing systems with two classes of customers and exponential services

Journal of Applied Probability

Volumn 41, Issue 3, 2004, Pages 832-858

  Guillemin, Fabrice ^a   Pinchon, Didier ^b  

^a ORANGE LABS   (France)

^b UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

Asymptotic analysis; Generating function; Poisson equation; Weighted fair queueing

Indexed keywords

EID: 10244256463     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1091543429     Document Type: Article

References (22)

1. ABRAMOWITZ, M. AND STEGUN, I. (eds) (1972). Handbook of Mathematical Functions (National Bureau Standards Appl. Math. Ser. 55). National Bureau of Standards, Washington, D.C.
2. BERTSIMAS, D., PASCHALIDIS, I. AND TSITSIKLIS, J. (1999). Large deviations analysis of the generalized processor sharing policy. Queueing Systems 32, 319-349.
3. BORST, S. C., BOXMA, O. J. AND JELENKOVIC, P. R. (2000). Asymptotic behavior of generalized processor sharing with long-tailed traffic sources. In Proc. IEEE Infocom 2000 (Tel Aviv, March 2000), Vol. 2. pp. 912-921.
4. BRANDT, A. AND BRANDT, M. (1998). On the sojourn times for many-queue head-of-line processor-sharing systems with permanent customers. Math. Meth. Operat. Res. 47, 181-220.
5. COHEN, J. W. (1982). The Single Server Queue. North-Holland, Amsterdam.
6. COHEN, J. W. AND BOXMA, O. J. (1984). Boundary Value Problems in Queueing System Analysis. North-Holland, Amsterdam.
7. DAUTRAY, R. AND LIONS, J.-L. (1985). Analyse Mathématique et Calcul Numérique pour les Sciences et les Techniques. Masson, Paris.
8. DAVIS, P. J. AND RABINOWITZ, P. (1984). Methods of Numerical Integration, 2nd edn. Academic Press, Orlando, FL.
9. DIEUDONNE, J. (1980). Calcul Infinitésimal. Hermann, Paris.
10. DUFFIELD, N. G. AND O'CONNELL, N. (1995). Large deviations and overflow probabilities for the general single server queue with applications. Math. Proc. Camb. Phil. Soc. 118, 363-374.
11. DUPUIS, P. AND RAMANAN, K. (1998). A Skorokhod problem formulation and large deviation analysis of a processor sharing model. Queueing Systems 28, 109-124.
12. ERDÉLYI, A., MAGNUS, W., OBERHETTINGER, F. AND TRICOMI, F. G. (1953). Higher Transcendental Functions, Vol. 2. McGraw-Hill, New York.
13. FAYOLLE, G. AND IASNOGORODSKI, R. (1979). Two coupled processors: the reduction to a Riemann-Hilbert problem. Z. Wahrscheinlichkeitsth. 47, 325-351.
14. FAYOLLE, G., IASNOGORODSKI, R. AND MALYSHEV, V. (1999). Random Walks in the Quarter-Plane. Algebraic Methods, Boundary Value Problems and Applications (Appl. Math. 40). Springer, Berlin.
15. FAYOLLE, G., KING, P. J. B. AND MITRANI, I. (1982). The solution of certain two-dimensional Markov models. Adv. Appl. Prob. 14, 295-308.
16. GRAVES-MORRIS, P. R., ROBERTS, D. E. AND SALAM, A. (2000). The epsilon algorithm and related topics. J. Comput. Appl. Math. 122, 51-80.
17. HENRICI, P. (1977). Applied and Computational Complex Analysis, Vol. 2. John Wiley, New York.
18. MASSOULIÉ, L. (1999). Large deviations estimates for polling and weighted fair queueing service systems. Adv. Performance Anal. 2, 103-128.
19. ROBERTS, J. AND MASSOULIÉ, L. (1998). Bandwidth sharing and admission control for elastic traffic. In Proc. IEEE Infocom 1999 (New York, March 1999), Vol. 1, pp. 1395-1403.
20. RUDIN, W. (1965). Real and Complex Analysis. McGraw-Hill, New York.
21. ZHANG, Z.-L. (1997). Large deviations and the generalised processor sharing scheduling for a two-queue system. Queueing Systems 27, 229-264.
22. ZHANG, Z.-L. (1998). Large deviations and the general processor sharing scheduling for a multiple-queue system. Queueing Systems 28, 349-376.