Workload and waiting time in a fixed-time loop system

Computers and Operations Research

Volumn 24, Issue 8, 1997, Pages 789-803

  Xie, Jennifer ^a   Fischer, Martin J ^a,b,d,e,f   Harris, Carl M ^b,c  

^a US Postal Service   (United States)

^b NOBLIS   (United States)

^c George Mason University   (United States)

^d Research Management Consultants   (United States)

^e Washington Gas Light Company   (United States)

^f Project Design Systems Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; PROBABILITY; QUEUEING THEORY; STATISTICAL METHODS; TELECOMMUNICATION TRAFFIC;

FIXED TIME LOOP SYSTEMS; WORKLOAD ANALYSIS;

COMPUTER NETWORKS;

EID: 0031206650     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(96)00079-2     Document Type: Article

References (24)

1. Takagi, H., Queueing analysis of polling systems: an update. In Stochastic Analysis of Computer and Communication Systems. Elsevier, Amsterdam, 1990, pp. 267-318.
2. Takagi, H., Effects of the target token rotation time on the performance of a timed-token protocol. Performance '90, 1990, 363-370.
3. Leung, K. K., Cyclic-service systems with nonpreemptive time-limited service. IEEE Transactions Communications, 1994, 42, 2521-2524.
4. Takagi, H., Queueing analysis of polling models. ACM Computing Surveys, 1988, 20, 5-28.
5. Tangemann, M. and Sauer, K., Performance analysis of the timed token protocol of FDDI and FIID-II. IEEE Journal of Selective Areas of Communications, 1991, 9, 271-278.
6. Levy, H. and Sidi, M., Polling systems: applications, modeling and optimization. IEEE Transactions Communications, 1990, 38, 1750-1760.
7. Leung, K. K., Cyclic-service systems with probabilistically-limited service. IEEE Journal of Selective Areas of Communications, 1991, 9, 185-193.
8. Leung, K. K. and Eisenberg, M., A single-server queue with vacations and gated time-limited service. IEEE Transactions Communications, 1990, 38, 1454-1462.
9. Schwartz, M., Telecommunications Networks, Addison-Wesley Publishing, California, 1988.
10. Layland, R., Multiplexers hit the comeback trail. Data Communications , 1993, 6, 17-18.
11. Doshi, B. T., Queueing systems with vacations - a survey. Queueing Systems Theory and Applications, 1986, 1, 29-66.
12. Doshi, B. T., Conditional and unconditional distributions for M/G/1 type queues with server vacations. Queueing Systems Theory and Applications, 1990, 7, 229-251.
13. Sahin, I., Moment inequalities for a class of stochastic systems. Stochastic Processes and Applications, 1978, 7, 123-130.
14. Sahin, I. and Bhat, U. N., A stochastic system with scheduled secondary inputs. Operations Research, 1971, 19, 436-447.
15. Sahin, I. and Perrakis, S., Moment inequalities for a class of single server queues. INFOR, 1976, 14, 144-152.
16. Kuczura, A., Queues with mixed renewal and poisson inputs. Bell System Technical Journal, 1972, 51, 1305-1326.
17. Kuczura, A., Loss systems with mixed renewal and poisson inputs. Operations Research, 1972, 21, 787-795.
18. Fischer, M. J., An approximation to queueing systems with interruptions. Management Science, 1977, 24, 338-344.
19. Fischer, M. J., Analysis and design of loop service systems via a diffusion approximation. Operations Research, 1977, 25, 269-278.
20. Ott, T. J., On the M/G/1 queue with additional inputs. Journal of Applied Probability, 1984, 21, 129-142.
21. Zhang, Z. and Vickson, R. A., A simple approximation for mean waiting time in M/G/1 queue with vacations and limited service discipline. Operations Research Letters , 1993, 13, 21-26.
22. Xie, J., Cyclic service systems with limited service disciplines. Ph.D. Dissertation, Department of Operations Research and Engineering, George Mason University, Fairfax, VA, 1992.
23. Wolff, R., Poisson arrivals see time averages. Operations Research, 1982, 30, 223.
24. Takacs, L., Introduction to the Theory of Queues. Oxford University Press, New York, 1962.