A core-stateless utility based rate allocation framework

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

Volumn 2334, Issue , 2002, Pages 1-16

  Venkitaraman, Narayanan ^a   Mysore, Jayanth P ^a   Needham, Mike ^a  

^a MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; INTERNET PROTOCOLS;

CORE-STATELESS; DIFFERENT SERVICES; LABELING ALGORITHMS; PARTIAL INFORMATION; RATE ALLOCATION; RESOURCE REQUIREMENTS; UTILITY FUNCTIONS; UTILITY VALUES;

HIGH SPEED NETWORKS;

EID: 84889345374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47828-0_1     Document Type: Conference Paper

References (14)

1. R. Barnes, R. Srik ant, J.P. Mysore, N. Venkitaraman “Analysis of Stateless Fair Queuing Algorithms”, to appear in Proc. of 35th Annual Conference on Information Sciences and Systems, March 2001.
2. Z. Cao and E. Zegura.“Utilit y Max-Min: An application-Oriented Bandwidth Allocation Scheme”, Proc. of IEEE INFOCOM, 1999.
3. Z. Cao, Z. Wang and E. Zegura.“Rain bow Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State”, Proc. of IEEE INFOCOM, 2000.
4. F.P. Kelly.“Charging and Rate Control for Elastic Traffic”, European Transactions on Telecommunications, vol 8, 1997.
5. R.J. Gibb ens and F.P. Kelly.“Distributed connection acceptance control for a connectionless network”, Proceedings of the 16th International Teletraffic Congress, Edinburg, June 1999.
6. P. Key, D. McAuley, P. Barham.“Congestion Pricing for Congestion Avoidance”, Technical Report MSR-TR-99-15, Microsoft Research, Febuary 1999.
7. L. Massoulie and J. Roberts.“Bandwidth Sharing: Objectives and Algorithms”, Proc. of INFOCOM, March 1999.
8. J. Mo and J. Warlang.“Fair end-to-end Window based Congestion Control”
9. S. McCanne, V. Jacobson, and M. Vetterli.“Receiver-driven layered multicast”, Proc. SIGCOMM’96, Stanford, CA, Aug.1996, ACM, pp.117-130.
10. S. Shenker “Fundamental Design Issues for the Future Internet”, IEEE JSAC. Vol 13, No. 7, September 1995.
11. S. Kunniyur and R. Srikant “End-to-End Congestion Control Schemes: Utility Functions, Random Losses and ECN Marks”, Proc. of IEEE INFOCOM 2000.
12. S. Raghupathy, T. Kim, N. Venkitaraman, and V. Bharghavan.“Providing a Flexible Service Model with a Stateless Core”, Proc. of ICDCS 2000.
13. I. Stoica and H. Zhang.“Providing Guaranteed Services Without Per Flow Management”, Proceedings of the ACM SIGCOMM’99 Conference, September 1999.
14. I. Stoica, S. Shenker and H. Zhang.“Core-Stateless Fair Queueing: Achieveing approximately Fair Bandwidth Allocations in High Speed Networks”, Proceedings of the ACM SIGCOMM’98 Conference, September 1998.