logging in or signing up Routing Protocols Sunil.kr Download Post to : URL : Related Presentations : Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Uploaded from authorPOINT lite Insert YouTube videos in PowerPont slides with aS Desktop Copy embed code: Embed: Flash iPad Copy Does not support media & animations WordPress Embed Customize Embed URL: Copy Thumbnail: Copy The presentation is successfully added In Your Favorites. Views: 8609 Category: Product Traini.. License: All Rights Reserved Like it (12) Dislike it (0) Added: January 30, 2010 This Presentation is Public Favorites: 1 Presentation Description No description available. Comments Posting comment... By: duyvan (30 month(s) ago) hi, i want to download it. Saving..... Post Reply Close Saving..... Edit Comment Close By: aparajito (30 month(s) ago) plz allow me to dwnload this presentation.....its prettty urgent..................... Saving..... Post Reply Close Saving..... Edit Comment Close By: aparajito (30 month(s) ago) plz allow me to dwnload this presentation.....its prettty urgent..................... Saving..... Post Reply Close Saving..... Edit Comment Close By: manoojkumaar (31 month(s) ago) nice ppt Saving..... Post Reply Close Saving..... Edit Comment Close By: talk2kshitish (36 month(s) ago) plz allow me to dwnload this presentation..... Saving..... Post Reply Close Saving..... Edit Comment Close Premium member Presentation Transcript Routing Protocols : Routing Protocols Prepared By:- Sunil Kumar Introduction : Introduction A routing protocol is the implementation of a routing algorithm in software or hardware. A routing protocol uses metrics to determine which path to utilize to transmit a packet across an internetwork. The metrics used by routing protocols include: •Number of network layer devices along the path (hop count) •Bandwidth •Delay •Load •MTU •Cost Routing protocols store the results of these metrics in a routing table. Static routing and Dynamic Routing : Static routing and Dynamic Routing The router learns about remote networks from neighbor routers or from an administrator. The router then builds a routing table, that describes how to find the remote networks. If the network is directly connected then the router already knows how to get to the network. If the networks are not attached, the router must learn how to get to the remote network with either static routing (administrator manually enters the routes in the router's table) or dynamic routing The routers then update each other about all the networks they know. If a change occurs e.g. a router goes down, the dynamic routing protocols automatically inform all routers about the change. If static routing is used, then the administrator has to update all changes into all routers and therefore no routing protocol is used. Static routing and Dynamic Routing : Static routing and Dynamic Routing Only Dynamic routing uses routing protocols, which enable routers to: Dynamically discover and maintain routes Calculate routes Distribute routing updates to other routers Reach agreement with other routers about the network topology Statically programmed routers are unable to discover routes, or send routing information to other routers. They send data over routes defined by the network Administrator. A Stub network is so called because it is a dead end in the network. There is only one route in and one route out and, because of this, they can be reached using static routing, thus saving valuable bandwidth. Dynamic Routing Protocols : Dynamic Routing Protocols There are 3 types of Dynamic routing protocols, these differ mainly in the way that they discover and make calculations about routes (click to select): 1) Distance Vector 2) Link State 3) Hybrid Distance Vector routers compute the best path from information passed to them from neighbors. Link State routers each have a copy of the entire network map. Link State routers compute best routes from this local map. Types of Dynamic Routing Protocols : Types of Dynamic Routing Protocols Interior Routing Protocol : Interior Routing Protocol Interior Gateway Protocols (IGPs) handle routing within an Autonomous System. These protocols keep track of how to get from one destination to the other inside a network or set of networks that you administrate (all of the networks you manage combined are usually just one Autonomous System). IGP fall into two categories: Distance Vector Protocols Routing Information Protocol (RIP) Interior Gateway Routing Protocol (IGRP) Link State Protocols Open Shortest Path First (OSPF) Intermediate System to Intermediate System (IS-IS) Exterior Routing Protocol : Exterior Routing Protocol To get from place to place outside your network's, i.e. on the Internet, you must use an Exterior Gateway Protocol. Exterior Gateway Protocols handle routing outside an Autonomous System and get you from your network, through your Internet provider's network and onto any other network. BGP is used by companies with more than one Internet provider Examples of an EGP: Border Gateway Protocol (BGP) Exterior Gateway Protocol (Replaced by BGP) Distance Vector : Distance Vector Distance Vector protocols judge best path on how far it is. Distance can be hops or a combination of metrics calculated to represent a distance value. The IP Distance Vector routing protocols still in use today are: Routing Information Protocol (RIP v1 and v2) and Interior Gateway Routing Protocol 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. Link State Routing Protocol : Link State Routing Protocol A Link-state routing is a concept used in routing of packet-switched networks in computer communications. Link-state routing works by having the routers tell every router on the network about its closest neighbors. The entire routing table is not distributed from any router, only the part of the table containing its neighbors. Some of the link-state routing protocols are the OSPF, IS-IS and EIGRP. Novell's NLSP (NetWare Link State Protocol) is also a link-state routing protocol, which only supports IPX. Link State Routing protocols provide greater flexibility and sophistication than the Distance Vector routing protocols. They reduce overall broadcast traffic and make better decisions about routing by taking characteristics such as bandwidth, delay, reliability, and load into consideration, instead of basing their decisions solely on distance or hop count You do not have the permission to view this presentation. In order to view it, please contact the author of the presentation.
Routing Protocols Sunil.kr Download Post to : URL : Related Presentations : Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Uploaded from authorPOINT lite Insert YouTube videos in PowerPont slides with aS Desktop Copy embed code: Embed: Flash iPad Copy Does not support media & animations WordPress Embed Customize Embed URL: Copy Thumbnail: Copy The presentation is successfully added In Your Favorites. Views: 8609 Category: Product Traini.. License: All Rights Reserved Like it (12) Dislike it (0) Added: January 30, 2010 This Presentation is Public Favorites: 1 Presentation Description No description available. Comments Posting comment... By: duyvan (30 month(s) ago) hi, i want to download it. Saving..... Post Reply Close Saving..... Edit Comment Close By: aparajito (30 month(s) ago) plz allow me to dwnload this presentation.....its prettty urgent..................... Saving..... Post Reply Close Saving..... Edit Comment Close By: aparajito (30 month(s) ago) plz allow me to dwnload this presentation.....its prettty urgent..................... Saving..... Post Reply Close Saving..... Edit Comment Close By: manoojkumaar (31 month(s) ago) nice ppt Saving..... Post Reply Close Saving..... Edit Comment Close By: talk2kshitish (36 month(s) ago) plz allow me to dwnload this presentation..... Saving..... Post Reply Close Saving..... Edit Comment Close Premium member Presentation Transcript Routing Protocols : Routing Protocols Prepared By:- Sunil Kumar Introduction : Introduction A routing protocol is the implementation of a routing algorithm in software or hardware. A routing protocol uses metrics to determine which path to utilize to transmit a packet across an internetwork. The metrics used by routing protocols include: •Number of network layer devices along the path (hop count) •Bandwidth •Delay •Load •MTU •Cost Routing protocols store the results of these metrics in a routing table. Static routing and Dynamic Routing : Static routing and Dynamic Routing The router learns about remote networks from neighbor routers or from an administrator. The router then builds a routing table, that describes how to find the remote networks. If the network is directly connected then the router already knows how to get to the network. If the networks are not attached, the router must learn how to get to the remote network with either static routing (administrator manually enters the routes in the router's table) or dynamic routing The routers then update each other about all the networks they know. If a change occurs e.g. a router goes down, the dynamic routing protocols automatically inform all routers about the change. If static routing is used, then the administrator has to update all changes into all routers and therefore no routing protocol is used. Static routing and Dynamic Routing : Static routing and Dynamic Routing Only Dynamic routing uses routing protocols, which enable routers to: Dynamically discover and maintain routes Calculate routes Distribute routing updates to other routers Reach agreement with other routers about the network topology Statically programmed routers are unable to discover routes, or send routing information to other routers. They send data over routes defined by the network Administrator. A Stub network is so called because it is a dead end in the network. There is only one route in and one route out and, because of this, they can be reached using static routing, thus saving valuable bandwidth. Dynamic Routing Protocols : Dynamic Routing Protocols There are 3 types of Dynamic routing protocols, these differ mainly in the way that they discover and make calculations about routes (click to select): 1) Distance Vector 2) Link State 3) Hybrid Distance Vector routers compute the best path from information passed to them from neighbors. Link State routers each have a copy of the entire network map. Link State routers compute best routes from this local map. Types of Dynamic Routing Protocols : Types of Dynamic Routing Protocols Interior Routing Protocol : Interior Routing Protocol Interior Gateway Protocols (IGPs) handle routing within an Autonomous System. These protocols keep track of how to get from one destination to the other inside a network or set of networks that you administrate (all of the networks you manage combined are usually just one Autonomous System). IGP fall into two categories: Distance Vector Protocols Routing Information Protocol (RIP) Interior Gateway Routing Protocol (IGRP) Link State Protocols Open Shortest Path First (OSPF) Intermediate System to Intermediate System (IS-IS) Exterior Routing Protocol : Exterior Routing Protocol To get from place to place outside your network's, i.e. on the Internet, you must use an Exterior Gateway Protocol. Exterior Gateway Protocols handle routing outside an Autonomous System and get you from your network, through your Internet provider's network and onto any other network. BGP is used by companies with more than one Internet provider Examples of an EGP: Border Gateway Protocol (BGP) Exterior Gateway Protocol (Replaced by BGP) Distance Vector : Distance Vector Distance Vector protocols judge best path on how far it is. Distance can be hops or a combination of metrics calculated to represent a distance value. The IP Distance Vector routing protocols still in use today are: Routing Information Protocol (RIP v1 and v2) and Interior Gateway Routing Protocol 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. Link State Routing Protocol : Link State Routing Protocol A Link-state routing is a concept used in routing of packet-switched networks in computer communications. Link-state routing works by having the routers tell every router on the network about its closest neighbors. The entire routing table is not distributed from any router, only the part of the table containing its neighbors. Some of the link-state routing protocols are the OSPF, IS-IS and EIGRP. Novell's NLSP (NetWare Link State Protocol) is also a link-state routing protocol, which only supports IPX. Link State Routing protocols provide greater flexibility and sophistication than the Distance Vector routing protocols. They reduce overall broadcast traffic and make better decisions about routing by taking characteristics such as bandwidth, delay, reliability, and load into consideration, instead of basing their decisions solely on distance or hop count