Share Email Print
cover

Proceedings Paper

Flow control in networks with multiple paths
Author(s): Weihua Wang; M. Palaniswami; Steven H. Low
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 24 July 2001
PDF: 12 pages
Proc. SPIE 4523, Internet Performance and Control of Network Systems II, (24 July 2001); doi: 10.1117/12.434306
Show Author Affiliations
Weihua Wang, Univ. of Melbourne (Australia)
M. Palaniswami, Univ. of Melbourne (Australia)
Steven H. Low, California Institute of Technology (United States)


Published in SPIE Proceedings Vol. 4523:
Internet Performance and Control of Network Systems II
Robert D. van der Mei; Frank Huebner-Szabo de Bucs, Editor(s)

© SPIE. Terms of Use
Back to Top