Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds

Computer Communications

Volumn 26, Issue 2, 2003, Pages 65-78

  Barta, P ^a   Nemeth F ^a   Szabo R ^a   Biro J ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Bandwidth delay decoupling; Call admission control; Generalized processor sharing

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS;

CALL ADMISSION CONTROL (CAC);

PROGRAM PROCESSORS;

EID: 0037297832     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(02)00107-X     Document Type: Article

References (27)

1. P. Barta, F. Németh, R. Szabó, J. Bíró, Call admission control algorithms for tandem generalized processor sharing networks, In Proceedings of ISCC 2002 (7th IEEE Symposium on Computers and Communication), Taormina, Italy, July 2002.
2. Barta P., Németh F., Szabó R., Bíró J. An approach for traffic characterization in generalized processor sharing networks. Proceedings of ICC2001 IEEE International Conference on Communications, Helsinki, Finland. June:2001.
3. Barta P., Németh F., Szabó R., Bíró J. End-to-end delay bound calculation in generalized processor sharing networks. Proceedings of ISCC 2001 (The Sixth IEEE Symposium on Computers and Communication), Hammamet, Tunisia. July:2001.
4. Cruz R.L. A calculus for network delay, part II: network analysis. IEEE Trans. Inform. Theory. 37:(1):1991;132-141.
5. Cruz R.L. SCED+: efficient management of quality of service guarantees. Proceedings of IEEE Infocom, San Francisco, CA. March/April:1998;625.
6. Dukkipati N., Kuri J., Jamadagni H.S. Optimal call admission control in generalized processor sharing (GPS) schedulers. Proceedings of IEEE Infocom, Anchorage, Alaska. April:2001.
7. Elwalid A., Mitra D. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS. Proceedings of IEEE Infocom, New York. March:1999.
8. Golestani S. A self-clocked fair queueing scheme for broadband applications. Proceedings of IEEE Infocom, Toronto, CA. June:1994;636-646.
9. Mpeg video statistics and bandwidth traces. http://www2.ncsu.edu/eos/service/ece/project/rtcomm/ewfulp/www/sources/sourcesta ts.html.
10. A. Parekh, A generalized processor sharing approach to flow control in integrated services networks, PhD thesis, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, February (1992).
11. Parekh A., Gallager R.G. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Network. 1:(3):1993;344-357.
12. Parekh A., Gallager R.G. A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans. Network. 2:(2):1994;137-150.
13. Sariowan A., Cruz R.L., Polyzos G.C. Scheduling for quality of service guarantees via service curves. Proceedings of International Conference on Computer Communications and Networks'96 (ICCCN'95). September:1995;512-520.
14. S. Shenker, C. Partridge, R. Guerin, Specification of guaranteed quality of service, Request for Comments (Proposed Standard) 2212, Internet Engineering Task Force, September (1997).
15. S. Shenker, J. Wroclawski, General characterization parameters for integrated service network elements, Request for Comments (Proposed Standard) 2215, Internet Engineering Task Force, September (1997).
16. Szabó R., Barta P., Németh F., Bíró J. Worst-case deterministic delay bounds for arbitrary weighted generalized processor sharing schedulers. Proceedings of Networking 2000, Paris, France. May:2000.
17. Szabó R., Barta P., Németh F., Bíró J., Perntz C.-G. Non-rate proportional weighting of generalized processor sharing schedulers. Proceedings of GLOBECOM'99, Rio de Janerio, Brazil. 2:(December):1999;1334-1339.
18. Szabó R., Barta P., Németh F., Bíró J., Perntz C.-G. Call admission control in generalized processor sharing (GPS) schedulers using non-rate proportional weighting of sessions. Proceedings of IEEE Infocom, Tel-Aviv, Israel. 3:(March):2000;1243-1252.
19. Wang Y.-C., Lu C.-C. End-to-end call admission control in service guaranteed networks. IEICE Trans. Commun. E83-B:(4):2000;791-802.
20. J. Wroclawski, Specification of the controlled-load network element service, Request for Comments (Proposed Standard) 2211, Internet Engineering Task Force, September (1997).
21. Yaron O., Sidi M. Generalized processor sharing networks with exponentially bounded burstiness arrivals. Proceedings of IEEE Infocom, Toronto, Canada. June:1994.
22. Zhang H. Service disciplines for guaranteed performance service in packet-switching networks. Proceedings of the IEEE. 83:(10):1995.
23. L. Zhang, VirtualClock: a new traffic control algorithm for packet switching networks, Proceedings of ACM SIGCOMM, Philadelphia, Pennsylvania, September 1990, pp. 19-29, ACM, Also in Computer Communication Review 20 (4), October 1990.
24. L. Zhang, VirtualClock: a new traffic control algorithm for packet switching networks, Proceedings of ACM SIGCOMM, Philadelphia, Pennsylvania, September 1990, pp. 19-29, ACM, Also in Computer Communication Review 20 (4), October 1990.
25. Zhang Z.L., Liu Z., Kurose J., Towsley D. Call admission control schemes under generalized processor sharing scheduling. Telecommun. Syst. 7:(1-3):1997;125-152.
26. Zhang Z.-L., Liu Z., Towsley D. Closed-form deterministic performance bounds for the generalized processor sharing scheduling discipline. J. Combinatorial Optimization, Special Issue on Scheduling. 1:(4):1998.
27. Zhang Z.-L., Towsley D., Kurose J. Statistical analysis of generalized processor sharing scheduling discipline. Proceedings of ACM SIGCOMM'94, London, UK. September:1994;68-77.