A network service curve approach for the stochastic analysis of networks

Performance Evaluation Review

Volumn 33, Issue 1, 2005, Pages 279-290

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

^a University of Virginia   (United States)

Author keywords

Network service curve; Quality of service; Stochastic network calculus

Indexed keywords

MULTIPLEXING; RANDOM PROCESSES; STATISTICAL METHODS; TELECOMMUNICATION TRAFFIC;

NETWORK SERVICE CURVE; SINGLE NODES; STOCHASTIC NETWORK CALCULUS; TRAFFIC MODEL;

COMPUTER NETWORKS;

EID: 33244495760     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/1071690.1064251     Document Type: Conference Paper

References (24)

1. R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan. Performance bounds for flow control protocols. IEEE/ACM Transactions on Networking, 7(3):310-323, 1999.
2. S. Ayyorgun and R. Cruz. A service-curve model with loss and a multiplexing problem. In 24th International Conference on Distributed Computing System (ICDCS'04), pages 756-765, March 2004.
3. S. Ayyorgun and W. Feng. A probabilistic definition of burstiness characterization. Technical Report LA-UR 03-3668, Los Alamos National Laboratory, May 2003.
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, 18(12):2651-2664, 2000.
5. A. Burchard, J. Liebeherr, and S. D. Patek. A calculus for end-to-end statistical service guarantees. Technical Report CS-2001-19, University of Virginia, Computer Science Department, May 2002.
6. C. S. Chang. Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Transactions on Automatic Control, 39(5):913-931, 1994.
7. C. S. Chang. On deterministic traffic regulation and service guarantees: a systematic approach by filtering. IEEE/ACM Transactions on Information Theory, 44(3):1097-1110, 1998.
8. C. S. Chang. Performance Guarantees in Communication Networks. Springer Verlag, 2000.
9. R. Cruz. A calculus for network delay, parts I and II. IEEE Transactions on Information Theory, 37(1):114-141, 1991.
10. R. L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications, 13(6): 1048-1056, 1995.
11. R. L. Cruz. Quality of service management in integrated services networks. In Proceedings of the 1st Semi-Annual Research Review, CWC, UCSD, June 1996.
12. F. Kelly. Notes on effective bandwidths. In Stochastic Networks: Theory and Applications. (Editors: P.P. Kelly, S. Zachary and I.B. Ziedins) Royal Statistical Society Lecture Notes Series, 4, pages 141-168. Oxford University Press, 1996.
13. J. Kurose. On computing per-session performance bounds in high-speed multi-hop computer networks. In Proceedings of ACM Sigmetrics'92, pages 128-139, June 1992.
14. J. Y. Le Boudec. Application of network calculus to guaranteed service networks. IEEE/ACM Transactions on Information Theory, 44(3):1087-1097, 1998.
15. J. Y. Le Boudec and P. Thiran. Network Calculus. Springer Verlag, Lecture Notes in Computer Science, LNCS 2050, 2001.
16. C. Li, A. Burchard, and J. Liebeherr. A network calculus with effective bandwidth. Technical Report CS-2003-20, University of Virginia, Computer Science Department, Nov. 2003.
17. J. Liebeherr, S. Patek, and A. Burchard. Statistical per-flow service bounds in a network with aggregate provisioning. In Proceedings of IEEE Infocom 2003, March 2003.
18. Y. Liu, C. Tham, and Y. Jiang. A stochastic network calculus. Technical report, ECE-CCN-0301, Dept. of Electrical and Computer Engineering, National University of Singapore, Nov. 2003.
19. 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 Transactions on Networking, l(3):344-357, 1993.
20. J. Qiu and E. Knightly. Inter-class resource sharing using statistical service envelopes. In Proceedings of IEEE Infocom '99, pages 36-42, March 1999.
21. M. Schwartz. Telecommunication Network: Protocols, Modeling, and Analysis. Addison-Wesley, 1986.
22. D. Starobinski and M. Sidi. Stochastically bounded burstiness for communication networks. IEEE Transaction of Information Theory, 46(1):206-212, 2000.
23. O. Yaron and M. Sidi. Performance and stability of communication networks via robust exponential bounds. IEEE/'A CM Transactions on Networking, 1(3):372-385, 1993.
24. 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, pages 141-149, November 2002.