Scaling properties of statistical end-to-end bounds in the network calculus

IEEE Transactions on Information Theory

Volumn 52, Issue 6, 2006, Pages 2300-2312

  Ciucu, Florin ^a   Burchard, Almut ^b   Liebeherr, Jörg ^b  

^a University of Virginia   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Network service curve; Quality of service; Stochastic network calculus

Indexed keywords

BOUNDARY CONDITIONS; DIFFERENTIATION (CALCULUS); MULTIPLEXING; PROBABILITY; QUALITY OF SERVICE; RANDOM PROCESSES;

NETWORK SERVICE CURVE; STATISTICAL MULTIPLEXING GAIN; STOCHASTIC NETWORK CALCULUS;

STATISTICAL METHODS;

EID: 33745134357     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.874380     Document Type: Article

References (26)

1. R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan, "Performance bounds for flow control protocols," IEEE/ACM Trans. Netw., vol. 7, pp. 310-323, 1999.
2. S. Ayyorgun and R. Cruz, "A service-curve model with loss and a multiplexing problem," in Proc. 24th Int. Conf. Distr. Comput. Syst. (ICDCS'04), Mar. 2004, pp. 756-765.
3. S. Ayyorgun and W. Feng, "A Probabilistic Definition of Burstiness Characterization," Los Alamos National Laboratory, Tech. Rep. LA-UR 03-3668, 2003.
4. R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn, "Statistical service assurances for traffic scheduling algorithms," IEEE J. Sel. Areas Commun., Special Issue on Internet QoS, vol. 18, no. 12, pp. 2651-2664, 2000.
5. A. Burchard, J. Liebeherr, and S. D. Patek, "A Calculus for End-to-end Statistical Service Guarantees," University of Virginia, Computer Science Department, Tech. Rep. CS-2001-19, 2002. Available [Online] at arxiv.org/abs/cs.NI/0205001.
6. C. S. Chang, "Stability, queue length, and delay of deterministic and stochastic queueing networks," IEEE Trans. Automat. Control, vol. 39 pp. 913-931, 1994.
7. C. S. Chang, "On the exponentiality of stochastic linear systems under the maxplus algebra," IEEE Trans. Automat. Control, vol. 41, pp. 1182-1188, 1996.
8. C. S. Chang, "On deterministic traffic regulation and service guarantees: A systematic approach by filtering," IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 1097-1110, 1998.
9. C. S. Chang, Performance Guarantees in Communication Networks. New York: Springer Verlag, 2000.
10. R. Cruz, "A calculus for network delay: Parts I and II," IEEE Trans. Inf. Theory, vol. 37, pp. 114-141, 1991.
11. R. L. Cruz, "Quality of service guarantees in virtual circuit switched networks," IEEE J. Sel. Areas Commun., vol. 13, pp. 1048-1056, 1995.
12. R. L. Cruz, "Quality of service management in integrated services networks," in Proc. 1st Semi-Annu. Res. Rev., CWC, Jun. 1996.
13. M. Fidler, "An End-to-End Probabilistic Network Calculus With Moment Generating Functions for Efficient Utilization of Independence," NTNU, Trondheim, Norway, 2005.
14. F. Kelly, "Notes on effective bandwidths," in Stochastic Networks: Theory and Applications. ser. Royal Statistical Society Lecture Notes Series, F. P. Kelly, S. Zachary, and I. B. Ziedins, Eds. Oxford, U.K.: Oxford University Press, 1996, vol. 4, pp. 141-168.
15. J. Kurose, "On computing per-session performance bounds in high-speed multi-hop computer networks," in Proc. ACM Sigmetrics'92, Jun. 1992, pp. 128-139.
16. J. Y. Le Boudec, "Application of network calculus to guaranteed service networks," IEEE/ACM Trans. Inf. Theory, vol. 44, no. 3, pp. 1087-1097, 1998.
17. J. Y. Le Boudec and P. Thiran, Network Calculus: Springer Verlag, 2001, vol. 2050, Lecture Notes in Computer Science, LNCS.
18. C. Li, A. Burchard, and J. Liebeherr, "A Network Calculus With Effective Bandwidth," University of Virginia, Computer Science Department, Tech. Rep. CS-2003-20, 2003.
19. J. Liebeherr, S. Patek, and A. Burchard, "Statistical per-flow service bounds in a network with aggregate provisioning," in Proc. IEEE INFOCOM 2003, Mar. 2003.
20. Y. Liu, C. Tham, and Y. Jiang, "A Stochastic Network Calculus," Dept. of Electrical and Computer Engineering, National University of Singapore, ECE-CCN-0301, 2003.
21. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single-node case," IEEE/ACM Transactions on Networking, vol. 1, pp. 344-357, 1993.
22. J. Qiu and E. Knightly, "Inter-class resource sharing using statistical service envelopes," in Proc. IEEE INFOCOM '99, Mar. 1999, pp. 36-42.
23. M. Schwartz, Telecommunication Network: Protocols, Modeling, and Analysis. Reading, MA: Addison-Wesley, 1986.
24. D. Starobinski and M. Sidi, "Stochastically bounded burstiness for communication networks," IEEE Trans. Inf. Theory, vol. 46, no. 1, pp. 206-212, 2000.
25. O. Yaron and M. Sidi, "Performance and stability of communication networks via robust exponential bounds," IEEE/ACM Trans. Netw., vol. 1, pp. 372-385, 1993.
26. Q. Yin, Y. Jiang, S. Jiang, and P. Y. Kong, "Analysis on generalized stochastically bounded bursty traffic for communication networks," in Proc. IEEE Local Computer Networks 2002, Nov. 2002, pp. 141-149.