An exact analysis of an asymmetric polling system with mixed service discipline and general service order

Computer Communications

Volumn 20, Issue 14, 1997, Pages 1292-1300

  Hwang, Lain Chyr ^a   Chang, Chung Ju ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

General service order; Genetic algorithm; Mean age; Mean excess; Mean waiting time; Mixed service discipline; Polling system

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; NUMERICAL ANALYSIS; OPTIMIZATION; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

WAITING TIME;

TELECOMMUNICATION SYSTEMS;

EID: 0031344611     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0140-3664(97)00110-2     Document Type: Article

References (18)

1. H. Takagi, Queueing analysis of polling model: an update, in: Stochastic Analysis of Computer and Communication Systems, Elsevier Science, North Holland, Amsterdam, 1990, pp. 267-318.
2. M.J. Ferguson, Y.J. Aminetzah, Exact results for nonsymmetric token ring system, IEEE Transactions on Communications 33 (3) (1985) 223-231.
3. M. Eisenberg, Queues with periodic service and changeover time, Operations Research 20 (1972) 440-451.
4. J.E. Baker, I. Rubin, Polling with a general service order table, IEEE Transactions on Communications 35 (3) (1987) 283-288.
5. G.L. Choudhury, Polling with a general service order table: gated service, Proceedings of the IEEE INFOCOM '90, pp. 268-276.
6. L.C. Hwang, C.J. Chang, Optimal design of a finite-buffer polling network with mixed service discipline and general service order sequence, IEE Proceedings: Communications February (1995) 1-6.
7. A.G. Konheim, H. Levy, M.M. Srinivasan, Descendant set: an efficient approach for the analysis of polling systems, IEEE Transactions on Communications. 42(2-4) (1994) 1245-1253.
8. D. Saxkar, W.I. Zandwill, Expected waiting time for nonsynimetric cyclic queueing systems - exact results and applications, Management Science 35 (12) (1989) 1463-1474.
9. D. Everitt, Simple approximations for token rings, IEEE Transactions on Communications 34 (7) (1986) 719-721.
10. S.C. Borst, O.J. Boxma, H. Levy, The use of service limits for efficient operation of multistation single-medium communication systems, IEEE ACM Transactions on Communications 3 (5) (1995) 602-612.
11. R.W. Wolff, Stochastic Modeling and the Theory of Queue, Prentice-Hall, Englewood Cliff, NJ, 1989.
12. L. Kleinrock, Queueing Systems, Volume 1: Theory, Wiley, New York, 1975.
13. L.C. Hwang, Polling schemes in computer communication networks, Ph.D. dissertation, National Chiao Tung University, Taiwan, 1994.
14. W.Y. Jung, C.K, Un, Analysis of a finite buffer polling system with exhaustive service based on virtual buffering, IEEE Transactions on Communications 40(5) (1992) 860-862.
15. G.L. Choundhury, H. Takagi, Comments on "Exact results for nonsymmetric token ring systems", IEEE Transactions on Communications 38 (8) (1990) 1125-1127.
16. D.E. Goldbeg, Genetic Algorithm in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1986.
17. N.N. Schraudolph, J.J. Grefenstette, A user's guide to GAUCSA 1.4, Technical Report CSE DEP., UC San Diego, La Jolla, CA.
18. H. Takagi, Queuing Analysis, A Foundation of Performance Evaluation, Volume 1 Vocation and Priority Systems, Part 1, Elsevier Science, North Holland, Amsterdam, 1991.