(Enter summary)
Abstract: We present a framework for designing end-to-end congestion
control schemes in a network where each user may have a different
utility function. We first show that there exists an additive increasemultiplicative
decrease scheme using only end-to-end measurable losses
such that a socially-optimal solution can be reached. We incorporate noncongestion
-related random losses and round-trip delay in this model, and
show that one can generalize observations regarding TCP-type congestion
avoidance to... (Update)
Cited by: More
OMAR: Utilizing Multiuser Diversity in Wireless Ad Hoc.. - Wang, Zhai, Fang, Shea, Wu (2006)
(Correct)
A Utility-Based Congestion Control Scheme for Internet-Style.. - Alpcan, Basar (2003)
(Correct)
Oscillations with TCP-like Flow Control in - Networks Of Queues
(Correct)
Similar documents (at the sentence level):
39.6%: End-to-End Congestion Control Schemes: Utility Functions.. - Kunniyur, Srikant (2000)
(Correct)
Active bibliography (related documents): More All
0.1: Modelling and Improving Flow Establishment in RSVP - Mathy, Hutchison, Simpson
(Correct)
0.1: A Quantitative Study of Differentiated Services for the.. - Sahu, Towsley, Kurose (1999)
(Correct)
0.1: Dynamic Edge Provisioning for Core IP Networks - Liao, Campbell (2000)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.9: A Decentralized Adaptive ECN Marking Algorithm - Kunniyur, Srikant
(Correct)
0.5: A Time Scale Decomposition Approach to Adaptive ECN Marking - Kunniyur, Srikant (2001)
(Correct)
0.3: Congestion Control for Fair Resource Allocation in Networks.. - Deb, Srikant (2001)
(Correct)
Related documents from co-citation: More All
70: Rate control in communication networks: shadow prices
- Kelly, Maulloo et al. - 1998
32: Charging and rate control for elastic traffic
- Kelly - 1997
28: Random early detection gateways for congestion avoidance
- Floyd, Jacobson - 1993
BibTeX entry: (Update)
Srisankar Kunniyur and R. Srikant. End--to--end congestion control schemes: utility functions, random losses and ECN marks. In Proceedings of IEEE Infocom, March 2000. http://citeseer.ist.psu.edu/kunniyur00endtoend.html More
@inproceedings{ kunniyur00endtoend,
author = "Srisankar Kunniyur and R. Srikant",
title = "End-to-End Congestion Control Schemes: Utility Functions, Random Losses and {ECN} Marks",
booktitle = "{INFOCOM} (3)",
pages = "1323-1332",
year = "2000",
url = "citeseer.ist.psu.edu/kunniyur00endtoend.html" }
Citations (may not include all citations):
1159
Random early detection gateways for congestion avoidance
- Floyd, Jacobson - 1993
510
Promoting the use of end-to-end congestion control in the In..
- Floyd, Fall - 1999
206
Connections with multiple congested gateways in packet-switc..
- Floyd, Jacobson - 1991
119
ACM Computer Communication Review (context) - Floyd, Explicit - 1994
62
IP performance over wireless networks (context) - Balakrishnan, Seshan et al. - 1995
61
Distributed connection acceptance control for a connectionle..
- Gibbens, Kelly
7
Gallager Data Networks (context) - Bertsekas - 1987
6
Best-effort versus reservations: a simple comparative analys.. (context) - Breslau, Shenker - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cse.ucsc.edu/~rom/infocom2000/program.html): More
Internet Traffic Engineering by Optimizing OSPF Weights - Fortz, Thorup (2000)
(Correct)
Constrained Multicast Routing in WDM Networks with Sparse.. - Zhang, Wei, Qiao (1999)
(Correct)
A Signaling System Using Lightweight Call Sessions - Wang, Joseph, Katz (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC