Price of Path Diversity : in Practice and in Theory

Recent research [17,26] suggests that path diversity, in which end systems choose from a set of network-constructed paths, can achieve much of the benefit of source routing such as improved reliability, but avoids its scaling and policy issues. This work examines a less explored performance aspect of path diversity: end-to-end throughput. When an end system can access a diverse set of paths, it may use all or a subset of the paths to improve its throughput. Unfortunately, using both realistic simulations as well as a theoretic optimization framework, we discover that when all nodes can use multiple paths to send their traffic, the all-pair throughput of the network may decrease significantly (e.g., up to 50% in some cases). A main reason is that traffic sent along paths longer than the shortest paths consume more network resources than necessary. From this study, we suggest three areas of future work to reduce the downside of path diversity: 1) better path construction schemes, 2) more efficient multi-path resource allocation, and 3) a more practical optimization framework that can guide the design of multi-path resource allocation.

[1]  Santosh S. Vempala,et al.  Path splicing , 2008, SIGCOMM '08.

[2]  Laurent Massoulié,et al.  Control of communication networks: welfare maximization and multipath transfers , 2008, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[3]  Anees Shaikh,et al.  On the Performance Benefits of Multihoming Route Control , 2008, IEEE/ACM Transactions on Networking.

[4]  Mung Chiang,et al.  Rethinking internet traffic management: from multiple decompositions to a practical protocol , 2007, CoNEXT '07.

[5]  Arun Venkataramani,et al.  A Multipath Background Network Architecture , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[6]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[7]  J. Rexford,et al.  MIRO: multi-path interdomain routing , 2006, SIGCOMM.

[8]  Xiaowei Yang,et al.  Source selectable path diversity via routing deflections , 2006, SIGCOMM.

[9]  Ness B. Shroff,et al.  Utility maximization for communication networks with multipath routing , 2006, IEEE Transactions on Automatic Control.

[10]  Yin Zhang,et al.  On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.

[11]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

[12]  Radia J. Perlman,et al.  Routing with Byzantine robustness , 2005 .

[13]  Derong Liu The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

[14]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[15]  Krishna P. Gummadi,et al.  Improving the Reliability of Internet Paths with One-hop Source Routing , 2004, OSDI.

[16]  Ming Zhang,et al.  Proceedings of the General Track: 2004 USENIX Annual Technical Conference , 2022 .

[17]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[18]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[19]  Raghupathy Sivakumar,et al.  pTCP: an end-to-end transport layer protocol for striped connections , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[20]  D. Andersen,et al.  Resilient overlay networks , 2002, CCRV.

[21]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[22]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[23]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[24]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .