@inproceedings{e4712abfca514932abb98b50537762b0,

title = "Modified widest disjoint paths algorithm for multipath routing",

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.",

keywords = "Candidate path, Multipath routing, Widest disjoint paths, Width of path set",

author = "Shangming Zhu and Zhili Zhang and Xinhua Zhuang",

year = "2007",

doi = "10.1007/978-3-540-74784-0_22",

language = "English (US)",

isbn = "9783540747833",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "212--219",

editor = "Keqiu Li and Keqiu Li and Keqiu Li and Chris Jesshope and Chris Jesshope and Chris Jesshope and Hai Jin and Hai Jin and Hai Jin and Jean-Luc Gaudiot and Jean-Luc Gaudiot and Jean-Luc Gaudiot",

booktitle = "Network and Parallel Computing - IFIP International Conference, NPC 2007, Proceedings",

note = "2007 IFIP International Conference on Network and Parallel Computing, NPC 2007 ; Conference date: 18-09-2007 Through 21-09-2007",

}