## An Algorithm for Rate Allocation in Packet-Switching Network with Feedback

### Cached

### Download Links

Citations: | 83 - 3 self |

### BibTeX

@MISC{Charny_analgorithm,

author = {Anna Charny},

title = {An Algorithm for Rate Allocation in Packet-Switching Network with Feedback},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

As the speed and complexity of computer networks evolve, sharing network resources becomes increasingly important. Thus, the issue of how to allocate the available bandwidth among the multitude of users needs to be addressed. Such allocation needs to be in some sense efficient and fair to different users. In this work the so-called maxmin fairness is chosen as the optimality criterion. A new distributed and asynchronous algorithm is suggested. The algorithm is shown to converge to the optimal rate allocation in a network with general topology under dynamic changes in the set of network users, individual user load and occasional route changes. An upper bound on convergence time is given. The algorithm is shown to be well-behaved in transience. Unlike previous work, the algorithm takes bandwidth consumed by feedback traffic into account. Further, an extension of the algorithm is suggested to address the problem of policing misbehaved users.

### Citations

2468 | M.J.: Congestion Avoidance and Control - Jacobson, Karels - 1988 |

542 | Supporting realtime applications in an integrated services packet network: Architecture and mechanism
- Clark, Shenker, et al.
- 1992
(Show Context)
Citation Context ... There is a vast amount of work addressing the issue of preserving feasible user rates under various assumptions on the underlying service discipline and the shape of source traffic. (see for example =-=[3]-=-, [11], [12], [14], [25]). This thesis addresses the first problem, i.e. how to determine the set of optimal rates in a distributed network under dynamic changes in the absence of centralized knowledg... |

534 | A Quantitative Measure of Fairness and Discrimination for Resource Allocation - Jain, Chiu, et al. - 1984 |

353 | Analysis and simulation of a fair queuing algorithm - Demers, Keshav, et al. - 1989 |

194 | Bottleneck Flow Control
- Jaffe
- 1981
(Show Context)
Citation Context ...proaches and definitions of fairness and efficiency. The approach adopted in this work chooses the so-called maxmin or bottleneck optimality criterion discussed in various modifications in [1], [12], =-=[17]-=-, [23], [26]. This approach is based on the following intuition. Consider a network with given link capacities, the set of sessions and fixed session routes. We are interested in such rate allocations... |

171 | On Packet Switches with Infinite Storage - Nagle - 1987 |

170 | Congestion avoidance in computer networks with a connectionless network layer - JAIN, RAMAKRISHNAN, et al. - 1987 |

118 | Robin Scheduling for Max-Min Fairness in Data Networks
- Hahne, Round
- 1991
(Show Context)
Citation Context ...amount of work addressing the issue of preserving feasible user rates under various assumptions on the underlying service discipline and the shape of source traffic. (see for example [3], [11], [12], =-=[14]-=-, [25]). This thesis addresses the first problem, i.e. how to determine the set of optimal rates in a distributed network under dynamic changes in the absence of centralized knowledge about the networ... |

112 |
Flow Control: A Comparative Survey
- Gerla, Kleinrock
- 1980
(Show Context)
Citation Context ... to determine a fair and efficient rate allocation . The precise meaning of the terms `efficient' and `fair' has been a target of extensive debate in the last two decades. References [1], [21], [24], =-=[8]-=-, [7] contain a variety of approaches and definitions of fairness and efficiency. The approach adopted in this work chooses the so-called maxmin or bottleneck optimality criterion discussed in various... |

108 | Architectural Considerations for a New Generation of - Clark, Tennenhouse - 1990 |

52 |
Round Robin Scheduling for Fair Flow Control
- Hahne, Gallager
- 1986
(Show Context)
Citation Context ... vast amount of work addressing the issue of preserving feasible user rates under various assumptions on the underlying service discipline and the shape of source traffic. (see for example [3], [11], =-=[12]-=-, [14], [25]). This thesis addresses the first problem, i.e. how to determine the set of optimal rates in a distributed network under dynamic changes in the absence of centralized knowledge about the ... |

38 | Dynamic control of session input rates in communication networks - Gafni, Bertsekas - 1984 |

38 | Myths about Congestion Management in High-speed Networks - Jain - 1992 |

32 |
Voice flow control in integrated packet networks
- Hayden
- 1981
(Show Context)
Citation Context ...ransmission rate according to some rule. These algorithms essentially differ in the particular choices of link controls and the type of feedback provided to the source by the network. References [6], =-=[15]-=-, [17] describe distributed algorithms of this type. However, these algorithms required synchronization, which is difficult to achieve. Mosley in [23] suggested an asynchronous algorithm for distribut... |

14 |
Asynchronous distributed flow control algorithms
- Mosley
- 1984
(Show Context)
Citation Context ... this work is based on the cooperation between the sources and the network in sustaining an acceptable network load from the standpoint of fairness and efficiency. This approach is similar to that of =-=[23]-=- and [26]. The problem of load allocation is twofold - the sources must be able to determine their optimal load, and the network must ensure that even if all sources operate at their optimal rates, th... |

11 |
A stop-and-go queuing framework for congestion management
- Golestani
- 1990
(Show Context)
Citation Context ...e is a vast amount of work addressing the issue of preserving feasible user rates under various assumptions on the underlying service discipline and the shape of source traffic. (see for example [3], =-=[11]-=-, [12], [14], [25]). This thesis addresses the first problem, i.e. how to determine the set of optimal rates in a distributed network under dynamic changes in the absence of centralized knowledge abou... |

11 | A decentralized, “optimal”, multiple-user, flow control algorithm - Jaffe - 1980 |

10 | e, \Bottleneck Flow Control - Ja |

9 |
Myths About Congestion Management
- Jain
- 1990
(Show Context)
Citation Context ...es versus closed-loop control schemes. The large propagation delay to packet transmission time ratio in the modern high-speed networks poses a significant challenge for any end-to-end feedback scheme =-=[21]-=-, [24], [25]. As a result, a number of open-loop alternatives like prior reservation and switch-based controls have been suggested. Prior reservation schemes are generally considered to be suitable fo... |

8 | On packet switches with in nite storage - Nagle - 1987 |

5 | A Unified Theory of Flow Control and Routing in Data Communication Networks - Golestani - 1980 |

2 |
The Integration of Routing and Flow Control for Voice and Data
- Gafni
- 1982
(Show Context)
Citation Context ...wed transmission rate according to some rule. These algorithms essentially differ in the particular choices of link controls and the type of feedback provided to the source by the network. References =-=[6]-=-, [15], [17] describe distributed algorithms of this type. However, these algorithms required synchronization, which is difficult to achieve. Mosley in [23] suggested an asynchronous algorithm for dis... |

2 | Congestion Free Real-Time Traffic in Packet Networks - Golestaani - 1990 |

2 | Gigabit Networking, ch - Partridge - 1993 |

1 | A Uni ed Theory of Flow Control and Routing on Data Communication Networks - Golestani - 1980 |

1 | Congestion Free Real-Time Tra c in Packet Networks - Golestaani - 1990 |

1 | A Decentralized Optimal Multiple-User Flow Control Algorithm - Ja, J - 1981 |