Statistical per-flow service bounds in a network with aggregate provisioning

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2003, Pages 1680-1690

  Liebeherr, Jörg ^a   Patek, Stephen D ^a   Burchard, Almut ^b  

^a University of Virginia   (United States)

^b UNIVERSITY OF VIRGINIA   (United States)

Author keywords

Admission Control; Network Calculus; Quality of Service; Statistical Multiplexing

Indexed keywords

BURSTINESS; NETWORK CALCULUS; SERVICE ARCHITECTURE; STOCHASTIC BOUND;

ACCESS CONTROL; CALCULATIONS; MULTIPLEXING; QUALITY OF SERVICE; SCHEDULING ALGORITHMS;

COMPUTER ARCHITECTURE;

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

References (20)

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, June 1999.
2. M. Andrews. Instability of FIFO in session-oriented networks. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pages 440-447, October 1996. (Pubitemid 30549287)
3. 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, December 2000. (Pubitemid 32252004)
4. A. Borodin, J. M. Kleinberg, P. Raghavan, J. Sudan, and D. P. Williamson. Adversarial queuing theory. Journal of the ACM, 48(1):13-38, 2001.
5. J. Y. Le Boudec and P. Thiran. Network Calculus. Springer Verlag, Lecture Notes in Computer Science, LNCS 2050, 2001.
6. 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.
7. 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.
8. C. S. Chang, Y. Chiu, and W. T. Song. On the performance of multiplexing independent regulated inputs. In Proceedings of ACM SIGMETRICS 2001, pages 184-193, 2001. (Pubitemid 32865934)
9. A. Charny and J. Y. Le Boudec. Delay bounds in a network with aggregate scheduling. In Proceedings of QOFIS, October 2000.
10. R. L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications, 13(6):1048-1056, August 1995.
11. R. L. Cruz. SCED+: Efficient management of quality of service guarantees. In IEEE Infocom, pages 625-634, 1998.
12. A. Elwalid, D. Mitra, and R. Wentworth. A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node. IEEE Journal on Selected Areas in Communications, 13(6):1115-1127, August 1995.
13. V. Firoiu, J.-Y. Le Boudec, D. Towsley, and Z.-L. Zhang. Theories and models for internet quality of service. Proceedings of the IEEE, 2002. To appear.
14. F. 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.
15. G. Kesidis and T. Konstantopoulos. Extremal traffic and worst-case performance for queues with shaped arrivals. In Proceedings of Workshop on Analysis and Simulation of Communication Networks, Toronto, November 1998.
16. A. Papoulis. Probability, Random Variables, and Stochastic Processes. 3rd edition. McGraw Hill, 1991.
17. L. Tassiulas and L. Georgiadis. Any work-conserving policy stabilizes the ring with spatial re-use. IEEE/ACM Transactions on Networking, 4(2):205-208, April 1996. (Pubitemid 126784916)
18. M. Vojnovic and J.-Y. Le Boudec. Bounds for independent regulated inputs multiplexed in a service curve network element. In Proceedings of IEEE Globecom 2001, San Antonio, Texas, November 2001.
19. M. Vojnovic and J.-Y. Le Boudec. Elements of a probabilistic nework calculus for packet scale rate guarantee nodes. In Proceedings of Fifteenth International Symposium on Mathematical Theory of Networks and Systems, University of Notre Dame, 2002.
20. Z. Zhang, Z. Duan, and T. Hou. Fundamental trade-offs in aggregate packet scheduling (extended abstract). In Proceedings of SPIE Vol. 4526, August 2001.