Dynamic set of paths for localized QoS routing with bandwidth-constraint

Abstract

The requirement for quality of network such as bandwidth, the value of delay time or packet loss is more and more sophisticated and popular in providing new services. Beside the traditional QoS routing algorithms which use global state information, the types of routing algorithms, which use localized information collected from source node to route, have recently been researched as an alternative to the QoS routing algorithms. By this localized QoS routing, each router predetermines and maintains a set of candidate paths for each destination. This set of paths will help the source node to decide the path for a connection request. Hence, it helps to avoid the problems associated with the maintenance of the global network state information. This paper studies the types of set of paths and proposes the dynamic set of paths. From that, we imply that type of path set may affect the operation of localized QoS routing and that the dynamic path set will help load balancing better in the whole network. Besides, in this paper, we also propose a novel localized bandwidth-constraint QoS routing scheme which uses both static set and dynamic set of paths in the simulation performances. The results of performances show the more considerable work of dynamic set of paths for localized QoS routing.