Perspectives on network calculus - No free lunch, but still good value

Computer Communication Review

Volumn 42, Issue 4, 2012, Pages 311-322

  Ciucu, Florin ^a   Schmitt, Jens ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b University of Koblenz Landau   (Germany)

Author keywords

Network calculus; Statistical multiplexing gain

Indexed keywords

EID: 84894579118     PISSN: 01464833     EISSN: 19435819     Source Type: Conference Proceeding    
DOI: 10.1145/2377677.2377747     Document Type: Conference Paper

References (50)

1. R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan. Performance bounds for flow control protocols. IEEE/ACM Transactions on Networking, 7(3):310-323, June 1999.
2. F. L. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat. Synchronization and Linearity: An Algebra for Discrete Event Systems. John Wiley and Sons, 1992.
3. F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios. Open, closed and mixed networks of queues with different classes of customers. Journal of the ACM, 22(2):248-260, Apr. 1975.
4. R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn. Statistical service assurances for traffic scheduling algorithms. IEEE Journal on Selected Areas in Communications. Special Issue on Internet QoS, 18(12):2651-2664. Dec. 2000.
5. J.-Y. Le Boudec and P. Thiran. Network Calculus. Springer Verlag, Lecture Notes in Computer Science, LNCS 2050, 2001.
6. R. Braden, D. Clark, and S. Shenker. Integrated services in the Internet architecture: an overview. IETF RFC 1633, July 1994.
7. L. Breiman. Probability. SIAM, 1992.
8. A. Burchard, J. Liebeherr, and F. Ciucu. On superlinear scaling of network delays. IEEE/ACM Transactions on Networking, 19(4):1043-1056, Aug. 2011.
9. A. Burchard, J. Liebeherr, and S. D. Patek. A min-plus calculus for end-to-end statistical service guarantees. IEEE Transactions on Information Theory, 52(9):4105-4114, Sept. 2006.
10. S. Chakraborty, S. Kuenzli, L. Thiele, A. Herkersdorf, and P. Sagmeister. Performance evaluation of network processor architectures: Combining simulation with analytical estimation. Computer Networks, 41(5):641 -665, Apr. 2003.
11. C.-S. Chang. Stability, queue length and delay, Part II: Stochastic queueing networks. In 31st IEEE Conference on Decision and Control, pages 1005-1010, 1992.
12. C.-S. Chang. Performance Guarantees in Communication Networks. Springer Verlag, 2000.
13. F. Ciucu. Network calculus delay bounds in queueing networks with exact solutions. In International Teletraffic Congress (ITC). pages 495-506, 2007.
14. F. Ciucu, A. Burchard, and J. Liebeherr. Scaling properties of statistical end-to-end bounds in the network calculus. IEEE Transactions on Information Theory, 52(6):2300-2312, June 2006.
15. C. Courcoubetis and R. Weber. Effective bandwidths for stationary sources. Probability in Engineering and Informational Sciences, 9(2):285 294, Apr. 1995.
16. R. Cruz. A calculus for network delay, parts I and II. IEEE Transactions on Information Theory, 37(1):114-141, Jan. 1991.
17. R. L. Cruz. Quality of service management in integrated services networks. In 1st Semi-Annual Research Review, CWC, University of California at San Diego, June 1996.
18. R. L. Cruz. SCED+: Efficient management of quality of service guarantees. In IEEE Infocorn, pages 625-634, 1998.
19. R. L. Cruz and C. Okino. Service guarantees for window flow control. In 34th Allerton Conference on Communications, Control and Computating, 1996.
20. A. Erlang. Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Elektrotkeknikeren, 13, 1917 (in Danish).
21. W. Feller. An Introduction to Probability Theory and Its Applications, Vol. 2. Wiley, 1971.
22. M. Fidler. An end-to-end probabilistic network calculus with moment generating functions. In IEEE International Workshop on Quality of Service (IWQoS), pages 261 270, 2006.
23. M. Fidler. A survey of deterministic and stochastic service curve models in the network calculus. IEEE Communications Surveys & Tutorials, 12(1):59-86, Feb. 2010.
24. R. D. Gordon. Values of Mills' ratio of area to bounding ordinate and of the normal probability integral for large values of the argument. Annals of Mathematical Statistics, 12(3):364-366, Sept. 1941.
25. M. Harchol-Balter. Performance Modeling and Design of Computer Systems. Queueing Theory in Action. Cambridge University Press, 2012.
26. Y. Jiang. A basic stochastic network calculus. In ACM Sigcomm, pages 123-134, Sept. 2006.
27. Y. Jiang. Network calulus and queueing theory: Two sides of one coin. In ICST ValueTools, 2009.
28. Y. Jiang and Y. Liu. Stochastic Network Calculus. Springer, 2008.
29. F. P. Kelly. Networks of queues with customers of different types. Journal of Applied Probability, 3(12):542-554, Sept. 1975.
30. J. Kurose. On computing per-session performance bounds in high-speed multi-hop computer networks. In ACM Sigmetrics, pages 128-139, 1992.
31. E. A. Lee and P. Varaiya. Structure and interpretation of signals and systems. Addison-Wesley, 2003.
32. W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson. On the self-similar nature of Ethernet traffic. IEEE/ACM Transactions on Networking, 2(1):1-15, Feb. 1994.
33. L. Lenzini, E. Mingozzi, and G. Stea. A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems. Performance Evaluation, 65( 11-12):922-943, Nov. 2008.
34. J. Liebeherr, A. Burchard, and F. Ciucu. Delay bounds in communication networks with heavy-tailed and self-similar traffic. IEEE Transactions on Information Theory, 58(2):1010-1024, Feb. 2012.
35. J. Liebeherr, M. Fidler, and S. Valaee. A system-theoretic approach to bandwidth estimation. IEEE/ACM Transactions on Networking, 18(4): 1040-1053, Aug. 2010.
36. J. Liebeherr, Y. Ghiassi-Farrokhfal, and A. Burchard. On the impact of link scheduling on end-to-end delays in large networks. IEEE Journal on Selected Areas in Communications, 29(5):1009-1020, May 2011.
37. S. Mao and S. S. Panwar. A survey of envelope processes and their applications in quality of service provisioning. IEEE Communications Surveys & Tutorials, 8(3):2-20, Dec. 2006.
38. L. Massoulie and A. Busson. Stochastic majorization of aggregates of leaky bucket-constrained traffic streams. Preprint, Microsoft Research, 2000.
39. V. Misra. Public review on 'A Basic Stochastic Network Calculus' by Y. Jiang, ACM Sigcomm 2006. http://conferences.sigcomm.org/sigcomm/2006/discussion/ showpaper.php?paper-id=14.
40. V. Paxson and S. Floyd. Wide-area traffic: The failure of Poisson modelling. IEEE/ACM Transactions on Networking, 3(3):226-244, June 1995.
41. J.-L. Scharbarg, F. Ridouard, and C. Fraboul. A probabilistic analysis of end-to-end delays on an AFDX avionic network. IEEE Transactions on Industrial Informatics, 5(1):38-49, Feb. 2009.
42. J. Schmitt and I. Martinovic. Demultiplexing in network calculus - a stochastic scaling approach. In International Conference on the Quantitative Evaluation of Systems (QEST), pages 217-226, 2009.
43. J. Schmitt, F. A. Zdarsky, and M. Fidler. Delay bounds under arbitrary multiplexing: When network calculus leaves you in the lurch... In IEEE Infocom, pages 1669-1677, 2008.
44. T. Skeie, S. Johannessen, and O. Holmeide. Timeliness of real-time IP communication in switched industrial ethernet networks. IEEE Transactions on Industrial Informatics, 2(1):25-39, Feb. 2006.
45. D. Starobinski and M. Sidi. Stochastically bounded burstiness for communication networks. IEEE Transactions on Information Theory, 46(1):206-212, Jan. 2000.
46. M. Talagrand. Majorizing measures: The generic chaining. Annals of Probability, 24(3):1049-1103, July 1996.
47. M. Vojnovic and J.-Y. Le Boudec. Bounds for independent regulated inputs multiplexed in a service curve network element. IEEE Transactions oil Communications, 51(5):735-740, May 2003.
48. K. Wang, F. Ciucu, S. Low, and C. Lin. A stochastic power network calculus for integrating renewable energy sources into the power grid. IEEE Journal on Selected Areas in Communications; Smart Grid Communications Series, 30(6), July 2012.
49. O. Yaron and M. Sidi. Performance and stability of communication networks via robust exponential bounds. IEEE/ACM Transactions on Networking, 1(3):372 385, June 1993.
50. Y. Ying, F. Guillemin, R. Mazumdar, and C. Rosenberg. Buffer overflow asymptotics for multiplexed regulated traffic. Performance Evaluation, 65(8):555-572, July 2008.