On Θ (H log H) scaling of network delays

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1866-1874

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

^a UNIVERSITY OF TORONTO   (Canada)

^b University of Virginia

Author keywords

[No Author keywords available]

Indexed keywords

PACKET SWITCHING; ROUTING ALGORITHMS; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC; TIME DELAY;

END-TO-END DELAYS; NETWORK CALCULUS; WORST-CASE ANALYSIS;

TELECOMMUNICATION NETWORKS;

EID: 34548319617     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.217     Document Type: Conference Paper

References (29)

1. R. Cruz, "A calculus for network delay, parts I and II," IEEE Transactions on Information Theory, vol. 37, no. 1, pp. 114-141, Jan. 1991.
2. J. Y. Le Boudec and P. Thiran, Network Calculus. Springer Verlag, Lecture Notes in Computer Science, LNCS 2050, 2001.
3. C. S. Chang, Performance Guarantees in Communication Networks. Springer Verlag, 2000.
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, vol. 18, no. 12, pp. 2651-2664, December 2000.
5. R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan, "Performance bounds for flow control protocols," IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 310-323, June 1999.
6. J. Y. Le Boudec, "Application of network calculus to guaranteed service networks," IEEE/ACM Transactions on Information Theory, vol. 44, no. 3, pp. 1087-1097, May 1998.
7. A. Burchard, J. Liebeherr, and S. D. Patek, "A min-plus calculus for end-to-end statistical service guarantees," IEEE Transaction on Information Theory, vol. 52, no. 9, pp. 4105-4114, Sept. 2006.
8. C. Li, A. Burchard, and J. Liebeherr, "A network calculus with effective bandwidth," IEEE/ACM Transactions on Networking, 2008, (to appear).
9. S. Ayyorgun and R. Cruz, "A service-curve model with loss and a multiplexing problem," in Proc. 24th IEEE International Conference on Distributed Computing System (ICDCS'04), March 2004, pp. 756-765.
10. M. Fidler, "An end-to-end probabilistic network calculus with moment generating functions," in Proc. IEEE 14th International Workshop on Quality of Service (IWQoS 2006), 2006, pp. 261-270.
11. Y. Jiang and P. J. Emstad, "Analysis of stochastic service guarantees in communication networks: A server model," in Proc. of the International Workshop on Quality of Service (IWQoS 2005), June 2005, pp. 233-245.
12. Y. Jiang, "A basic stochastic network calculus," in Proc. of ACM Sigcomm 2006, September 2006, pp. 123-134.
13. F. Ciucu, A. Burchard, and J. Liebeherr, "Scaling properties of statistical end-to-end bounds in the network calculus," IEEE Transaction on Information Theory, vol. 52, no. 6, pp. 2300-2312, June 2006.
14. O. Yaron and M. Sidi, "Performance and stability of communication networks via robust exponential bounds," IEEE/ACM Transactions on Networking, vol. 1, no. 3, pp. 372-385, June 1993.
15. J. Jackson, "Networks of waiting lines," Oper. Res., vol. 5, pp. 518-521, 1957.
16. L. Kleinrock, "Message delay in communication nets with storage," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 1962.
17. D. Bertsekas and R. Gallager, Data Networks. Prentice Hall, 1992.
18. F. Kelly, "Notes on effective bandwidths," in Stochastic Networks: Theory and Applications. (Editors: F.P. Kelly, S. Zachary and I.B. Ziedins) Royal Statistical Society Lecture Notes Series, 4. Oxford University Press, 1996, pp. 141-168.
19. O. Boxma, "On a tandem queueing model with identical service times at both counters. Part 1,2," Adv. Appl. Probab., vol. 11, pp. 616-659, 1979.
20. S. B. Calo, "Delay properties of message channels," in Proc. IEEE ICC, Boston, Mass., 1979, pp. 43.5.1-43.5.4.
21. O. P. Vinogradov, "A multiphase system with identical service," Soviet Journal of Computer and Systems Sciences., vol. 24, pp. 28-31, 1986.
22. _, "A multiphase system with many servers and identical service times," Stochastic Processes and Their Applications, MIEM, Moscow, vol. 24, pp. 42-45, 1989 (in Russian).
23. _, "On certain asymptotic properties of waiting time in a multiserver queueing system with identical times," SIAM Theory of Probability and Its Applications (TVP), vol. 39, no. 4, pp. 714-718, 1994.
24. P. W. Glynn and W. Whitt, "Departures from many queues in series," Annals of Applied Probability, vol. 1, pp. 546-572, 1991.
25. P. Le Gall, "The overall sojourn time in tandem queues with identical successive service times and renewal input," Stochastic Processes and Their Applications, vol. 52, pp. 165-178, 1994.
26. F. I. Karpelevitch and A. Y. Kreinin, "Asymptotic analysis of queuing systems with identical service," Journal of Applied Probability, vol. 33, no. 1, pp. 267-281, 1996.
27. G. Grimmett and D. Stirzaker, Probability and Random Processes. Oxford University Press, 2001.
28. 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, Tampa, Florida, November 2002, pp. 141-149.
29. S. McCreary and K. Claffy, "Trends in wide area IP traffic patterns," in Proc. 13th ITC Specialist Seminar on Internet Traffic Measurement and Modeling, Sept. 2000.