Browse > Article

A Centralized QoS Routing Architecture with No Dynamic Network State Information Exchange Overhead  

Kim, Sung-Ha (Dept.of Computer, Ewah Wonan's University)
Lee, Mee-Jeong (Dept.of Computer, Ewah Wonan's University)
Abstract
We propose centralized server based QoS routing schemes, where a route server is responsible for determining QoS paths on behalf of all the routers in a routing domain. In the proposed server based schemes, the dynamic link QoS state information, which is required for a QoS path computation, is implicitly maintained at route server as it assigns or gets back QoS paths. By maintaining the network state information this way, we may not only eliminate the overhead to exchange network state update message but also achieve higher routing performance by utilizing accurate network state information in path computation. We discuss path caching techniques for reducing the amount of path computation overhead at the route server, and evaluate the performance of the proposed schemes using simulation. The simulation results show that the path caching schemes may significantly reduce the route server load. The proposed schemes are also compared to the distributed QoS routing schemes proposed in the literature. It has been shown that the proposed server based schemes not only enhance the routing performance, but they are also competitive with respect to routing overheads.
Keywords
QoS; QoS routing; server based architecture; caching; dynamic network state update;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Server based QoS Routing /
[ G.Apostolopoulos;R.Guerin;S.Kamat;S.K.Tripathi ] / IEEE GLOBECOM 1999
2 R. Guerin, A. Orda, D. Williams, 'QoS Routing Mechanisms and OSPF Extensions,' IEEE GLOBECOM 1997   DOI
3 J.-Y. Le Boudec, T. Przygienda, 'A Route Precomputation Algorithm for Integrated Services Networks,' Journal of Networks and Systems Management, vol. 3, no. 4, pages 427-449, 1995   DOI
4 A. Shaikh, J. Rexford, K. Shin, 'Efficient Precomputation of Quality-of-Service Routes,' Proceedings Workshop on Network and Operating Systems Support for Digital Audio and Video 1998
5 Q. Ma, P. Steenkiste, 'On Path Selection for Traffic with Bandwidth Guaratees,' IEEE ICNP 1997, 1997   DOI
6 G. Apostolopoulos, S. K. Tripathi, 'On the Effectiveness of Path Pre-Computation in Reducing the Processing Cost of On-Demand Qos Path Computation,' IEEE INFOCOM 1998
7 R. Yavatkar, D. Pendarakis, R. Guerin, 'A Framework for Policy-based Admission Control,' IEEE RFC 2753, 2000
8 M. Peyravian, A. D. Kshemkalyani, 'Network Path Caching: Issues, Algorithms, and a Simulation Study,' Computer Communications, vol. 20, pages 605-614, 1997   DOI   ScienceOn
9 G. Apostolopoulos, R. Guerin, S. Kamat, S. K. Tripathi, 'On Reducing the Processing Cost of On-Demand QoS Path Computation,' Journal of High Speed Networking
10 A. Shaikh, J. Rexford, K. Shin, 'Dynamics of qulity-of-service routing with inaccurate link-state information,' University of Michigan Technical Report CSE-TR-350-97, 1998
11 G. Apostolopoulos, R. Guerin, S. Kamat, S. K. Tripathi, 'QoS Routing : A Performance Perspective,' ACM SIGCOMM 1998
12 G. Apostolopoulos, R. Guerin, S. Kamat, S. K. Tripathi, 'Server based QoS Routing,' IEEE GLOBECOM 1999   DOI
13 J. Boyle, R. Cohen, D. Durham, S. Herzog, R. Rajan, A. Sastry, 'The COPS(Common Open Policy Service) Protocol,' IEEE RFC 2748, 2000
14 S. Herzog, 'RSVP Extensions for Policy Control,' IEEE RFC 2750, 2000