Processor-sharing and random-service queues with semi-markovian arrivals

Journal of Applied Probability

Volumn 42, Issue 2, 2005, Pages 478-490

  Wu, D A ^a   Takagi, Hideaki ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Processor sharing; Queue; Random service; Semi Markov arrival process; Sojourn time; Waiting time

Indexed keywords

EID: 23944520344     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1118777183     Document Type: Article

References (20)

1. ANDERSSON, M., CAO, J., KIHL, M. AND NYBERG, C. (2003). Performance modeling of an Apache web server with bursty arrival traffic. In Proc. Internat. Conf. Internet Comput. (Las Vegas, June 2003), Vol. 2, pp. 508-514.
2. ÇINLAR, E. (1967). Queues with semi-Markovian arrivals. J Appl. Prob. 4, 365-379.
3. COFFMAN, E. G., JR., MUNTZ, R. R. AND TROTTER, H. (1970). Waiting time distributions for processor-sharing systems. J. Assoc. Comput. Mach. 17, 123-130.
4. COHEN, J. W. (1982). The Single Server Queue (North-Holland Ser. Appl. Math. Mech. 8), 2nd edn. North-Holland, Amsterdam.
5. COHEN, J. W. (1984). On processor sharing and random service. J. Appl. Prob. 21, 937.
6. DING, W. (1991). A unified correlated input process model for telecommunication networks. In Teletraffic and Datatraffic in a Period of Change, eds A. Jensen and V. B. Iversen, Elsevier, Amsterdam, pp. 539-544.
7. GANTMACHER, F. R. (2000). The Theory of Matrices, Vol. 1. AMS, Providence, RI.
8. GANTMACHER, F. R. (2000). The Theory of Matrices, Vol. 2. AMS, Providence, RI.
9. HEFFES, H. (1980). A class of data traffic processes-covariance function characterization and related queuing results. Bell System Tech. J. 59, 897-929.
10. JAGERMAN, D. AND SENGUPTA, B. (1991). The GI/M/1 processor-sharing queue and its heavy traffic analysis. Commun. Statist. Stoch. Models 7, 379-395.
11. KHERANI, A. AND KUMAR, A. (2002). Stochastic models for throughput analysis of randomly arriving elastic flows in the Internet. In Proc. IEEE INFOCOM (New York, July 2002), Vol. 2, pp. 1014-1023.
12. LOYNES, R. M. (1962). Stationary waiting-time distribution for single server queue. Ann Math. Statist. 33, 1323-1339.
13. NEUTS, M. F. (1966). The single server queue with Poisson input and semi-Markov service times. J. Appl. Prob. 3, 202-230.
14. OTT, T. J. (1984). The sojourn time distribution in the M/G/1 queue with processor sharing J. Appl. Prob. 21, 360-378.
15. RAMASWAMI, V. (1984). The sojourn time in the GI/M/1 queue with processor sharing. J. Appl. Prob. 21, 437-442.
16. SENGUPTA, B. (1991). An approximation for the sojourn-time distribution for the GI/G/1 processor sharing discipline queue. Commun. Statist. Stoch. Models 8, 379-395.
17. TAKÁCS, L. (1962). Introduction to the Theory of Queues. Oxford University Press.
18. YAGYU, S. AND TAKAGI, H. (2002). A queueing model with input of MPEG fame sequence and interfering traffic. J. Operat. Res. Soc. Japan 45, 317-338.
19. YASHKOV, S. F. (1983). A derivation of response time distribution for an M/G/1 processor-sharing queue. Problems Control Inf. Theory 12, 133-148.
20. YASHKOV, S. F. (1987). Processor-sharing queues: some progress in analysis. Queueing Systems 2, 1-17.