Performance of non-exhaustive cyclic service systems with finite queues and non-zero switchover times

INMIC2007 - 11th IEEE International Multitopic Conference

Volumn , Issue , 2007, Pages

  Aziz, Khurram ^a   Van As, Harmen R ^a   Sarwar, Shahzad ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Communication systems; Cyclic queueing systems; Cyclic service; Finite queues; Queueing theory; Switchover time

Indexed keywords

AGGLOMERATION; COMMUNICATION SYSTEMS; STATE SPACE METHODS;

ANALYTICAL METHODS; BUFFER CAPACITIES; BURST ASSEMBLY; CYCLIC QUEUEING SYSTEMS; CYCLIC SERVICE; EDGE NODES; EXHAUSTIVE SERVICES; FINITE QUEUES; QUEUE SIZES; QUEUEING SYSTEMS; REAL SYSTEMS; RING NETWORKS; SERVICE SYSTEMS; STATE SPACES; SWITCH OVER; SWITCHOVER TIME; SWITCHOVER TIMES; TRAFFIC AGGREGATION; TRAFFIC LOADS;

QUEUEING THEORY;

EID: 51849084849     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INMIC.2007.4557709     Document Type: Conference Paper

References (15)

1. R. B. Cooper and G. Murray, "Queues Served in Cyclic Order", The Bell Systems Technical Journal, vol. 48, 1969, pp. 675-689.
2. R. B. Cooper, "Queues Served in Cyclic Order : Waiting Times", The Bell Systems Technical Journal, vol. 49, 1970, pp. 399-413.
3. M. Eisenberg, "Queues with Periodic Service and Changeover Times", Operations Research, vol. 20, 1972, pp. 440-451.
4. O. Hashida, "Analysis of Multiqueue", Review of the Electrical Communication Laboratories, vol. 20, 3, 1972, pp. 189-199.
5. Duan-Shin Lee, "A two-queue model with exhaustive and limited service disciplines", Stochastic Models, vol. 12, 2, 1996, pp. 285-305.
6. O. J. Boxma, "Two-Queue Polling Models with a Patient Server", Operations Research, vol. 112, 2002, pp. 101-121.
7. P. J. Kuehn, "Multiqueue Systems with Nonexhaustive Cyclic Service", The Bell Systems Technical Journal, vol. 58, 1979, pp. 671-699.
8. O. J. Boxma, "Workloads and Waiting Times in Single-server Systems with Multiple Customer Classes", Queueing Systems, vol. 5, 1989, pp. 185-214.
9. R. B. Cooper, S.-C. Niu and M. M. Srinivasan, "A Decomposition Theorem for Polling Models: The Switch-over Times Are Effectively Additive". Operations Research, vol. 44, 4, 1996, pp. 629-633.
10. S. W. Fuhrmann, "A Decomposition Result for a Class of Polling Models", Queueing Systems, vol. 11, 1992, pp. 109-120.
11. M. M. Srinivasan, S.-C. Niu and R. B. Cooper, "Relating Polling Models with Nonzero and Zero Switchover Times", Queueing Systems, vol. 19, 1995, pp. 149-168.
12. S. C. Borst and O. J. Boxma, "Polling Models With and Without Switchover Times", Operations Research, vol. 45, 4, 1997, pp. 536-543.
13. R. O. Onvural and H. G. Perros, "Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers", IEEE Transactions on Software Engineering, vol. 15, 6, 1989, pp. 800-808.
14. P. Tran-Gia and Thomas Raith, "Multiqueue Systems with Finite Capacity and Nonexhaustive Cyclic Service", International Seminar on Computer Networking and Performance Evaluation, Tokyo, Japan, 1985.
15. J. D. C. Little, "A Proof of the Queueing Formula L = λW", Operations Research, vol. 9, 1961, pp. 383-387.