Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Computer Networks

Volumn 48, Issue 6, 2005, Pages 910-940

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

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Arbitrary weighting; End to end delay bound; Generalized processor sharing; Traffic characterization

Indexed keywords

ALGORITHMS; FEEDFORWARD NEURAL NETWORKS; NUMERICAL ANALYSIS; PROGRAM PROCESSORS; SCHEDULING; TOPOLOGY;

ARBITRARY WEIGHTING; END-TO-END DELAY BOUND; GENERALIZED PROCESSOR SHARING; TRAFFIC CHARACTERIZATION;

TELECOMMUNICATION TRAFFIC;

EID: 20144365900     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2004.11.022     Document Type: Article

References (41)

1. Andrews, Awerbuch, Fernandez, Kleinberg, Leighton, Liu, Universal stability results for greedy contention-resolution protocols, in: Proceedings of FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), 1996.
2. P. Barta, F. Németh, R. Szabó, J. Bíró, An approach for traffic characterization in generalized processor sharing networks, in: Proceedings of ICC2001 IEEE International Conference on Communications, Helsinki, Finland, June 2001.
3. P. Barta, F. Németh, R. Szabó, J. Bíró, End-to-end delay bound calculation in generalized processor sharing networks, in: Proceedings of ISCC 2001 (The 6th IEEE Symposium on Computers and Communication), Hammamet, Tunisia, July 2001.
4. P. Barta, F. Németh, R. Szabó, J. Bíró, Call admission control algorithms for tandem generalized processor sharing networks, in: Proceedings of ISCC'02 (The 7th IEEE Symposium on Computers and Communication), Taormina, Italy, July 2002.
5. P. Barta, F. Németh, R. Szabó, and J. Bíró Connection admission control in generalized processor sharing schedulers with tight deterministic delay bounds Comput. Commun. 22 2 2003 65 78
6. C. Chang Stability, queue length, and delay of deterministic and stochastic queueing networks IEEE Trans. Automat. Control 39 1994 913 931
7. C.-S. Chang, Stability, queue length and delay, part II: stochastic queueing networks, Research Report RC 17709 (#77963), IBM Research Division, Yorktown Heights, New York, February 1992.
8. C.-S. Chang Performance Guarantees in Communication Networks 2000 Springer Berlin ISBN 1852332263
9. R.L. Cruz A calculus for network delay, part I: Network elements in isolation IEEE Trans. Inform. Theory 37 1 1991 114 131
10. R.L. Cruz A calculus for network delay, part II: Network analysis IEEE Trans. Inform. Theory 37 1 1991 132 141
11. N. Dukkipati, J. Kuri, H.S. Jamadagni, Optimal call admission control in generalized processor sharing (GPS) schedulers, in: Proc. IEEE Infocom, Anchorage, Alaska, April 2001.
12. A. Elwalid, D. Mitra. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS, in: Proc. IEEE Infocom, New York, March 1999.
13. D. Ferrari, and D.C. Verma A scheme for real-time channel establishment in wide-area networks IEEE J. Select. Areas Commun. 8 3 1990 368 379
14. D. Gamarnik Using fluid models to prove stability of adversarial queueing networks IEEE Trans. Automat. Control 45 2000 741 746
15. L. Georgiadis, R. Guérin, V. Peris, and K.N. Sivarajan Efficient network QoS provisioning based on per node traffic shaping IEEE/ACM Trans. Network. 4 4 1996 482 501
16. A. Goel, Stability of networks and protocols in the adversarial queueing model for packet routing (short), in: Proceedings of SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1999.
17. S. Golestani, A stop-and-go queueing framework for congestion management, in: Proceedings of ACM SIGCOMM'90, Philadelphia, PA, September 1990, pp. 8-18.
18. P. Goyal, S.S. Lam, H.M. Vin, Determining end-to-end delay bounds in heterogeneous networks, in: Network and Operating System Support for Digital Audio and Video, 1995, pp. 273-284.
19. B. Hajek Large bursts don't cause instability IEEE Trans. Automat. Control 45 2000 116 118
20. J.F. Kurose, On computing per-session performance bounds in high-speed multi-hop computer networks, in: Sigmetrics 1992, New Port, Rhode Island, June 1992, ACM, New York, pp. 128-139.
21. J.-Y. Le Boudec, Selected lecture notes, Technical report, ICA Ecole Polytechnique Federale de Lausanne, October 1998.
22. J.-Y. Le Boudec, and P. Thiran Network Calculus: A Theory of Deterministic Queueing Systems for the Internet Lecture Notes in Computer Science vol. 2050 2002 Springer Berlin
23. F. Németh, P. Barta, Network level call admission control algorithms for generalized processor sharing scheduling discipline, in: Proceedings of ISCC'03 (The 8th IEEE Symposium on Computers and Communication), Kemer-Antalya, Turkey, July 2003.
24. A. Panagakis, and I. Stavrakakis Optimal call admission control under generalized processor sharing scheduling International Workshop on Quality of Service (IWQoS) Lecture Notes in Computer Science vol. 2092 2001 Springer Berlin 419 433
25. 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.
26. A. Parekh, and R.G. Gallager 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
27. A. Parekh, and R.G. Gallager 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
28. R. Szabó, P. Barta, F. Németh, J. Bíró, Worst-case deterministic delay bounds for arbitrary weighted generalized processor sharing schedulers, in: Proceedings of Networking 2000, Paris, France, May 2000.
29. R. Szabó, P. Barta, F. Németh, J. Bíró, C.-G. Perntz, Non rate proportional weighting of generalized processor sharing schedulers, in: Proceedings of GLOBECOM'99, vol. 2, Rio de Janerio, Brazil, December 1999, pp. 1334-1339.
30. R. Szabó, P. Barta, F. Németh, J. Bíró, C.-G. Perntz, Call admission control in generalized processor sharing (GPS) schedulers using non-rate proportional weighting of sessions, in: Proceedings of IEEE Infocom, vol. 3, Tel-Aviv, Israel, March 2000, pp. 1243-1252.
31. L. Tassiulas, and L. Georgiadis Any work-conserving policy stabilizes the ring with spatial re-use IEEE/ACM Trans. Network. 4 2 1996 205 208
32. D. Verma, H. Zhang, D. Ferrari, Guaranteeing delay jitter bounds in packet switching networks, in: Proceedings of Tricomm, April 1991.
33. G. Winograd, and P. Kumar The FCFS service discipline: stable network topologies, bounds on traffic burstiness and delay, and control by regulators Math. Comput. Modell. 23 1996 115 129
34. O. Yaron, and M. Sidi Performance and stability of communication networks via robust exponential bounds IEEE/ACM Trans. Network. 1 3 1993 372 385
35. O. Yaron, M. Sidi, Generalized processor sharing networks with exponentially bounded burstiness arrivals, in: Proceedings of IEEE Infocom, Toronto, Canada, June 1994.
36. H. Zhang Service disciplines for guaranteed performance service in packet-switching networks Proc. IEEE 83 10 1995
37. H. Zhang, and D. Ferrari Rate-controlled service disciplines J. High Speed Networks 3 4 1994
38. L. Zhang. VirtualClock: A new traffic control algorithm for packet switching networks, in: Sigcomm, Philadelphia, Pennsylvania, ACM, New York, September 1990, pp. 19-29
39. also in Comput. Commun. Rev. 20(4) (1990).
40. Z.-L. Zhang, Z. Liu, and D. Towsley Closed-form deterministic performance bounds for the generalized processor sharing scheduling discipline J. Combin. Optim., Special Issue on Scheduling 1 4 1998 457 481
41. Z.-L. Zhang, D. Towsley, J. Kurose. Statistical analysis of generalized processor sharing scheduling discipline, in: Proceedings of ACM SIGCOMM'94, London, UK, September 1994, pp. 68-77.