Modified widest disjoint paths algorithm for multipath routing

Shangming Zhu, Zhili Zhang, Xinhua Zhuang

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

3 Scopus citations

Abstract

Widest Disjoint Paths (WDP) algorithm is a promising multipath routing algorithm aimed at selecting good paths for routing a flow between a source-destination pair, where their bottleneck links are mutually disjoint. Nevertheless, the complexity of WDP algorithm is relatively high due to the fact that the good path selection process considers all available paths. To reduce its complexity, This paper proposes a modified WDP algorithm, which uses only a subset of available paths based on shortest widest paths, thereby limiting the number of candidate paths considered. As a result, the number of iterations in the good path selection process is significantly reduced. Performance analysis shows the modified scheme is more efficient than the original algorithm in a large network. Simulation results demonstrate that, in comparison with the original WDP algorithm, the modified WDP algorithm leads to lower latency and faster packets transferring process as the number of available paths increases.

Original languageEnglish (US)
Title of host publicationNetwork and Parallel Computing - IFIP International Conference, NPC 2007, Proceedings
Pages212-219
Number of pages8
StatePublished - Dec 1 2007
Event2007 IFIP International Conference on Network and Parallel Computing, NPC 2007 - Dalian, China
Duration: Sep 18 2007Sep 21 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4672 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2007 IFIP International Conference on Network and Parallel Computing, NPC 2007
CountryChina
CityDalian
Period9/18/079/21/07

Keywords

  • Candidate path
  • Multipath routing
  • Widest disjoint paths
  • Width of path set

Fingerprint Dive into the research topics of 'Modified widest disjoint paths algorithm for multipath routing'. Together they form a unique fingerprint.

Cite this