Novel algorithms for QoS localized routing in communication networks

The biggest contemporary drawback in the maintenance and distribution of the global state is the increase in 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. The main aim of this paper is to present new localized algorithms to avoid some problems associated with the existing localized quality of service routing algorithms and so generate better performance. 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 new algorithms are compared under different traffic loads and network topologies to the existing credit based routing (CBR) localized QoS routing algorithm, and they show better performance without undue increase in complexity.