A bandwidth constrained QoS routing algorithm

Most previous work on bandwidth-constrained QoS routing looks for one feasible path that meets a certain bandwidth requirement. Even if multiple paths exist in the network and the combination of these paths satisfies the bandwidth requirement of the QoS request, the inability to find a single path with the required bandwidth results in rejection of the QoS request by these algorithms. In this paper, we propose a new bandwidth constrained QoS routing algorithm that breaks the flow into smaller sub-flows and seeks multi-paths when there is no a single feasible path in the network. The performance of this algorithm is predictable since it always accepts the QoS request as long as there is enough resource between the source node and the destination node. Moreover the finer granularity of the sub-flows improves the network utilization.