Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T12:34:51.770Z Has data issue: false hasContentIssue false
  • English
  • Français

PERFORMANCE ESTIMATION OF M/DK/1 QUEUE UNDER FAIR SOJOURN PROTOCOL IN HEAVY TRAFFIC

Published online by Cambridge University Press:  13 November 2008

Yingdong Lu
Yingdong Lu
Affiliation:
IBM T. J. Watson Research Center, Yorktown Heights, NY 10598 E-mail: yingdong@us.ibm.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We study the performance of a M/DK/1 queue under Fair Sojourn Protocol (FSP). We use a Markov process with mixed real- and measure-valued states to characterize the queuing process of system and its related processor sharing queue. The infinitesimal generator of the Markov process is derived. Classifying customers according to their service time, using techniques in multiclass queuing system, and borrowing recently developed heavy traffic results for processor-sharing queues, we are able to derive approximations for average waiting time for the jobs.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 23 , Issue 1 , January 2009, pp. 61 - 74
Copyright
Copyright © Cambridge University Press 2009

References

1.Cabré, X. & Caffarelli, L.A. (1995). Fully nonlinear elliptic equations. Providence, R: American Mathematical Society. Colloquium Publications, Vol. 43.Google Scholar
2.Dawson, D.A. (1993). Measure-valued markov processes, Ecole d'Eté de Probabilités de Saint Flour XX1-1991, Lecture Notes in Mathematics No. 1541. New york; Springer.CrossRefGoogle Scholar
3.Ethier, S. & Kurtz, T. (1986). Markov processes: Characterization and convergence. New York: Wiley.Google Scholar
4.Friedman, E.J. & Henderson, S.G. (2003). Fairness and efficiency in web server protocols. In Proceedings ACM/SIGMETRICS’03.Google Scholar
5.Grishechkin, S. (1994). GI/GI/1 processor sharing queue in heavy traffic. Advances in Applied Probability 26: 539–555.Google Scholar
6.Gromoll, H.C. (2004). Diffusion approximations for a processor sharing queue in heavy traffic. Annals of Applied Probability 14: 555–611.Google Scholar
7.Gromoll, H.C., Puha, A.L. & Williams, R.J. (2002). The fluid limit of a heavily loaded processir sharing queue. Annals of Applied Probability 12: 797–859.Google Scholar
8.Kallenberg, O. (1976). Random measures. Berlin: Akademie-Verlag.Google Scholar
9.Kleinrock, L. (1976). Queueing systems, Vol. II: Computer applications, New York: Wiley.Google Scholar
10.Prohorov, Y.V. (1956). Convergence of random processes and limit theorems in propability theory. Theory of Probability and its Applications 1: 157–214.CrossRefGoogle Scholar
11.Puha, A.L. & Williams, R.J.Invariant states and rates of convergence for a critical fluid model of a processor sharing queue. Annals of Applied Probability 14: 517–554.Google Scholar
12.Rogers, L.C.G. & Williams, D. (2000). Diffusions, Markov processes and martingales. Cambridge: Cambridge University Press.Google Scholar