Networking

A Distributed Max-Min Flow Control Algorithm for Multi-Rate Multicast Flows

Free registration required

Executive Summary

The authors present a distributed algorithm to compute bandwidth max-min fair rates in a multi-rate multicast network. The significance of the algorithm, compared to previous algorithms, is that it is more scalable in that it does not require each link to maintain the saturation status of all sessions and virtual sessions travelling through it, more stable in that it converges asymptotically to the desired equilibrium satisfying the minimum plus max-min fairness even in presence of heterogeneous round-trip delays, and has explicit link buffer control in that the buffer occupancy of every bottlenecked link in the network asymptotically converges to the pre-defined value.

  • Format: PDF
  • Size: 553.38 KB