A network calculus with effective bandwidth

IEEE/ACM Transactions on Networking

Volumn 15, Issue 6, 2007, Pages 1442-1453

  Li, Chengzhi ^a   Burchard, Almut ^b   Liebeherr, Jörg ^b  

^a University of Texas at Arlington   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Effective bandwidth; Network calculus; Probabilistic logic; QoS; Quality of service; Statistical multiplexing

Indexed keywords

ALGORITHMS; BANDWIDTH; MULTIPLEXING; PROBABILISTIC LOGICS; QUALITY OF SERVICE; TELECOMMUNICATION TRAFFIC;

EFFECTIVE BANDWIDTH; NETWORK CALCULUS; PROBABILISTIC ENVELOPE FUNCTIONS;

TELECOMMUNICATION NETWORKS;

EID: 37549020654     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.896501     Document Type: Article

References (24)

1. R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan, "Performance bounds for flow control protocols," IEEE/ACM Trans. Netw., vol. 7, no. 3, pp. 310-323, Jun. 1999.
2. S. Ayyorgun and R. Cruz, "A service-curve model with loss and a multiplexing problem," in Proc. ICDCS 2004, Tokyo, Mar. 1994, pp. 756-765.
3. S. Ayyorgun and W. Feng, "A probabilistic definition of burstiness characterization: A systematic approach," Los Alamos National Laboratory, Tech. Rep. LA-UR-03-3668, May 2003.
4. R. R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn, "Statistical service assurances for traffic scheduling algorithms," IEEE J. Sel. Areas Commun., vol. 18, no. 12, pp. 2651-2664, Dec. 2000.
5. J. Y. Le Boudec, "Application of network calculus to guaranteed service networks," IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 1087-1097, May 1998.
6. J.-Y. Le Boudec and P. Thiran, Network Calculus. New York: Springer-Verlag, 2001, vol. LNCS 2050.
7. A. Burchard, J. Liebeherr, and S. D. Patek, "A min-plus calculus for end-to-end statistical service guarantees," IEEE Trans. Inf. Theory vol. 52, no. 9, pp. 4105-4114, Sep. 2006.
8. C. S. Chang, "Stability, queue length, and delay of deterministic and stochastic queueing networks," IEEE Trans. Autom. Contr., vol. 39, no. 5, pp. 913-931, May 1994.
9. C. S. Chang, Performance Guarantees in Comunication Networks. New York: Springer-Verlag, 2000.
10. G. Choudhury, D. Lucantoni, and W. Whitt, "Squeezing the most out of ATM," IEEE Trans. Commun., vol. 44, no. 2, pp. 203-217, Feb. 1996.
11. F. Ciucu, A. Burchard, and J. Liebeherr, "Scaling properties of statistical end-to-end bounds in the network calculus," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2300-2312, Jun. 2006.
12. R. Cruz, "A calculus for network delay, parts I and II," IEEE Trans. Inf. Theory, vol. 37, no. 1, pp. 114-141, Jan. 1991.
13. A. Erramilli, O. Narayan, and W. Willinger, "Experimental queueing analysis with long-range dependent packet traffic," IEEE/ACM Trans. Netw., vol. 4, no. 2, pp. 209-223, Apr. 1996.
14. F. Kelly, "Notes on effective bandwidths," in Stochastic Networks: Theory and Applications. New York: Oxford Univ. Press, 1996.
15. E. Knightly and N. Shroff, "Admission control for statistical QoS: Theory and practice," IEEE Network, vol. 13, no. 2, pp. 20-29, Mar. 1999.
16. C. Li, A. Burchard, and J. Liebeherr, "A network calculus with effective bandwidth," Comp. Sci. Dept., Univ. Virginia, Charlottesville, Tech. Rep. CS-2003-20, Nov. 2003.
17. J. Liebeherr, A. Burchard, and S. D. Patek, "Statistical per-flow service bounds in a network with aggregate provisioning," in Proc. IEEE INFOCOM 2003, San Francisco, CA, May 2003, pp. 1404-1411.
18. I. Norros, "On the use of fractional brownian motion in the theory of connectionless networks," IEEE J. Sel. Areas Commun., vol. 13, no. 6, pp. 953-962, Aug. 1995.
19. A. Papoulis, Probability, Random Variables, and Stochastic Processes 3rd ed. New York: McGraw-Hill, 1991.
20. J. Qiu and E. Knightly, "Inter-class resource sharing using statistical service envelopes," in Proc. IEEE INFOCOM '99, New York, Mar. 1999, p. 1690.
21. D. Starobinski and M. Sidi, "Stochastically bounded burstiness for communication networks," IEEE Trans. Inf. Theory, vol. 46, no. 1, pp. 206-212, Jan. 2000.
22. D. Stiliadis and A. Varma, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms," IEEE/ACM Trans. Netw. vol. 6, no. 5, pp. 611-624, 1998.
23. M. Vojnovic and J.-Y. Le Boudec, "Bounds for independent regulated inputs multiplexed in a service curve network element," IEEE Trans. Commun., vol. 51, no. 5, pp. 735-740, May 2003.
24. O. Yaron and M. Sidi, "Performance and stability of communication networks via robust exponential bounds," IEEE/ACM Trans. Netw., vol. 1, no. 3, pp. 372-385, Jun. 1993.