@inproceedings{146ad7e5fefc4b849ef6f80d16df72d4,
title = "Multi-Path Routing for Maximum Bandwidth with K Edge-Disjoint Paths",
abstract = "Multi-path routing has been increasingly used to improve aggregate bandwidth for big data transfer in various network environments. Typical solutions to this problem include a path set with the largest total bandwidth and the widest path pair. In this paper, we formulate a multi-path routing problem to maximize the total bandwidth of k edge-disjoint paths, where k > 1. We show this problem to be NP-complete and propose a heuristic algorithm with focus on global optimization. We implement the proposed algorithm and evaluate its performance in comparison with existing solutions in the literature. Extensive simulation results illustrate the superiority of the proposed algorithm in terms of aggregate bandwidth and satisfaction of edge count constraint.",
keywords = "Edge-disjoint paths, QoS, maximum bandwidth, path bandwidth",
author = "Tao Wang and Wu, {Chase Q.} and Yongqiang Wang and Aiqin Hou and Huiyan Cao",
note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 14th International Wireless Communications and Mobile Computing Conference, IWCMC 2018 ; Conference date: 25-06-2018 Through 29-06-2018",
year = "2018",
month = aug,
day = "28",
doi = "10.1109/IWCMC.2018.8450413",
language = "English (US)",
isbn = "9781538620700",
series = "2018 14th International Wireless Communications and Mobile Computing Conference, IWCMC 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1178--1183",
booktitle = "2018 14th International Wireless Communications and Mobile Computing Conference, IWCMC 2018",
address = "United States",
}