Ospf patch in ns2

Investigations are performed on basis of average E2E end to end delay, throughput and jitter. In this investigation, convergence time for link failures is calculated. It is observed that network has least average E2E delay when working path does not experience any failure. Under single link failure, average E2E delay is least when failed link is nearest to the source node. Under double link failure, average E2E delay is maximum when failed links are farthest apart. Convergence time for multiple link failure is more than single link failure.

It is observed that convergence is least for failed link immediately connected to the source node. As observed from plots, network achieves high throughput when working path does not experience any failure and throughput reduces for multiple link failures.

Average jitter is maximum for the network without failure and its value reduces for multiple link failures.

The investigations in this paper provide insight into the performance of OSPF routing technique. Analysis performed and values of performance metrics obtained for various link failures provide knowledge of critical links and backup routes with respect to application specific QoS Quality of Service requirements.

Skip to main content. This service is more advanced with JavaScript available. Advertisement Hide. Conference paper First Online: 08 March This is a preview of subscription content, log in to check access. Related Articles.

Computer Network Fundamentals. Physical layer. Data Link layer. Network layer. Transport layer. Application layer. Network Security.

Computer Network Quizes. Table of Contents. Improve Article. Save Article. By Priya Pedamkar. It is a Link-state routing protocol that is used to distribute routing information about data packets within a large Autonomous System.

An autonomous system can be divided into areas; these help in reducing the link state advertisements and other overhead traffic that will be otherwise sent to the network. When it is configured, it listens to its neighbours in the networks, and it gathers all the link state data available.

This data is then used to make a topology map that contains all available paths in the network. This database is saved for use, and we call it Link State Database. OSPF creates 3 tables:. OSPF is the first widely deployed routing protocol.

It can converge with a network in a few seconds, and it is one of the protocols that can provide loop-free paths.