Analysis of a discrete time table polling system with MAP input and time-limited service discipline

Telecommunication Systems

Volumn 12, Issue 1, 1999, Pages 51-77

  Frigui, Imed ^a   Alfa, Attahiru Sule ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033169323     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019182325899     Document Type: Article

References (34)

1. A.S. Alfa, A discrete single-server MAP/PH/1 queue with vacations and exhaustive time-limited service, Operations Research Letters 18 (1995) 31-40.
2. E. Altman and D. Kofman, Bounds for performance measures of token rings, IEEE/ACM Transactions on Networking 4 (1996) 292-299.
3. J.E. Baker and I. Rubin, Polling with general-service order, IEEE Transactions on Communications 35 (1987) 283-288.
4. J.P.C. Blanc and R.D. Van der Mei, Optimization of polling systems with Bernoulli schedules, Perfomance Evaluation 22 (1995) 139-158.
5. C. Blondia, A discrete-time Markovian arrival process, RACE Document, PRLB_123_0015_CC_CD (1989).
6. C. Blondia, A discrete-time batch Markovian arrival process as B-ISDN traffic model, Belgian Journal of Operations Research Statistics and Computer Science 32 (1994) 3-23.
7. C. Blondia and T. Theimer, A discrete-time model for ATM traffic, RACE Document, PRLB_123_ 0018_CC_CD/UST_123_0022_CC_CD (1989).
8. S.C. Borst, O.J. Boxma and H. Levy, The use of service limits for efficient operation of multistation single-medium communications systems, IEEE/ACM Transactions on Networking 3 (1995) 602-612.
9. O.J. Boxma, W.P. Groenendijk and J.A. Weststrate, A pseudoconservation law for service systems with polling table, IEEE Transactions on Communications 38 (1990) 1865-1870.
10. G.L. Choudhury, Polling with a general service order table: Gated service, IEEE Transactions on Communications 38 (1990) 268-276.
11. E.G. Coffman et al., Two queues with alternating service periods, in: Performance '87, eds. P.J. Courtois and G. Latouche (North-Holland, Amsterdam, 1988) pp. 227-239.
12. E. de Souza e Silva et al., Polling systems with server timeouts and their application to token passing networks, IEEE/ACM Transactions on Networking 3 (1995) 560-575.
13. M. Eisenberg, Queues with periodic service and changeover times, Operations Research 20 (1972) 440-451.
14. A. Federgruen and Z. Katalan, Approximating queue size and waiting time distributions in general polling systems, Queueing Systems 18 (1994) 353-386.
15. I. Frigui and A.S. Alfa, Discrete time analysis of a time limited polling system with Markovian arrival process, Computer Communications 21 (1998) 558-571.
16. I. Frigui and A.S. Alfa, Approximate method for polling systems with time-limited-based polling tables, in: IEEE WESCANEX'95 Conf. (1995) pp. 398-402.
17. I. Frigui, R. Stone and A.S. Alfa, Message delay for priority-based automatic meter reading network, Computer Communications 20 (1997) 38-47.
18. S.W. Fuhrmann and R. Cooper, Stochastic decomposition in the M/G/1 queue with generalized vacations, Operations Research 33 (1985) 1117-1129.
19. S.W. Fuhrmann and Y.T. Wang, Analysis of cyclic service systems with limited service: Bounds and approximations, Performance Evaluation 9 (1988) 35-54.
20. H. Heffes and D.M. Lucantoni, A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance, IEEE Journal on Selected Areas in Communications 4 (1986) 856-868.
21. S. Hong, H.G. Perros and H. Yamashita, A discrete-time queueing model of the shared buffer ATM switch with bursty arrival, Telecommunication Systems 2 (1993) 1-20.
22. D.S. Lee and B. Sengupta, An approximation analysis of cyclic server queue with limited service and reservation with application to satellite communications, Queueing Systems 11 (1992) 153-178.
23. K.K. Leung, Cyclic-service systems with probabilistically-limited service, IEEE Journal on Selected Areas in Communications 9 (1991) 185-193.
24. K.K. Leung, Cyclic-service systems with nonpremptive time-limited service, IEEE Transactions on Communications 42 (1994) 2521-2524.
25. K.K. Leung and D.M. Lucantoni, Two vacation models for token-ring networks where service is controlled by timers, Perfomance Evaluation 20 (1994) 165-184.
26. B.E. Patuwo, R.L. Disney and D.C. McNickle, The effect of correlated arrivals on queues, IIE Transactions 25 (1993) 105-110.
27. I. Rubin and J.C.H. Wu, Analysis of an M/G/1/N queue with vacations and its iterative application to FDDI time-token rings, IEEE/ACM Transactions on Networking 3 (1995) 842-856.
28. L.D. Servi, Average delay approximation of M/G/1 cyclic service queues with Bernoulli schedules, IEEE Journal on Selected Areas in Communications 4 (1986) 813-822.
29. K. Sriram and W. Whitt, Characterizing superposition arrival processes in packet multiplexers for voice and data, IEEE Journal in Selected Areas in Communications 4 (1986) 833-846.
30. H. Takagi, Analysis of Polling Systems (MIT Press, Cambridge, MA, 1986).
31. H. Takagi, Applications of polling models to computer networks, Computer Networks and ISDN Systems 22 (1991) 193-211.
32. H. Takagi and K.K. Leung, Analysis of a discrete-time queueing system with time-limited service, Queueing Systems 18 (1994) 183-197.
33. A. Zaghloul and H. Perros, Approximate analysis of a discrete-time polling system with bursty arrival, in: IFIP Workshop on Modelling and Performance Evaluation of ATM Technology, Maritinique (1993).
34. A.O. Zaghloul and H.G. Perros, Approximate analysis of a shared-medium ATM switch under bursty arrivals and nonuniform destinations, Perfomance Evaluation 21 (1994) 111-129.