Results 1 
7 of
7
Distributed Algorithms for Optimal Rate Allocation of Multipath Traffic Flows”, Submitted for publication
, 2003
"... We address the question of optimal rate allocation for multipath unicast traffic, with the objective of maximizing the total system utility. First, we consider the problem where the set of paths (routes) between each flow is predetermined, and show how the optimal rates on these paths can be compute ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We address the question of optimal rate allocation for multipath unicast traffic, with the objective of maximizing the total system utility. First, we consider the problem where the set of paths (routes) between each flow is predetermined, and show how the optimal rates on these paths can be computed. We then consider the problem where the paths are not predetermined, and present an approach that finds the optimal paths as well as the optimal rates on these paths. For both the problems, the algorithms that we develop are completely decentralized, computationally simple, and have a low communication overhead. We demonstrate, through analysis and simulation, that our algorithms converge and attain the maximum system utility. 1
unknown title
, 2007
"... This article was published in an Elsevier journal. The attached copy is furnished to the author for noncommercial research and education use, including for instruction at the author’s institution, sharing with colleagues and providing to institution administration. Other uses, including reproductio ..."
Abstract
 Add to MetaCart
This article was published in an Elsevier journal. The attached copy is furnished to the author for noncommercial research and education use, including for instruction at the author’s institution, sharing with colleagues and providing to institution administration. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier’s archiving and manuscript policies are encouraged to visit:
Applicationlayer Multipath Data Transfer via TCP: Schemes and Performance Tradeoffs
"... For applications involving data transmission from multiple sources, an important problem is: when sources are allowed to use multiple paths, how does one select paths and control the sending rates on the paths to maximize the aggregate sending rate of the sources? We consider this problem in the con ..."
Abstract
 Add to MetaCart
For applications involving data transmission from multiple sources, an important problem is: when sources are allowed to use multiple paths, how does one select paths and control the sending rates on the paths to maximize the aggregate sending rate of the sources? We consider this problem in the context of an overlay network by allowing a source to send data over k (k ≥ 1) overlay paths to its destination. This problem is NPhard, and we develop an iterative distributed heuristic to solve it. In each iteration, we first select paths and then control the sending rates on the multiple paths to maximize the aggregate sending rate of the sources. For rate control, we develop an applicationlevel multipath rate controller via TCP. This controller is easy to deploy and maximizes the aggregate sending rate of the sources in certain settings. To the best of our knowledge, this is the first distributed applicationlevel controller with such an optimality property. For path selection, we prove that the problem of optimal overlay path selection is NPhard and propose randomized pathselection algorithms. Our performance evaluation demonstrates that our iterative heuristic performs very well in a wide range of settings. Furthermore, a small number of paths, 2 to 4, and a small amount of extra bandwidth in the network are sufficient to realize most of the performance gains.
Optimal flow control and routing in multipath networks �
"... 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 sa ..."
Abstract
 Add to MetaCart
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 sourcebased mechanism in which no link algorithm nor feedback is needed. We present numerical examples to illustrate their behavior.
Multipath Overlay Data Transfer
"... Abstract — For applications involving data transmission from multiple sources, an important problem is: when the sources use multiple paths, how to maximize the aggregate sending rate of the sources using applicationlayer techniques via TCP? We solve this problem in the context of an overlay networ ..."
Abstract
 Add to MetaCart
Abstract — For applications involving data transmission from multiple sources, an important problem is: when the sources use multiple paths, how to maximize the aggregate sending rate of the sources using applicationlayer techniques via TCP? We solve this problem in the context of an overlay network by allowing a source to send data over k (k ≥ 1) overlay paths to its destination. Our goal is to select the overlay paths for each source and control the sending rate on each path via TCP to maximize the aggregate sending rate of the sources. We prove that optimal path selection is NPhard and develop two practical applicationlevel multipath rate controllers that use TCP. Our performance evaluation demonstrate that very simple pathselection and ratecontrol algorithms perform reasonably well in a wide range of settings. Furthermore, a small number of overlay paths for a source and a small amount of extra bandwidth in the network are sufficient to realize most of the performance gains. I.
Distributed Applicationlayer Rate Control for Efficient Multipath Data Transfer via TCP
"... Abstract — For applications involving data transmission from multiple sources, an important problem is: when the sources use multiple paths, how to maximize the aggregate sending rate of the sources using applicationlayer techniques via TCP? We develop an applicationlevel distributed rate controll ..."
Abstract
 Add to MetaCart
Abstract — For applications involving data transmission from multiple sources, an important problem is: when the sources use multiple paths, how to maximize the aggregate sending rate of the sources using applicationlayer techniques via TCP? We develop an applicationlevel distributed rate controller to solve this problem. Our controller utilizes the bandwidth probing mechanisms embedded in TCP and does not require explicit network knowledge (e.g., topology, available bandwidth). We theoretically prove the convergence of our algorithm in certain settings. Furthermore, using a combination of simulation and testbed experiments, we demonstrate that our algorithm provides efficient multipath data transfer and is easy to deploy. I.