TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
The impact of multicast layering on network fairness
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Random Early Marking: An Optimization Approach to Internet Congestion Control
ICON '99 Proceedings of the 7th IEEE International Conference on Networks
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
On max-min fair congestion control for multicast ABR service in ATM
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider the problem of designing decentralized algorithms to achieve max-min fairness in multicast networks. Starting with a convex program formulation, we show that there exists an algorithm to compute the fairshare at each link using only the total arrival rate at each link. Further this information can be conveyed to the multicast receivers using a simple marking mechanism. The mechanisms required to implement the algorithm at the routers have low complexity since they do not require any per-flow information.