routing simulator ppt

12
Guided By:- Submitted By:- Ms. P. Ponveni Ritesh Kumar Shaw MCA MCA 3 RD year Asst. Prof(O.G) Reg - 3521120051

Upload: ritesh-shaw

Post on 19-Dec-2014

1.002 views

Category:

Technology


3 download

DESCRIPTION

A simple definition of routing is "learning how to get from here to there.“ The term routing is used in a very strict sense to refer only to the process of obtaining and distributing information, but not to the process of using that information to actually get from one place to. To discover and advertise paths from here to there and to actually move packets from here to there when necessary. functions performed by OSI end systems and intermediate systems. Routing is the act of moving information across an inter network from a source to a destination. Along the way, at least one intermediate node typically is encountered. Routing is the process of finding a path from a source to every destination in the network. Establish mutually consistent routing tables in every router in the Network.   When a packet is received by the router or is forwarded by the host, they both must make decisions as to how to send the packet. To do this, the router and the host consult a database for information known as the routing table. This database is stored in RAM so that the lookup process is optimized

TRANSCRIPT

Page 1: Routing simulator ppt

Guided By:- Submitted By:-

Ms. P. Ponveni Ritesh Kumar Shaw

MCA MCA 3RD year

Asst. Prof(O.G) Reg - 3521120051

Page 2: Routing simulator ppt

SYSTEM ANALYSIS

»Abstract

»Existing System

»Drawbacks of Existing System

»Proposed System

»Benefits of proposed system

»Methods

SYSTEM SPECIFICATION

»Hardware Configuration

»Software Configuration

CONTENT

Page 3: Routing simulator ppt

» A simple definition of routing is "learning how to get from here to there.“

» The term routing is used to the process of using that information to actually get

from one place to.

» functions performed by OSI end systems and intermediate systems.

» At least one intermediate node typically is encountered.

» Routing is the process of finding a path from a source to every destination in the

network.

» Establish mutually consistent routing tables in every router in the Network.  

» When a packet is received by the router or is forwarded by the host, they both

must make decisions as to how to send the packet.

» To do this, the router and the host consult a database for information known as

the routing table. This database is stored in RAM so that the lookup process is

optimized

ABSTRACT

Page 4: Routing simulator ppt
Page 5: Routing simulator ppt

 

»one has to select a better routing technique among the

several techniques available.

» So far no routing Algorithm is reported to be outright choice

for all possible cases.

»provides better results for a given configuration of the

subnet in real time.

»The main objective of our project is to maximize the

efficiency of the routing process by suggesting the potential

user a better algorithm.

EXISTING SYSTEM

Page 6: Routing simulator ppt

» One routing technique are Available to get the Information

» less efficiency of the routing process

DRAWBACKS OF EXISTING SYSTEM

Page 7: Routing simulator ppt

»  » Objectives of the System 

» The topology of the subnet should be displayed with routers designated with computer images and links with lines.

 » Various Statistics for the router like efficiency, average packet size are to be

displayed when required. » A router should show an outline when a router is crashed. » When a link is down, it should be highlighted. This gives an idea of how the

routing goes when a link is down. » The statistics for the router and the link are to be calculated for every 500 m/sec.

» It redrawing the congestion table and network is to be provided. » The routing should be controlled by a speed controller.

PROPOSED SYSTEM

Page 8: Routing simulator ppt

 »Optimality

select the best route, which depends on the metrics and metric weightings

used to make the calculation.» Simplicity and low overhead  Functionality efficiently, with a minimum of software and utilization overhead.

The routing algorithm must run on a computer with limited physical resources.»Robustness and stability

It has capacity to perform in some situation such as hardware failures, high load

conditions, and incorrect implementations»Rapid convergence

Convergence is the process of agreement.When a network go down or become available, routers distribute

routing update messages. »Flexibility

They should quickly and accurately adapt to a variety of network.programmed to adapt to changes in network bandwidth, router

queue size, and network delay, among other variables.

BENEFITS OF PROPOSED SYSTEM

Page 9: Routing simulator ppt

METHODS OF THE PROJECT

Router

GeneratePacket

Route NextPacket

CrashRouter

ReceivePacket

ConsultRouteAlgo

Router and its methods

Page 10: Routing simulator ppt

Java Development Kit 1.3  The JDK 1.3 is a development environment for writing GUI and applications that confirm to the Java core API. Its compiler and other tools are run from a shell and have no GUI interface. Java Tools:

Java Compiler (javac)

Java Interpreter (java)  

Java Debugger (jdb) 

Class File Disassembler (javap) Java Documentation Generator (javadoc) Java Archive Tool (jar)

SOFTWARE CONFIGURATION

Page 11: Routing simulator ppt

PROCESSOR : PENTIUM IV 2.6 GHzRAM : 512 MB DD RAMMONITOR : 15” COLORHARD DISK : 20 GBFLOPPY DRIVE : 1.44 MBCDDRIVE : LG 52XKEYBOARD : STANDARD 102 KEYSMOUSE :3 BUTTONS

HARDWARE CONFIGURATION

Page 12: Routing simulator ppt

THANKTHANK YOUYOU