## Some Observations on Fairness of Bandwidth Sharing (1999)

Citations: | 21 - 0 self |

### BibTeX

@MISC{Chiu99someobservations,

author = {Dah Ming Chiu},

title = {Some Observations on Fairness of Bandwidth Sharing},

year = {1999}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper reviews the engineering solutions and economic models for fair allocation of network bandwidth to elastic flows. By using examples, it gives insight to Proportional Fairness, and how it compares to the fairness achieved by TCP. The second

### Citations

1946 |
Data Networks
- Bertsekas, Gallager
- 1987
(Show Context)
Citation Context ...nalysis in [Chiu] was based on a single bottleneck resource. The generalized model of network fairness is the Max-Min fairness, which had been discussed in earlier literature and described clearly in =-=[Bertsekas]-=-. For an Additive Increase Multiplicative Decrease algorithm to approximately result in Max-Min fairness, it would require the competing flows to traverse the same number of links (or have approximate... |

1577 |
Rate control in communication networks: shadow prices, proportional fairness and stability
- Kelly, Maulloo, et al.
- 1998
(Show Context)
Citation Context ... elastic traffic to share network resources, and new protocols must strictly emulate TCP. The economics More recent research re-examined the economic models of network bandwidth sharing. In [Kelly1], =-=[Kelly2]-=- and [Gibbens], Kelly and others proposed a model of optimizing a utility function associated with network flows. Kelly further applied operations research techniques to solve the optimization problem... |

826 | Promoting the use of end-to-end congestion control in the Internet
- Floyd, Fall
- 1999
(Show Context)
Citation Context ...ize, short flows achieve higher throughput than long flows due to the shorter roundtrip time to refresh the window. Closed-form equations of TCP's throughput have been studied under static conditions =-=[Floyd]-=-, [Mathis], [Padhye]. It roughly approximates to 1 A more sensible terminology, used by some people today, is linear increase/exponential decrease. 2 where T is the roundtrip time, q is the fraction o... |

783 | Charging and rate control for elastic traffic
- Kelly
- 1997
(Show Context)
Citation Context ...policy for elastic traffic to share network resources, and new protocols must strictly emulate TCP. The economics More recent research re-examined the economic models of network bandwidth sharing. In =-=[Kelly1]-=-, [Kelly2] and [Gibbens], Kelly and others proposed a model of optimizing a utility function associated with network flows. Kelly further applied operations research techniques to solve the optimizati... |

599 | The macroscopic behavior of TCP congestion avoidance algorithm
- Mathis, Semke, et al.
- 1997
(Show Context)
Citation Context ...t flows achieve higher throughput than long flows due to the shorter roundtrip time to refresh the window. Closed-form equations of TCP's throughput have been studied under static conditions [Floyd], =-=[Mathis]-=-, [Padhye]. It roughly approximates to 1 A more sensible terminology, used by some people today, is linear increase/exponential decrease. 2 where T is the roundtrip time, q is the fraction of packets ... |

592 |
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
- Chiu, Jain
- 1989
(Show Context)
Citation Context ...time they were designed. The simple notion of sharing the bottleneck bandwidth fairly was the only guiding consideration. The fairness of TCP-style congestion control algorithms was first analyzed in =-=[Chiu]-=-. The rather awkward terminology of Additive Increase Multiplicative Decrease 1 used to describe these algorithms stuck, and is often used to refer to the TCP congestion control algorithms by the perf... |

422 | Fundamental design issues for the future Internet
- Shenker
- 1995
(Show Context)
Citation Context ...um of each user's utility; then the economic problem is to maximize the aggregate utility: Any rate allocation x that satisfies Ax C, and x 0 is called a feasible allocation. Assuming elastic traffic =-=[Shenker]-=-, a reasonable utility function for U() is log(). Using this utility function and Lagrangian multiplier techniques, Kelly found that the solution to the above problem must satisfy the following criter... |

329 | Resource pricing and the evolution of congestion control
- Gibbens, Kelly
- 1998
(Show Context)
Citation Context ...fic to share network resources, and new protocols must strictly emulate TCP. The economics More recent research re-examined the economic models of network bandwidth sharing. In [Kelly1], [Kelly2] and =-=[Gibbens]-=-, Kelly and others proposed a model of optimizing a utility function associated with network flows. Kelly further applied operations research techniques to solve the optimization problem, and illustra... |

293 | Bandwidth sharing: objectives and algorithms
- Massoulie, Roberts
- 1999
(Show Context)
Citation Context ...elly was also able to apply other economic interpretations to his models; for example, certain variables in the model correspond to shadow prices and usage charges of network bandwidth. Subsequently, =-=[Massoulie]-=- took Kelly's framework and considered other possible utility functions, such as maximizing the sum of the throughputs of all flows, or minimizing the sum of the delays (inverse throughput) of all flo... |

34 | trawman Specification for TCP Friendly (Reliable) Multicast Congestion Control (TFMCC
- Handley, Floyd
- 1998
(Show Context)
Citation Context ...tion control algorithm, 6 and repeat this for all receivers. Then pick the slowest throughput (produced by one representative receiver working with the sender) as the multicast flow's fair share. See =-=[Strawman]-=- as an example proposal. Consider applying this representative approach to the two extreme examples based on the network in Figure 4 that we discussed earlier. For both examples, the multicast flow ge... |

26 |
et al.: Modeling TCP Throughput: A Simple Model and its Empirical Validation
- Padhye
- 1998
(Show Context)
Citation Context ...hieve higher throughput than long flows due to the shorter roundtrip time to refresh the window. Closed-form equations of TCP's throughput have been studied under static conditions [Floyd], [Mathis], =-=[Padhye]-=-. It roughly approximates to 1 A more sensible terminology, used by some people today, is linear increase/exponential decrease. 2 where T is the roundtrip time, q is the fraction of packets lost, and ... |

11 |
et al., “IETF Criteria for Evaluating Reliable Multicast Transport and Application Protocols”, Network Working Group RFC 2357
- Mankin
- 1998
(Show Context)
Citation Context ...h further experimentation with multicast. In addition, the Internet Engineering Task Force (IETF) orchestrated a very strong guideline for developing a TCPfriendly multicast congestion control scheme =-=[RFC2357]-=-, realizing that congestion control is where network bandwidth sharing policies are implemented on the Internet today. The IETF guideline suggests that a multicast flow be treated as a unicast flow. T... |

2 |
Bandwidth Allocation Policies for Unicast and
- Legout
- 1999
(Show Context)
Citation Context ...st to n unicast flows. Therefore, a sensible utility function of a multicast is probably something in-between the utility of a single unicast flow and n times of a single unicast flow. A recent paper =-=[Legout]-=- studied a number of possibilities, among them is a utility function that depends on log(n) instead of n. More research on this topic should perhaps try to factor in the costs associated with multicas... |