A General Theory of Constrained Max-Min Rate Allocation for Multicast Networks

Authors:
Affiliations:
Venue:
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Year:
2000

Citing 0
Cited 2

Stabilization of Max-Min Fair Networks without Per-flow State

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Stabilization of max-min fair networks without per-flow state

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a general theory of network max-min rate assignment as a lexicographic optimization. The model includes multicast and lower bound constraints. The model for multicast allows the sender to send at the maximum rate allowed by the network and the receivers. Equivalent optimality conditions, especially those that can be coded into practical algorithms, are derived. A reference parallel algorithm is also derived. The theoretical results clearly show the important role of the advertised rates in automatable optimality conditions. The theory also shows that, once the single-link problem is solved, the multi-link (network) problem can be simply solved by recursively applying the algorithm for single-link problem.