OPTIMAL ROUTING ANALYSIS BETWEEN NODES ENABLING RIPng AND OSPFv3 IN A WAN ENTERPRISE NETWORK.

WELCOME TO ALLPROJECTBY,T.KUMAR D.SATHISHKUMARS.SEETHAPATHIFINAL YEAR,ECE DEPARTMENT,P.T.Lee.CNCET

Honourable guideMr.G.SATHISHKUMAR, Lect of ECE, P.T.Lee CNCET.

Honourable guideMr. A.VETRIVEL , Sub Divisional Engineer, RGMTTC, BSNL.

GUIDESOPTIMAL ROUTING ANALYSIS BETWEEN NODES ENABLING RIPng AND OSPFv3 IN A WAN ENTERPRISE NETWORK.4Routing is the heartbeat of the Internet.

The most common protocols in use are Routing Information Protocol (RIP) and Open Shortest Path First (OSPF).

ABSTRACTThe prime objectives of our project is to investigate the consequences of deploying RIP and OSPF simultaneously on a network and to analyze the performance to increase the QoS.

PRIME OBJECTIVEThe internet is a worldwide publicly accessible system.

It is the interconnection of computer networks.

IPv6in network enables data sharing between two or more computers.

IPv6 minimize time and energy wastages.

IMPORTANCE OF NETWORKRouting between different network involves the usages of routers.

The routers maintain a routing table.

Routers are configured manually by the process called static routing.

Static routing is very difficult for larger networks.

This issue exists in IPv6(Internet Protocol version6).

EXSISTING SYSTEMThe existing system of IPv4 has the following issuesMore latency.Less security.Less address space.No auto configuration facility.The issues of static routing areTime delay.Applied only for small LAN networks.

PROBLEMS IPv6 network is proposed in this project with enabling the RIP and OSPF dynamic protocols that dynamically update the routing information that helps to forward the packet from source and destination.

additional advantagesVirtual linkRe distributionPROPOSED SYSTEMDue to limitation of dynamic protocol, converging time may differ whenever modification occurs in the network.

As a result loss of packets more or less based properties of converging time that decrease the network performance.

PROBLEM DEFINITIONThe problem of static routing in IPv6 can be resolved by using the dynamic routing.

The different dynamic routing protocols may be ROUTING INFORMATION PROTOCOL(RIP)OPEN SHORTEST PATH FIRST(OSPF)

Depending on the topology and the protocol used the results may vary.

Convergence of networks is the main parameter in optimal routing.

SOLUTIONTheRouting Information Protocol(RIP) is adistance vector routing protocol.

It employs thehop countas a routing metric.

RIP prevents routing loops by implementing a limit on the number of hops.

The maximum number of hops allowed for RIP is 15.RIP INTRODUCTIONThere are three versions of the Routing Information Protocol:

RIPv1

RIPv2 and

RIPng.

RIP VERSIONSEach RIP router transmitted full updates every 30 seconds.

It is easy to configure, because RIP does not require any parameters on a router unlike other protocols.

Perfect Protocol for small LAN networks.RIPng ADVANTAGESHop count can not exceed 15.

The Maximum number of routers that RIP can support are 16 only.

Most RIP networks are flat.

There is no concept of areas or boundaries in RIP networks.

LIMITATION OF RIPngOSPF is an interior gateway protocol that routes Internet Protocol (IP) packets solely within a single routing domain .

It gathers link state information from available routers and constructs a topology map of the network.

OSPF INTRODUCTIONOSPF supports Variable Length Subnet Masking (VLSM) orClassless Inter-Domain Routing(CIDR) addressing models.

OSPF detects changes in the topology, such as link failures, very quickly andconvergeson a new loop-free routing structure within seconds.

It computes theshortest path treefor each route using a method based onDijkstras algorithm, ashortest path firstalgorithm. OSPF defines the following router types:

Area border router (ABR)

Autonomous system boundary router (ASBR)

Internal router (IR)

Backbone router (BR)

OSPF ROUTER TYPES Area border router

An area border router (ABR) is a router that connects one or more areas to the main backbone network.

An ABR keeps multiple copies of the link-state database in memory, one for each area to which that router is connected.

Autonomous system boundary router

