An end-to-end probabilistic network calculus with moment generating functions

IEEE International Workshop on Quality of Service, IWQoS

Volumn , Issue , 2006, Pages 261-270

  Fidler, Markus ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; MULTIPLEXING; PROBABILITY DISTRIBUTIONS; QUEUEING NETWORKS; SERVERS; STATISTICAL METHODS;

MOMENT GENERATING FUNCTIONS; PROBABILISTIC NETWORK;

TELECOMMUNICATION NETWORKS;

EID: 33748557572     PISSN: 1548615X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWQOS.2006.250477     Document Type: Conference Paper

References (40)

1. C.-S. Chang, Performance Guarantees in Communication Networks. Springer-Verlag, 2000.
2. J.-Y. Le Boudec and P. Thiran, Network Calculus A Theory of Deterministic Queuing Systems for the Internet, ser. LNCS. Springer-Verlag, 2001, no. 2050.
3. R. L. Cruz, "A calculus for network delay, part I and II: Network elements in isolation and network analysis," IEEE Trans. Inform. Theory, vol. 37, no. 1, pp. 114-141, Jan. 1991.
4. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single-node case," IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.
5. F. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat, Synchronization and Linearity: An Algebra for Discrete Event Systems. John Wiley & Sons Ltd., 1992.
6. R. L. Cruz, "Quality of service guarantees in virtual circuit switched networks," IEEE J. Select. Areas Commun., vol. 13, no. 6, pp. 1048-1056, Aug. 1995.
7. H. Sariowan, R. L. Cruz, and G. C. Polyzos, "Scheduling for quality of service guarantees via service curves," in Proc. IEEE ICCCN, Sept. 1995, pp. 512-520.
8. C.-S. Chang, "On deterministic traffic regulation and service guarantees: A systematic approach by filtering," IEEE Trans. Inform. Theory, vol. 44, no. 3, pp. 1097-1110, May 1998.
9. J.-Y. Le Boudec, "Application of network calculus to guaranteed service networks," IEEE Trans. Inform. Theory, vol. 44, no. 3, pp. 1087-1096, May 1998.
10. R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan, "Performance bounds for flow control protocols," IEEE/ACM Trans. Networking, vol. 7, no. 3, pp. 310-323, June 1999.
11. G. Kesidis and T. Konstantopoulos, "Extremal shape-controlled traffic patterns in high-speed networks," IEEE Trans. Commun., vol. 48, no. 5, pp. 813-819, May 2000.
12. A. I. Elwalid, D. Mitra, and R. H. Wentworth, "A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node," IEEE J. Select. Areas Commun., vol. 13, no. 6, pp. 1115-1127, 1995.
13. F. LoPresti, Z. Zhang, D. Towsley, and R. Kurose, "Source time scale and optimal buffer/bandwidth tradeoff for regulated traffic in an ATM node," in Proc. IEEE INFOCOM, Apr. 1997, pp. 676-683.
14. S. Rajagopal, M. Reisslein, and K. W. Ross, "Packet multiplexers with adversarial regulated traffic," in Proc. IEEE INFOCOM, Mar. 1998, pp. 347-355.
15. M. Reisslein, K. W. Ross, and S. Rajagopal, "A framework for guaranteeing statistical QoS," IEEE/ACM Trans. Networking, vol. 10, no. 1, pp. 27-42, Feb. 2002.
16. C. S. Chang, Y.-M. Chiu, and W. T. Song, "On the performance of multiplexing independent regulated inputs," in Proc. ACM SIGMETRICS, June 2001, pp. 184-193.
17. G. Kesidis and T. Konstantopoulos, "Worst-case performance of a buffer with independent shaped arrival processes," IEEE Communication Letters, vol. 4, no. 1, pp. 26-28, Jan. 2000.
18. M. Vojnović and J.-Y. Le Boudec, "Bounds for independent regulated inputs multiplexed in a service curve network element," IEEE Trans. Commun., vol. 51, no. 5, pp. 735-740, May 2003.
19. O. Yaron and M. Sidi, "Performance and stability of communication networks via robust exponential bounds," IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 372-385, June 1993.
20. D. Starobinski and M. Sidi, "Stochastically bounded burstiness for communication networks," IEEE Trans. Inform. Theory, vol. 46, no. 1, pp. 206-212, Jan. 2000.
21. Q. Yin, Y. Jiang, S. Jiang, and P. Y. Kong, "Analysis of generalized stochastically bounded bursty traffic for communication networks," in Proc. IEEE LCN, Nov. 2002, pp. 141-149.
22. S. Ayyorgun and W. Feng, "A systematic approach to probabilistic quality of service guarantees in communication networks," LANL, Tech. Rep. LA-UR-03-7267, 2003.
23. C.-S. Chang, "Stability, queue length and delay of deterministic and stochastic queueing networks," IEEE Trans. Automat. Contr., vol. 39, no. 5, pp. 913-931, May 1994.
24. R. L. Cruz, "Quality of service management in integrated services networks," in Proc. Semi-Annual Research Review, Center of Wireless Communication, UCSD, 1996.
25. C.-S. Chang and J. Cheng, "Computable exponential bounds for intree networks with routing," in Proc. IEEE INFOCOM, Apr. 1995, pp. 197-204.
26. F. Ciucu, A. Burchard, and J. Liebeherr, "A network service curve approach for the stochastic analysis of networks," in Proc. ACM SIGMETRICS, June 2005, pp. 279-290.
27. C.-S. Chang, "On the exponentiality of stochastic linear systems under the max-plus algebra," IEEE Trans. Automat. Contr., vol. 41, no. 8, pp. 1182-1188, Aug. 1996.
28. R.-R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn, "Statistical service assurances for traffic scheduling algorithms," IEEE J. Select. Areas Commun., vol. 18, no. 12, pp. 2651-2664, Dec. 2000.
29. J. Qiu and E. W. Knightly, "Inter-class resource sharing using statistical service envelopes," in Proc. IEEE INFOCOM, Mar. 1999, pp. 1404-1411.
30. E. W. Knightly, "Enforceable quality of service guarantees for bursty traffic streams," in Proc. IEEE INFOCOM, Mar. 1998, pp. 635-642.
31. nd revised version, June 2002.
32. J. Liebeherr, S. D. Patek, and A. Burchard, "Statistical per-flow service bounds in a network with aggregate provisioning," in Proc. IEEE INFOCOM, Mar. 2003, pp. 1680-1690.
33. C. Li, A. Burchard, and J. Liebeherr, "A network calculus with effective bandwidth," University of Virginia, Tech. Rep. CS-2003-20, Nov. 2003.
34. F. P. Kelly, "Notes on effective bandwidths," ser. Royal Statistical Society Lecture Notes. Oxford University, 1996, no. 4, pp. 141-168.
35. S. Ayyorgun and R. L. Cruz, "A service curve model with loss," LANL, Tech. Rep. LA-UR-03-3939, 2003.
36. C.-S. Chang and R. L. Cruz, "A time varying filtering theory for constrained traffic regulation and dynamic service guarantees," in Proc. IEEE INFOCOM, Mar. 1999, pp. 63-70.
37. C.-S. Chang, R. L. Cruz, J.-Y. Le Boudec, and P. Thiran, "A min, + system theory for constrained traffic regulation and dynamic service guarantees," IEEE/ACM Trans. Networking, vol. 10, no. 6, pp. 805-817, Dec. 2002.
38. R. L. Cruz, "SCED+: Efficient management of quality of service guarantees," in Proc. IEEE INFOCOM, Mar. 1998, pp. 625-634.
39. S. Ross, A First Course in Probability, 6th ed. Prentice Hall, 2002.
40. A. Papoulis and S. U. Pillai, Probability, Random Variables and Stochastic Processes, forth ed. McGraw-Hill, 2002.