Hostname: page-component-89b8bd64d-x2lbr Total loading time: 0 Render date: 2026-05-07T09:32:20.838Z Has data issue: false hasContentIssue false
  • English
  • Français

GeoX1, GeoX2/D/c HOL Priority Queueing System with Random Order Selection within Each Priority Class*

Published online by Cambridge University Press:  27 July 2009

Bong Dae Choi ,
Yutae Lee  and
Doo Il Choi
Bong Dae Choi
Affiliation:
Department of Mathematics, Korea Advanced Institute of Science and Technology, Taejon, Korea
Yutae Lee
Affiliation:
Department of Mathematics, Korea Advanced Institute of Science and Technology, Taejon, Korea
Doo Il Choi
Affiliation:
Department of Mathematics, Statistics andComputer Science University of Illinois at Chicago
Get access Rights & Permissions [Opens in a new window]

Abstract

We model the virtual contention queue in an ATM nonblocking packet switch with capacity c and input queues by a Geox1, Geox2/D/c Head-of-Line priority queueing system with Random Order Selection within each class and find the joint queue length distribution and the waiting time distribution for each class.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 12 , Issue 1 , January 1998 , pp. 125 - 139
Copyright
Copyright © Cambridge University Press 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Ahmadi, H.& Guerin, R. (1990). Analysis of a class of buffer storage systems with Markovcorrelated input and bulk service. Proceedings of the 4th International Conference on Data Communication Systems and Their Performances, Barcelona, pp. 67–84.Google Scholar
2.Chang, J.F. & Harn, Y.P. (1992). A discrete-time priority queue with two-class customers and bulk services. Queueing Systems 10: 185–212.CrossRefGoogle Scholar
3.Chen, J.S.C. & Guerin, R. (1991). Performance study of an input queueing packet switch with two priority classes. IEEE Transactions on Communications COM-39(1): 117–126.CrossRefGoogle Scholar
4.Churchill, R.V. & Brown, J.W. (1960). Complex variables and applications. New York: McGraw-Hill.Google Scholar
5.Gupta, A.K. & Georganas, N.D. (1992). Priority performance of ATM switches. IEEE INFOCOM '92: 727–733.Google Scholar
6.Karo, M.J., Hluchyj, M.G., & Morgan, S.P. (1987). Input versus output queueing on a space-division packet switch. IEEE Transactions on Communications COM-35(12): 1347–1356.CrossRefGoogle Scholar
7.Lamperti, J. (1960). Criteria for the recurrence or transience of stochastic process, I. Journal of Mathematical Analysis and Applications 1: 314–330.CrossRefGoogle Scholar
8.Lee, J.Y.& Un, C.K. (1995). Performance analysis of an input and output queueing packet switch with a priority packet discarding scheme. IEEE Proceedings; Communications 142(2): 67–74.CrossRefGoogle Scholar
9.Li, S.Q. (1990). Nonuniform traffic analysis on a nonblocking space-division packet switch. IEEE Transactions on Communications COM-38(7): 1085–1096.CrossRefGoogle Scholar
10.Li, S.Q. (1991). Performance of trunk grouping in packet switch design. IEEE INFOCOM '91: 688–693.Google Scholar
11.Neuts, M.F. (1989). Structured stochastic matrices of M/G/l type and their applications. New York: Marcel Dekkar.Google Scholar
12.Rubin, I. & Zhang, Z. (1991). Message delay and queue-size analysis for circuit-switched TDMA systems. IEEE Transactions on Communications COM-39(6): 905–914.CrossRefGoogle Scholar
13.Takagi, H. (1993). Queueing analysis: A foundation of performance evaluation. Vol. 3: Discrete-time systems. Amsterdam: North-Holland.Google Scholar