Improving multipath reliability in topology-aware overlay networks

Use of multiple paths between node pairs can enable an overlay network to bypass Internet link failures. Selecting high quality primary and backup paths is challenging, however. To maximize communication reliability, an overlay multipath routing protocol must account for both the failure probability of a single path and link sharing among multiple paths. We propose a practical solution that exploits physical topology information and end-to-end path quality measurement results to select high quality path pairs. Simulation results show the proposed approach is effective in achieving higher multipath reliability in overlay networks at reasonable communication cost.

[1]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Randy H. Katz,et al.  Backup path allocation based on a correlated link failure probability model in overlay networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[3]  Jeffrey Considine,et al.  Informed content delivery across adaptive overlay networks , 2002, IEEE/ACM Transactions on Networking.

[4]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Philip K. McKinley,et al.  On the cost-quality tradeoff in topology-aware overlay path probing , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[6]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[7]  Sonia Fahmy,et al.  Topology-aware overlay networks for group communication , 2002, NOSSDAV '02.

[8]  Hari Balakrishnan,et al.  Best-path vs. multi-path overlay routing , 2003, IMC '03.

[9]  Ben Y. Zhao,et al.  Exploiting routing redundancy via structured peer-to-peer overlays , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[10]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[11]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[12]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[13]  Aravind Srinivasan,et al.  Resilient multicast using overlays , 2003, IEEE/ACM Transactions on Networking.

[14]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[15]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[16]  Chunming Qiao,et al.  On finding disjoint paths in single and dual link cost networks , 2004, IEEE INFOCOM 2004.

[17]  Farnam Jahanian,et al.  Impact of path diversity on multi-homed and overlay networks , 2004, International Conference on Dependable Systems and Networks, 2004.

[18]  Helen J. Wang,et al.  Server-based inference of Internet link lossiness , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Renata Teixeira,et al.  General Terms Measurement , 2022 .