Queue-length distribution for the discriminatory processor-sharing queue

Operations Research

Volumn 44, Issue 4, 1996, Pages 653-657

  Rege, Kiran M ^a   Sengupta, Bhaskar ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERFACES (COMPUTER); LINEAR ALGEBRA; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY;

DISCRIMINATORY PROCESSOR SHARING QUEUE; LIMIT THEOREMS; LINEAR EQUATIONS; QUEUE LENGTH DISTRIBUTION;

COMPUTER NETWORKS;

EID: 0030181588     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.44.4.653     Document Type: Article

References (19)

1. ASARE, B. K., AND F. G. FOSTER. 1983. Conditional Response Time in the M/G/1 Processor-Sharing System. J. Appl. Probl. 20, 910-915.
2. CHOW, Y. S., AND H. TEICHER. 1988. Probability Theory: Independence, Interchangeability, Martingales. Second Edition. Springer-Verlag, New York.
3. COFFMAN, E. G., R. R. MUNTZ, AND H. TROTTER. 1970. Waiting Time Distributions for Processor Sharing Systems. J. Assoc. Comput. Mach. 17, 123-130.
4. FAYOLLE, G., I. MITRANI, AND R. IASNOGORODSKI. 1980. Sharing a Processor Among Many Job Classes. J. Assoc. Comput. Mach. 27, 519-532.
5. JAGERMAN, D. L., AND B. SENGUPTA. 1991. The GI/M/1 Processor-Sharing Queue and Its Heavy Traffic Analysis. Stochastic Models 7, 379-396.
6. KLEINROCK, L. 1967. Time-Shared Systems: A Theoretical Treatment. J. Assoc. Comput. Mach. 14, 242-261.
7. KNESSL, C. 1992. Asymptotic Approximations for the GI/M/1 Queue with Processor-Sharing Service. Stochastic Models 8, 1, 1-34.
8. MITRA, D., AND A. WEISS. 1989. A Closed Network with a Discriminatory Processor-Sharing Server, 1989 ACM Sigmetrics and Performance '89. Performance Evaluation Review 17, 200-208.
9. MORRISON, J. A. 1991. Asymptotic Analysis of a Large Closed Queueing Network with Discriminatory Processor Sharing, Queueing Systems-Special Issue on Communication Systems 9, 191-213.
10. O'DoNOVAN, T. M. 1974. Direct Solutions of M/G/1 Processor-Sharing Models. Opns. Res. 22,1232-1235.
11. OTT, T. J. 1984. The Sojourn Time Distribution in the M/G/1 Queue with Processor Sharing. J. Appl. Prob. 21, 360-378.
12. RAMASWAMI, V. 1984. The Sojourn Time in the GI/M/1 Queue with Processor Sharing. J. Appl. Prob. 21, 445-450.
13. REGE, K. M., AND B. SENGUPTA. 1994. A Decomposition Theorem and Related Results for the Discriminatory Processor-Sharing Queue. Queueing Systems, 18, 333-351.
14. SAKATA, M., S. NOGUCHI, AND J. OIZUMI. 1969. Analysis of a Processor Shared Queueing Model for Time Sharing Systems. Proc. Second Hawaii Int. Conf. on Systems Sci. 625-627.
15. SCHASSBERGER, R. 1984. A New Approach to the M/G/1 Processor-Sharing Queue. Adv. Appl. Prob. 16, 202-213.
16. SENATA, E. 1981. Non-negative Matrices and Markov Chains. Springer-Verlag, New York.
17. SENGUPTA, B. 1989. A Perturbation Method for Solving Some Queues with Processor Sharing Discipline. J. Appl. Prob. 26, 209-214.
18. SENGUPTA, B. 1992. An Approximation for the Sojourn-Time Distribution for the GI/G/1 Processor-Sharing Queue. Stochastic Models 8, 1, 35-58.
19. YASHKOV, S. F. 1983. A Derivation of Response Time Distribution for a M/G/1 Processor-Sharing Queue. Prob. Control and Info. Theory 12, 133-148.