## End-to-end congestion control schemes: Utility functions, random losses and ECN marks (2000)

### Cached

### Download Links

- [www.seas.upenn.edu]
- [comm.csl.uiuc.edu]
- [comm.csl.uiuc.edu:80]
- [www.ieee-infocom.org]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of IEEE Infocom |

Citations: | 179 - 1 self |

### BibTeX

@INPROCEEDINGS{Kunniyur00end-to-endcongestion,

author = {Srisankar Kunniyur and R. Srikant},

title = {End-to-end congestion control schemes: Utility functions, random losses and ECN marks},

booktitle = {In Proceedings of IEEE Infocom},

year = {2000},

pages = {1323--1332}

}

### Years of Citing Articles

### OpenURL

### 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 and may experience non-congestion-related losses. We first show that there exists an additive increase-multiplicative decrease scheme using only end-to-end measurable losses such that a socially-optimal solution can be reached. We incorporate round-trip delay in this model, and show that one can generalize observations regarding TCP-type congestion avoidance to more general window flow control schemes. We then consider explicit congestion notification (ECN) as an alternate mechanism (instead of losses) for signaling congestion and show that ECN marking levels can be designed to nearly eliminate losses in the network by choosing the marking level independently for each node in the network. While the ECN marking level at each node may depend on the number of flows through the node, the appropriate marking level can be estimated using only aggregate flow measurements, i.e., per-flow measurements are not required. 1

### Citations

2183 | Random early detection gateways for congestion avoidance
- Floyd, Jacobson
- 1993
(Show Context)
Citation Context ...elay on dierent windowsow control schemes that could be derived by starting with dierent utility functions. The eect of random losses and round-trip delay on TCP performance have been quantied in [5, =-=17, 13-=-]. Our results generalize these earlier works to the case of multiple nodes and to windowsow controllers derived from other utility functions. Finally, we study the use of early congestion notication,... |

1788 |
Data Networks
- Bertsekas, Gallagher
- 1991
(Show Context)
Citation Context ...needs of dierent applications. It is now well-established that various notions of fairness can be dened in terms of appropriate utility functions [12, 23, 21]. While the well-known max-min fairness [1] cannot be dened in terms of a single utility function, it can still be dened in terms of a sequence of utility functions [12]. Thus, another motivation for allowing dierent utility functions for d... |

1367 |
Rate control in communication networks: shadow prices, proportional fairness and stability
- Kelly, Maullo, et al.
- 1998
(Show Context)
Citation Context ... design of end-to-end congestion controllers. We start with the nonlinear programming formulation of a flow allocation problem suggested in [3] from which a penalty function formulation is derived in =-=[4]-=-. In [4], it has been shown that a congestion controller can be designed such that the equilibrium point of the congestion controller is stable and converges to the unique solution of the penalty func... |

750 | Promoting the use of end-to-end congestion controlin the Internet - Floyd - 1999 |

689 | Charging and rate control for elastic traffic
- Kelly
- 1997
(Show Context)
Citation Context ...s, random losses and explicit congestion notification on the design of end-to-end congestion controllers. We start with the nonlinear programming formulation of a flow allocation problem suggested in =-=[3]-=- from which a penalty function formulation is derived in [4]. In [4], it has been shown that a congestion controller can be designed such that the equilibrium point of the congestion controller is sta... |

531 | TCP and explicit congestion notification - Floyd - 1994 |

514 | Optimization flow control, I. Basic algorithm and convergence
- Low, Lapsley
- 1999
(Show Context)
Citation Context ... as a pricing scheme which steers a set of non-cooperative users to a socially optimal solution as in “smart-market” proposal [5]. Our formulation is also closely related to the approach presented in =-=[6]-=-. While [6] uses duality theory to solve the nonlinear program formulation of the resource allocation problem, we use a penalty function approach as in [4]. Also, [6] does not deal with random losses ... |

375 | Improving TCP/IP performance over wireless networks, in - Balakrishnan, Seshan, et al. - 1995 |

306 | Resource pricing and the evolution of congestion control
- Gibbens, Kelly
- 1969
(Show Context)
Citation Context ...chanisms. We are partly motivated by the recent works ∗ Research supported by NSF Grants ANI-9813710 and ANI-9714685 † An earlier version of this paper appeared in INFOCOM 2000 1sof Gibbens and Kelly =-=[1, 2]-=- who have demonstrated the possibility of designing such networks using simple models. Some of the issues that have to be addressed when designing these networks include • defining appropriate notions... |

262 | Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic - Floyd - 1991 |

258 | Pricing congestible network resources
- MacKie-Mason, Varian
- 1995
(Show Context)
Citation Context ...om the network. We also show that the penalty function can also be thought as a pricing scheme which steers a set of non-cooperative users to a socially optimal solution as in “smart-market” proposal =-=[5]-=-. Our formulation is also closely related to the approach presented in [6]. While [6] uses duality theory to solve the nonlinear program formulation of the resource allocation problem, we use a penalt... |

104 | Distributed connection acceptance control for a connectionless network
- Gibbens, Kelly
- 1999
(Show Context)
Citation Context ...chanisms. We are partly motivated by the recent works ∗ Research supported by NSF Grants ANI-9813710 and ANI-9714685 † An earlier version of this paper appeared in INFOCOM 2000 1sof Gibbens and Kelly =-=[1, 2]-=- who have demonstrated the possibility of designing such networks using simple models. Some of the issues that have to be addressed when designing these networks include • defining appropriate notions... |

60 | Best-effort versus reservations: A simple comparative analysis
- Breslau, Shenker
- 1998
(Show Context)
Citation Context ..., all users have non-zero rates in the optimal solution. Examples of such a function include log x r and 1=x r : An open issue is to incorporate non-concave utility functions such as those studied in =-=[2]-=-. Proposition 1 The game admits a unique Nash equilibrium which is also the unique maximum of the following team problem, i.e., one where all users jointly optimize a single performance objective: max... |

23 |
TCP and Explicit Congestion Noti
- Floyd
- 1994
(Show Context)
Citation Context ...f the resources will pay more than the rest of the users. 5 ECN Marks Explicit Congestion Notication (ECN) has been recently proposed to provide early indication to sources about imminent congestion [=-=3]-=-. Current versions of TCP and the windowsow control algorithms that we have discussed so far rely on loss as the congestion indicator. Clearly, this is not desirable if one wishes to operate the netwo... |

20 |
Charging and rate control for elastic tra#c
- Kelly
(Show Context)
Citation Context ...s, random losses and explicit congestion notification on the design of end-to-end congestion controllers. We start with the nonlinear programming formulation of a flow allocation problem suggested in =-=[3]-=- from which a penalty function formulation is derived in [4]. In [4], it has been shown that a congestion controller can be designed such that the equilibrium point of the congestion controller is sta... |

1 |
Promoting the use of en-to-end congestion control in the internet
- Floyd, Fall
- 1999
(Show Context)
Citation Context ...ll see later, our primary motivation for doing this is that we want TCP to be a special case of our formulation and thus, any controller in the class that we study can be checked for TCP-friendliness =-=[4-=-]. Further, our ECN marking scheme described later becomes a straightforward modication to TCP where losses are simply replaced by marks in the congestion avoidance algorithm. For yet another related,... |