New algorithm for QoS routing in communication networks

摘要

Quality of service (QoS) 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. The network in this technique is inferred by the source nodes using statistics which is collected locally. This paper presents new localized routing algorithm called Highest Minimum Bandwidth routing (HMB), which serves to avoid the issues associated with the existing localized QoS routing techniques and so generate better performance. The selection of disjoint paths and recalculation of the set of candidate paths were used in our new algorithm and also applied on the existing algorithm CBR. These methodologies were found to decrease the blocking probability.