Name
Abstract | ||
|---|---|---|
End-to-end rate baaed congestion management has been extensively studied for control of computer commmdcation networks. In tlds paper, we examine some of the properties of end-to-end rate based algorithms for congestion management using explicit rate feedback, to achieve maxmin fair rate allo- cation in the network. We formutate a requirement on a switch's locat rate allocation computation sufficient to ensure convergence of the distributed algorithm to the globat maxmin fair rate allocation. We provide an upper bound on the convergence time when the switch algorithm satisfies this requirement. We propose a reqtdrement of feasibility of the tmnsmicsion mtea, maintaining which results in oscillation-free operation of the algorithm while maintaining smalt queues at the switches. Feasibility implies that the capacity of any of the resources is not exceeded at any time. We suggest a source policy to ensure feasibility of transmission rates, the essence of which is to delay a rate increase by a certain time, while decreasing the transmission mte immediately upon receiving the appropriate feedback. Finally, we seek ways of improving scalability of the computation of maxmin fair mtea in the presence of a large number of flows. We suggest using a discrete set of mtes, which as we show, reduces the computational complexity and the state requirement at the switches. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/90.532866 | IEEE/ACM Transactions on Networking |
Keywords | DocType | Volume |
explicit rate allocation,time scale analysis scalability,ATM network | Journal | 4 |
Issue | ISSN | Citations |
4 | 1063-6692 | 37 |
PageRank | References | Authors |
75.66 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anna Charny | 1 | 402 | 114.64 |
| K. K. Ramakrishnan | 2 | 4793 | 1087.48 |
| Anthony Lauck | 3 | 58 | 79.59 |