Novel localized QoS routing algorithms

Quality of service routing has recently been improved by using localized routing rather than global state information. The traditional global method is associated with many problems which are avoided by using the Localized Quality of Service (QoS) routing, where the source nodes using statistics which is collected locally. Three new localized routing algorithms called Highest Minimum Bandwidth routing (HMB), Best Reserved Bandwidth routing (BRB) and Highest Link Average Bandwidth History (HLABH) are introduced in this paper. The selection of disjoint paths and recalculation of the set of candidate paths were used in our new algorithms and also applied on the existing algorithm Credit Based Routing (CBR). The new algorithms are compared under different traffic loads and network topologies to the existing localized QoS routing algorithm CBR, and show better performance without undue increase in complexity. Novel algorithms act perfectly using residual bandwidth as a path selection metric, were found to decrease the blocking probability.