Sharp per-flow delay bounds for bursty arrivals: The case of FIFO, SP, and EDF scheduling

Proceedings - IEEE INFOCOM

Volumn , Issue , 2014, Pages 1896-1904

  Ciucu, Florin ^a   Poloczek, Felix ^a   Schmitt, Jens ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

STOCHASTIC SYSTEMS;

BURSTY ARRIVALS; DELAY BOUND; EDF SCHEDULING; EXPONENTIAL DECAYS; NUMERICAL COMPARISON; ORDERS OF MAGNITUDE; PERFORMANCE BOUNDS; STOCHASTIC NETWORK CALCULUS;

SCHEDULING;

EID: 84904437864     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2014.6848129     Document Type: Conference Paper

References (43)

1. D. Anick, D. Mitra, and M. Sondhi. Stochastic theory of a datahandling system with multiple sources. Bell Systems Technical Journal, 61(8):1871-1894, Oct. 1982.
2. A. W. Berger and W. Whitt. Effective bandwidths with priorities. IEEE/ACM Transactions on Networking, 6(4):447-460, Aug. 1998.
3. D. Botvich and N. Duffield. Large deviations, economies of scale, and the shape of the loss curve in large multiplexers. Queueing Systems, 20(3-4):293-320, Sept. 1995.
4. J.-Y. Le Boudec and P. Thiran. Network Calculus. Springer Verlag, Lecture Notes in Computer Science, LNCS 2050, 2001.
5. A. Burchard, J. Liebeherr, and F. Ciucu. On superlinear scaling of network delays. IEEE/ACM Transactions on Networking, 19(4):1043-1056, Aug. 2011.
6. A. Burchard, J. Liebeherr, and S. D. Patek. A min-plus calculus for endto-end statistical service guarantees. IEEE Transactions on Information Theory, 52(9):4105-4114, Sept. 2006.
7. C.-S. Chang. Performance Guarantees in Communication Networks. Springer Verlag, 2000.
8. G. Choudhury, D. Lucantoni, and W. Whitt. Squeezing the most out of ATM. IEEE Transactions on Communications, 44(2):203-217, Feb. 1996.
9. F. Ciucu. Network calculus delay bounds in queueing networks with exact solutions. In 20th International Teletraffic Congress (ITC), pages 495-506, 2007.
10. 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.
11. F. Ciucu, R. Khalili, Y. Jiang, L. Yang, and Y. Cui. Towards a system theoretic approach to wireless network capacity in finite time and space. In IEEE Infocom, 2014.
12. F. Ciucu, F. Poloczek, and J. Schmitt. Sharp bounds in stochastic network calculus. CoRR, abs/1303.4114, 2013.
13. F. Ciucu and J. Schmitt. Perspectives on network calculus-No free lunch but still good value. In ACM Sigcomm, 2012.
14. C. Courcoubetis and R. Weber. Effective bandwidths for stationary sources. Probability in Engineering and Informational Sciences, 9(2):285-294, Apr. 1995.
15. R. Cruz. A calculus for network delay, parts I and II. IEEE Transactions on Information Theory, 37(1):114-141, Jan. 1991.
16. R. L. Cruz. SCED+: Efficient management of quality of service guarantees. In IEEE Infocom, pages 625-634, 1998.
17. N. G. Duffield. Exponential bounds for queues with markovian arrivals. Queueing Systems, 17(3-4):413-430, Sept. 1994.
18. S. N. Ethier and T. G. Kurtz. Markov processes-characterization and convergence. John Wiley & Sons Inc., 1986.
19. 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.
20. Y. Jiang and Y. Liu. Stochastic Network Calculus. Springer, 2008.
21. F. P. Kelly. Reversibility and Stochastic Networks. Wiley, Chichester, 1979.
22. F. P. 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, pages 141-168. Oxford University Press, 1996.
23. J. F. C. Kingman. Inequalities in the theory of queues. Journal of the Royal Statistical Society, Series B, 32(1):102-110, 1970.
24. C. Li, A. Burchard, and J. Liebeherr. A network calculus with effective bandwidth. IEEE/ACM Transactions on Networking, 15(6):1442-1453, Dec. 2007.
25. 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.
26. 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.
27. L. Lipsky. Queueing Theory: A Linear Algebraic Approach. Springer Publishing Company, Incorporated, 2nd edition, 2008.
28. Z. Liu, P. Nain, and D. Towsley. Exponential bounds with applications to call admission. Journal of the ACM, 44(3):366-394, May 1997.
29. R. Lübben and M. Fidler. Non-equilibrium information envelopes and the capacity-delay-error-tradeoff of source coding. CoRR, abs/1107.3087, 2011.
30. M. Mandjes. Large Deviations for Gaussian Queues: Modelling Communication Networks. Wiley, 2007.
31. M. F. Neuts. Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Dover, 1981.
32. 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.
33. Z. Palmowski and T. Rolski. A note on martingale inequalities for fluid models. Statistics & Probability Letters, 31(1):13-21, Dec. 1996.
34. V. Ramaswami. Matrix analytic methods for stochastic fluid flows. In 16th International Teletraffic Congress (ITC), pages 1019-1030, 1999.
35. A. Rizk and M. Fidler. Non-asymptotic end-to-end performance bounds for networks with long range dependent fBm cross traffic. Computer Networks, 56(1):127-141, Jan. 2012.
36. S. Shakkottai and R. Srikant. Delay asymptotics for a priority queueing system. In ACM Sigmetrics, pages 188-195, 2000.
37. N. B. Shroff and M. Schwartz. Improved loss calculations at an ATM multiplexer. IEEE/ACM Transactions on Networking, 6(4):411-421, Aug. 1998.
38. V. Sivaraman and F. M. Chiussi. Statistical analysis of delay bound violations at an earliest deadline first scheduler. Performance Evaluation, 36(1):457-470, Aug. 1999.
39. M. Talagrand. Majorizing measures: The generic chaining. Annals of Probability, 24(3):1049-1103, July 1996.
40. D. Wischik. Sample path large deviations for queues with many inputs. Annals of Applied Probability, 11(2):379-404, May 2001.
41. Y. Yuan, K. Wu, W. Jia, and Y. Jiang. Performance of acyclic stochastic networks with network coding. IEEE Transactions on Parallel and Distributed Systems, 22(7), July 2011.
42. K. Zheng, F. Liu, L. Lei, C. Lin, and Y. Jiang. Stochastic performance analysis of a wireless finite-state Markov channel. IEEE Transactions on Wireless Communications, 12(2):782-793, Feb. 2013.
43. H. Al-Zubaidy, J. Liebeherr, and A. Burchard. A (min, ×) network calculus for multi-hop fading channels. In IEEE Infocom, 2013.