A distributed multipath algorithm for providing bandwidth guaranteed routing

QoS routing is one of the key technologies to provide guaranteed service in IP networks. In most of the previous works on bandwidth constrained QoS routing, the source looks for one feasible path that satisfies a certain bandwidth requirement. In this scheme, the source blocks the request if it can not find one feasible path although there may be multiple paths such that a combination of these paths satisfies the bandwidth requirement. In this paper, we propose a distributed bandwidth routing that finds multiple paths for a request and divides the required bandwidth between them. Experimental results show that our algorithm has lower call blocking ratio than traditional single-path algorithms.