24 July 2001 Flow control in networks with multiple paths
Author Affiliations +
Proceedings Volume 4523, Internet Performance and Control of Network Systems II; (2001) https://doi.org/10.1117/12.434306
Event: ITCom 2001: International Symposium on the Convergence of IT and Communications, 2001, Denver, CO, United States
Abstract
We propose two flow control algorithms for networks with multiple paths between each source-destination pair. Both are distributed algorithms over the network to maximize aggregate source utility. Algorithm 1 is a first order Lagrangian method applied to a modified objective function that has the same optimal solution as the original objective function but has a better convergence property. Algorithm 2 is based on the idea that, at optimality, only paths with the minimum price carry positive flows, and naturally decomposes the overall decision into flow control (determines total transmission rate based on minimum path price) and routing (determines how to split the flow among available paths). Both algorithms can be implemented as simply a source-based mechanism in which no link algorithm nor feedback is needed. We present numerical examples to illustrate their behavior.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Weihua Wang, Weihua Wang, M. Palaniswami, M. Palaniswami, Steven H. Low, Steven H. Low, } "Flow control in networks with multiple paths", Proc. SPIE 4523, Internet Performance and Control of Network Systems II, (24 July 2001); doi: 10.1117/12.434306; https://doi.org/10.1117/12.434306
PROCEEDINGS
12 PAGES


SHARE
Back to Top