| | |
Summary: Approximation Algorithms For Multipath Setup
Tricha Anjali
Department of Electrical and Computer Engineering
Illinois Institute of Technology
Chicago, Illinois 60616
Email: tricha@ece.iit.edu
Gruia Calinescu and Sanjiv Kapoor
Department of Computer Science
Illinois Institute of Technology
Chicago, Illinois 60616
Email: {calinescu, kapoor}@iit.edu
Supported in part by NSF Grant grant CCF-0515088
Abstract-- It is desirable to allow packets with the same source
and destination to take more than one possible path. This facility
can be used to ease congestion and overcome node failures. One
approach toward deploying multipath routing in the networks is
by creating virtual paths, e.g. using MPLS. There are however
costs associated with establishing and maintaining such virtual
connections. In this paper, we present the formulation and an
approximate solution for the problem of modeling, creation and
|
