Distance-vector Routing Essay

Submitted By skluna
Words: 2239
Pages: 9
Open Document
Distance-vector Routing

Purpose of Routing Protocol Routing protocols can be described as a set of guidelines that are used by routers to resolve the best path to which it should forward packets destined for a remote network. The routing algorithms determine the specific route that is the best choice for the packet to be forwarded to. Every router holds a carnal knowledge of any networks that are attached to them directly and understand which interfaces connect them to these networks and their associated costs. Routing protocols allow routers to have the ability to share information with other routers that run that same protocol; advertising routes thru a series of broadcasts are one method used to accomplish this task. These protocols have the ability to dynamically update their routing tables based on information received from other devices in the network. Some routing protocol simply share their own routing tables with adjacent nodes till all nodes have a common understanding of the best routing costs to all attached networks. Other routing protocols have a much more complex methodology of propagating their information in the form of a distributed database that each router holds a working copy of. When a change is executed or occurs, the change is distributed to all nodes in the system and their local routing tables are updated to reflect the change. These methods are how routers gain their knowledge of the topology that is in the network. (Doyle, J. 2001)
Distance-vector Routing Protocol
Distance vector routing protocols are simple protocols that are typically used in packet switching network. These protocols use the Bellman-Ford algorithm, Ford–Fulkerson algorithm, or DUAL FSM algorithms to decide on the best path to which a routing device should advance a packet destined for another network. These decisions are based on calculations of distance and direction to an adjacent network with the least cost and shortest distance between the nodes. Distance vector typically uses a cost associated with every link to determine the best path for forwarding packets; this cost is normally referred to as the “hop” count. (linfo 2005) When a path has less cost associated with it, it is determined to be the best path to a destination network. Information is propagated in the form of broadcasts containing either a portion or a router’s entire routing table as the payload. Distance vector protocols are usually best when used in smaller networks because of the ease at which they are setup and configured and how quickly they converge in smaller networks.
Advantages and Disadvantages of Distance-vector Protocols
The downside of distance vector protocols is that they typically do not scale well in larger networks and have a much greater convergence time factor than protocols of a different nature. Another less attractive side effect of distance vector protocols are the fact that most distance vector protocols send their entire routing table instead of incremental updates every 30 seconds to every active interface. This causes an increased amount of traffic on the network and also causes associated routers to consume much more resources than with a link state protocols in larger network scenarios. One of the other issues with distance vector is the routing by rumor effect of receiving information from neighboring routers or second hand information. (Heshamtecom 2011)If a route is lost from an associated router on the network then all routers who’s routing table still show that network as being an available path with a valid hop count, will continue to advertise this path as valid. If the router who has lost this path does not advertise the loss of this link fast enough, it is conceptually possible for it to receive a route for that lost network from an adjacent neighbors update. If this happens then a network loop is created when the router who lost the network, receives a routing
Show More

Related Documents: Distance-vector Routing Essay

UNIT 5 ASSIGNMENT 5 Essay

5.1 EIGRP Enhances Interior Gateway Routing Protocol; EIGRP is an enhanced distance vector protocol, relying on the Diffused Update Algorithm (DUAL) to calculate the shortest path to a destination within a network. EIGRP STRENGHTS Fast convergence: EIGRP is an advance distance vector protocol, one of its core strengths is its fast network convergence capabilities, unlike other routing protocols EIGRP keeps feasible successor routes right into the routing table, this allows millisecond convergence…

Words 608 - Pages 3

Essay on Dv Protocol

Distance Vector Routing Protocols Most routing protocols fall into one of two classes: distance vector or link state. The basics of distance vector routing protocols are examined here; the next section covers link state routing protocols. Most distance vector algorithms are based on the work done of R. E. Bellman, L. R. Ford, and D. R. Fulkerson, and for this reason occasionally are referred to as Bellman-Ford or Ford-Fulkerson algorithms. A notable exception is EIGRP, which is based on an algorithm…

Words 3338 - Pages 14

Chapter 8 Exam Essentials Essay

Chapter 8 : Exam Essentials Describe the IP routing process. You need to remember that the frame changes at each hop but that the packet is never changed or manipulated in any way until it reached the destination device (the TTL field in the IP header is decremented for each hop, but that’s it). List the information required by a router to successfully route packets. To be able to route packets, a router must know, at a minimum, the destination address, the location of neighboring routers through…

Words 594 - Pages 3

Nt1330 Unit 1 Research Paper

It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). OSPF (Open Shortest Path First) is a router protocol used to find the best path for packets as they pass through a set of connected networks. Unlike RIP, which requires routers to send the entire routing table to neighbors every 30 seconds, OSPF sends only the part that has changed and only…

Words 387 - Pages 2

Nt1310 Unit 1 Exercise 1

Autonomous and infrastructure less: MANET does not depend on any established infrastructure or centralized administration. Each node operates in distributed peer to- peer mode, acts as an independent router, and generates independent data. Dynamic routing: No dedicated routers are necessary; every node acts as a router and forwards each other’s’ packets to enable information sharing between mobile hosts. Mobility: Each node is free to move about while communicating with other nodes. Decentralised network:…

Words 886 - Pages 4

Ch 5 Network Layer Essays

layer Segmenting Session Management Network Layer Functions Addressing Routing TCP/IP Examples Implications for Management Network and Transport Layers Transport Layer Layer 4 in the Internet model Links application and network layers Responsible for segmentation and reassembly Session management Responsible for end-to-end delivery of messages Network Layer Layer 3 in the Internet model Responsible for addressing and routing of messages Protocols TCP/IP Originally developed as a single internetworking…

Words 2852 - Pages 12

Nt1310 Unit 1 Exercise 1

direction, and can thus modification its links to different devices frequently. MANETs are much more vulnerable and are susceptible to numerous kinds of security attacks [2]. These nodes have routing capabilities which permit them to make multihop paths connecting node that aren't within radio range. The routing…

Words 1023 - Pages 5

Netw204 Quiz Answers Essay

or more routers and an IPv4 addressing scheme, implement static routing and confirm layer 3 connectivity. | 3 | Given a network topology and three or more routers and an IPv4 addressing scheme, implement RIPv1 routing protocol and confirm layer 3 connectivity. | 4 | Given a network topology of three or more routers with bandwidth designations, compare the metrics used during the route selection process and the resulting routing tables generated by the DUAL and SPF algorithms. | 5 | Given a…

Words 3312 - Pages 14

Nt1310 Unit 1 Problem Analysis Paper

The algorithm finds the shortest path between source and all destinations in the network. Each node is labeled in parenthesis with its distance from the source node along the best-known path. The distance must be none negative, as they will be if they are based on real qualities like bandwidth and delay. Initially no paths are known, so all nodes are labeled with infinity. As the algorithm proceeds and paths are found…

Words 2365 - Pages 10

Network & Transport Layes Essay

correction. It also decides when a device can transmit so that two computers do not try to transmit at the same time. Figure 1.3: Network models. OSI = Open Systems Interconnection Reference Layer 3: Network Layer The network layer performs routing. It determines the next computer the message should be sent to so it can follow the best route through the network and finds the full address for that computer if needed. Layer 4: Transport Layer The transport layer deals with end-to-end issues,…

Words 3940 - Pages 16