TY - GEN

T1 - Modified widest disjoint paths algorithm for multipath routing

AU - Zhu, Shangming

AU - Zhang, Zhili

AU - Zhuang, Xinhua

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

KW - Candidate path

KW - Multipath routing

KW - Widest disjoint paths

KW - Width of path set

UR - http://www.scopus.com/inward/record.url?scp=38149066039&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149066039&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38149066039

SN - 9783540747833

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 212

EP - 219

BT - Network and Parallel Computing - IFIP International Conference, NPC 2007, Proceedings

T2 - 2007 IFIP International Conference on Network and Parallel Computing, NPC 2007

Y2 - 18 September 2007 through 21 September 2007

ER -