Routing
•Download as DOCX, PDF•
0 likes•29 views
There are three main types of routing algorithms: distance vector routing, link state routing, and path vector routing. Common routing protocols include RIP, OSPF, and BGP. RIP uses distance vector routing to identify available paths between source and destination based on hop count. OSPF uses link state routing to identify the shortest path in the network based on hop count. BGP uses path vector routing to identify the best path to transmit data between source and destination.
Report
Share
Report
Share
Recommended
OSPF - Routing Protocol
Link state routing relies on each node disseminating information about its directly connected links to all other nodes, allowing each node to build a map of the network and calculate the shortest paths using Dijkstra's algorithm; nodes reliably flood their link state packets to ensure all nodes receive the latest information, then independently calculate routes based on the accumulated knowledge; routes are determined by having each node maintain tentative and confirmed lists, moving entries from tentative to confirmed after calculating costs through neighboring nodes' links.
Ch13
This document summarizes several routing protocols:
- RIP (Routing Information Protocol), an interior gateway protocol that shares routing tables periodically and uses hop counts to determine best paths. It has issues with slow convergence and instability.
- OSPF (Open Shortest Path First), an IGP that uses link state routing to calculate shortest paths. Routers flood link state advertisements to maintain synchronized topological databases.
- BGP (Border Gateway Protocol), an exterior gateway protocol used between autonomous systems to exchange routing and reachability information. It uses path vector routing rather than link states.
RIP - Routing Information Protocol
Distance vector routing is an algorithm where each node maintains a routing table with the distances to all other nodes and shares this table periodically with its neighbors. Nodes initially only know the cost to directly connected neighbors and update their tables based on information received, potentially leading to a "count to infinity" problem if routes oscillate. Solutions include using split horizon to not pass back the source of a route and poison reverse to mark such routes as infinite. RIP is an implementation of distance vector routing that shares updates every 30 seconds.
Ospf
OSPF is a link-state routing protocol used within an autonomous system. Each router maintains an identical link state database describing the network topology and calculates shortest paths using the SPF algorithm. Routers establish adjacencies to exchange routing information and databases are synchronized during the exchange process. OSPF supports features like equal-cost multi-path routing and areas to reduce routing traffic and provide protection.
Routing
The document discusses different types of routing techniques used in computer networks. It describes routing as the process of selecting paths to send network traffic between interconnected networks. It then covers techniques like least cost routing, non-adaptive and adaptive routing, common routing algorithms including shortest path, flooding, distance vector, link state, hierarchical and broadcast routing. It also discusses routing for mobile hosts and multicast routing.
Chapter 06 - Routing
The document discusses routing and routing protocols. It defines routing as the process routers use to forward packets toward their destination network based on the destination IP address. It describes static routing, where network administrators manually configure routes, as well as dynamic routing protocols, where routers automatically share information to build and update routing tables. It outlines common routing protocols including RIP, IGRP, EIGRP, OSPF, and BGP and their key characteristics such as the metrics and timers they use.
Routing
The document discusses various network layer services and routing algorithms. It describes packet switching which allows packets to be forwarded using destination addresses and connection-oriented services which require call setup and use virtual circuit identifiers. It also summarizes different routing algorithms including flooding, distance vector, link state, hierarchical routing, multicast routing, and routing for mobile and ad hoc networks.
Routing
This document provides an overview of routing concepts and protocols. It discusses the basic components of routing including algorithms, databases, and protocols. It describes different routing algorithm types such as static, distance vector, and link state. Specific routing protocols covered include RIP, OSPF, and BGP. It also discusses routing within autonomous systems and between autonomous systems on the internet.
Recommended
OSPF - Routing Protocol
Link state routing relies on each node disseminating information about its directly connected links to all other nodes, allowing each node to build a map of the network and calculate the shortest paths using Dijkstra's algorithm; nodes reliably flood their link state packets to ensure all nodes receive the latest information, then independently calculate routes based on the accumulated knowledge; routes are determined by having each node maintain tentative and confirmed lists, moving entries from tentative to confirmed after calculating costs through neighboring nodes' links.
Ch13
This document summarizes several routing protocols:
- RIP (Routing Information Protocol), an interior gateway protocol that shares routing tables periodically and uses hop counts to determine best paths. It has issues with slow convergence and instability.
- OSPF (Open Shortest Path First), an IGP that uses link state routing to calculate shortest paths. Routers flood link state advertisements to maintain synchronized topological databases.
- BGP (Border Gateway Protocol), an exterior gateway protocol used between autonomous systems to exchange routing and reachability information. It uses path vector routing rather than link states.
RIP - Routing Information Protocol
Distance vector routing is an algorithm where each node maintains a routing table with the distances to all other nodes and shares this table periodically with its neighbors. Nodes initially only know the cost to directly connected neighbors and update their tables based on information received, potentially leading to a "count to infinity" problem if routes oscillate. Solutions include using split horizon to not pass back the source of a route and poison reverse to mark such routes as infinite. RIP is an implementation of distance vector routing that shares updates every 30 seconds.
Ospf
OSPF is a link-state routing protocol used within an autonomous system. Each router maintains an identical link state database describing the network topology and calculates shortest paths using the SPF algorithm. Routers establish adjacencies to exchange routing information and databases are synchronized during the exchange process. OSPF supports features like equal-cost multi-path routing and areas to reduce routing traffic and provide protection.
Routing
The document discusses different types of routing techniques used in computer networks. It describes routing as the process of selecting paths to send network traffic between interconnected networks. It then covers techniques like least cost routing, non-adaptive and adaptive routing, common routing algorithms including shortest path, flooding, distance vector, link state, hierarchical and broadcast routing. It also discusses routing for mobile hosts and multicast routing.
Chapter 06 - Routing
The document discusses routing and routing protocols. It defines routing as the process routers use to forward packets toward their destination network based on the destination IP address. It describes static routing, where network administrators manually configure routes, as well as dynamic routing protocols, where routers automatically share information to build and update routing tables. It outlines common routing protocols including RIP, IGRP, EIGRP, OSPF, and BGP and their key characteristics such as the metrics and timers they use.
Routing
The document discusses various network layer services and routing algorithms. It describes packet switching which allows packets to be forwarded using destination addresses and connection-oriented services which require call setup and use virtual circuit identifiers. It also summarizes different routing algorithms including flooding, distance vector, link state, hierarchical routing, multicast routing, and routing for mobile and ad hoc networks.
Routing
This document provides an overview of routing concepts and protocols. It discusses the basic components of routing including algorithms, databases, and protocols. It describes different routing algorithm types such as static, distance vector, and link state. Specific routing protocols covered include RIP, OSPF, and BGP. It also discusses routing within autonomous systems and between autonomous systems on the internet.
Routing
Routing is the process of moving information across an internetwork from a source to a destination. There are two types of routing: direct delivery where the source and destination are on the same network, and indirect delivery where packets travel through multiple routers to reach the destination on a different network. Distance vector routing protocols like RIP use hop count as the metric and periodically share routing tables with neighboring routers to allow all routers to learn the optimal paths. However, this can cause instability issues like two-node and three-node loops where routers incorrectly update their routing tables.
Week13 lec2
The document describes routing algorithms and protocols at the network layer. It discusses global routing algorithms that use complete network knowledge versus decentralized algorithms that do not. It also covers the distance vector routing algorithm and how it works iteratively to share routing information between neighbors. Specific distance vector protocols discussed include RIP, which uses hop count as its metric. The document also introduces the concepts of hierarchical routing and autonomous systems to allow scaling of routing in a decentralized manner across large networks.
Olsr protocol ppt
he Optimized Link State Routing Protocol (OLSR)[1] is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR is a proactive link-state routing protocol, which uses hello and topology control (TC) messages to discover and then disseminate link state information throughout the mobile ad hoc network. Individual nodes use this topology information to compute next hop destinations for all nodes in the network using shortest hop forwarding paths.
Day 2 IP ROUTING
The document provides information about IP routing, including static and dynamic routing. It discusses:
- The basics of routing including destination addresses, neighbor routers, routes, and maintaining routing information.
- The benefits and disadvantages of static routing, including less overhead but requiring manual configuration.
- Dynamic routing protocols like RIP, IGRP, and OSPF that automatically share routing information.
- Configuring and verifying static routes, as well as troubleshooting connection issues.
- Key aspects of distance vector protocols like RIP and IGRP, including updates, loops, metrics, and timers.
Presentation2modi
This document summarizes and compares two reactive routing protocols for wireless ad-hoc networks: AODV and DSR. It describes that AODV uses routing tables and sequence numbers to prevent loops, and broadcasts route requests containing source and destination IP addresses. DSR uses source routing by storing routes in a cache, and data packets carry the source route. The document outlines the key mechanisms of each protocol, including route discovery and maintenance for DSR. It concludes by comparing their performance based on metrics like packet drop, consistency, throughput, noting that AODV had higher drops but more consistency while DSR had lower drops but less consistency.
Week13 lec1
The document summarizes routing protocols and algorithms used in computer networks. It discusses how routing protocols define how routers exchange network information, including the type of information exchanged and timing. Examples of routing protocols include RIP, EIGRP, OSPF and BGP. Routing algorithms find the least cost path between routers using a graph representation of the network. Dijkstra's algorithm is a link-state routing algorithm that computes the shortest paths from one router to all others using an iterative approach where it progressively updates the costs of reachable nodes.
Routing table
Routing protocols are used to automatically maintain routing tables in routers. Distance vector routing protocols like RIP use the distributed Bellman-Ford algorithm, where each router only knows its local state - the link metrics and estimates of distances to destinations from its neighbors. Using this information, routers periodically exchange distance updates with neighbors and recalculate path costs to determine the optimal next-hop for each destination. While simple and distributed, distance vector protocols are prone to slow convergence and routing loops in certain network conditions.
OSPF (Open Shortest Path First) Case Study: Anil Nembang
- The document discusses Open Shortest Path First (OSPF) configuration for a network comprising routers and PCs partitioned into 4 areas.
- An addressing scheme is proposed using /30 subnet masking to assign point-to-point interfaces between routers in areas 120, 120, and 120. Area 99 is an OSPF multi-access network requiring a different approach.
- OSPF is configured on the network with areas and interfaces assigned addresses according to the proposed scheme. A virtual link is also specified to connect the non-contiguous areas as required.
Distance Vector Routing Protocols
This document discusses and compares two routing protocols: distance vector routing and link state routing. Distance vector routing involves each node sharing its routing table only with its neighbors, while link state routing involves each node having knowledge of the entire network topology. The document outlines the working principles, drawbacks like count to infinity, and pros and cons of each approach.
rip, ospf 13-14
The document discusses several routing protocols used in TCP/IP networks, including RIP, OSPF, and BGP. It begins by distinguishing between intra-domain routing within an autonomous system and inter-domain routing between autonomous systems. It then covers the distance vector routing protocol RIP, the link state routing protocol OSPF used for intra-domain routing, and the path vector routing protocol BGP used for inter-domain routing. For each it discusses the routing algorithm, packet formats, and other implementation details.
Week16 lec1
This document provides a summary of key concepts about switches and the Address Resolution Protocol (ARP) at the link layer of computer networks:
- Switches operate at the link layer, selectively forwarding frames to the correct outgoing link based on the frame's MAC address. Switches learn MAC addresses and their associated ports through a self-learning process.
- ARP is used to dynamically map IP addresses to MAC addresses when two hosts are on the same local area network (LAN). When a host wants to send to an IP address, it first broadcasts an ARP request. The host with that IP responds with its MAC address.
- For hosts on different LANs, the sending host uses ARP to get the MAC address
IP ROUTING
Router used to make communication between different type of network ,for this purpose router use routing protocol and routed protocol. Routed protocol for source and destination address and routing protocol for path selection.
Link state protocols.ppt
Link-state routing protocols use Dijkstra's shortest path first algorithm to determine the optimal route between nodes. Each router uses hello packets to discover neighbors and then builds and floods link state packets (LSPs) throughout the network. All routers use the LSPs to construct a topological map and independently calculate the shortest path to every network using an SPF tree. Common link-state protocols are Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS).
Ospf
The document discusses designing a network for a software development organization using OSPF routing. It requires dividing the network into different areas for three departments - development, testing, and trainee. The trainee department should not have internet browsing access but all other communication should be allowed. ACLs will be configured on the routers to restrict access according to requirements.
Rip ospf and bgp
This document discusses routing protocols including RIP, OSPF, and BGP. It describes the differences between intradomain and interdomain routing. RIP uses distance vector routing, while OSPF uses link state routing based on Dijkstra's algorithm. BGP is an interdomain routing protocol that uses path vector routing to exchange routing information between autonomous systems.
IP Routing
The chapter discusses IP routing and routing protocols. It explains the goals of routing which include stability, robustness, dynamic path updates, and secure information transmission. It also covers routing metrics, interior and exterior routing protocols, static and dynamic routing, routing tables, and the Routing Information Protocol (RIP). RIP uses hop count as its metric and supports up to 15 hops between routers. Enhancements in RIPv2 include multicast updates, triggered updates, classless operation, and authentication.
Dynamic Routing
Dynamic routing protocols allow networks to keep routing tables up to date as the network changes over time. There are two main types of dynamic routing protocols: link-state protocols and vector-distance protocols. Link-state protocols have advantages like ensuring all routers converge on the same routing tables and generating less network traffic compared to vector-distance protocols. Common dynamic routing protocols include RIP, OSPF, IS-IS, and BGP.
Zaharaddeen karami lawal distance vector routing
In distance vector routing, the least-cost route between any two nodes is the route with minimum distance.
In this protocol, as the name implies, each node maintains a vector (table) of minimum distances to every node.
The table at each node also guides the packets to the desired node by showing the next stop in the route (next-hop routing).
Each node knows how to reach any other node and the cost. At the beginning, however, this is not the case the distance between itself and its immediate neighbors, those directly connected to it.
BASICS OF ROUTING IN NETWORKS
This document provides an overview of different routing protocols. It discusses IP routing, static routing, and dynamic routing. It also covers proactive routing protocols like DSDV which maintain routing tables and periodically update them. Reactive protocols like DSR and AODV establish routes on demand. Hybrid protocols combine proactive and reactive approaches. The document describes the key processes, advantages, and disadvantages of DSDV, DSR, AODV, and zone routing protocol.
Day 8 2 distance vector routing
Distance vector routing protocols work by having routers periodically share their routing tables with neighboring routers. This allows each router to build up its own table indicating the distance to various destinations via each neighbor. Issues can arise from slow convergence of routing information leading to inconsistent entries. Techniques like split horizon, route poisoning, and holddown timers aim to prevent routing loops from occurring during this convergence process.
Routing protocols.pptx
Routing protocols are sets of rules that enable routers to communicate and select the best path between a source and destination. There are two main types - static protocols where paths are manually assigned, and dynamic protocols where routers automatically share topology updates and select optimal routes. Common dynamic interior gateway protocols like RIP, EIGRP, and OSPF use distance vector or link state algorithms to calculate and update routing tables across an autonomous system.
Ospf
The document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes how OSPF routers exchange link state advertisements to maintain a synchronized topological database. The database allows each router to calculate the shortest path to all destinations within the autonomous system. The document also discusses OSPF packet types, the process of forming adjacencies between neighbors, and the election of designated routers on multi-access networks.
More Related Content
What's hot
Routing
Routing is the process of moving information across an internetwork from a source to a destination. There are two types of routing: direct delivery where the source and destination are on the same network, and indirect delivery where packets travel through multiple routers to reach the destination on a different network. Distance vector routing protocols like RIP use hop count as the metric and periodically share routing tables with neighboring routers to allow all routers to learn the optimal paths. However, this can cause instability issues like two-node and three-node loops where routers incorrectly update their routing tables.
Week13 lec2
The document describes routing algorithms and protocols at the network layer. It discusses global routing algorithms that use complete network knowledge versus decentralized algorithms that do not. It also covers the distance vector routing algorithm and how it works iteratively to share routing information between neighbors. Specific distance vector protocols discussed include RIP, which uses hop count as its metric. The document also introduces the concepts of hierarchical routing and autonomous systems to allow scaling of routing in a decentralized manner across large networks.
Olsr protocol ppt
he Optimized Link State Routing Protocol (OLSR)[1] is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR is a proactive link-state routing protocol, which uses hello and topology control (TC) messages to discover and then disseminate link state information throughout the mobile ad hoc network. Individual nodes use this topology information to compute next hop destinations for all nodes in the network using shortest hop forwarding paths.
Day 2 IP ROUTING
The document provides information about IP routing, including static and dynamic routing. It discusses:
- The basics of routing including destination addresses, neighbor routers, routes, and maintaining routing information.
- The benefits and disadvantages of static routing, including less overhead but requiring manual configuration.
- Dynamic routing protocols like RIP, IGRP, and OSPF that automatically share routing information.
- Configuring and verifying static routes, as well as troubleshooting connection issues.
- Key aspects of distance vector protocols like RIP and IGRP, including updates, loops, metrics, and timers.
Presentation2modi
This document summarizes and compares two reactive routing protocols for wireless ad-hoc networks: AODV and DSR. It describes that AODV uses routing tables and sequence numbers to prevent loops, and broadcasts route requests containing source and destination IP addresses. DSR uses source routing by storing routes in a cache, and data packets carry the source route. The document outlines the key mechanisms of each protocol, including route discovery and maintenance for DSR. It concludes by comparing their performance based on metrics like packet drop, consistency, throughput, noting that AODV had higher drops but more consistency while DSR had lower drops but less consistency.
Week13 lec1
The document summarizes routing protocols and algorithms used in computer networks. It discusses how routing protocols define how routers exchange network information, including the type of information exchanged and timing. Examples of routing protocols include RIP, EIGRP, OSPF and BGP. Routing algorithms find the least cost path between routers using a graph representation of the network. Dijkstra's algorithm is a link-state routing algorithm that computes the shortest paths from one router to all others using an iterative approach where it progressively updates the costs of reachable nodes.
Routing table
Routing protocols are used to automatically maintain routing tables in routers. Distance vector routing protocols like RIP use the distributed Bellman-Ford algorithm, where each router only knows its local state - the link metrics and estimates of distances to destinations from its neighbors. Using this information, routers periodically exchange distance updates with neighbors and recalculate path costs to determine the optimal next-hop for each destination. While simple and distributed, distance vector protocols are prone to slow convergence and routing loops in certain network conditions.
OSPF (Open Shortest Path First) Case Study: Anil Nembang
- The document discusses Open Shortest Path First (OSPF) configuration for a network comprising routers and PCs partitioned into 4 areas.
- An addressing scheme is proposed using /30 subnet masking to assign point-to-point interfaces between routers in areas 120, 120, and 120. Area 99 is an OSPF multi-access network requiring a different approach.
- OSPF is configured on the network with areas and interfaces assigned addresses according to the proposed scheme. A virtual link is also specified to connect the non-contiguous areas as required.
Distance Vector Routing Protocols
This document discusses and compares two routing protocols: distance vector routing and link state routing. Distance vector routing involves each node sharing its routing table only with its neighbors, while link state routing involves each node having knowledge of the entire network topology. The document outlines the working principles, drawbacks like count to infinity, and pros and cons of each approach.
rip, ospf 13-14
The document discusses several routing protocols used in TCP/IP networks, including RIP, OSPF, and BGP. It begins by distinguishing between intra-domain routing within an autonomous system and inter-domain routing between autonomous systems. It then covers the distance vector routing protocol RIP, the link state routing protocol OSPF used for intra-domain routing, and the path vector routing protocol BGP used for inter-domain routing. For each it discusses the routing algorithm, packet formats, and other implementation details.
Week16 lec1
This document provides a summary of key concepts about switches and the Address Resolution Protocol (ARP) at the link layer of computer networks:
- Switches operate at the link layer, selectively forwarding frames to the correct outgoing link based on the frame's MAC address. Switches learn MAC addresses and their associated ports through a self-learning process.
- ARP is used to dynamically map IP addresses to MAC addresses when two hosts are on the same local area network (LAN). When a host wants to send to an IP address, it first broadcasts an ARP request. The host with that IP responds with its MAC address.
- For hosts on different LANs, the sending host uses ARP to get the MAC address
IP ROUTING
Router used to make communication between different type of network ,for this purpose router use routing protocol and routed protocol. Routed protocol for source and destination address and routing protocol for path selection.
Link state protocols.ppt
Link-state routing protocols use Dijkstra's shortest path first algorithm to determine the optimal route between nodes. Each router uses hello packets to discover neighbors and then builds and floods link state packets (LSPs) throughout the network. All routers use the LSPs to construct a topological map and independently calculate the shortest path to every network using an SPF tree. Common link-state protocols are Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS).
Ospf
The document discusses designing a network for a software development organization using OSPF routing. It requires dividing the network into different areas for three departments - development, testing, and trainee. The trainee department should not have internet browsing access but all other communication should be allowed. ACLs will be configured on the routers to restrict access according to requirements.
Rip ospf and bgp
This document discusses routing protocols including RIP, OSPF, and BGP. It describes the differences between intradomain and interdomain routing. RIP uses distance vector routing, while OSPF uses link state routing based on Dijkstra's algorithm. BGP is an interdomain routing protocol that uses path vector routing to exchange routing information between autonomous systems.
IP Routing
The chapter discusses IP routing and routing protocols. It explains the goals of routing which include stability, robustness, dynamic path updates, and secure information transmission. It also covers routing metrics, interior and exterior routing protocols, static and dynamic routing, routing tables, and the Routing Information Protocol (RIP). RIP uses hop count as its metric and supports up to 15 hops between routers. Enhancements in RIPv2 include multicast updates, triggered updates, classless operation, and authentication.
Dynamic Routing
Dynamic routing protocols allow networks to keep routing tables up to date as the network changes over time. There are two main types of dynamic routing protocols: link-state protocols and vector-distance protocols. Link-state protocols have advantages like ensuring all routers converge on the same routing tables and generating less network traffic compared to vector-distance protocols. Common dynamic routing protocols include RIP, OSPF, IS-IS, and BGP.
Zaharaddeen karami lawal distance vector routing
In distance vector routing, the least-cost route between any two nodes is the route with minimum distance.
In this protocol, as the name implies, each node maintains a vector (table) of minimum distances to every node.
The table at each node also guides the packets to the desired node by showing the next stop in the route (next-hop routing).
Each node knows how to reach any other node and the cost. At the beginning, however, this is not the case the distance between itself and its immediate neighbors, those directly connected to it.
BASICS OF ROUTING IN NETWORKS
This document provides an overview of different routing protocols. It discusses IP routing, static routing, and dynamic routing. It also covers proactive routing protocols like DSDV which maintain routing tables and periodically update them. Reactive protocols like DSR and AODV establish routes on demand. Hybrid protocols combine proactive and reactive approaches. The document describes the key processes, advantages, and disadvantages of DSDV, DSR, AODV, and zone routing protocol.
Day 8 2 distance vector routing
Distance vector routing protocols work by having routers periodically share their routing tables with neighboring routers. This allows each router to build up its own table indicating the distance to various destinations via each neighbor. Issues can arise from slow convergence of routing information leading to inconsistent entries. Techniques like split horizon, route poisoning, and holddown timers aim to prevent routing loops from occurring during this convergence process.
What's hot (20)
OSPF (Open Shortest Path First) Case Study: Anil Nembang
OSPF (Open Shortest Path First) Case Study: Anil Nembang
Similar to Routing
Routing protocols.pptx
Routing protocols are sets of rules that enable routers to communicate and select the best path between a source and destination. There are two main types - static protocols where paths are manually assigned, and dynamic protocols where routers automatically share topology updates and select optimal routes. Common dynamic interior gateway protocols like RIP, EIGRP, and OSPF use distance vector or link state algorithms to calculate and update routing tables across an autonomous system.
Ospf
The document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes how OSPF routers exchange link state advertisements to maintain a synchronized topological database. The database allows each router to calculate the shortest path to all destinations within the autonomous system. The document also discusses OSPF packet types, the process of forming adjacencies between neighbors, and the election of designated routers on multi-access networks.
Routing Information Protocol (RIP)
RIP (Routing Information Protocol) is a distance vector routing protocol that exchanges routing information between routers to determine the best path. It uses hop count as the path selection metric and limits paths to 15 hops. RIP routers send routing updates every 30 seconds by default to advertise routes and timers are used to mark routes as invalid if updates are not received. It has features like split horizon and hold-down to improve stability but only considers hop count in path selection.
Basic router configuration
The document discusses several routing protocols: IGRP is a distance-vector protocol that uses a composite metric and supports unequal cost load balancing. EIGRP is an advanced protocol that converges faster and has less overhead than IGRP. OSPF is a link-state protocol that uses the SPF algorithm to determine the shortest routes; it divides networks into hierarchical areas and routes to improve scalability.
Routing ppt
Routing is the process of selecting a path for traffic in a network or between or across multiple networks. this slide helps to describe routing protocols and their various aspects.
Routing protocols
This slides will be very useful for engineering college students,Based on the Syllabus from Anna university chennai.
3 ip routing eigrp
This document provides an overview of IP routing essentials including routing protocols, path selection, static routing, and virtual routing and forwarding. It describes common routing protocols such as RIP, EIGRP, OSPF, IS-IS, and BGP. It discusses the algorithms and mechanisms used for path selection in distance vector protocols, link-state protocols, and BGP. It also covers topics such as administrative distance, metrics, equal-cost multipathing, and different types of static routes.
Ip routing
Routing protocols allow routers to exchange information and dynamically calculate the optimal data pathways between any two points on a network. Interior routing protocols operate within an autonomous system, while exterior protocols route between autonomous systems. Common interior protocols include RIP, OSPF, IGRP, and EIGRP, while exterior protocols include EGP and BGP. Routing metrics like hop count, bandwidth, load, and reliability help routers determine the best routes. Dynamic routing enables automatic path selection and updating in response to topology changes. [/SUMMARY]
Chapter Four - Network Layer.pptx
The network layer is responsible for carrying packets between hosts and routing packets through routers and switches. It addresses each device with an IP address to allow global communication. Routing protocols like RIP, OSPF, and BGP are used for routing packets within and between autonomous systems. Multicast routing protocols deliver data from one source to multiple destinations, while flooding can be used for broadcast routing but wastes bandwidth. The network layer packetizes data, fragments packets if needed for transmission through different networks, and performs address resolution.
Dynamic routing protocols (CCNA)
Dynamic routing protocols are used to automatically discover remote networks, maintain up-to-date routing information, and choose the best path to destination networks. There are two main types - interior gateway protocols (IGPs) like RIP, OSPF, and EIGRP that are used within an autonomous system, and exterior protocols like BGP that route between autonomous systems. IGPs use metrics like hop count or bandwidth to determine the best path. OSPF is a link-state protocol that floods link information, while EIGRP uses DUAL algorithm and maintains topology tables for fast convergence.
All in one q & ans
The document discusses routing and routing protocols. It provides explanations of key routing concepts like routing tables, static routing, default routing, dynamic routing, distance vector routing protocols, link state routing protocols, hybrid routing protocols, and how routing loops occur and can be overcome. It also defines specific routing protocols like OSPF, RIP, IGRP, EIGRP, and compares features of these protocols.
6.Routing
This document provides an overview of routing protocols and network security concepts. It discusses distance vector protocols like RIP, path vector protocols like BGP, and link state protocols like OSPF. It covers routing attacks such as source routing, spoofing, and man-in-the-middle attacks. It also discusses secure routing requirements and authentication methods used in protocols.
OSPF Open Shortest Path First protocol full details
Open Shortest Path First (OSPF) is a link-state routing protocol that was developed for IP networks and is based on the Shortest Path First (SPF) algorithm. OSPF is an Interior Gateway Protocol (IGP).
C 16
This document summarizes several multipath routing protocols for mobile ad hoc networks (MANETs). It discusses Ad Hoc On-Demand Distance Vector (AODV) routing, which uses on-demand route discovery and maintenance. It also describes Ad hoc On-Demand Multipath Distance Vector (AOMDV) routing, which extends AODV to find multiple disjoint paths. Additionally, it reviews a Load Balancing Multipath AODV (LB-M AODV) protocol that uses multiple paths to increase delivery ratio and balances load. Finally, it briefly discusses a Backup Path Routing protocol that selects primary and backup paths, and a Prioritized Routing (PRIMAR) protocol that considers packet priority when
ppt (it).pdf
Routing protocols allow routers to share information about changes on the internet and their neighborhoods. Intra-domain routing handles routing within autonomous systems using distance vector or link state protocols like RIP and OSPF. Inter-domain routing between autonomous systems uses the path vector BGP protocol. Distance vector protocols like RIP exchange periodic updates between neighbors, while link state protocols like OSPF share periodic topology information between all routers. BGP establishes sessions between directly connected routers of different autonomous systems to exchange routing information.
Wireless routing protocols
The document summarizes several routing protocols used in wireless networks. It discusses both table-driven protocols like DSDV and on-demand protocols like AODV. It provides details on how each protocol performs routing and maintains routes. It also outlines some advantages and disadvantages of protocols like DSDV, AODV, DSR, and TORA.
IPv6 Routing.pdf
Routing protocols exchange information to determine the best paths between sources and destinations in a network. The document discusses several routing protocols:
Distance vector protocols like RIP propagate routing tables between routers periodically. They are simple to configure but slow to converge. Link state protocols like OSPF use link state advertisements to build a map of the network and calculate the lowest cost paths more quickly. OSPF divides large networks into areas to reduce routing table sizes and convergence times. It elects routers on area borders to aggregate routing information between areas.
ccna networking ppt
it contains devices used in networking, companies manufactures of networking devices, routing protocols, etc ..
Qs.pptx
RIP is a distance-vector routing protocol that uses hop count as its routing metric. It operates at the OSI application layer and uses port 520. The maximum number of hops in a RIP route is 15. There are three versions of RIP with RIP v2 being classless and supporting authentication. RIP timers include the update, invalid, hold down, and flush timers. OSPF is a link-state routing protocol that uses the SPF/Dijkstra algorithm to calculate the shortest path. It has five message types including hello, database description, link-state request, link-state update, and link-state acknowledgement messages.
ConfigureTwo networks principle
Simple approach to connect two Nks using the following principle likes:
Scalable Routing Protocols and (Scalable network)
TCP/IP (Transmission Control Protocol/Internet Protocol)
OSPF (Open Shortest Path First)
or BGP (Border Gateway Protocol)
DHCP (Dynamic Host Configuration Protocol)
NAT (Network Address Translation)
Similar to Routing (20)
OSPF Open Shortest Path First protocol full details
OSPF Open Shortest Path First protocol full details
More from Bathshebaparimala
C programming structures & union
This document discusses C structures and unions. It begins by explaining the need for structure data types in C and how to define a structure using the struct keyword. Member access is done using the dot operator. Structures allow grouping of different data types under one name. Unions also define a custom data type but only one member can be active at a time as they share the same memory location. The document provides examples of defining, declaring variables of, and accessing members of structures and unions. It also compares the key differences between structures and unions.
An enhanced liver stages classification in 3 d ct and 3d-us images using glrl...
This document proposes a method to classify liver stages in 3D CT and 3D US images using texture feature extraction and 3D convolutional neural networks (CNNs). Gray level run length matrix (GLRLM) is used to extract texture features from segmented liver regions. A 3D CNN is then used for two stages of classification: first to classify images as normal or abnormal, and second to classify abnormal images into stages of liver disease (fatty liver, compensated cirrhosis, decompensated cirrhosis, hepatocellular carcinoma). The method is implemented using TensorFlow and Keras in Python. Results show that 3D CT provides higher classification accuracy than 3D US.
Assessment
This document discusses methods for the non-invasive classification and staging of chronic hepatic disease (CHD) using medical imaging techniques and machine learning. Various segmentation and feature extraction methods are applied to ultrasound liver images to analyze textures and identify features that can help classify disease stages. Classification algorithms like Bayes, Parzen, support vector machine, and k-nearest neighbor are used at different stages to distinguish healthy from diseased liver conditions and classify specific pathologies in a hierarchical manner. While non-invasive methods like transient elastography and ultrasound image analysis provide easy diagnosis, they have limitations for obese or ascites patients who may still require invasive biopsy for definitive diagnosis.
Normalization
Functional dependency defines constraints between attributes in a relation such that if two tuples have the same values for a set of attributes X, they must have the same values for another attribute Y. Armstrong's axioms generate all functional dependencies logically implied by a set of dependencies F through reflexive, augmentation, and transitive rules. Normalization removes anomalies from database design by decomposing relations until all dependencies meet certain normal forms like 1NF, 2NF, 3NF and BCNF.
Protocols and its standards
The document discusses network protocols and the OSI model. It explains that network protocols allow devices to communicate by establishing rules and data structures. It then describes the seven-layer OSI model and how network protocols operate at each layer to divide communication tasks. Some key application layer protocols discussed include DHCP for IP address management, DNS for domain name resolution, FTP for file transfer, HTTP for web browsing, IMAP/POP for email, SMTP for email transmission, Telnet for remote access, and SNMP for network management.
Unit v
UNIT V - Application Layer(DNS,Network Security cryptography,Symmetric key algorithms,Public key Algorithms,Digital Signature
Hint for transmission media
Transmission media is the physical medium used to transmit data between a sender and receiver. The two main types are guided and unguided media. Guided media uses physical pathways like cables to direct signals over shorter distances at high speeds securely. Common examples are twisted pair, coaxial, and fiber optic cables. Unguided media transmits electromagnetic waves without physical pathways, broadcasting signals through the air over longer distances less securely. Common examples are radio waves, microwaves, and infrared waves used in wireless technologies.
Osi model detail description
The document discusses the OSI model, which defines 7 layers of network communication - physical, data link, network, transport, session, presentation, and application. It describes the functions of each layer, with a focus on the physical and data link layers. The physical layer deals with transmitting raw bits and electrical signaling. The data link layer handles framing, addressing, error checking, and flow control to deliver error-free frames between nodes.
Creating a rainbow using graphics programming in c
This document discusses creating a rainbow graphic using C graphics programming functions. It explains that the graphics.h header file contains functions to draw shapes, display text in different formats, and create programs, animations, and games. It then provides examples of specific functions like delay(), setcolor(), and arc() that can be used to draw an arc-based rainbow by looping through color values and drawing incremental arcs. The code sample provided draws a rainbow centered on the screen by looping through color values from 30 to 200 and using setcolor() and arc() within the loop.
Network layer
The document discusses the network layer of the OSI model. It describes the functions of the network layer, including routing, addressing devices and networks, populating routing tables, queuing and forwarding data, internetworking between subnets, and delivering packets with best efforts. It also discusses routing algorithms like static routing, default routing, and dynamic routing. Dynamic routing protocols like RIP, OSPF, and BGP are mentioned. Congestion control algorithms like leaky bucket and token bucket are also summarized. The transport layer is briefly introduced as providing process-to-process delivery between computers connected in a network.
Microprocessor
This document provides information about assembly language and its advantages. It discusses that each processor has its own machine language of 1s and 0s, but assembly language uses symbolic codes to represent instructions in a more understandable way for software development. Assembly language allows direct access to hardware, requires less memory and execution time than other languages, and is suitable for time-critical tasks. The document then describes the different sections of an assembly program and provides an example program in 8085 assembly language to add two 8-bit numbers stored in memory locations.
Assembly language
This document provides information about assembly language and 8085 microprocessor instructions. It defines assembly language as a low-level programming language that represents machine code in a symbolic form. It then discusses the different sections of an assembly program and provides an example program for adding two 8-bit numbers on the 8085 microprocessor. Finally, it outlines the various instruction types supported by the 8086 microprocessor, including data transfer, arithmetic, bit manipulation, string, program flow, processor control, iteration control, and interrupt instructions.
Transport layer
The document discusses the transport layer and TCP protocol. It begins by defining the transport layer and its role in providing reliable data transport between processes on different machines. It describes the transport entity, transport service provider/user, and transport primitives. It then discusses various elements of transport protocols including addressing, connection establishment using three-way handshake, connection release using asymmetric/symmetric approaches, error control and flow control, and multiplexing. Finally, it provides an overview of TCP, noting it provides reliable byte streams over unreliable networks by adapting dynamically and being robust to network failures.
Generation of Computer Network
The document summarizes the five generations of computers from the first generation in 1946-1959 based on vacuum tubes to the current fifth generation from 1980 onwards based on artificial intelligence. Each generation is defined by the underlying technology used in processors. The first generation used vacuum tubes, second used transistors, third used integrated circuits, fourth used microprocessors, and fifth uses ULSI microprocessors. Each generation provided improvements in size, speed, reliability and capabilities over previous generations. The document also provides examples of computers from each generation and discusses their characteristics.
Network -Lecture Notes
This document defines various types of computer networks and networking concepts. It begins by defining what a computer network is. It then lists and briefly describes different types of networks including personal area networks, local area networks, wireless local area networks, campus area networks, metropolitan area networks, wide area networks, and storage area networks. It also discusses network topologies such as bus, star, ring, mesh, tree, and hybrid topologies. Finally, it provides an overview of the seven-layer OSI model.
Segmentation of Machine learning Algorithm
The document discusses different types of classification techniques. It categorizes classification based on the training sample, parameters used, pixel/spatial elements analyzed, use of spatial information, and whether multiple classifiers are used. Specific algorithms are listed for each category. Common classification techniques include maximum likelihood, k-means clustering, linear discriminant analysis, artificial neural networks, support vector machines, and decision trees. Each technique has distinct characteristics such as using parametric or non-parametric approaches and handling different types and volumes of input data.
Osireferencemodel
The document discusses the Open Systems Interconnection (OSI) model, which defines seven layers of network communication. It describes each layer in order from the physical layer, which transmits raw bits of data, to the application layer, which provides user interfaces and services. The seven layers are the physical, data link, network, transport, session, presentation, and application layers, with each layer building upon the functions of the layers below it to establish communication between applications running on networked devices.
Transmission media
This document provides an overview of different transmission media used for data communication, including both guided and unguided media. It discusses various types of guided media such as twisted pair cables, coaxial cables, and fiber optic cables. It describes their characteristics, applications, advantages and disadvantages. The document also covers unguided or wireless transmission media such as radio waves, microwaves, and infrared. It explains propagation methods for unguided signals and the role of antennas. Finally, it discusses some issues with signal transmission such as attenuation, distortion and noise.
Osi model
The document discusses the seven-layer OSI reference model. It describes each layer including the physical, data link, network, transport, session, presentation, and application layers. The physical layer deals with physical connections and converting data to bits. The data link layer converts bits to frames and provides tools for establishing connections. The network layer converts frames to packets and provides routing between networks. The transport layer reliably transmits packets and provides different classes of service. The session layer transmits data at time intervals and manages dialogs and tokens. The presentation layer translates data formats and performs encryption/compression. The application layer produces data and provides network services like file transfer and mail.
Relational dbms
This document provides an introduction to relational databases. It defines key concepts such as what a database is, how data is organized into relations and tables, what a relational database is, and what a database management system (DBMS) is and does. A DBMS allows users to create, update, query and manage the data and relations within a database through the use of database queries and commands. It also enforces integrity rules and authorization controls on the data. Relational databases organize data into logical relations, and relations can be represented visually as tables but the logical relation does not depend on how the table is structured or ordered.
More from Bathshebaparimala (20)
An enhanced liver stages classification in 3 d ct and 3d-us images using glrl...
An enhanced liver stages classification in 3 d ct and 3d-us images using glrl...
Creating a rainbow using graphics programming in c
Creating a rainbow using graphics programming in c
Recently uploaded
Types of Herbal Cosmetics its standardization.
Physiology and chemistry of skin and pigmentation, hairs, scalp, lips and nail, Cleansing cream, Lotions, Face powders, Face packs, Lipsticks, Bath products, soaps and baby product,
Preparation and standardization of the following : Tonic, Bleaches, Dentifrices and Mouth washes & Tooth Pastes, Cosmetics for Nails.
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar KanvariaNatural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityAkanksha trivedi rama nursing college kanpur.
Natural birth techniques are various type such as/ water birth , alexender method, hypnosis, bradley method, lamaze method etcAzure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
CACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Assessment and Planning in Educational technology.pptx
In an education system, it is understood that assessment is only for the students, but on the other hand, the Assessment of teachers is also an important aspect of the education system that ensures teachers are providing high-quality instruction to students. The assessment process can be used to provide feedback and support for professional development, to inform decisions about teacher retention or promotion, or to evaluate teacher effectiveness for accountability purposes.
The Diamonds of 2023-2024 in the IGRA collection
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS Template 2023-2024 by: Irene S. Rueco
clinical examination of hip joint (1).pdf
described clinical examination all orthopeadic conditions .
Digital Artifact 1 - 10VCD Environments Unit
Digital Artifact 1 - 10VCD Environments Unit - NGV Pavilion Concept Design
How to Manage Your Lost Opportunities in Odoo 17 CRM
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
How to Add Chatter in the odoo 17 ERP Module
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
Recently uploaded (20)
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Digital Artefact 1 - Tiny Home Environmental Design
Digital Artefact 1 - Tiny Home Environmental Design
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Assessment and Planning in Educational technology.pptx
Assessment and Planning in Educational technology.pptx
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
How to Manage Your Lost Opportunities in Odoo 17 CRM
How to Manage Your Lost Opportunities in Odoo 17 CRM
Routing
- 1. Unit IV Routing Algorithm: Routing is the process of selecting a path for traffic in a network or between or across multiple networks. There are three main types of routing algorithms: 1. Distance Vector (distance-vector routing)-DVR 2. To link state (link state routing)-(LSR) 3. Path to vector (path-vector routing)-(PVR) Routing Protocols: 1. RIP(Routing Information Protocol) -It identifies the availability path between source and destination(or)sender and receiver -DVR Algorithm used in this protocol Routing Table For RIP S.No Source Address Destination Address Hop count Path- Identification 1 192.168.1.101(S ource A) 192.168.1.110 (Destination E) 1 2 2 A-B-E A-D-F-E A-A-F-E Availablity path:3
- 2. 2.Open Shortest Path First Protocol(OSPF) -It identifies the shortest path in the network -Link state Routing protocols used(LSR) Routing Table For OSPF S.No Source Address Destination Address Hop count Path- Identification Shortest Path 1 192.168.1.101(S ource A) 192.168.1.110 (Destination E) 1 2 2 A-B-E A-D-F-E A-A-F-E A-B-E Define by hop count Availablity path:1
- 3. 2.Border Gateway Protocol(BGP) -It identifies the best path to transmit the data -PVR algorithm used Routing Table For BGP S.No Source Address Destination Address Hop count Path- Identification Best Path 1 192.168.1.101(S ource A) 192.168.1.110 (Destination E) 1 2 2 A-B-E A-D-F-E A-A-F-E A-B-E A-D-F-E Choosing the best path to transmitting Availablity path:1
- 4. Related Images could be draw X------------------------X X-----------------------X
- 5. This image is important