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.
Chapter PDF
Similar content being viewed by others
References
Nelakuditi, S., Zhang, Z.-L., Du, D.H.C.: On Selection of Candidate Paths for Proportional Routing. Computer Networks 44, 79–102 (2004)
Nelakuditi, S., Zhang, Z.-L.: On Selection of Paths for Multipath Routing. In: Wolf, L., Hutchinson, D.A., Steinmetz, R. (eds.) IWQoS 2001. LNCS, vol. 2092, pp. 170–184. Springer, Heidelberg (2001)
Lee, K., Toguyeni, A., Noce, A., Rahmani, A.: Comparison of Multipath Algorithms for Load Balancing in a MPLS Network. In: Kim, C. (ed.) ICOIN 2005. LNCS, vol. 3391, pp. 463–470. Springer, Heidelberg (2005)
Song, J., Kim, S., Lee, M.: Dynamic Load Distribution in MPLS Networks. In: Kahng, H.-K. (ed.) ICOIN 2003. LNCS, vol. 2662, pp. 989–999. Springer, Heidelberg (2003)
Moy, J.: OSPF Version 2, RFC 2328. Internet Engineering Task Force (1998), http://www.ietf.org/rfc/rfc2328.txt
Villamizar, C.: MPLS Optimized Multipath (MPLS-OMP). Work in Progress Internet-Draft (1999), draft-villamizar-mpls-omp-01
Elwalid, A., Jin, C., Low, S., Widjaja, I.: MATE: MPLS Adaptive Traffic Engineering. In: Proceedings of INFOCOM 2001, Alaska (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Zhu, S., Zhang, Z., Zhuang, X. (2007). Modified Widest Disjoint Paths Algorithm for Multipath Routing. In: Li, K., Jesshope, C., Jin, H., Gaudiot, JL. (eds) Network and Parallel Computing. NPC 2007. Lecture Notes in Computer Science, vol 4672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74784-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-74784-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74783-3
Online ISBN: 978-3-540-74784-0
eBook Packages: Computer ScienceComputer Science (R0)