Scribd
Upload
114 views6 pages

Protocols

Distance vector and link state routing protocols use different algorithms to determine the best paths between nodes in a network. Distance vector protocols use the Bellman-Ford algorithm and share routing tables between neighbors, while link state protocols flood information about direct links to all nodes and independently calculate the best paths. Distance vector protocols scale well for small networks but have slow convergence, while link state protocols have faster convergence but require more resources. Common examples are RIP, IGRP for distance vector, and OSPF, IS-IS for link state. Hybrid protocols like EIGRP combine features of both.

Uploaded by

PŘincê ÂĻĩ
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
114 views6 pages

Protocols

Distance vector and link state routing protocols use different algorithms to determine the best paths between nodes in a network. Distance vector protocols use the Bellman-Ford algorithm and share routing tables between neighbors, while link state protocols flood information about direct links to all nodes and independently calculate the best paths. Distance vector protocols scale well for small networks but have slow convergence, while link state protocols have faster convergence but require more resources. Common examples are RIP, IGRP for distance vector, and OSPF, IS-IS for link state. Hybrid protocols like EIGRP combine features of both.

Uploaded by

PŘincê ÂĻĩ
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 6

Routing Protocol

Routing and Routed Protocols Routed protocols A routed protocol is any network layer protocol that provides enough information in its network layer address to allow a packet to be forwarded from one host to another host based on the addressing scheme, without knowing the entire path from source to destination. Routing protocols Routing protocols are used in the implementation of routing algorithms to facilitate the exchange of routing information between networks, allowing routers to build routing tables dynamically. In some cases, routing protocols can themselves run over routed protocols. Routing metrics A routing metric consists of any value used by routing algorithms to determine to choose one route over another. Metrics can take into account such information as bandwidth, delay, hop count, path cost, load, MTU, reliability, and communication cost. The routing table stores only the best possible routes. Routers use the feature known as administrative distance to select the best path when they "know" of two or more different routes to the same destination from two different routing protocols. Administrative distance defines the reliability of a routing protocol. Each routing protocol gets prioritized in order of most to least reliable using an administrativedistance value. A static route has a lower (better) administrative-distance than a route by OSPF, which is better then RIP.

Classes of routing algorithms


Distance vector algorithms

Distance vector algorithms use the Bellman-Ford algorithm. This approach assigns a number, the cost, to each of the links between each node in the network. Nodes will send information from point A to point B via the path that results in the lowest total cost (i.e. the sum of the costs of the links between the nodes used). The algorithm operates in a very simple manner. When a node first starts, it only knows of its immediate neighbors, and the direct cost involved in reaching them. (This information, the list of destinations, the total cost to each, and the next hop to send data to get there, makes up the routing table, or distance table.) Each node, on a regular basis, sends to each neighbour its own current idea of the total cost to get to all the destinations it knows of. The neighbouring node(s) examine this information, and compare it to what they already 'know'; anything which represents an improvement on what they already have, they insert in their own routing table(s). Over time, all the nodes in the network will discover the best next hop for all destinations, and the best total cost. When one of the nodes involved goes down, those nodes which used it as their next hop for certain destinations discard those entries, and create new routing-table information. They then pass this information to all adjacent nodes, which then repeat the process. Eventually all the nodes in the network receive the updated information, and will then discover new paths to all the destinations which they can still "reach". Link-state algorithms When applying link-state algorithms, each node uses as its fundamental data a map of the network in the form of a graph. To produce this, each node floods the entire network with information about what other nodes it can connect to, and each node then independently assembles this information into a map. Using this map, each router then independently determines the best route from itself to every other node. The algorithm used to do this, Dijkstra's algorithm, does this by building another data structure, a tree, with the current node itself as the root, and containing every other node in the network. It starts with a tree containing only itself. Then, one at a time, from the set of nodes which it has not yet added to the tree, it adds the node which has the lowest cost to reach an adjacent node which already appears in the tree. This continues until every node appears in the tree. This tree then serves to construct the routing table, giving the best next hop, etc, to get from the node itself to any other network.

Comparison of routing algorithms


Distance-vector routing protocols are simple and efficient in small networks, and require little, if any management. However, they do not scale well, and have poor convergence properties, which has led to the development of more complex but more scalable link-state routing protocols for use in large networks. Distance-vector protocols suffer from the count-to-infinity problem. The primary advantage of link-state routing is that it reacts more quickly, and in a bounded amount of time, to connectivity changes. Also, the link-state packets that are sent over the network are smaller than the packets used in distance-vector routing. Distance-vector routing requires a node's entire routing table to be transmitted, while in link-state routing only information about the node's immediate neighbours are transmitted. Therefore, these packets are small enough that they do not use network resources to any significant degree. The primary disadvantage of link-state routing is that it requires more storage and more computing to run than distance-vector routing. Routing Protocols Routers talk to one another about the state of the network and of nearby devices. The protocols they use for to talk to each other, routing protocols, should not be confused with ROUTED protocols like IP and IPX that carry data on the network. Common routing protocols include RIP, RIPv2, IGRP, EIGRP, IS-IS and BGP. For the CCNA exam you will need to be well versed in RIP, RIPv2, IGRP and EIGRP. You should be aware of IS-IS and BGP, and be able to configure basic OSPF. Two main types of routing protocols exist - distance vector and link state. A third type known as balanced hybrid (Known now as "Advanced Distance Vector") combines features of both link state and distance vector protocols.

Routing Protocols
Examples of Distance Vector routing protocols RIP RIPv2 IGRP Examples of Link State routing protocols OSPF IS-IS Examples of Advanced Distance Vector routing protocols EIGRP

Routing Protocol AD Value Static 1 EIGRP 90 IGRP 100 OSPF 110 RIP 120

TFTP SERVER
Perform Reliable & Secure File Transfers The Most Trusted TFTP Server Available! SolarWinds free TFTP Server is a multi-threaded TFTP server commonly used to upload and download executable images and backup configurations for routers and switches. TFTP Server is the most robust, widely-trusted, and easy-to-use free TFTP solution available. Download our free TFTP Server today for projects ranging from single file transfers to large network auditing projects! TFTP Server Highlights Upgrade IOS images and firmware on your network devices Back up configuration files for your critical routers and switches Upload or download configs to multi-vendor network devices 4 GB Transfers Transfer files up to 4 GB supporting the latest IOS or firmware versions without file size concerns Additional Features Advanced Security Authorize specific IP addresses or ranges of IP addresses for transfers; additional parameters can limit usage to send/receive files directly to TFTP Server Multi-threaded Concurrently upload and download images from multiple network devices saving valuable time when managing large networks with many devices Runs as a Service Run as a service to deliver 24 x 7 TFTP server availability for your entire network Latest Update New 64 bit OS support, improved error handling, and multiple subnet binding are included in the latest version of TFTP server

You might also like