6
Simulation of OSPF Routing Protocol Using OPNET Module A Routing Protocol Based on the Link-State Algorithm By: Mehboob Nazim Shehzad (1085) ([email protected]) Najam-Ul-Sahar (1253) ([email protected] ) Department of Computing and Technology Iqra University Islamabad Campus Course Code: Research Methods and Skill (HMT401) Submit To: Dr. Jamil Ahmad Supervisor: Sir Abdul Hannan Introduction: Background Information: Open Shortest Path First (OSPF) protocol was developed due to a need in the internet community to introduce a high functionality non-proprietary Internal Gateway Protocol (IGP) for the TCP/IP protocol family[3]. The discussion of the creation of a common interoperable IGP for the Internet started in 1988 and did not get formalized until 1991.At that time the OSPF Working Group requested that OSPF be considered for advancement to Draft Internet Standard.[3][2].That Project discusses the OSPF terminology, algorithm of the protocol in designing the large and complicated networks of today. Introduction to Project: This Project is a speci cation of the Open Shortest Path First (OSPF) TCP/IP internet routing protocol. OSPF is classier as an

OSPF routing protocol proposal

Embed Size (px)

DESCRIPTION

It is proposal of OSPF routing protocol.

Citation preview

Page 1: OSPF routing protocol proposal

Simulation of OSPF Routing Protocol Using OPNET Module

A Routing Protocol Based on the Link-State Algorithm

By: Mehboob Nazim Shehzad (1085) ([email protected])

Najam-Ul-Sahar (1253) ([email protected])

Department of Computing and Technology

Iqra University Islamabad Campus

Course Code: Research Methods and Skill (HMT401)

Submit To: Dr. Jamil Ahmad

Supervisor: Sir Abdul Hannan

Introduction:

Background Information:

Open Shortest Path First (OSPF) protocol was developed due to a need in the internet community to introduce a high functionality non-proprietary Internal Gateway Protocol (IGP) for the TCP/IP protocol family[3]. The discussion of the creation of a common interoperable IGP for the Internet started in 1988 and did not get formalized until 1991.At that time the OSPF Working Group requested that OSPF be considered for advancement to Draft Internet Standard.[3][2].That Project discusses the OSPF terminology, algorithm of the protocol in designing the large and complicated networks of today.

Introduction to Project:

This Project is a specification of the Open Shortest Path First (OSPF) TCP/IP internet routing protocol. OSPF is classier as an Interior Gateway Protocol (IGP). In addition, much work has been done to produce a protocol that responds quickly to topology changes, yet involves small amounts of routing protocol traffic. When several equal-cost routes to a destination exist, traffic is distributed equally among them. The cost of a route is described by a single dimensionless metric[1].In this Project, set up a network that utilizes OSPF as its routing protocol. We will analyze the routing tables generated in the routers and will observe how the resulting routes are affected by assigning areas and enabling load balancing.

Page 2: OSPF routing protocol proposal

Link State Algorithm :

The OSPF protocol is based on link-state technology, which is a going away from the Bellman-Ford vector (Vector Distance) based algorithms [5].The basic idea behind link-state protocols is very simple, every node knows how to reach its directly connected neighbors, and if we make sure that the totality of this knowledge is disseminated to every node, then every node will have enough knowledge of the network to build a complete map of the network.[5]

Distance-vector Algorithm :

A distance-vector routing protocol requires that a router informs its neighbors of topology changes periodically and, in some cases, when a change is detected in the topology of a network. Compared to link-state protocols, which require a router to inform all the nodes in a network of topology changes, distance-vector routing protocols have less computational complexity and message overhead.[11]

Methodology:

This Project is based on simulation so that simulate in OPNET (Optimized Network Evaluation Tool) Module. In the network just created 8 routers network,all routers belong to one level of hierarchy (i.e., one area.Also we didn’t implement load balancing for any routes. Two new scenarios will be created. The first new scenario will define two new areas in addition to the backbone area.The first one will be configured to balance load for traffic demands between Router A and Router C.Then second one will be configured to balance the load for the traffic demands between Router B and Router H.OPNET router models support a parameter called a reference bandwidth to calculate the actual cost, as follows:

Cost = (Reference bandwidth) / (Link bandwidth)

Objectives:

This research aims to examine the OSPF routing protocol simulation in Link state algorithm.The main objectives of this simulation in OPNET are:

Be able to Define Routing Protocol. Be able to configure the routing protocol scenarios.

Be able to analyze the OSPF routing protocol.

Simulation on OPNET(Optimized Network Evaluation Tool)Module.

Page 3: OSPF routing protocol proposal

We will try to define the routing protocol in term of algorithms because basically two types of algorithms use in network field.First one is Link state and other one is Distance vector algorithm.Then we have done design network in OPNET for simulation.In opnet we have to perform the simulation scenarios.So that all simulation depedns on scenarios.The end of simulation we have to analysis the results in different scenarios.

Resources:

The resource includes Seniors,IEEE journals,data records of the selected firms, internet and books.

Bibliography:

[1] , protocol_OSPF.php. protocolbase.net. [Online] Colasoft Co., Ltd., 11 14, 2005. [Cited: 11 02, 2010.] http://www.protocolbase.net/protocols/protocol_OSPF.php.

[2] T.Moy, john., OSPF Anatomy of an internet Routing Protocol. [ed.] Library of Congress Cataloging-in-Publication Data. 1. Addision-wesley : Jaco way, 1998. p. 331. Computer network protocols.

[3] ll, Thomas .M.Thomas., OSPF Network Design Solutions. 2nd. USA : Cisco Press 201 west 103rd streetindianplis, March 12,2003. p. 768. 2001095162.

[4] community, cisco support., "OSPF Design Guide." [ed.] Cisco. IP Routing, s.l. : Cisco , Aug 10, 2005, Issue 7039, p. 59.

[5] khan, Razurehman., "Computet Communication and Networks/." Course website. [Online] 01 25, 2010. [Cited: 11 03, 2010.] Lectures website for student. http://sites.google.com/site/ccn261.

[6] Thorenoor, S.G., "Dynamic Routing Protocol Implementation Decision between EIGRP, OSPF and RIP Based on Technical Background Using OPNET Modeler ." [ed.] Wipro Technol. Bangkok : Bangalore,India, April 23-25,2010. Computer and Network Technology (ICCNT), 2010 Second International Conference . Vol. 1, pp. 191-195.b. 11358172 .

[7] J R.Hause,T.Prygienda, and G. Tsudik.”Reducing the cost of security in Link-stste Routing”,In Internet Society Symposium on Network and Distributed Systems Security,1997.

[8] John Moy,OSPF Version 2,RFC 1583, March 1994.

[9] S.L. Murphy,”Digital Signature Protection of the OSPF Routing Protocol”,IEEE/ISOC Symposiums on Network andDistributed System Security,1996.

[10] OSPF Working Group Mailing List Archive,ftp://gated.cornell.edu/pub/lists/ospf

[11] "Distance-vector routing protocol." Wikipedia,encyclopedia. [Online] September 29, 2010. [Cited: 11 04, 2010.] http://en.wikipedia.org/wiki/Distance-vector_routing_protocol.