Network Performance Analysis of an Adaptive OSPF Routing Strategy - Effective Bandwidth Estimation

Currently Open Shortest Path First (OSPF) is the most commonly used and promising intra-domain internet routing protocol where packets are routed along shortest paths to the destination. The shortest path computation is based on some static link costs and the change of the paths only happens when existing link components become unreachable or when new link components are added. In other words, the network congestion doesn't affect the routing decisions and, as a consequence, alternative paths, which could result in a better traffic performance, remain unused. This paper introduces and analyzes an adaptive OSPF routing strategy based on effective bandwidth estimation. Simulations carried out in the OPNET network simulator showed some preliminary, interesting results. Better network throughput (sometimes until 25,673 % better) can be reached using this adaptive routing other than the traditional OSPF, sacrificing an increase in network delay.

[1]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[2]  K. S. Vastola,et al.  The Tunability Of Network Routing Using Online Simulation , 2000 .

[3]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM '89.

[4]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[6]  Craig Hunt.  TCP/IP Network Administration , 1992 .

[7]  Carl Tropper,et al.  A new metric for dynamic routing algorithms , 1990, IEEE Trans. Commun..

[8]  Lee Luan Ling,et al.  Estudo de caracterização de trafego e alocação de banda para redes ATM , 1999 .

[9]  Jean C. Walrand,et al.  Effective bandwidths for multiclass Markov fluids and other ATM sources , 1993, TNET.

[10]  Ilkka Norros,et al.  On the Use of Fractional Brownian Motion in the Theory of Connectionless Networks , 1995, IEEE J. Sel. Areas Commun..

[11]  Lee Luan Ling,et al.  Data traffic characterization in corporate environment , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).