An autonomous system boundary router (ASBR) is a router that is connected to more than one Routing protocol and that exchanges routing information with routers in other protocols. Internal router

An internal router is a router that has OSPF neighbor relationships with interfaces in the same area. An internal router has all its interfaces in a single area.

Backbone router

Backbone routers are all routers that are connected to the OSPF backbone, irrespective of whether they are also area border routers or internal routers of the backbone area.

Designated router

Adesignated router(DR) is the router interface elected among all routers on a particular multi access network segment, generally assumed to be broadcast multi access.

Backbone designated router

Abackup designated router(BDR) is a router that becomes the designated router if the current designated router has a problem or fails. Down

This is the first OSPF neighbor state. It means that no information (hellos) has been received from this neighbor, but hello packets can still be sent to the neighbor in this state.

Init

This state specifies that the router has received a hello packet from its neighbor, but the receiving router's ID was not included in the hello packet. OSPF STATES 2-Way

This state designates that bi-directional communication has been established between two routers. Bi-directional means that each router has seen the other's hello packet.

Exstart

Once the DR and BDR are elected, the actual process of exchanging link state information can start between the routers and their DR and BDR.

Exchange

In the exchange state, OSPF routers exchange database descriptor (DBD) packets.

Loading

In this state, the actual exchange of link state information occurs.

Full

In this state, routers are fully adjacent with each other. All the router and network LSAs are exchanged and the routers' databases are fully synchronized.

Full is the normal state for an OSPF router

Changes in an OSPF network are propagated quickly.

OSPF is hierarchical, using area 0 as the top as the hierarchy.

OSPF is aLink State Algorithm.

OSPF supportsVariable Length Subnet Masking (VLSM).

OSPF usesmulticastingwithin areas.OSPF ADVANTAGESOSPF is very processor intensive.

OSPF maintains multiple copies of routing information, increasing the amount of memory needed.

OSPF is not as easy to learn as some other protocols.OSPF LIMITATIONSHardware implementation: The proposed system can very well be implemented in hardware.

Software implementation: We can use 3 simulation software's to obtain the output.

They are,WIRE SHARKGNSVPCSIMPLEMENTATIONGNS3 is a graphical network simulator that allows simulation of complex networks.

It can also be used to experiment features of Cisco IOS, Juniper JunOS or to check configurations that need to be deployed later on real routers.

This project is an open source, free program that may be used on multiple operating systems, including Windows, Linux, and MacOS X.

GNS3The VPCS can simulate up to 9 PCs.

You can ping/trace route them, or ping/trace route the other hosts/routers from the virtual PCs.

VPCS is not the traditional PC, it is just a program running on the Linux or Windows, and only few network commands can be used in it.

VPCSWiresharkis afree and open source packet analyzer.

Used fornetworktroubleshooting, analysis, software and communication protocol development, and education.

Originally namedEthereal, in May 2006 the project was renamed Wireshark.

WIRE SHARK

PROJECT TOPOLOGY

CONFIGURING A ROUTER

CONFIGURING RIPng PROTOCOL

CONFIGURING OSPF PROTOCOLThe analysis of optimal routing in WAN network may be visualized in graphical format.

Latency vs. No. of nodes.Convergence time vs. No. of routers.Packet loss vs nodes

OUTPUTGRAPHICAL OUTPUTImproved performance.

Improved availability.

Simplified systems management.ADVANTAGESMustafa,N.M. Othman,M. IEEE International Conference on Telecommunications 2007. ICT-MICC 2007. on 14-17 May 2007,pp 472 477. Goyal, M. Ramakrishnan, K.K. Wu-chi Feng IEEE Conference on Communications ,2003. ICC'03 11-15 May 2003 Volume: 1, p.p 296-300. Thorenoor S.G, Dynamic Routing Protocol Implementation Decision between EIGRP, OSPF and RIP based on Technology Background Using OPNET Modeler , IEEE Conference on Computer and Network Technology (ICCNT), 2010, pp. 191-195.Narayan, S. Peng Shang Na Fan, Wireless Communications and Trusted Computing International Conference on Networks Security, NSWCTC 0925-26 April 2009. pp.653-656.

REFERENCES THANK U