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 ...
[PDF] Modified Widest Disjoint Paths Algorithm for Multipath Routing.
dl.ifip.org › npc2007 › ZhuZZ07
Abstract. Widest Disjoint Paths (WDP) algorithm is a promising multipath routing algorithm aimed at selecting good paths for routing a flow between a.
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 ...
Modified Widest Disjoint Paths Algorithm for Multipath Routing Available at TC Walter Library Sci/Eng Books (Level F) (QA76.58 .N73 2007).
Shangming Zhu, Zhili Zhang, Xinhua Zhuang: Modified Widest Disjoint Paths Algorithm for Multipath Routing. NPC 2007: 212-219. manage site settings.
It uses two flow conservation constraints to compute the set of widest disjoint paths. In addition, we propose two heuristics for the WKDPP. The first heuristic ...
Fingerprint. Dive into the research topics of 'Modified widest disjoint paths algorithm for multipath routing'. Together they form a unique fingerprint.
People also ask
What is the maximum number of disjoint paths?
What is multipath routing algorithm in computer networks?
Abstract. Multipath routing schemes distribute traffic among multiple paths in- stead of routing all the traffic along a single path.
Among multipath routing algorithms, we select four algorithms which fit our expectations in terms of architecture: WDP, MATE, multipath-AIMD and LDM. We focused ...
This work proposes a hybrid approach that uses both globally exchanged link state metrics -- to identify a set of good paths, and locally collected path ...