• Corpus ID: 14271141

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

  title={Network Performance Analysis of an Adaptive OSPF Routing Strategy - Effective Bandwidth Estimation},
  author={Tatiana Brito Pereira and Lee Luan Ling},
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… 
An Adaptive OSPF Routing Strategy-Based on Bandwidth Estimation and a Simulation Platform for Network Performance Analysis
The goal of presenting an adaptive OSPF routing strategy based on bandwidth estimation is presented, with the estimation of effective bandwidths carried out as a function of traffic load and desired quality assists each router in its decision making.
Performance analysis of OSPF and EIGRP routing protocols for greener internetworking
  • Y. Krishnan, G. Shobha
  • Computer Science
    2013 International Conference on Green High Performance Computing (ICGHPC)
  • 2013
Through network simulations it is proved that EIGRP is more CPU intensive than OSPF and hence uses a lot of system power and therefore EIG RP is a greener routing protocol and provides for greener internetworking.
Evaluation of EIGRP and OSPF Routing Protocols for Greener Internetworking
Routing protocol is taking a vital role in the modern internet era. A routing protocol determines how the routers communicate with each other to forward the packets by taking the optimal path to
Impact of Mathematical Optimization on OSPF Routing in WDM Optical Networks
It is observed that EA optimization has a better optimized denser network (COST 239) and ACO has optimized NSF and 4n5e networks better than EA optimization.
Adaptive Traffic Engineering in MPLS and OSPF Networks
Traffic engineering refers to performance optimization of operational networks. One task of traffic engineering is load balancing, the idea of which is to move traffic from congested links to other
Adaptive load balancing with OSPF
An adaptive and distributed algorithm that gradually balances the load by making small changes in the traffic splitting ratios in the routers is proposed that shows that the performance of OSPF-networks can be improved as compared to the equal splitting.
Pengaruh Routing Adaptif OSPF terhadap Penggunaan Bandwidth pada Jaringan Komputer
The result the authors found indicates that the bigger number of router and link on the router, the bigger the bandwidth used in networks while the smaller number of area, the smaller bandwidth using in every area.
Traffic engineering in the Internet : from traffic characterization to load balancing and peer-to-peer file sampling ; Liikenteenhallinta Internetissä: liikenteen karakterisoinnista kuormantasaukseen ja tiedostonjakoon vertaisverkoissa
This thesis proposes an adaptive and distributed algorithm that gradually balances the load by making small changes in the traffic-splitting ratios on the basis of measured link loads and develops optimization algorithms that differentiate traffic classes in terms of mean delay.


Internet traffic engineering by optimizing OSPF weights
  • B. Fortz, M. Thorup
  • Computer Science
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
Surprisingly it turned out that for the proposed AT&T WorldNet backbone, weight settings that performed within a few percent from that of the optimal general routing where the flow for each demand is optimally distributed over all paths between source and destination.
The Revised ARPANET Routing Metric
The ARPANET routing metric was revised in July 1987, resulting in substantial performance improvements, especially in terms of user delay and effective network capacity, and a move away from the strict delay metric.
A new metric for dynamic routing algorithms
A dynamic routing algorithm that has as its goal the control of congestion in a packet switching network is presented, based in part on the ARPANET SPF, but instead of employing a delay metric, the authors make use of a combination of link and buffer utilizations.
The Tunability Of Network Routing Using Online Simulation
Simulation results demonstrate improvement in the end-to-end performance in terms of throughput and round-trip delay and indicate that a stable adaptive link state routing can be achieved by using the online simulation architecture.
The end-to-end effects of Internet path selection
A measurement-based study comparing the performance seen using the "default" path taken in the Internet with the potential performance available using some alternate path, finding that in 30-80% of the cases, there is an alternate path with significantly superior quality.
TCP/IP Network Administration
This new second edition of TCP/IP Network Administration discusses advanced routing protocols (RIPv2, OSPF, and BGP) and the gated software package that implements them and is a command and syntax reference for several important packages, including gated, pppd, named, dhcpd, and sendmail.
Effective bandwidths for multiclass Markov fluids and other ATM sources
The authors show the existence of effective bandwidths for multiclass Markov fluids and other types of sources that are used to model ATM traffic. More precisely, it is shown that when such sources
OSPF Version 2
  • J. Moy
  • Computer Science
  • 1994
This memo documents version 2 of the OSPF protocol. OSPF is a link-state routing protocol. It is designed to be run internal to a single Autonomous System. Each OSPF router maintains an identical
Data traffic characterization in corporate environment
  • F. Perlingeiro, L. Ling
  • Computer Science
    Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042)
  • 1999
The goal of this paper is to present a data traffic characterization method for data networks (LAN, VSAT and Internet), including a new ATM network, in a large company, facilitating design and implementation.
On the Use of Fractional Brownian Motion in the Theory of Connectionless Networks
  • I. Norros
  • Computer Science
    IEEE J. Sel. Areas Commun.
  • 1995
An abstract model for aggregated connectionless traffic, based on the fractional Brownian motion, is presented, and the notion of ideal free traffic is introduced.