On the Benefits of Multipath Routing for Distributed Data-Intensive Applications with High Bandwidth Requirements and Multidomain Reach

Authors:
Xiaomin Chen;Mohit Chamania;Admela Jukan;André C. Drummond;Nelson L. S. da Fonseca
Affiliations:
-;-;-;-;-
Venue:
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Year:
2009

Citing 7
Cited 0

Optimized k-shortest-paths algorithm for facility restoration

Software—Practice & Experience
Analysis of multi-path routing

IEEE/ACM Transactions on Networking (TON)
Analysis of Topology Aggregation techniques for QoS routing

ACM Computing Surveys (CSUR)
Multipath routing algorithms for congestion minimization

IEEE/ACM Transactions on Networking (TON)
Reliable multipath provisioning for high-capacity backbone mesh networks

IEEE/ACM Transactions on Networking (TON)
The OptIPuter: high-performance, QoS-guaranteed network service for emerging E-science applications

IEEE Communications Magazine
Carrier ethernet

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate and quantify the benefits of multipath routing in a wide-area distributed environment which includes inter-domain routing issues. In this context, we discuss two possible multipath routing schemes and focus on the viable solution for distributed data-intensive applications with high bandwidth and delay requirements. The network topology aggregation is extended for end-to-end multipath computation. An ILP-based algorithm and a heuristic algorithm are proposed with multiple constraints, including bandwidth, delay and memory size. Numerical and simulation results show that the proposed multipath routing algorithms are feasible, and especially well-suited for emerging applications with extremely high bandwidth requirements.