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

Tao Wang, Chase Q. Wu, Yongqiang Wang, Aiqin Hou, Huiyan Cao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2018 14th International Wireless Communications and Mobile Computing Conference, IWCMC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1178-1183
Number of pages6
ISBN (Print)9781538620700
DOIs
StatePublished - Aug 28 2018
Event14th International Wireless Communications and Mobile Computing Conference, IWCMC 2018 - Limassol, Cyprus
Duration: Jun 25 2018Jun 29 2018

Publication series

Name2018 14th International Wireless Communications and Mobile Computing Conference, IWCMC 2018

Other

Other14th International Wireless Communications and Mobile Computing Conference, IWCMC 2018
Country/TerritoryCyprus
CityLimassol
Period6/25/186/29/18

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Energy Engineering and Power Technology
  • Control and Optimization

Keywords

  • Edge-disjoint paths
  • QoS
  • maximum bandwidth
  • path bandwidth

Fingerprint

Dive into the research topics of 'Multi-Path Routing for Maximum Bandwidth with K Edge-Disjoint Paths'. Together they form a unique fingerprint.

Cite this