Study of a class of partially ordered service strategies for a system of two discrete-time queues

Performance Evaluation

Volumn 29, Issue 1, 1997, Pages 15-33

  Stavrakakis, Ioannis ^a   Tsakiridou, Sophia ^b  

^a Northeastern University   (United States)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

Discrete time queueing systems; M G 1 type Markov chain; Matrix analytic technique; Service strategies

Indexed keywords

MARKOV PROCESSES; MATRIX ALGEBRA; NETWORK PROTOCOLS; PERFORMANCE; QUEUEING THEORY; TELECOMMUNICATION SERVICES;

DISCRETE TIME QUEUEING SYSTEMS; MATRIX ANALYTIC TECHNIQUE; SERVICE STRATEGIES;

PACKET NETWORKS;

EID: 0031076613     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-5316(96)00002-8     Document Type: Article

References (17)

1. H. Takagi, Queueing analysis of polling models, ACM Comput. Surveys 20(1) (1988) 5-28.
2. H. Levy and M. Sidi, Polling systems: Applications, modelling, and optimization, IEEE Trans. Comm. 38(10) (1990) 1750-1760.
3. H. Takagi, Queueing analysis: A foundation of performance evaluation. Vacation and priority systems, Vol. 1, Part 1, 42(2) (1994) 615-624.
4. I. Stavrakakis, Delay bounds on a queueing system with consistent priorities, IEEE Trans. Comm., 42(2) (1994) 615-624. Proc. IEEE INFOCOM'92, Florence, Italy, May 4-8 (1992) pp. 2151-2160.
5. I. Stavrakakis, Delay bounds on a queueing system with consistent priorities, IEEE Trans. Comm., 42(2) (1994) 615-624. Proc. IEEE INFOCOM'92, Florence, Italy, May 4-8 (1992) pp. 2151-2160.
6. C. Bisdikian, A queueing model for a data station within the IEEE 802.6 MAN, IEEE 17th Local Computer Networks Conf., Minneapolis, MN, September 13-16, 1992.
7. R. Landry and I. Stavrakakis, A three-priority queueing policy with applications to communication networks, Proc. INFOCOM'93, San Francisco, CA, March 30-April 1, 1993, pp. 1067-1074.
8. M. Eisenberg, Two queues with alternating service, SIAM J. Appl. Math. 36(2) (1979) 287-303.
9. T. Ozawa, Alternating service queues with mixed exhaustive and K-limited services, Perform. Eval. 11 (1990) 165-175.
10. I. Stavrakakis and S. Tsakiridou, Occupancy distribution for a DQDB station based on a queueing system with Markovstructured service requirements, Proc. INFOCOM'93, San Francisco, CA, March 30-April 1, 1993, pp. 1083-1090.
11. C.M. Harris and W.G. Marchal, State dependence in M/G/1 server-vacation models, Oper. Res. 36(4) (1988) 560-565.
12. J. Keilson and L.D. Servi, Blocking probability for M/G/1 vacation systems with occupancy level dependent schedules, Oper. Res. 37(1) (1989) 134-140.
13. D.M. Lucantoni, K.S. Meier-Hellstern and M.F. Neuts, A single-server queue with server vacations and a class of non-renewal arrival processes, Adv. in Appl. Probab. 22 (1990) 676-705.
14. K.K. Leung, Cyclic-service systems with probabilistically-limited service, IEEE J. Select. Areas Commun. 9(2) (1991) 185-193.
15. S. Tsakiridou and I. Stavrakakis, Study of a class of partially ordered service strategies for a system of two discrete-time queues, Technical Report, TR-CDSP-96-37, Communications and Digital Signal Processing (CDSP) Center, ECE Department, Northeastern University, Boston, 1996.
16. D. Towsley, Providing quality of service in packet switched networks, in: L. Donatiello and R. Nelson (Eds.) Performance Evaluation of Computer and Communication Systems, Lecture Notes in Computer Science, Vol. 729, Springer, Berlin (1993) pp. 560-586.
17. M.F. Neuts, Structured Stochastic Matrices of M/C/1 Type and their Applications, Marcel Dekker, New York (1989).