The power-series algorithm for polling systems with time limits

Probability in the Engineering and Informational Sciences

Volumn 12, Issue 2, 1998, Pages 221-237

  Blanc, J P C ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

GRADIENT METHODS;

COMPUTING PERFORMANCE; CONSTANT TIME; NUMERICAL SOLUTION; OPTIMAL TIME; OPTIMIZATION PROBLEMS; PERFORMANCE MEASURE; POLLING SYSTEM; POWER SERIES;

COST FUNCTIONS;

EID: 0032362678     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0269964800005167     Document Type: Article

References (13)

1. Baker, J.E. & Rubin, I. (1987). Polling with a general-service order table. IEEE Transactions on Communications 35: 283-288.
2. Blanc, J.P.C. (1992). Performance evaluation of polling systems by means of the power-series algorithm. Annals of Operations Research 35: 155-186.
3. Blanc, J.P.C. (1993). Performance analysis and optimization with the power-series algorithm. In L. Donatiello & R. Nelson (eds.), Performance evaluation of computer and communication systems. Berlin: Springer-Verlag, pp. 53-80.
4. Blanc, J.P.C. (1996). Optimization of periodic polling systems with non-preemptive, time-limited service. CentER Discussion paper 9663, Tilburg University.
5. Blanc, J.P.C. & Van der Mei, R.D. (1995). Optimization of polling systems with Bernoulli schedules. Performance Evaluation 22: 139-158.
6. Blanc, J.P.C. & Van der Mei, R.D. (1996). Computation of derivatives by means of the power-series algorithm. INFORMS Journal on Computing 8: 45-54.
7. Borst, S.C., Boxma, O.J., & Levy, H. (1995). The use of service limits for efficient operation of multistation single-medium communication systems. IEEE/ACM Transactions on Networking 3: 602-612.
8. Coffman, E., Jr., Mitrani, I., & Fayolle, G. (1988). Two queues with alternating service periods. In P.-J. Courtois & G. Latouche (eds.), Performance '87. Amsterdam: North-Holland, pp. 227-239.
9. Fricker, C. & Jaïbi, M.R. (1994). Monotonicity and stability for periodic polling models. Queueing Systems 15: 211-238.
10. Leung, K.K. (1994). Cyclic-service systems with nonpreemptive, time-limited service. IEEE Transactions on Communications 42: 2521-2524.
11. Resing, J.A.C. (1993). Polling systems and multitype branching processes. Queueing Systems 13: 409-426.
12. Takagi, H. (1986). Analysis of polling systems. Cambridge, MA: The MIT Press.
13. Van den Hout, W.B. & Blanc, J.P.C. (1995). The power-series algorithm for Markovian queueing networks. In W.J. Stewart (ed.), Computations with Markov chains. Boston: Kluwer, pp. 321-338.