The biggest contemporary drawback in the maintenance and distribution of the global state is the increase in communication overheads. Localized routing is the method to avoid this problem. New localized routing algorithms called Highest Minimum Bandwidth routing (HMB) is introduced in this paper. The new algorithm is compared under different traffic loads and network topologies to the existing localized Credit Based Routing (CBR) and the global WSP routing algorithm. New algorithm shows better performance without undue increase in complexity. The selection of disjoint paths and recalculation of the set of candidate paths, which assist both existing localized routing and our novel algorithm to achieve superior performance, are also described.
['Turki A. AlGhamdi', 'Michael E. Woodward']
Localized QoS Routing Algorithm Based on Residual Bandwidth