Non-asymptotic delay bounds for networks with heavy-tailed traffic

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

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

^a UNIVERSITY OF TORONTO   (Canada)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL BOUNDS; ANALYTICAL RESULTS; CROSS-TRAFFIC; DELAY BOUND; DELAY PERFORMANCE; END-TO-END DELAY BOUNDS; FIRST MOMENTS; HEAVY-TAILED; HEAVY-TAILED TRAFFIC; IN-NETWORK; LARGE BUFFER; LOWER BOUNDS; MULTI-HOP PATH; PERFORMANCE BOUNDS; SAMPLING METHOD; SCALE-FREE; SELF-SIMILAR; SERVICE PROCESS; STEADY STATE;

ASYMPTOTIC ANALYSIS;

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

References (30)

1. J. Abate, G. L. Choudhury, and W. Whitt. Waiting-time tail probabilities in queues with long-tail service-time distributions. Queueing Systems, 16(3-4):311-338, Sept. 1994.
2. H. Ayhan, Z. Palmowski, and S. Schlegel. Cyclic queueing networks with subexponential service times. Journal of Applied Probability, 41(3):791-801, Sept. 2004. (Pubitemid 39620515)
3. F. Baccelli, M. Lelarge, and S. Foss. Asymptotics of subexponential (max,+): the stochastic event graph case. Queueing Systems, 46(1-2):75-96, Jan. 2004.
4. J. Y. L. Boudec and P. Thiran. Network Calculus. Springer Verlag, Lecture Notes in Computer Science, LNCS 2050, 2001.
5. O. Boxma. On a tandem queueing model with identical service times at both counters. part 1,2. Advances in Applied Probability, 11(3):616-659, 1979.
6. O. J. Boxma and V. Dumas. Fluid queues with long-tailed activity period distributions. Computer Communications, 21(17):1509-1529, Nov. 1998.
7. A. Burchard, J. Liebeherr, and F. Ciucu. On Θ (H logH) scaling of network delays. In Proc. of IEEE Infocom, May 2007.
8. C.-S. Chang. Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Transactions on Automatic Control, 39(5):913-931, May 1994.
9. 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. (Pubitemid 43898893)
10. J. Cohen. Some results on regular variation in queueing and fluctuation theory. Journal of Applied Probability, 10(2):343-353, June 1973.
11. M. Crovella and A. Bestavros. Self-similarity in World Wide Web traffic: evidence and possible causes. IEEE/ACM Transactions on Networking, 5(6):835-846, Dec. 1997.
12. J. R. Gallardo, D. Makrakis, and L. Orozco-Barbosa. Use of alpha-stable self-similar stochastic processes for modeling traffic in broadband networks. Performance Evaluation, 40:71-98, March 2000.
13. J. R. Gallardo, D. Makrakis, and L. Orozco-Barbosa. Probabilistic envelope processes for α-stable self-similar traffic models and their application to resource provisioning. Performance Evaluation, 61(2- 3):257-279, July 2005.
14. B. V. Gnedenko and A. N. Kolmogorov. Limit distributions for sums of independent random variables. Addison-Wesley, 1968.
15. T. Huang and K. Sigman. Steady-state asymptotics for tandem, splitmatch and other feedforward queues with heavy tailed service. Queueing Systems, 33(1-3):233-259, Dec. 1999.
16. Y. Jiang and P. J. Emstad. Analysis of stochastic service guarantees in communication networks: A traffic model. In 19th International Teletraffic Congress (ITC), Aug. 2005.
17. A. Karasaridis and D. Hatzinakos. Network heavy traffic modeling using α-stable self-similar processes. IEEE Transactions on Communications, 49(7):1203-1214, July 2001.
18. S. Karlin. A First Course in Stochastic Processes. Academic Press, 1975.
19. 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.
20. J. Liebeherr, A. Burchard, and F. Ciucu. Delay bounds for networks with heavy-tailed and self-similar traffic. Technical report, arXiv:0911.3856, 2009.
21. 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, 3rd Quarter 2006.
22. T. Mikosch, S. Resnick, H. Rootzen, and A. Stegeman. Is network traffic approximated by stable Lévy motion or fractional Brownian motion? Annals of Applied Probability, 12(1):23-68, Feb. 2002.
23. I. Norros. On the use of fractional Brownian motion in the theory of connectionless networks. IEEE Journal on Selected Areas in Communications, 13(6):953-962, Aug. 1995.
24. V. Paxson and S. Floyd. Wide-area traffic: The failure of Poisson modelling. IEEE/ACM Transactions on Networking, 3(3):226-244, June 1995.
25. G. Samorodnitsky and M. S. Taqqu. Stable non-Gaussian random processes: stochastic models with infinite variance. Chapman and Hall, CRC Press, 1994.
26. D. Starobinski and M. Sidi. Stochastically bounded burstiness for communication networks. IEEE Transactions on Information Theory, 46(1):206-212, Jan. 2000.
27. M. Vojnovic and J.-Y. L. Boudec. Bounds for independent regulated inputs multiplexed in a service curve network element. IEEE Transactions on Communications, 51(5):735-740, May 2003.
28. W.Willinger, M. S. Taqqu, R. Sherman, and D. V.Wilson. Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level. In ACM Sigcomm, pages 100-113, 1995.
29. 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.
30. Q. Yin, Y. Jiang, S. Jiang, and P. Y. Kong. Analysis on generalized stochastically bounded bursty traffic for communication networks. In Proceedings of IEEE Local Computer Networks (LCN), pages 141-149, November 2002.