Delay analysis of a probabilistic priority discipline

European Transactions on Telecommunications

Volumn 13, Issue 6, 2002, Pages 563-577

  Jiang, Yuming ^a   Tham, Chen Khong ^a   Ko, Chi Chung ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003341106     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.4460130603     Document Type: Article

References (40)

1. N.K. Jaiswal. Priority Queues. Academic Press, New York, 1968.
2. C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne. Real-time communication in packet-switched networks. In Proceedings of the IEEE, Vol. 82, No. 1, pages 122-139, Jan. 1994.
3. P. Brucker. Scheduling Algorithms. Springer, Berlin, second edition, 1998.
4. S. Keshav. An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network. Addison-Wesley, 1997.
5. H. Zhang. Service disciplines for guaranteed performance service in packet-switching networks. In Proceedings of the IEEE, Vol. 83, No. 10, pages 1374-1396, Oct. 1995.
6. L. Kleinrock. Queueing Systems, volume 2. Wiley, New York, 1975.
7. K.W. Ross and D.D. Yao. Optimal scheduling of interactive and non-interactive traffic in telecommunication systems. IEEE Trans. Automat. Contr., Vol. 33, No. 3, pages 261-267, Mar. 1988.
8. K. Nichols, V. Jacobson, and L. Zhang. A two-bit differentiated services architecture for the internet. IETF Internet Draft, April 1999.
9. J. Liebeherr and D.E. Wrege. Priority queue schedulers with approximate sorting in output-buffered switches. IEEE J. Select. Areas Commun., Vol. 17, No. 6, pages 1127-1144, June 1999.
10. S. Shenker. Fundamental design issues for the future Internet. IEEE J. Select. Areas Commun., Vol. 13, No. 7, pages 1176-1188, Sept. 1995.
11. J. Liebeherr, D.E. Wrege, and D. Ferrari. Exact admission control for networks with a bounded delay service. IEEE/ACM Trans. Networking, Vol. 4, No. 6, pages 885-901, Dec. 1996.
12. D.E. Wrege, E.W. Knightly, H. Zhang, and J. Liebeherr. Deterministic delay bounds for VBR video in packet-switching networks: Fundamental limits and practical tradeoffs. IEEE/ACM Trans. Networking, Vol. 4, No. 3, pages 352-362, June 1996.
13. K.W. Ross and D.D. Yao. Optimal dynamic scheduling in Jackson networks. IEEE Trans. Automat. Contr., Vol. 34, No. 1, pages 47-53, Jan. 1989.
14. C. Dovrolis, D. Stiliadis, and P. Ramanathan. Proportional differentiated services: Delay differentiation and packet scheduling. In ACM SIGCOMM'99, 1999.
15. J. Keilson and L.D. Servi. Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules. J. Appl. Prob., Vol. 23, pages 790-802, 1986.
16. H. Levy. Binomial-gated service: A method for effective operation and optimization of polling systems. IEEE Trans. Commun., Vol. 39, No. 9, pages 1341-1350, Sept. 1991.
17. i-persistent protocol for unidirectional broadcast bus networks. IEEE Trans. Commun., Vol. 36, No. 12, pages 1277-1286, Dec. 1988.
18. T. Katayama and Y. Takajashi. Analysis of a two-class priority queue with Bernoulli schedules. Journal of the Operations Research Society of Japan, Vol. 35, No. 3, pages 236-249, Sept. 1992.
19. D.S. Lee. Generalized longest queue first: An adaptive scheduling discipline for ATM networks. In IEEE Infocom'97, 1997.
20. i-persistent protocol for high-speed fiber optic networks. Computer Communications, Vol. 13, No. 7, pages 387-398, Sept. 1990.
21. L.D. Servi. Average delay approximation of M/G/1 cyclic service queues with Bernoulli schedules. IEEE J. Select. Areas Commun., Vol. 4, No. 6, pages 813-822, Sept. 1986.
22. J.C.R. Bennett and H. Zhang. WF2Q: Worst-case fair weighted fair queueing. In IEEE Infocom'96, pages 120-128, 1996.
23. P. Goyal, H.M. Vin, and H. Cheng. Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks. In ACM SIGCOMM'96, pages 157-168, 1996.
24. S. Shreedhar and G. Varghese. Efficient fair queuing using deficit round robin. IEEE/ACM Trans. Networking, Vol. 4, No. 3, pages 375-385, June 1996.
25. Tedijanto. Exact results for the cyclic-service queue with a Bernoulli schedule. Performance Evaluation, Vol. 11, pages 107-115, 1990.
26. W. Feng, M. Kowada, and K. Adachi. A two-queue model with Bernoulli service schedule and switching times. Queueing Systems, Vol. 30, pages 405-434, 1998.
27. D.S. Lee. Analysis of a two-queue model with Bernoulli schedules. J. Appl. Prob., Vol. 34, pages 176-191, 1997.
28. i-persistent protocol using channel feedback. IEEE Trans. Commun., Vol. 39, No. 6, pages 887-897, June 1991.
29. J. Abate, G.L. Choudhury, and W. Whitt. Exponential approximations for tail probabilities in queues I: Waiting times. Operations Research, Vol. 43, No. 5, pages 885-901, 1995.
30. J. Abate, G.L. Choudhury, and W. Whitt. Exponential approximations for tail probabilities in queues II: Sojourn time and workload. Operations Research, Vol. 44, No. 5, pages 758-763, 1996.
31. D.J. Daley, A.Y. Kreinin, and C.D. Trengove. Inequalities concerning the waiting-time in single-server queues: a survey. Queueing and related methods. U.N. Bhat and I.V. Basawa, editors, pages 177-223. Oxford, 1992.
32. Y. Jiang, C.K. Tham, and C.C. Ko. An approximation for waiting time tail probabilities in multiclass systems. IEEE Communications Letters, Vol. 5, No. 4, pages 175-177, April 2001.
33. W. Whitt. Approximations for the GI/G/m queue. Production and Operations Management, Vol. 2, No. 2, pages 114-161, 1993.
34. Y. Jiang, C.K. Tham, and C.C. Ko. A probabilistic priority scheduling discipline for multi-service networks. In IEEE ISCC'2001, July 2001.
35. O.J. Boxma and B.W. Meister. Waiting-time approximations in multi-queue systems with cyclic service. Performance Evaluation, Vol. 7, pages 59-70, 1987.
36. E.W. Knightly. Resource allocation for multimedia traffic flows using rate-variance envelopes. ACM/Springer-Verlag Multimedia Systems Journal, Vol. 7, No. 6, pages 477-485, Nov. 1999.
37. B. Walke. Improved bounds and an approximation for a dynamic priority queue. In Proc. 3rd Int. Symp. Modeling and Perform. Eval. Comput. Syst., pages 321-346. North-Holland, 1978.
38. B. Walke and W. Rossenbohm. Waiting-time distributions for deadline-oriented serving. Performance of Computer Systems. M. Arato, A. Butrimenko, and E. Gelenbe, editors, pages 241-260. North-Holland, 1979.
39. B. Walke and W. Rossenbohm. Deadline-oriented servicing: Waiting-time distributions. IEEE Trans. Software Engineering, Vol. 6, No. 3, pages 304-312, May 1980.
40. S. Delas, R.R. Mazumdar, and C. Rosenberg. Cell loss asymptotics in priority queues accessed by a large number of independent stationary sources. In IEEE Infocom'99, pages 551-558, 1999.