Disjoint Multipath QoS Routing

Abstract

-Disjoint Multipath QoS (quality of service) Routing algorithm is aimed at selecting multiple paths for a flow in a peer to peer network, which are mutually disjoint w.r.t. bottleneck links. The Widest Disjoint Paths (WDP) algorithm [3][4] assumes a static set of available paths for each source-destination pair a priori, from which disjoint paths w.r.t. bottleneck links are selected. The Shortest Widest Path (SWP) algorithm [9] dynamically determines one path for each source-destination pair, which is shortest among widest ones. The proposed Disjoint Multipath QoS Routing algorithm dynamically finds paths mutually disjoint w.r.t. bottleneck links, which are shortest among widest ones. Thus, the algorithm generalizes both WDP and SWP algorithms. In many important multimedia applications such as video over IP in telehealth application, the applicationand network-layer must collaborate in order to provide some necessary QoS guarantee. The network-layer should provide certain level of QoS measures, based on which the application-layer is able to compensate for deficiency of achieved QoS level. Those QoS measures may include end-to-end bandwidth, delay and packet loss rate, etc. The Disjoint Multipath QoS Routing algorithm is designed to achieve certain QoS level the application-layer can easily work with. In this paper, we only deal with the network-layer part and will focus on a scenario of one source and one destination. Simulation results and performance analysis demonstrate that the algorithm converges, offers lower end-to-end packet loss rate and higher throughput in comparison with SWP and Dijkstra Shortest Path algorithm as network traffic grows. Keywords--Disjoint path; Multipath routing; Bottleneck link; Bandwidth; Delay; Packet Loss Rate