QoS-Satisfied Dynamic Routing Based on Overlay Service Network

In recent years, overlay networks have emerged as an approach to provide a general framework for new applications and services to be implemented without significant changes in the IP-layer network infrastructure. Overlay Service Network (OSN) is a unified framework which acts as a top layer over the IP-layer network and makes overlay routing feasible. This paper mainly focuses on designing a QoS-satisfied dynamic overlay routing protocol based on OSN framework. While satisfying the QoS requirements, being a dynamic routing protocol enhances the reliability and performance of the routing. So the proposed algorithm not only satisfies the application QoS requirements, but also improves the routing performance. The goals are: (1) to discover an overlay path which fulfills the QoS requirements, as well as (2) balancing the computational capacity of the resources and at the same time, (3) enhance the performance of the overlay network. To achieve these goals, we propose a path selection algorithm called Modified Least-Cost Path (MLCP) algorithm. Our simulation experiments have shown that the proposed algorithm performs well in achieving QoS-satisfied overlay routing while maintaining the performance.

[1]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[2]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[3]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[4]  David Watson,et al.  Enhancing end-to-end availability and performance via topology-aware overlay networks , 2008, Comput. Networks.

[5]  Anees Shaikh,et al.  Evaluating the overheads of source-directed quality-of-service routing , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

[6]  Hari Balakrishnan,et al.  Best-path vs. multi-path overlay routing , 2003, IMC '03.

[7]  Prasant Mohapatra,et al.  The impact of topology on overlay routing service , 2004, IEEE INFOCOM 2004.

[8]  Antonio Capone,et al.  Routing and resource optimization in service overlay networks , 2009, Comput. Networks.

[9]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[10]  Filip De Turck,et al.  Dynamic Algorithms to Provide a Robust and Scalable Overlay Routing Service , 2006, ICOIN.

[11]  Prasant Mohapatra,et al.  QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.