DSpace Repository

ANALYSIS OF SHORTEST PATH PACKET TRACING OF ROUTERS

Show simple item record

dc.contributor.author Haque, A.K.M Fazlul
dc.contributor.author Roksana, Mahdi
dc.date.accessioned 2012-11-08T07:02:16Z
dc.date.accessioned 2019-05-28T09:39:21Z
dc.date.available 2012-11-08T07:02:16Z
dc.date.available 2019-05-28T09:39:21Z
dc.date.issued 2008-01-01
dc.identifier.uri http://hdl.handle.net/20.500.11948/467
dc.description.abstract In this paper, the shortest path in a packet switched network has been analyzed. A router receives a packet from a network and passes it to another network calculating the shortest path. However, the packets of a network use different routing protocols. A routing protocol is a combination of rules and procedures that lets routers informs each other of changes. It allows routers to share whatever they know about their neighborhood. Routing protocols are used to continuously update the routing tables that are consulted for forwarding and routing. The primary contribution of this paper is a simulation method of displaying the packet traces which finds the shortest path to route the packet through its destination. The simulation has been done by using Packet Tracer 4.01 software that allows us to stop time in our network and examine traffic in detail. en_US
dc.language.iso en en_US
dc.publisher Daffodil International University en_US
dc.subject Routing, Routing protocols, Shortest path, Packet Tracing. en_US
dc.title ANALYSIS OF SHORTEST PATH PACKET TRACING OF ROUTERS en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account

Statistics