A distributed parallel QoS routing algorithm with multi-path probing

The task of quality-of-service (QoS) routing is to find a path in the network that satisfies certain constraints on metrics such as bandwidth, delay, delay jitter and cost. All recently-published QoS routing algorithms consider one or two metrics and most of them require the maintenance of a global network state at each node. This paper is proposed a distributed routing algorithm which require every node to maintain only its local state. The state information of intermediate nodes is collectively used to guide the routing messages along the most appropriate paths in order to maximize the success probability. It not only keeps the merits of simplicity and low link overhead in traditional QoS routing algorithm, but also can reduce resource fragments and admit more services into a network with heavy load.