Network calculus delay bounds in queueing networks with exact solutions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4516 LNCS, Issue , 2007, Pages 495-506

  Ciucu, Florin ^a  

^a University of Virginia   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK MANAGEMENT; PROBABILITY; QUEUEING NETWORKS; TELECOMMUNICATION TRAFFIC;

NETWORK CALCULUS; PROBABILISTIC DELAY;

DIFFERENTIATION (CALCULUS);

EID: 38149078109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72990-7_45     Document Type: Conference Paper

References (23)

1. Cruz, R.: A calculus for network delay, parts I and II. IEEE Transactions on Information Theory 37, 114-141 (1991)
2. Chang, C.S.: Performance Guarantees in Communication Networks. Springer Verlag, Heidelberg (2000)
3. Le Boudec, J.-Y., Thiran, P.: Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2001)
4. Kurose, J.: On computing per-session performance bounds in high-speed multi-hop computer networks. In: ACM Sigmetrics, pp.128-139 (1992)
5. Knightly, E.W.: Second moment resource allocation in multi-service networks. In: ACM Sigmetrics, pp. 181-191 (1997)
6. Boorstyn, R., Burchard, A., Liebeherr, J., Oottamakorn, C.: Statistical service assurances for traffic scheduling algorithms. IEEE Journal on Selected Areas in Comm. Special Issue on Internet QoS 18, 2651-2664 (2000)
7. Li, C., Burchard, A., Liebeherr, J.: A network calculus with effective bandwidth. Tech. Rep. CS-2003-20, University of Virginia (November 2003)
8. Yaron, O., Sidi, M.: Performance and stability of communication networks via robust exponential bounds. IEEE/ACM Trans. on Net. 1, 372-385 (1993)
9. Starobinski, D., Sidi, M.: Stochastically bounded burstiness for communication networks. IEEE Transactions of Information Theory 46, 206-212 (2000)
10. Ciucu, F., Burchard, A., Liebeherr, J.: Scaling properties of statistical end-to-end bounds in the network calculus. IEEE Transactions on Information Theory 52, 2300-2312 (2006)
11. Fidler, M.: An end-to-end probabilistic network calculus with moment generating functions. In: IEEE 14th Int. Workshop on Quality of Service, pp. 261-270 (2006)
12. Jiang, Y.: A basic stochastic network calculus. In: ACM Sigcomm, pp. 123-134 (2006)
13. Knightly, E.: Enforceable quality of service guarantees for bursty traffic streams. In: IEEE Infocom, pp. 635-642 (1998)
14. Kleinrock, L.: Queueing Systems. John Wiley and Sons, Chichester (1975)
15. Pandit, K., Schmitt, J., Steinmetz, R.: Network calculus meets queueing theory - a simulation based approach to bounded queues. In: IEEE 12th International Workshop on Quality of Service, pp. 114-118 (2004)
16. Kelly, F.: Notes on effective bandwidths. In: Kelly, F.P., Zachary, S., Ziedins, I.B. (eds.) Stochastic Networks: Theory and Applications Royal Statistical Society. Lecture Notes Series, vol. 4, pp. 141-168. Oxford University Press, New York (1996)
17. Kingman, J.F.C: A martingale inequality in the theory of queues. In Cambridge Philos. Soc. 59, 359-361 (1964)
18. Buffet, E., Duffield, N.G.: Exponential upper bounds via martingales for multiplexers with Markovian arrivals. J. of App. Prob. 31, 1049-1060 (1994)
19. Liu, Z., Nain, P., Towsley, D.: Exponential bounds with applications to call admission. J. of the ACM 44, 366-394 (1997)
20. Chang, C.S.: On the exponentiality of stochastic linear systems under the max-plus algebra. IEEE Trans. on Automatic Control 41, 1182-1188 (1996)
21. Boudec, J.-Y.L.: Some properties of variable length packet shapers. IEEE/ACM Transactions on Networking 10, 329-337 (2002)
22. Iversen, V., Staalhagen, L.: Waiting time distribution in M/D/1 queueing systems. Electronics Letters 35(25), 2184-2185 (1999)
23. Burchard, A., Liebeherr, J., Ciucu, F.: On ⊖ (H log H) scaling of network delays. In: Proceedings of IEEE Infocom (2007)