Routing algorithm
Download as pptx, pdf0 likes827 views
The document discusses routing algorithms used in computer networks. It describes adaptive and non-adaptive routing algorithms, with adaptive algorithms making decisions based on topology and traffic while non-adaptive algorithms use pre-stored routing information. Distance vector and link state routing algorithms are then explained in more detail, with distance vector using periodic updates between neighbors and link state flooding link information network-wide to allow all routers to map the entire network graph and calculate optimal routes.
1 of 15
Download to read offline
Ad
Recommended
Presentation Routing algorithm
Presentation Routing algorithmBasit Hussain The document discusses routing algorithms used in networking, specifically focusing on distance vector and link state routing. Distance vector routing is adaptive but slower to converge and can lead to traffic issues, while link state routing allows routers to have a clearer view of the network topology at the cost of needing more memory. Both methods have advantages and disadvantages that affect their implementation and efficiency in managing network traffic.
Multiple access protocol
Multiple access protocolMerlin Florrence This document discusses multiple access protocols used to coordinate access to shared broadcast channels. It describes various channel partitioning protocols like TDMA and FDMA that divide channels by time or frequency. Random access protocols like ALOHA and CSMA are also covered, which allow nodes to transmit randomly and detect collisions. CSMA/CD improves on CSMA by allowing nodes to detect collisions quickly and abort transmissions. Taking-turns protocols pass control of the channel between nodes either through polling or token passing. The document provides examples and compares the efficiency of different multiple access protocols.
Computer network switching
Computer network switchingShivani Godha This document discusses different types of computer network switching, including circuit switching, packet switching, and virtual circuit switching. Circuit switching establishes a dedicated connection between nodes for the duration of a call. Packet switching divides messages into packets that are routed independently through a network on a first-come, first-served basis without dedicated connections. Virtual circuit switching combines aspects of circuit switching and packet switching by establishing paths for packets through a three-phase process of setup, data transfer using local addressing, and teardown.
Routing algorithm network layer
Routing algorithm network layersambhenilesh The document provides an overview of different routing algorithms:
- It describes shortest path routing and discusses properties like optimality, simplicity, and robustness that routing algorithms should have.
- Common routing algorithms are described briefly, including flooding, distance vector routing, link state routing, and hierarchical routing.
- Specific routing algorithms like Dijkstra's algorithm, flow based routing, and link state routing are explained in more detail through examples.
- Issues with distance vector routing like the count to infinity problem are also covered.
- The talk concludes with hierarchical routing being presented as a solution for scaling routing to larger networks.
ALOHA Protocol (in detail)
ALOHA Protocol (in detail)Hinal Lunagariya The document discusses the ALOHA protocol for medium access. It was developed at the University of Hawaii in 1971 to connect users across the Hawaiian islands via radio frequencies. There are two main versions: Pure ALOHA, where nodes transmit randomly, and Slotted ALOHA, where time is divided into slots for transmission. Slotted ALOHA improves on Pure ALOHA by reducing collisions to only those within a time slot. The maximum throughput for Pure ALOHA is 18.4% while Slotted ALOHA achieves 37%, but both protocols experience exponentially decreasing performance with only small increases in network load.
Media Access Control
Media Access ControlVijayaLakshmi514 S.VIJAYALAKSHMI M.SC(CS) discusses Media Access Control and multiple access protocols. The main task of MAC protocols is to minimize collisions and utilize bandwidth by determining when nodes can access the shared channel, what to do when the channel is busy, and how to handle collisions. Early protocols like Aloha and slotted Aloha were inefficient at high loads due to many collisions. CSMA protocols reduce collisions by having nodes listen first before transmitting, but collisions are still possible due to propagation delays.
Unit 2 data link control
Unit 2 data link controlVishal kakade This document summarizes key topics related to data link control and protocols. It discusses framing methods like fixed-size and variable-size framing. It also covers flow control, error control, and protocols for both noiseless and noisy channels. Specific protocols described include the Simplest Protocol, Stop-and-Wait Protocol, Stop-and-Wait ARQ, Go-Back-N ARQ, and Selective Repeat ARQ. The document provides details on their design, algorithms, and flow diagrams to illustrate how each protocol handles framing, flow control, and error control.
Routing algorithms
Routing algorithmsParameswaran Selvakumar The document discusses routing algorithms, detailing both adaptive and non-adaptive types, their classifications, and specific algorithms such as distance vector and link state routing. Adaptive algorithms adjust routing decisions based on network conditions, while non-adaptive algorithms use pre-computed routes. The document also covers the workings of various routing algorithms, their advantages and disadvantages, and the role of speaker nodes in path vector routing.
Issues in Data Link Layer
Issues in Data Link Layerselvakumar_b1985 The data link layer ensures reliable and efficient communication over the physical link by addressing issues such as framing, flow control, error control, synchronization, and link configuration control. It provides various services to the network layer, including unacknowledged and acknowledged connectionless services, as well as acknowledged connection-oriented services. Key functions include translating raw bits into frames, preventing buffer overflow during data transmission, detecting and correcting errors, and defining link topology and duplexity.
Ipv4 presentation
Ipv4 presentationshakeel khan IPv4 is the fourth version of the Internet Protocol (IP) and routes most internet traffic. It uses 32-bit addresses, allowing for over 4 billion devices to connect. Addresses are written in binary or dotted-decimal notation, with each part identifying the network or host. IPv4 addresses are divided into classes A-C that determine the portions for network vs host identification, with classes D-E being reserved. Issues with IPv4 include a limited address space and increasing routing tables as the internet grows.
Routing algorithm
Routing algorithmBushra M The document presents an overview of routing algorithms, explaining the roles of routers in packet forwarding and routing. It differentiates between adaptive and nonadaptive routing algorithms and covers concepts like sink trees, flooding, distance vector routing, and link state routing. Additionally, it discusses hierarchical routing for managing routing tables, mobile host routing, and multicast routing methods.
Multiple Access in Computer Network
Multiple Access in Computer NetworkHitesh Mohapatra The document discusses multiple access protocols in the data link layer, specifically detailing random access methods like ALOHA and CSMA variants, along with controlled access methods such as polling and token passing. It also covers channelization techniques including FDMA, TDMA, and CDMA, and provides insights into the evolution of Ethernet standards through various generations and their implementations. The document highlights the importance of bandwidth utilization and the methodology behind different access protocols.
Distance vector routing
Distance vector routingSiddique Ibrahim Distance vector routing works by having each node maintain a routing table with the minimum distance to reach every other node. Nodes share their routing tables with immediate neighbors periodically or when changes occur, allowing each node to learn optimal routes throughout the network. Each node sends only the minimum distance and next hop information to neighbors, who update their own tables. This sharing of routing information allows all nodes to gradually learn the least-cost routes.
CSMA /CD PPT ON SLIDESHARE
CSMA /CD PPT ON SLIDESHAREKhushboo Pal The CSMA/CD protocol enhances the basic CSMA method by incorporating collision detection for improved media access control, particularly in early Ethernet networks. It allows stations to sense the medium before transmitting and respond to collisions by transmitting a jam signal and retrying after a random delay. Despite its effectiveness in managing data collisions, CSMA/CD is limited by cable length and becomes less efficient in larger networks.
Media Access Control (MAC Layer)
Media Access Control (MAC Layer)Meenakshi Paul The document outlines various media access control (MAC) protocols, which are critical for managing how multiple stations access a shared communication medium without conflict. It covers random access methods like ALOHA and CSMA, controlled access methods, and channelization techniques such as FDMA, TDMA, and CDMA. Each method is designed to reduce collisions and manage data transmission effectively in multipoint networks.
TCP/IP Protocols With All Layer Description
TCP/IP Protocols With All Layer DescriptionShubham Khedekar The document provides an overview of the TCP/IP protocol suite, detailing its layers: the application, transport, network, data link, and physical layers. Each layer's functions and protocols, such as HTTP, FTP, and TCP/IP, are described, with emphasis on error detection, data routing, and transmission reliability. It highlights the roles of different protocols in ensuring effective communication and data transfer across networks.
ENCAPSULATION AND TUNNELING
ENCAPSULATION AND TUNNELINGMohammad Adil Mobile IP uses encapsulation and tunneling to forward data to mobile nodes. When a mobile node registers with its home agent while connected to a foreign network, the home agent intercepts datagrams for the mobile node and encapsulates them by adding a new IP header. This creates a tunnel to the mobile node's care-of address. Common encapsulation methods include IP-in-IP, minimal encapsulation, and GRE. Tunneling allows datagrams to be forwarded across networks while hiding the details of the encapsulated datagram. Loops can occur if the source IP matches the tunnel endpoint, so routers discard these datagrams.
Transmission impairments(presentation)
Transmission impairments(presentation)Vivek Kumar Attenuation, distortion, and noise are the main causes of transmission impairments. Attenuation is the reduction of signal strength during transmission, distortion alters the original signal shape, and noise is random electrical interference from internal and external sources that disrupts signal reception. These transmission impairments degrade, weaken, and contaminate signals as they travel through transmission mediums.
Link state routing protocol
Link state routing protocolAung Thu Rha Hein Link-state routing protocols use Dijkstra's algorithm to calculate the shortest path to all destinations based on a link-state database containing the full network topology. Each router runs the same algorithm locally to determine the optimal path. Key aspects include link-state advertisements to share connectivity information, the topological database to store network maps, and shortest path first calculations to derive routes. Common link-state protocols are OSPF and IS-IS. They provide fast convergence and scalability but require more resources than distance-vector protocols.
The medium access sublayer
The medium access sublayerLal Bahadur Gehlot The document discusses the Medium Access Control (MAC) sublayer of the data link layer and various protocols for determining which device can access a shared communication channel. It focuses on static and dynamic channel allocation problems in local area networks (LANs) and wireless networks. Static allocation wastes bandwidth by assigning each user a fixed portion of the channel even when they are not transmitting. Dynamic protocols like ALOHA and carrier sense multiple access (CSMA) aim to improve channel utilization by allowing users to transmit only when the channel is idle.
Flow Control
Flow Controlselvakumar_b1985 Flow control specifies how much data a sender can transmit before receiving permission to continue. There are two main types of flow control: stop-and-wait and sliding window. Stop-and-wait allows transmission of one frame at a time, while sliding window allows transmitting multiple frames before needing acknowledgement. Sliding window flow control uses variables like window size, last ACK received, and last frame sent to determine how transmission proceeds. It provides more efficiency than stop-and-wait. Automatic repeat request (ARQ) handles retransmission of lost or damaged frames through timeouts, negative acknowledgements, or cumulative acknowledgements depending on the specific ARQ protocol used.
Unit 3 Network Layer PPT
Unit 3 Network Layer PPTKalpanaC14 The document discusses network layer concepts including packet switching, IP addressing, and fragmentation. It provides details on:
- Packet switching breaks data into packets that are routed independently and reassembled at the destination. This allows for more efficient use of bandwidth compared to circuit switching.
- IP addresses in IPv4 are 32-bit numbers that identify devices on the network. Addresses are expressed in decimal notation like 192.168.1.1. Fragmentation breaks packets larger than the MTU into smaller fragments for transmission.
Computer networks - Channelization
Computer networks - ChannelizationElambaruthi Elambaruthi The document provides an overview of multiple access protocols in computer networks, discussing various methods such as random access, controlled access, and channelization protocols. It details specific techniques like Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA), and Code Division Multiple Access (CDMA), explaining their operational mechanics and use cases. The document emphasizes the importance of managing simultaneous data transmission to prevent collisions and ensure effective communication among multiple stations.
Data link layer
Data link layer Mukesh Chinta The Data Link Layer (DLL) is responsible for node-to-node communication, handling framing, addressing, flow control, and error control based on packets provided by the Network Layer. It offers various services, including unacknowledged connectionless, acknowledged connectionless, and acknowledged connection-oriented services. Error detection and correction methods such as vertical redundancy check, cyclic redundancy check, and others ensure the accurate transmission and integrity of data frames across the link.
priority interrupt computer organization
priority interrupt computer organizationchnrketan This document discusses different methods for prioritizing interrupts in a computer system. It describes software polling, where interrupts are checked sequentially in software to determine priority. It then covers two hardware methods: daisy-chaining priority, where devices are connected serially by priority level; and parallel priority, where an interrupt register tracks devices and a mask register controls which interrupts can trigger a response. Both hardware methods allow faster interrupt handling than software polling by directly determining the highest priority pending interrupt.
RANDOM ACCESS PROTOCOL IN COMMUNICATION
RANDOM ACCESS PROTOCOL IN COMMUNICATION AMOGHA A K The document discusses random access protocols in communication, particularly focusing on ALOHA and CSMA protocols to manage data transmission and avoid collisions. It outlines the history, functions, advantages, limitations, and applications of these protocols, emphasizing their significance in facilitating efficient data exchange over networks. Future research directions and the impact of these protocols on computer networks and human communication are also highlighted.
Flow Control.pptx
Flow Control.pptxAshokRachapalli1 Flow control is a data link layer mechanism that regulates the amount of data sent by the sender to ensure the receiver can process it. It works by having the sender wait for acknowledgment from the receiver before sending more data. Common flow control methods include stop-and-wait, which only allows one packet to be sent at a time, and sliding window protocols, which allow multiple packets to be sent before waiting for acknowledgment. Flow control prevents buffer overflows and frame losses at the receiver.
Multiple Access Protocal
Multiple Access Protocaltes31 Fast Ethernet increased the bandwidth of standard Ethernet from 10 Mbps to 100 Mbps. It used the same CSMA/CD access method and frame format as standard Ethernet but with some changes to address the higher speed. Fast Ethernet was implemented over twisted pair cables using 100BASE-TX or over fiber optic cables using 100BASE-FX. The increased speed enabled Fast Ethernet to compete with other high-speed LAN technologies of the time like FDDI.
Routing Protocols notes document .pptx.pdf
Routing Protocols notes document .pptx.pdfstefanrowlings The document provides an overview of routing in network architecture, detailing the roles of routers, including packet forwarding and routing as key functions. It describes the architecture of routers, emphasizing the components like input/output ports, switching fabric, and the routing processor, along with their respective functionalities. Additionally, the document covers routing protocols, distinguishing between dynamic vs. static, and link-state vs. distance vector, and explains algorithms like Dijkstra's and Bellman's Ford for pathfinding.
Module 3- transport_layer .pptx
Module 3- transport_layer .pptxhariprasad279825 This document provides an overview of key concepts in the network layer, including the architecture of routers, IPv6, routing algorithms like link state and distance vector, and routing protocols like RIP, OSPF, and BGP. It discusses router functions such as routing algorithms/protocols and packet forwarding. It also covers topics like switching fabrics, queuing, and hierarchical routing between autonomous systems.
More Related Content
What's hot (20)
Issues in Data Link Layer
Issues in Data Link Layerselvakumar_b1985 The data link layer ensures reliable and efficient communication over the physical link by addressing issues such as framing, flow control, error control, synchronization, and link configuration control. It provides various services to the network layer, including unacknowledged and acknowledged connectionless services, as well as acknowledged connection-oriented services. Key functions include translating raw bits into frames, preventing buffer overflow during data transmission, detecting and correcting errors, and defining link topology and duplexity.
Ipv4 presentation
Ipv4 presentationshakeel khan IPv4 is the fourth version of the Internet Protocol (IP) and routes most internet traffic. It uses 32-bit addresses, allowing for over 4 billion devices to connect. Addresses are written in binary or dotted-decimal notation, with each part identifying the network or host. IPv4 addresses are divided into classes A-C that determine the portions for network vs host identification, with classes D-E being reserved. Issues with IPv4 include a limited address space and increasing routing tables as the internet grows.
Routing algorithm
Routing algorithmBushra M The document presents an overview of routing algorithms, explaining the roles of routers in packet forwarding and routing. It differentiates between adaptive and nonadaptive routing algorithms and covers concepts like sink trees, flooding, distance vector routing, and link state routing. Additionally, it discusses hierarchical routing for managing routing tables, mobile host routing, and multicast routing methods.
Multiple Access in Computer Network
Multiple Access in Computer NetworkHitesh Mohapatra The document discusses multiple access protocols in the data link layer, specifically detailing random access methods like ALOHA and CSMA variants, along with controlled access methods such as polling and token passing. It also covers channelization techniques including FDMA, TDMA, and CDMA, and provides insights into the evolution of Ethernet standards through various generations and their implementations. The document highlights the importance of bandwidth utilization and the methodology behind different access protocols.
Distance vector routing
Distance vector routingSiddique Ibrahim Distance vector routing works by having each node maintain a routing table with the minimum distance to reach every other node. Nodes share their routing tables with immediate neighbors periodically or when changes occur, allowing each node to learn optimal routes throughout the network. Each node sends only the minimum distance and next hop information to neighbors, who update their own tables. This sharing of routing information allows all nodes to gradually learn the least-cost routes.
CSMA /CD PPT ON SLIDESHARE
CSMA /CD PPT ON SLIDESHAREKhushboo Pal The CSMA/CD protocol enhances the basic CSMA method by incorporating collision detection for improved media access control, particularly in early Ethernet networks. It allows stations to sense the medium before transmitting and respond to collisions by transmitting a jam signal and retrying after a random delay. Despite its effectiveness in managing data collisions, CSMA/CD is limited by cable length and becomes less efficient in larger networks.
Media Access Control (MAC Layer)
Media Access Control (MAC Layer)Meenakshi Paul The document outlines various media access control (MAC) protocols, which are critical for managing how multiple stations access a shared communication medium without conflict. It covers random access methods like ALOHA and CSMA, controlled access methods, and channelization techniques such as FDMA, TDMA, and CDMA. Each method is designed to reduce collisions and manage data transmission effectively in multipoint networks.
TCP/IP Protocols With All Layer Description
TCP/IP Protocols With All Layer DescriptionShubham Khedekar The document provides an overview of the TCP/IP protocol suite, detailing its layers: the application, transport, network, data link, and physical layers. Each layer's functions and protocols, such as HTTP, FTP, and TCP/IP, are described, with emphasis on error detection, data routing, and transmission reliability. It highlights the roles of different protocols in ensuring effective communication and data transfer across networks.
ENCAPSULATION AND TUNNELING
ENCAPSULATION AND TUNNELINGMohammad Adil Mobile IP uses encapsulation and tunneling to forward data to mobile nodes. When a mobile node registers with its home agent while connected to a foreign network, the home agent intercepts datagrams for the mobile node and encapsulates them by adding a new IP header. This creates a tunnel to the mobile node's care-of address. Common encapsulation methods include IP-in-IP, minimal encapsulation, and GRE. Tunneling allows datagrams to be forwarded across networks while hiding the details of the encapsulated datagram. Loops can occur if the source IP matches the tunnel endpoint, so routers discard these datagrams.
Transmission impairments(presentation)
Transmission impairments(presentation)Vivek Kumar Attenuation, distortion, and noise are the main causes of transmission impairments. Attenuation is the reduction of signal strength during transmission, distortion alters the original signal shape, and noise is random electrical interference from internal and external sources that disrupts signal reception. These transmission impairments degrade, weaken, and contaminate signals as they travel through transmission mediums.
Link state routing protocol
Link state routing protocolAung Thu Rha Hein Link-state routing protocols use Dijkstra's algorithm to calculate the shortest path to all destinations based on a link-state database containing the full network topology. Each router runs the same algorithm locally to determine the optimal path. Key aspects include link-state advertisements to share connectivity information, the topological database to store network maps, and shortest path first calculations to derive routes. Common link-state protocols are OSPF and IS-IS. They provide fast convergence and scalability but require more resources than distance-vector protocols.
The medium access sublayer
The medium access sublayerLal Bahadur Gehlot The document discusses the Medium Access Control (MAC) sublayer of the data link layer and various protocols for determining which device can access a shared communication channel. It focuses on static and dynamic channel allocation problems in local area networks (LANs) and wireless networks. Static allocation wastes bandwidth by assigning each user a fixed portion of the channel even when they are not transmitting. Dynamic protocols like ALOHA and carrier sense multiple access (CSMA) aim to improve channel utilization by allowing users to transmit only when the channel is idle.
Flow Control
Flow Controlselvakumar_b1985 Flow control specifies how much data a sender can transmit before receiving permission to continue. There are two main types of flow control: stop-and-wait and sliding window. Stop-and-wait allows transmission of one frame at a time, while sliding window allows transmitting multiple frames before needing acknowledgement. Sliding window flow control uses variables like window size, last ACK received, and last frame sent to determine how transmission proceeds. It provides more efficiency than stop-and-wait. Automatic repeat request (ARQ) handles retransmission of lost or damaged frames through timeouts, negative acknowledgements, or cumulative acknowledgements depending on the specific ARQ protocol used.
Unit 3 Network Layer PPT
Unit 3 Network Layer PPTKalpanaC14 The document discusses network layer concepts including packet switching, IP addressing, and fragmentation. It provides details on:
- Packet switching breaks data into packets that are routed independently and reassembled at the destination. This allows for more efficient use of bandwidth compared to circuit switching.
- IP addresses in IPv4 are 32-bit numbers that identify devices on the network. Addresses are expressed in decimal notation like 192.168.1.1. Fragmentation breaks packets larger than the MTU into smaller fragments for transmission.
Computer networks - Channelization
Computer networks - ChannelizationElambaruthi Elambaruthi The document provides an overview of multiple access protocols in computer networks, discussing various methods such as random access, controlled access, and channelization protocols. It details specific techniques like Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA), and Code Division Multiple Access (CDMA), explaining their operational mechanics and use cases. The document emphasizes the importance of managing simultaneous data transmission to prevent collisions and ensure effective communication among multiple stations.
Data link layer
Data link layer Mukesh Chinta The Data Link Layer (DLL) is responsible for node-to-node communication, handling framing, addressing, flow control, and error control based on packets provided by the Network Layer. It offers various services, including unacknowledged connectionless, acknowledged connectionless, and acknowledged connection-oriented services. Error detection and correction methods such as vertical redundancy check, cyclic redundancy check, and others ensure the accurate transmission and integrity of data frames across the link.
priority interrupt computer organization
priority interrupt computer organizationchnrketan This document discusses different methods for prioritizing interrupts in a computer system. It describes software polling, where interrupts are checked sequentially in software to determine priority. It then covers two hardware methods: daisy-chaining priority, where devices are connected serially by priority level; and parallel priority, where an interrupt register tracks devices and a mask register controls which interrupts can trigger a response. Both hardware methods allow faster interrupt handling than software polling by directly determining the highest priority pending interrupt.
RANDOM ACCESS PROTOCOL IN COMMUNICATION
RANDOM ACCESS PROTOCOL IN COMMUNICATION AMOGHA A K The document discusses random access protocols in communication, particularly focusing on ALOHA and CSMA protocols to manage data transmission and avoid collisions. It outlines the history, functions, advantages, limitations, and applications of these protocols, emphasizing their significance in facilitating efficient data exchange over networks. Future research directions and the impact of these protocols on computer networks and human communication are also highlighted.
Flow Control.pptx
Flow Control.pptxAshokRachapalli1 Flow control is a data link layer mechanism that regulates the amount of data sent by the sender to ensure the receiver can process it. It works by having the sender wait for acknowledgment from the receiver before sending more data. Common flow control methods include stop-and-wait, which only allows one packet to be sent at a time, and sliding window protocols, which allow multiple packets to be sent before waiting for acknowledgment. Flow control prevents buffer overflows and frame losses at the receiver.
Multiple Access Protocal
Multiple Access Protocaltes31 Fast Ethernet increased the bandwidth of standard Ethernet from 10 Mbps to 100 Mbps. It used the same CSMA/CD access method and frame format as standard Ethernet but with some changes to address the higher speed. Fast Ethernet was implemented over twisted pair cables using 100BASE-TX or over fiber optic cables using 100BASE-FX. The increased speed enabled Fast Ethernet to compete with other high-speed LAN technologies of the time like FDDI.
Similar to Routing algorithm (20)
Routing Protocols notes document .pptx.pdf
Routing Protocols notes document .pptx.pdfstefanrowlings The document provides an overview of routing in network architecture, detailing the roles of routers, including packet forwarding and routing as key functions. It describes the architecture of routers, emphasizing the components like input/output ports, switching fabric, and the routing processor, along with their respective functionalities. Additionally, the document covers routing protocols, distinguishing between dynamic vs. static, and link-state vs. distance vector, and explains algorithms like Dijkstra's and Bellman's Ford for pathfinding.
Module 3- transport_layer .pptx
Module 3- transport_layer .pptxhariprasad279825 This document provides an overview of key concepts in the network layer, including the architecture of routers, IPv6, routing algorithms like link state and distance vector, and routing protocols like RIP, OSPF, and BGP. It discusses router functions such as routing algorithms/protocols and packet forwarding. It also covers topics like switching fabrics, queuing, and hierarchical routing between autonomous systems.
Network Layer
Network Layerreshmadayma The document discusses various layers and concepts in computer networks and internetworking. It covers the network layer and its responsibilities in delivering packets from source to destination. It then discusses services provided by the network layer to the transport layer, including connection-oriented and connectionless services. Various routing algorithms and concepts are covered such as distance vector routing, link state routing, hierarchical routing, flooding, shortest path algorithms, broadcast routing, and multicast routing.
11-RoutingThe development of wireless systems traces its roots .ppt
11-RoutingThe development of wireless systems traces its roots .pptvimalgaur7 The development of wireless systems traces its roots
Routing algorithm
Routing algorithmTechStudent1 This document provides an overview of routing algorithms. It begins with an introduction to routing and forwarding. It then describes adaptive routing algorithms like centralized, isolation, and distributed algorithms. Non-adaptive algorithms like flooding and random walks are also covered. Common routing protocols like OSPF, BGP, and RIP are listed. Distance vector and link state routing algorithms are explained in detail through examples of how routing tables are created and updated.
COMPUTER NETWORKS CHAPTER 3 NETWORK LAYER NOTES CSE 3RD year sem 1
COMPUTER NETWORKS CHAPTER 3 NETWORK LAYER NOTES CSE 3RD year sem 1aishwaryaarrao3 The document covers key topics in computer networks, specifically focusing on the network layer, routing algorithms, and congestion control mechanisms. It discusses various routing techniques, including shortest path algorithms, adaptive and non-adaptive routing, and the implementation of connectionless and connection-oriented services. Additionally, it addresses quality of service requirements, internetworking issues, and the principles of effective network layer design.
Comparative Analysis of Distance Vector Routing & Link State Protocols
Comparative Analysis of Distance Vector Routing & Link State ProtocolsEast West University The document compares distance vector routing (DVA) and link state routing (LSA), highlighting their characteristics, strengths, and weaknesses. DVA is simpler with low CPU and memory usage, while LSA offers faster and more efficient routing at the cost of higher resource requirements. The paper also identifies gaps in data comparisons and problem focus, suggesting future research into security in routing protocols.
CN WEEK 11.pdf
CN WEEK 11.pdfssuser06fbd31 Routing is the process of selecting the best path to send data from a source to a destination. Routers perform routing by using routing protocols and algorithms to determine the optimal path. Distance vector routing uses hop count as the metric to calculate the best path, while link state routing uses the least cost path based on metrics like bandwidth and delay. Key differences are that distance vector routing shares distance vectors with neighbors periodically, while link state routing shares complete topology information and triggers updates when links change state.
Routing and IP in Advance Computer Network,Vikram Snehi
Routing and IP in Advance Computer Network,Vikram SnehiMR. VIKRAM SNEHI This document provides an overview of routing in IP networks. It discusses different routing protocols and algorithms used by routers to determine the best path between networks. Distance-vector protocols like RIP use hop count as the routing metric and exchange full routing tables periodically. Link-state protocols like OSPF use link costs and flood link state information to all routers to build a topology map and calculate shortest paths using Dijkstra's algorithm. BGP is used as the exterior routing protocol between autonomous systems. Areas are used in large OSPF networks to reduce routing overhead.
11 routing
11 routingshefali84 This document discusses routing in IP networks. It begins by introducing routing and routing protocols. Routers use routing protocols to decide the best path between networks based on metrics like link costs and current congestion. It then provides an example of router and network configurations with link costs. The document discusses routing tables, which contain the next hop for each destination network. It also covers different types of routing like fixed, adaptive, flooding and random routing. Adaptive routing aims to dynamically change paths in response to failures or congestion but faces challenges. The document classifies adaptive routing strategies and algorithms like distance-vector, link-state, and path-vector routing. It concludes by explaining the Dijkstra's and Bellman-Ford least cost
module10-rip (1).ppt
module10-rip (1).pptRakesh Dhiman Dynamic routing protocols calculate routes dynamically based on information exchanged between routers. Routing Information Protocol (RIP) is an example of a distance vector routing protocol. Distance vector protocols work by having each router periodically send its full routing table to neighbors. This can allow routes to increase without bound in the presence of failures, known as the count-to-infinity problem. Solutions include advertising the full path a route takes, not just the next hop.
Distance Vector & Link state Routing Algorithm
Distance Vector & Link state Routing AlgorithmMOHIT AGARWAL 1) Each router maintains a routing table containing the outgoing link and distance to reach each destination node. 2) Routers periodically share their routing tables with neighbors so each can update its own table. 3) This allows routers to continuously determine the shortest paths to all destinations as network conditions change.
Computer Network - Unicast Routing Distance vector Link state vector
Computer Network - Unicast Routing Distance vector Link state vectorKongu Engineering College, Perundurai, Erode The document discusses unicast routing protocols, highlighting their role in delivering datagrams from a source to a destination via forwarding tables and least-cost routing techniques. It compares distance-vector and link-state routing methods, elaborating on their mechanisms, advantages, and challenges such as the count-to-infinity problem. Additionally, it explains the Bellman-Ford algorithm and Dijkstra’s algorithm in the context of finding shortest paths in routing scenarios.
routing algorithm
routing algorithmAnusuaBasu The document discusses routing algorithms in computer networks. It describes the key components of routers and their functions. It then explains the concepts of distance vector routing (DVR) and link state routing algorithms. For DVR, it provides an example to illustrate how routers calculate and update their routing tables using the Bellman-Ford algorithm. For link state routing, it explains the key steps of reliable flooding of link state information and route calculation using Dijkstra's algorithm through an example network topology. It compares the advantages and disadvantages of both routing approaches.
UNIT2-nw layer autonomy.pptx
UNIT2-nw layer autonomy.pptxsatvikpatil5 The document discusses routing algorithms in computer networks. It describes the functions of the network layer, including internetworking, addressing, routing, and packetizing. It then focuses on routing algorithms, classifying them as either adaptive or non-adaptive. Adaptive algorithms make routing decisions dynamically based on network conditions, while non-adaptive algorithms use static routing tables. Specific adaptive algorithms discussed include distance vector routing and link state routing, along with explanations of how each works.
Routing
RoutingAmit Pandey 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.
Overview of Routing Techniques
Overview of Routing TechniquesSigSegVSquad The document provides an overview of routing protocols, including static and dynamic routing techniques used in network data transfer. It discusses metrics utilized to determine optimal routes, such as hop count and delay, and explains concepts like default routing, static routing, and dynamic/adaptive routing. Additionally, it covers distance vector and path vector routing protocols and their characteristics, emphasizing their roles in maintaining efficient network communication.
Computer Network - Unicast Routing Distance vector Link state vector
Computer Network - Unicast Routing Distance vector Link state vectorKongu Engineering College, Perundurai, Erode
Ad
More from Siva Priya (12)
source code metrics and other maintenance tools and techniques
source code metrics and other maintenance tools and techniquesSiva Priya The document discusses two source code metrics: Halstead's effort equation and McCabe's cyclomatic complexity measure. Halstead's metrics are based on counts of operators, operands, unique operators, and unique operands in source code. McCabe's measure defines the complexity of a program's control flow graph based on the number of edges, nodes, and connected components. The document also mentions that software maintenance involves a range of activities from code modification to tracking complexity metrics over time.
Class properties
Class propertiesSiva Priya The document discusses key concepts in class definitions in VB.Net including class structure with attributes, access modifiers, and inheritance indicators. It also covers class members like functions and encapsulation. Constructors and destructors are described as special member functions. Inheritance allows one class to inherit properties from another base class.
Planning the development process
Planning the development processSiva Priya The document discusses several software development life cycle models:
- The phased model segments development into phases like analysis, design, implementation, testing and maintenance.
- The cost model views the life cycle in terms of costs incurred in each phase and modifying previous work.
- Prototyping involves building initial versions to explore technical issues and illustrate requirements for the customer.
- Successive versions refines an initial product skeleton through multiple iterations.
Planning the development process involves choosing a life cycle model and defining documents, milestones and reviews. This provides structure and visibility needed for control and quality.
recovery management with concurrent controls
recovery management with concurrent controlsSiva Priya This document discusses recovery management and concurrency controls in databases. It defines recovery management as the process of restoring a database to its most recent consistent state after a failure. There are three states in recovery: pre-condition (consistent), condition (failure occurs), and post-condition (restore to pre-failure state). The types of failures are transaction, system, and media failures. Concurrency control manages simultaneous transactions to maintain consistency and prevent issues like lost updates, temporary updates, and incorrect summaries that can occur from concurrent execution.
Web technology
Web technology Siva Priya This document discusses exception handling in programming. It defines errors and exceptions, and describes the exception handling mechanism which involves try, catch, and throw blocks. There are two types of exceptions: synchronous which occur during program execution due to faults, and asynchronous caused by unrelated events. The try block contains code that may throw exceptions. When an exception occurs, it is thrown using throw and caught using catch, where it can be handled appropriately. There can be multiple catch blocks to handle different exception types. Exceptions can also be re-thrown to outer try/catch blocks using throw without arguments.
Retail of big data analytics
Retail of big data analyticsSiva Priya The document discusses how big data analytics can help retailers optimize their business operations and customer interactions. It explains that big data allows retailers to maintain a 360-degree view of each customer by understanding their preferences, behaviors, and attributes. This enables personalized engagement and targeted marketing. Big data also helps retailers optimize pricing by anticipating trends, streamline supply chain and inventory management, and enhance customer service by analyzing customer support interactions and feedback. Overall, the document outlines how big data is essential for retailers to target and retain customers while improving business decisions and reducing costs.
Deadlock and shadow paging
Deadlock and shadow pagingSiva Priya A deadlock occurs when two or more transactions are waiting indefinitely for each other to release locks on resources. For example, Transaction 1 locks rows in the student table while needing to update the grade table locked by Transaction 2, and vice versa. The transactions reach a standstill waiting state until the DBMS detects the deadlock and aborts one transaction. Methods to prevent or detect deadlocks include maintaining a wait-for graph to check for cycles and prioritizing older transactions.
Mobile IP
Mobile IPSiva Priya This document discusses Mobile IP and related concepts. It begins by outlining the motivation for Mobile IP, including issues with changing IP addresses or routing tables when a mobile node changes locations. It then defines key terminology like mobile node, home agent, foreign agent, and care-of address. It explains how registration and encapsulation allow a mobile node to maintain its home IP address as it roams. Finally, it discusses security considerations, problems, and the relationship between Mobile IP and IPv6.
density based method and expectation maximization
density based method and expectation maximizationSiva Priya This document discusses density-based clustering algorithms DBSCAN and OPTICS. DBSCAN clusters points based on density connectivity, defining clusters as areas of high density connected by chains of points with smaller neighborhoods. It directly assigns points to clusters or noise. OPTICS produces a special ordering of points based on density, representing the intrinsic clustering structure without predefined number of clusters. It extends DBSCAN to process points in a specific order based on lowest density reachability.
Classification by backpropacation
Classification by backpropacationSiva Priya The document discusses neural networks and their use for pattern detection and machine learning. It describes how neural networks are modeled after the human nervous system and consist of connected input/output units with associated weights. The key points covered include:
- Neural networks can build highly accurate predictive models by training on large datasets.
- Backpropagation is a common neural network learning algorithm that adjusts weights to predict the correct class label of inputs.
- Neural networks have strengths like tolerance to noisy data and ability to classify untrained patterns, but also weaknesses like long training times and lack of interpretability.
Disk scheduling & Disk management
Disk scheduling & Disk managementSiva Priya This document discusses disk scheduling and disk management. It provides information on disk scheduling concepts like seek time, rotational latency, transfer time, and disk access time. The purpose of disk scheduling is to efficiently schedule I/O requests arriving for the disk. Disk management allows management of disk drives in Windows, including partitioning, formatting, assigning drive letters. It is available in Windows 10, 8, 7, Vista, XP and 2000 and allows checking capacity and free space on disks.
Servlets & jdbc
Servlets & jdbcSiva Priya This document discusses servlets and JDBC. It explains that servlets provide a platform-independent way to build web applications using Java and have full access to Java APIs like JDBC for interacting with databases. The document then describes the lifecycle of servlets, including initialization, processing requests, and destruction. It also discusses how servlets can handle GET and POST requests. Finally, the document provides an overview of JDBC, describing it as the Java API for connecting to and executing queries on databases.
Ad
Recently uploaded (20)
“MPU+: A Transformative Solution for Next-Gen AI at the Edge,” a Presentation...
“MPU+: A Transformative Solution for Next-Gen AI at the Edge,” a Presentation...Edge AI and Vision Alliance For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2025/06/mpu-a-transformative-solution-for-next-gen-ai-at-the-edge-a-presentation-from-fotonation/
Petronel Bigioi, CEO of FotoNation, presents the “MPU+: A Transformative Solution for Next-Gen AI at the Edge” tutorial at the May 2025 Embedded Vision Summit.
In this talk, Bigioi introduces MPU+, a novel programmable, customizable low-power platform for real-time, localized intelligence at the edge. The platform includes an AI-augmented image signal processor that enables leading image and video quality.
In addition, it integrates ultra-low-power object and motion detection capabilities to enable always-on computer vision. A programmable neural processor provides flexibility to efficiently implement new neural networks. And additional specialized engines facilitate image stabilization and audio enhancements.
Lessons Learned from Developing Secure AI Workflows.pdf
Lessons Learned from Developing Secure AI Workflows.pdfPriyanka Aash Lessons Learned from Developing Secure AI Workflows
2025_06_18 - OpenMetadata Community Meeting.pdf
2025_06_18 - OpenMetadata Community Meeting.pdfOpenMetadata The community meetup was held Wednesday June 18, 2025 @ 9:00 AM PST.
Catch the next OpenMetadata Community Meetup @ https://www.meetup.com/openmetadata-meetup-group/
In this month's OpenMetadata Community Meetup, "Enforcing Quality & SLAs with OpenMetadata Data Contracts," we covered data contracts, why they matter, and how to implement them in OpenMetadata to increase the quality of your data assets!
Agenda Highlights:
👋 Introducing Data Contracts: An agreement between data producers and consumers
📝 Data Contracts key components: Understanding a contract and its purpose
🧑🎨 Writing your first contract: How to create your own contracts in OpenMetadata
🦾 An OpenMetadata MCP Server update!
➕ And More!
10 Key Challenges for AI within the EU Data Protection Framework.pdf
10 Key Challenges for AI within the EU Data Protection Framework.pdfPriyanka Aash 10 Key Challenges for AI within the EU Data Protection Framework
Using the SQLExecutor for Data Quality Management: aka One man's love for the...
Using the SQLExecutor for Data Quality Management: aka One man's love for the...Safe Software The SQLExecutor is one of FME’s most powerful and flexible transformers. Pivvot maintains a robust internal metadata hierarchy used to support ingestion and curation of thousands of external data sources that must be managed for quality before entering our platform. By using the SQLExecutor, Pivvot can efficiently detect problems and perform analysis before data is extracted from our staging environment, removing the need for rollbacks or cycles waisted on a failed job. This presentation will walk through three distinct examples of how Pivvot uses the SQLExecutor to engage its metadata hierarchy and integrate with its Data Quality Management workflows efficiently and within the source postgres database. Spatial Validation –Validating spatial prerequisites before entering a production environment. Reference Data Validation - Dynamically validate domain-ed columns across any table and multiple columns per table. Practical De-duplication - Removing identical or near-identical well point locations from two distinct source datasets in the same table.
Oh, the Possibilities - Balancing Innovation and Risk with Generative AI.pdf
Oh, the Possibilities - Balancing Innovation and Risk with Generative AI.pdfPriyanka Aash Oh, the Possibilities - Balancing Innovation and Risk with Generative AI
Cracking the Code - Unveiling Synergies Between Open Source Security and AI.pdf
Cracking the Code - Unveiling Synergies Between Open Source Security and AI.pdfPriyanka Aash Cracking the Code - Unveiling Synergies Between Open Source Security and AI
"Scaling in space and time with Temporal", Andriy Lupa.pdf
"Scaling in space and time with Temporal", Andriy Lupa.pdfFwdays Design patterns like Event Sourcing and Event Streaming have long become standards for building real-time analytics systems. However, when the system load becomes nonlinear with fast and often unpredictable spikes, it's crucial to respond quickly in order not to lose real-time operating itself.
In this talk, I’ll share my experience implementing and using a tool like Temporal.io. We'll explore the evolution of our system for maintaining real-time report generation and discuss how we use Temporal both for short-lived pipelines and long-running background tasks.
Tech-ASan: Two-stage check for Address Sanitizer - Yixuan Cao.pdf
Tech-ASan: Two-stage check for Address Sanitizer - Yixuan Cao.pdfcaoyixuan2019 A presentation at Internetware 2025.
Curietech AI in action - Accelerate MuleSoft development
Curietech AI in action - Accelerate MuleSoft developmentshyamraj55 CurieTech AI in Action – Accelerate MuleSoft Development
Overview:
This presentation demonstrates how CurieTech AI’s purpose-built agents empower MuleSoft developers to create integration workflows faster, more accurately, and with less manual effort
linkedin.com
+12
curietech.ai
+12
meetups.mulesoft.com
+12
.
Key Highlights:
Dedicated AI agents for every stage: Coding, Testing (MUnit), Documentation, Code Review, and Migration
curietech.ai
+7
curietech.ai
+7
medium.com
+7
DataWeave automation: Generate mappings from tables or samples—95%+ complete within minutes
linkedin.com
+7
curietech.ai
+7
medium.com
+7
Integration flow generation: Auto-create Mule flows based on specifications—speeds up boilerplate development
curietech.ai
+1
medium.com
+1
Efficient code reviews: Gain intelligent feedback on flows, patterns, and error handling
youtube.com
+8
curietech.ai
+8
curietech.ai
+8
Test & documentation automation: Auto-generate MUnit test cases, sample data, and detailed docs from code
curietech.ai
+5
curietech.ai
+5
medium.com
+5
Why Now?
Achieve 10× productivity gains, slashing development time from hours to minutes
curietech.ai
+3
curietech.ai
+3
medium.com
+3
Maintain high accuracy with code quality matching or exceeding manual efforts
curietech.ai
+2
curietech.ai
+2
curietech.ai
+2
Ideal for developers, architects, and teams wanting to scale MuleSoft projects with AI efficiency
Conclusion:
CurieTech AI transforms MuleSoft development into an AI-accelerated workflow—letting you focus on innovation, not repetition.
9-1-1 Addressing: End-to-End Automation Using FME
9-1-1 Addressing: End-to-End Automation Using FMESafe Software This session will cover a common use case for local and state/provincial governments who create and/or maintain their 9-1-1 addressing data, particularly address points and road centerlines. In this session, you'll learn how FME has helped Shelby County 9-1-1 (TN) automate the 9-1-1 addressing process; including automatically assigning attributes from disparate sources, on-the-fly QAQC of said data, and reporting. The FME logic that this presentation will cover includes: Table joins using attributes and geometry, Looping in custom transformers, Working with lists and Change detection.
You are not excused! How to avoid security blind spots on the way to production
You are not excused! How to avoid security blind spots on the way to productionMichele Leroux Bustamante We live in an ever evolving landscape for cyber threats creating security risk for your production systems. Mitigating these risks requires participation throughout all stages from development through production delivery - and by every role including architects, developers QA and DevOps engineers, product owners and leadership. No one is excused! This session will cover examples of common mistakes or missed opportunities that can lead to vulnerabilities in production - and ways to do better throughout the development lifecycle.
cnc-processing-centers-centateq-p-110-en.pdf
cnc-processing-centers-centateq-p-110-en.pdfAmirStern2 מרכז עיבודים תעשייתי בעל 3/4/5 צירים, עד 22 החלפות כלים עם כל אפשרויות העיבוד הדרושות. בעל שטח עבודה גדול ומחשב נוח וקל להפעלה בשפה העברית/רוסית/אנגלית/ספרדית/ערבית ועוד..
מסוגל לבצע פעולות עיבוד שונות המתאימות לענפים שונים: קידוח אנכי, אופקי, ניסור, וכרסום אנכי.
From Manual to Auto Searching- FME in the Driver's Seat
From Manual to Auto Searching- FME in the Driver's SeatSafe Software Finding a specific car online can be a time-consuming task, especially when checking multiple dealer websites. A few years ago, I faced this exact problem while searching for a particular vehicle in New Zealand. The local classified platform, Trade Me (similar to eBay), wasn’t yielding any results, so I expanded my search to second-hand dealer sites—only to realise that periodically checking each one was going to be tedious. That’s when I noticed something interesting: many of these websites used the same platform to manage their inventories. Recognising this, I reverse-engineered the platform’s structure and built an FME workspace that automated the search process for me. By integrating API calls and setting up periodic checks, I received real-time email alerts when matching cars were listed. In this presentation, I’ll walk through how I used FME to save hours of manual searching by creating a custom car-finding automation system. While FME can’t buy a car for you—yet—it can certainly help you find the one you’re after!
"Database isolation: how we deal with hundreds of direct connections to the d...
"Database isolation: how we deal with hundreds of direct connections to the d...Fwdays What can go wrong if you allow each service to access the database directly? In a startup, this seems like a quick and easy solution, but as the system scales, problems appear that no one could have guessed.
In my talk, I'll share Solidgate's experience in transforming its architecture: from the chaos of direct connections to a service-based data access model. I will talk about the transition stages, bottlenecks, and how isolation affected infrastructure support. I will honestly show what worked and what didn't. In short, we will analyze the controversy of this talk.
Hyderabad MuleSoft In-Person Meetup (June 21, 2025) Slides
Hyderabad MuleSoft In-Person Meetup (June 21, 2025) SlidesRavi Tamada Hyderabad MuleSoft In-Person Meetup (June 21, 2025) Slides
Enhance GitHub Copilot using MCP - Enterprise version.pdf
Enhance GitHub Copilot using MCP - Enterprise version.pdfNilesh Gule Slide deck related to the GitHub Copilot Bootcamp in Melbourne on 17 June 2025
“MPU+: A Transformative Solution for Next-Gen AI at the Edge,” a Presentation...
“MPU+: A Transformative Solution for Next-Gen AI at the Edge,” a Presentation...Edge AI and Vision Alliance
You are not excused! How to avoid security blind spots on the way to production
You are not excused! How to avoid security blind spots on the way to productionMichele Leroux Bustamante
Routing algorithm
- 1. By K.Sivapriya Msc(IT) Nadar Saraswathi College Of Arts & Science Theni
- 2. Routing algorithm In order to transfer the packets from source to the destination, the network layer must determine the best route through which packets can be transmitted. Whether the network layer provides datagram service or virtual circuit service, the main job of the network layer is to provide the best route. The routing protocol provides this job.
- 3. Cont… The routing protocol is a routing algorithm that provides the best path from the source to the destination. The best path is the path that has the "least-cost path" from source to the destination. Routing is the process of forwarding the packets from source to the destination but the best route to send the packets is determined by the routing algorithm.
- 4. Classification of a Routing algorithm The Routing algorithm is divided into two categories: Adaptive Routing algorithm Non-adaptive Routing algorithm
- 5. Adaptive Routing algorithm An adaptive routing algorithm is also known as dynamic routing algorithm. This algorithm makes the routing decisions based on the topology and network traffic. The main parameters related to this algorithm are hop count, distance and estimated transit time.
- 6. Non-Adaptive Routing algorithm Non Adaptive routing algorithm is also known as a static routing algorithm. When booting up the network, the routing information stores to the routers. Non Adaptive routing algorithms do not take the routing decision based on the network topology or network traffic.
- 7. Distance Vector Routing Algorithm A distance-vector routing (DVR) protocol requires that a router inform its neighbors of topology changes periodically. Historically known as the old ARPANET routing algorithm (or known as Bellman-Ford algorithm). ... Distances,based on a chosen metric, are computed using information from the neighbors' distance vectors.
- 8. Cont… Distributed: It is distributed in that each node receives information from one or more of its directly attached neighbors, performs calculation and then distributes the result back to its neighbors. Iterative: It is iterative in that its process continues until no more information is available to be exchanged between neighbors. Asynchronous: It does not require that all of its nodes operate in the lock step with each other.
- 9. working of Distance Vector Routing Algorithm Knowledge about the whole network: Each router shares its knowledge through the entire network. The Router sends its collected knowledge about the network to its neighbors. Routing only to neighbors: The router sends its knowledge about the network to only those routers which have direct links. The router sends whatever it has about the network through the ports.
- 10. Cont… The information is received by the router and uses the information to update its own routing table. Information sharing at regular intervals: Within 30 seconds, the router sends the information to the neighboring routers.
- 11. Link State Routing In link-state routing, each router shares its knowledge of its neighbourhood with all routers in the network. Link-state protocols implement an algorithm called the shortest path first (SPF, also known as Dijkstra's Algorithm) to determine the path to a remote destination
- 12. Link State Routing algorithm Knowledge about the neighborhood: Instead of sending its routing table, a router sends the information about its neighborhood only. A router broadcast its identities and cost of the directly attached links to other routers. Flooding: Each router sends the information to every other router on the internetwork except its neighbors. This process is known as Flooding.
- 13. Cont… Every router that receives the packet sends the copies to all its neighbors. Finally, each and every router receives a copy of the same information. Information sharing: A router sends the information to every other router only when the change occurs in the information.
- 14. Link State Routing has two phases Reliable Flooding Initial state: Each node knows the cost of its neighbors. Final state: Each node knows the entire graph. Route Calculation Each node uses Dijkstra's algorithm on the graph to calculate the optimal routes to all nodes.
- 15. Cont… The Link state routing algorithm is also known as Dijkstra's algorithm which is used to find the shortest path from one node to every other node in the network. The Dijkstra's algorithm is an iterative, and it has the property that after kth iteration of the algorithm, the least cost paths are well known for k destination nodes.