Download Now Free registration required
Most of the QoS routing mechanisms involve periodic exchange of global state information which causes communication overheads. Therefore, localized routing is the method to avoid this problem. The network in this technique is inferred by the source nodes using statistics which are collected locally. This paper presents new localized algorithm Highest Minimum Bandwidth routing algorithm (HMB). The new algorithm is compared to the existing localized Credit Based Routing (CBR) and the global WSP routing algorithm. The selection of disjoint paths and recalculation of the set of candidate paths were also introduced. There also was shown positive effect of dynamic path selection method on the performance of localized routing algorithm.
- Format: PDF
- Size: 372.67 KB