Probabilistic delay guarantees using delay distribution measurement

ACM Multimedia 2004 - proceedings of the 12th ACM International Conference on Multimedia

Volumn , Issue , 2004, Pages 900-907

  Gopalan, Kartik ^a   Chiueh, Tzi Cker ^b   Lin, Yow Jian ^c  

^a FLORIDA STATE UNIVERSITY   (United States)

^b STONY BROOK UNIVERSITY   (United States)

^c Telcordia Research   (United States)

Author keywords

Admission Control; Measurement based; Statistical Multiplexing

Indexed keywords

ALGORITHMS; DELAY CONTROL SYSTEMS; MULTIPLEXING; PACKET NETWORKS; PROBABILITY; QUALITY OF SERVICE; STATISTICAL METHODS; SWITCHING; TELECOMMUNICATION TRAFFIC;

ADMISSION CONTROL; MEASUREMENT-BASED; VIRTUAL PRIVATE NETWORK (VPN); VOICE OVER IP (VOIP);

TELECOMMUNICATION NETWORKS;

EID: 13444310518     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1027527.1027734     Document Type: Conference Paper

References (24)

1. M. Andrews. Probabilistic end-to-end delay bounds for earliest deadline first scheduling. In Proc. of IEEE INFOCOM 2000, March 2000.
2. R. Boorstyn, A. Burchard, J. Leibeherr, and C. Oottamakorn. Statistical service assurances for traffic scheduling algorithms. IEEE Journal on Selected Areas in Communications, 18(13):2651-2664, December 2000.
3. L. Breslau, S. Jamin, and S. Shenker. Comments on performance of measurement-based admission control algorithms. In Proc. of IEEE INFOCOM 2000, March 2000.
4. C-S. Chang, Y. Chiu, and W. Song. On the performance of multiplexing independent regulated inputs. In ACM Sigmetrics 2001/Performance 2001, pages 184-193, 2001.
5. S. Crosby, I. Leslie, B. McGurk, J. Lewis, R. Russell, and F. Toomey. Statistical properties of a near-optimal measurement-based admission CAC algorithm. In Proc. of IEEE ATM'97, June 1997.
6. R. Cruz. A calculus for network delay, Part I: Network elements in isolation. IEEE Transactions on Information Theory, 37(1):114-131, Jan. 1991.
7. A. Elwalid and D. Mitra. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes. In Proc. of IEEE INFOCOM'99, pages 1220-1230, March 1999.
8. S. Floyd. Comments on measurement-based admission control for controlled load services. Technical Report, Lawrence Berkeley Laboratory, July 1996.
9. R. Gibbens and F. Kelly. Measurement-based connection admission control. In Proc. of 15th Intl. Teletraffic Conference, June 1997.
10. K. Gopalan, T. Chiueh, and Y. Lin. Delay budget partitioning to maximize network resource usage efficiency. Proc. of IEEE INFOCOM 2004, Hong Kong, China, March 2004.
11. F. M. Guillemin, N. Likhanov, R. R. Mazumdar, and C. Rosenberg. Extremal traffic and bounds for the mean delay of multiplexed regulated traffic streams. In Proc. of IEEE INFOCOM'02, New York, NY, June 2002.
12. S. Jamin, P. Danzig, S. Shenker, and L. Zhang. A measurement-based admission control algorithm for integrated services packet networks. IEEE/ACM Transactions on Networking, 5(1):56-70, Feb. 1997.
13. W. Jiang and H. Schulzrinne. Analysis of On-Off patterns in VoIP and their effect on voice traffic aggregation. In Proc. of ICCCN 2000, March 1996.
14. F. Kelly. Notes on effective baridwidths. In Stochastic Networks: Theory and Applications, 4:141-168, 1996.
15. G. Kesidis and T. Konstantopoulos. Worst-case performance of a buffer with independent shaped arrival processes. IEEE Communication Letters, 4(1):26-28, Jan. 2000.
16. E. Knightly and N. B. Shroff. Admission control for statistical QoS. IEEE Network, 13(2):20-29, March 1999.
17. J. Kurose. On computing per-session performance bounds in high-speed multi-hop computer networks. In Proc. of ACM Sigmetrics'92, pages 128-139, 1992.
18. J.-Y. L. Boudec and M. Vojnovic. Stochastic analysis of some expedited forwarding networks. In IEEE Infocom'02, New York, NY, June 2002.
19. A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transactions on Networking, 1(3):344-357, June 1993.
20. J. Qiu and E. Knightly. Measurement-based admission control with aggregate traffic envelopes. IEEE/ACM Transactions on Networking, 9(2):199-210, April 2001.
21. M. Reisslein, K. Ross, and S. Rajagopal. A framework for guaranteeing statistical QoS. IEEE/ACM Transactions on Networking, 10(1):27-42, February 2002.
22. V. Sivaraman and F. Chiussi. Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping. In Proc. of IEEE INFOCOM 2000, March 2000.
23. B. Urgaonkar, P. Shenoy, and T. Roscoe. Resource overbooking and application profiling in shared hosting platforms. In Proc. of Symposium on Operating Systems Design and Implementation, Boston, MA, Dec. 2002.
24. M. Vojnovic and J. Le Boudec. Bounds for independent regulated inputs multiplexed in a service curve network element. IEEE Transactions on Communications, 51(5), Jan. 1991.