Multi-Path Routing for Maximum Bandwidth with K Edge-Disjoint Paths

Document Type

Conference Proceeding

Publication Date

8-28-2018

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.

Identifier

85053914959 (Scopus)

ISBN

[9781538620700]

Publication Title

2018 14th International Wireless Communications and Mobile Computing Conference Iwcmc 2018

External Full Text Location

https://doi.org/10.1109/IWCMC.2018.8450413

First Page

1178

Last Page

1183

Grant

2017YFB1300301

Fund Ref

Northwest University

This document is currently not available here.

Share

COinS