CaltechAUTHORS
  A Caltech Library Service

Optimal flow control and routing in multi-path networks

Wang, Wei-Hua and Palaniswami, Marimuthu and Low, Steven H. (2003) Optimal flow control and routing in multi-path networks. Performance Evaluation, 52 (2-3). pp. 119-132. ISSN 0166-5316. doi:10.1016/S0166-5316(02)00176-1. https://resolver.caltech.edu/CaltechAUTHORS:20170810-112123357

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170810-112123357

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.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1016/S0166-5316(02)00176-1DOIArticle
http://www.sciencedirect.com/science/article/pii/S0166531602001761PublisherArticle
ORCID:
AuthorORCID
Low, Steven H.0000-0001-6476-3048
Additional Information:© 2002 Elsevier Science B.V. Available online 7 January 2003. An earlier version of this paper was presented at the Internet Performance and Control of Network Systems Conference, R.D. van der Mei, F. Huebner-Szaba de Bucs (Eds.), Proceedings of SPIE, vol. 4523, Denver, CO, 21–22 August 2001, The International Society for Optical Engineering. This work was supported by the Australian Research Council through grant A49930405. The authors are very grateful to the anonymous reviewers for their valuable suggestions on and corrections of the manuscript.
Funders:
Funding AgencyGrant Number
Australian Research CouncilA49930405
Subject Keywords:Optimal flow control; Multiple paths network; Optimization; Minimum first derivative path
Issue or Number:2-3
DOI:10.1016/S0166-5316(02)00176-1
Record Number:CaltechAUTHORS:20170810-112123357
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170810-112123357
Official Citation:Wei-Hua Wang, Marimuthu Palaniswami, Steven H. Low, Optimal flow control and routing in multi-path networks, Performance Evaluation, Volume 52, Issues 2–3, April 2003, Pages 119-132, ISSN 0166-5316, https://doi.org/10.1016/S0166-5316(02)00176-1. (http://www.sciencedirect.com/science/article/pii/S0166531602001761)
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:80114
Collection:CaltechAUTHORS
Deposited By: Linqi Guo
Deposited On:11 Aug 2017 23:20
Last Modified:15 Nov 2021 17:52

Repository Staff Only: item control page