Routing algorithm

Download as ppt, pdf

19 likes24,772 views

The document discusses and compares different routing algorithms: 1. It classifies routing protocols as either link state or distance vector, and describes how each type works. Link state algorithms use flooding to share link information, while distance vector algorithms iteratively calculate the best paths. 2. It explains that distance vector algorithms can have issues with counting to infinity and routing loops. Techniques like poison reverse are used to address this. 3. It notes that link state algorithms have faster convergence but require more overhead, while distance vector algorithms are simpler but can be slower to converge. 4. Hierarchical routing is introduced as a way to scale routing by organizing routers into autonomous systems (AS) with inter and intra-

Education Technology Art & Photos

Most read

Routing Algorithm 2004. 11. 3 Ahn Kook Jin

Contents Routing Protocol and Algorithm Classifications Link State Routing Algorithm Distance Vector Routing Algorithm LS Algorithm vs. DV Algorithm Hierarchical Routing

Routing Protocol and Algorithm Determining the path(route) source host destination host 5 2 1 2 3 1 3 5 2 1 B A C E D F first-hop router default router source router destination router least-cost path

Classifications Global vs. decentralized global(link state algorithm) : complete information about connectivity and link costs Static vs. dynamic static : routes change very slowly Load-sensitive vs. load-insensitive load-sensitive : link costs reflect congestion Typical used Dynamic link state routing algorithm Dynamic distance vector routing algorithm

Link State Routing Algorithm Each node broadcasts the identities and costs to its directly attached neighbors Dijkstra’s algorithm

Link State Routing Algorithm Oscillation(page 307) D B C A e 1 1 2+e 0 0 1+e 0 0 0 1 1 0 0 0 e 0 1+e 0 0 0 0 0 1+e 1 2+e 0 2+e 0 0 1+e 0 0 0 1

Distance Vector Routing Algorithm Iterative, asynchronous, distributed Distance table D X (Y,Z) : cost of the direct link from X to Z + Z’s currently known minmum-cost path to Y D X (Y,Z)=c(X,Z)+min w {D z (Y,w)}

Distance Vector Routing Algorithm Initialization: D X (*,v) = inifinite, D X (v,v)=c(x,v) Send min w D X (y,w) to each neighbor when they changes C(X,V) changes Neighbor node send its update

Distance Vector Routing Algorithm 7 2 1 Y X Z 7 ∞ Z ∞ 2 Y Z Y D X 1 ∞ Z ∞ 2 X Z X D Y 1 ∞ Y ∞ 7 X Y X D z

Distance Vector Routing Algorithm 7 2 1 Y X Z 7 3 Z 8 2 Y Z Y D X 1 9 Z 8 2 X Z X D Y 1 9 Y 3 7 X Y X D z

Distance Vector Routing Algorithm 7 2 1 Y X Z 7 3 Z 8 2 Y Z Y D X 1 5 Z 4 2 X Z X D Y 1 9 Y 3 7 X Y X D z

Distance Vector Routing Algorithm Decrease 50 4 1 1 Y X Z 6 4 X Z X D Y 5 50 X Y X D z

Distance Vector Routing Algorithm Decrease 50 4 1 1 Y X Z 6 1 X Z X D Y 5 50 X Y X D z

Distance Vector Routing Algorithm Decrease 50 4 1 1 Y X Z 6 1 X Z X D Y 2 50 X Y X D z

Distance Vector Routing Algorithm Increase 50 4 1 60 Y X Z 6 4 X Z X D Y 5 50 X Y X D z

Distance Vector Routing Algorithm Increase 50 4 1 60 Routing loop Y X Z 6 60 X Z X D Y 5 50 X Y X D z

Distance Vector Routing Algorithm Increase 50 4 1 60 Y X Z 6 60 X Z X D Y 7 50 X Y X D z

Distance Vector Routing Algorithm Increase 50 4 1 60 Y X Z 8 60 X Z X D Y 7 50 X Y X D z

Distance Vector Routing Algorithm Increase 50 4 1 60 Too many iterations! (count-to-infinity problem) Y X Z 8 60 X Z X D Y 9 50 X Y X D z

Distance Vector Routing Algorithm Poisoned reverse 50 4 1 60 Y X Z ∞ 4 X Z X D Y 5 50 X Y X D z

Distance Vector Routing Algorithm Poisoned reverse 50 4 1 60 Y X Z ∞ 60 X Z X D Y 5 50 X Y X D z

Distance Vector Routing Algorithm Poisoned reverse 50 4 1 60 Y X Z ∞ 60 X Z X D Y 61 50 X Y X D z

Distance Vector Routing Algorithm Poisoned reverse 50 4 1 60 Y X Z 51 60 X Z X D Y 61 50 X Y X D z

Distance Vector Routing Algorithm Poisoned reverse Cannot solve general count-to-infinity problem 50 4 1 60 Y X Z 51 60 X Z X D Y ∞ 50 X Y X D z

LS Algorithm vs. DV Algorithm Bad Good Robustness Slow(count-to-infinity problem) O(n 2 ) algorithm Speed of convergence Maybe small O(nE) Message complexity DV LS

Hierarchical Routing View network as interconnected routers Scale Administrative autonomy Organize routers into autonomy systems(AS)

Hierarchical Routing Autonomy system(AS) Gateway router Intra-AS Inter-AS B.a B.a A.a A.b A.c A.d C.b C.c C.a Host H1 Host H2

Hierarchical Routing Topological view for inter-AS routing protocol B.a A.a A.c C.a

This document discusses multimedia system architecture and components. It describes how multimedia systems integrate various technologies in real-time, including add-on devices, software drivers, and high-resolution graphics displays. It also covers multimedia workstation architecture, with layers including applications, multimedia extensions, drivers, operating systems, and hardware. Network architectures for multimedia are also discussed.

Multimedia color in image and videoMazin Alwaaly

The document discusses the fundamentals of color science in multimedia, covering aspects such as light, human vision, camera systems, and various color models like RGB, CMY, and YUV. It explains how colors are perceived and represented, including gamma correction and color-matching functions, along with the transformation processes needed for accurate color reproduction in images and videos. Additionally, it highlights concepts like out-of-gamut colors and different color-coordinate schemes used in digital media and printing.

SciencesConf : plateforme de gestion de congres scientifiquesOAccsd

Le document présente la plateforme de gestion de congrès scientifiques Sciencesconf.org, créée pour unifier la gestion des conférences au sein de la communauté académique. Il détaille ses fonctionnalités, ses utilisateurs et les différentes étapes d'organisation d'une conférence, ainsi que son évolution depuis sa création en 2008. En février 2019, la plateforme a déjà géré plus de 7 000 conférences et a des outils pour la gestion éditoriale, l'inscription et le suivi des participants.

Video SegmentationSmriti Jain

This document discusses techniques for segmenting independently moving image regions using motion detection. It covers the following approaches: 1. Motion-based segmentation using optical flow to detect pixel-level motion between frames. This approach has limitations due to the aperture and occlusion problems. 2. Color-based and texture-based segmentation which learn background models (e.g. histograms or Gaussian distributions) for each pixel and detect foreground objects that differ significantly from the background models. 3. Dominant motion segmentation fits a single motion model to partition a frame into regions of global and local motion. Multiple motion segmentation estimates multiple motion models competing at each pixel.

Photo sharingSusan Lee

hierarchical bus systemElvis Jonyo

The document discusses the organization of computer systems and their components. It describes a computer system as having a central processing unit (CPU) that can execute instructions, input/output modules, and memory to store both instructions and data. The CPU contains an instruction interpreter and arithmetic logic unit. The system is programmable because any computation can be broken down into a sequence of simple instructions stored in memory and executed by the CPU. This is known as the von Neumann model. The document also discusses how instructions are fetched and executed in cycles, and how interrupts can alter the normal execution flow. It outlines different methods for interconnecting system components like I/O to CPU, I/O to memory, and I/O to a central switch

Buffer managementKarthigaGunasekaran1

The document discusses buffer management in database systems, highlighting strategies like LRU, FIFO, and clock for managing memory efficiently while minimizing physical I/O. It addresses allocation algorithms for concurrent transactions and the challenges posed by virtual operating systems, including page and buffer faults. The conclusion recommends efficient implementations for buffer search functions through hash techniques and emphasizes the importance of fixing pages in a buffer.

Unit 1 - mobile computing introductionVintesh Patel

The document discusses mobile computing architectures and design considerations. It introduces the three-tier architecture for mobile computing which includes a presentation layer, application layer, and data layer. It also outlines various design considerations for mobile computing like context awareness and adaptation. The document then discusses wireless application protocol (WAP) architecture and its layered protocol. It explains the differences between sometimes-on-connectivity (SOC) clients that can work offline and always-on-connectivity (AOC) clients that require a constant online connection.

Interactive osmimie_ghaz

Interactive operating systems allow users to run interactive programs that accept input from humans. Most popular programs like word processors and spreadsheets are interactive. An interactive OS provides fast turnaround times and immediate feedback while a non-interactive program runs without human input like compilers. Key characteristics of interactive OSs include processor scheduling, memory management, I/O data management, and file management. [/SUMMARY]

Edge linking in image processingVARUN KUMAR

This document discusses image segmentation techniques, specifically linking edge points through local and global processing. Local processing involves linking edge-detected pixels that are similar in gradient strength and direction within a neighborhood. Global processing uses the Hough transform to link edge points into lines by mapping points in the image space to the parameter space of slope-intercept or polar coordinates. Thresholding in parameter space identifies coherent lines composed of edge points. The Hough transform allows finding lines even if there are gaps or other defects in detected edge points.

BigData_TP1: Initiation à Hadoop et Map-ReduceLilia Sfaxi

Le document présente un TP sur l'initiation à Hadoop et MapReduce, visant à enseigner la création et la manipulation de données volumineuses. Il décrit l'installation de Hadoop, l'utilisation de mappers et reducers en Python pour traiter des fichiers de ventes et les instructions pour exécuter des jobs sur Hadoop. Des activités pratiques sont proposées pour renforcer l'apprentissage de ces concepts dans un contexte d'analyse de données.

Cours d'introduction aux HTML5 & CSS3Abel LIFAEFI MBULA

Le document présente une introduction aux langages HTML5 et CSS3, visant à aider à la création de pages web et à leur publication sur un serveur. Il couvre des éléments clés comme la structure de base d'une page HTML, les balises, les attributs, ainsi que les principes de mise en forme avec CSS. Enfin, il aborde les aspects pratiques de l'hébergement et du choix d'un nom de domaine pour rendre le site accessible en ligne.

Chap 16 bootp & dhcpNoctorous Jamal

Sonet kongara

This document provides an overview of SONET/SDH including: - The history and motivation for SONET/SDH which was to create a multivendor fiber optic communications standard to replace proprietary PDH networks. - The architecture of SONET/SDH including physical, line, and path layers with regenerators and different signal types like STS and OC. - The frame structure of SONET/SDH including the basic STS-1 frame of 90 columns by 9 rows for a rate of 51.84 Mbps.

Services web soap-el-habib-nfaouiEl Habib NFAOUI

Ce document présente un cours sur les services web SOAP et l'architecture orientée service (SOA) au sein des systèmes d'information modernes. Il aborde les spécifications de SOAP et WSDL, leur développement à l'aide de JAX-WS, ainsi que les technologies nécessaires pour implémenter cette architecture, tout en soulignant l'importance de l'interopérabilité et de la flexibilité dans les applications distribuées. Le cours détaille également la place des services web dans l'intégration d'applications B2B et leur fonctionnement via des protocoles standard tels que HTTP, SOAP et XML.

A starmeriem sari

L'algorithme A* est une méthode de pathfinding développée en 1968 qui permet de trouver un chemin optimal entre une source et une destination dans un graphe. Bien qu'il ne garantisse pas toujours la solution la plus optimale, il offre des résultats rapides, ce qui le rend utile dans divers domaines comme les jeux vidéo et la simulation. Son implémentation repose sur des classes spécifiques qui gèrent les noeuds et les calculs de coûts associés.

Multimedia system, Architecture & DatabasesHarshita Ved

The document discusses multimedia databases and multimedia database management systems. It defines multimedia databases as collections of related multimedia data types including text, images, audio, and video. It also describes the additional metadata that must be managed along with the actual multimedia data. Multimedia database management systems provide support for different data formats and facilitate creation, storage, retrieval, querying, and control of multimedia data.

Résumé ccna 1chapitre 1 v5.0EL AMRI El Hassan

Le document explique les rôles des serveurs et des clients dans un réseau, ainsi que les différents types de réseaux tels que LAN, WAN, et MAN. Il aborde également des concepts modernes comme le BYOD et le cloud computing, ainsi que les exigences de sécurité pour les réseaux domestiques et professionnels. Enfin, il souligne l'importance des infrastructures réseau pour garantir une communication efficace.

Difference between dtd and xsdUmar Ali

DTD and XSD are both used to define the structure and legal elements of an XML document, but XSD provides more robust validation capabilities. DTD has limitations in that it only supports validation of the root element, lacks namespaces and data types, and is weakly typed. In contrast, XSD supports validation of any element, uses namespaces, provides primitive and custom data types with restrictions, and is strongly typed. While DTD is suitable for small XML data, XSD is better suited for large XML documents like those used in web services and datasets due to its stronger validation features.

Multimedia notesKoYe Click

Multimedia refers to computer representations of various types of media like audio, video, text and graphics. It allows for integration of different media types that can be stored, transmitted and processed digitally. Multimedia applications combine multiple media sources like text, graphics, images, sound and video. Examples of multimedia applications include the World Wide Web, hypermedia courseware, video conferencing and interactive TV. Effective design of multimedia involves balanced layout, use of white space, consistency and interactivity that gives users control.

Multimedia system(OPEN DOCUMENT ARCHITECTURE AND INTERCHANGING FORMAT)pavishkumarsingh

The document discusses multimedia documents and hypermedia. It describes how multimedia documents contain both continuous and discrete media and require models for content, structure, manipulation, and representation. Standards for describing multimedia documents include SGML, HTML, and MHEG. Hypertext links discrete chunks of text, while hypermedia generalizes this to include additional media types and synchronization. The World Wide Web uses HTTP, URLs, and HTML to access and display hypermedia documents over the internet. Forms and CGI scripts allow for user interaction, while Java applets enable interactive content to run in web browsers.

Introduction to computer graphics Priyodarshini Dhar

This document provides an introduction to computer graphics. It defines computer graphics as the creation, storage, and manipulation of pictures and drawings using digital computers. Computer graphics is used across diverse fields such as engineering, medicine, education, entertainment, and more. The document discusses basic terms related to display devices such as pixels, resolution, color depth, and frame buffers. It also describes different types of display devices including raster scan displays, random scan displays, direct view storage tubes, flat panel displays, and stereoscopic displays. Applications of computer graphics such as design, image processing, animation, simulation, and medical imaging are also summarized.

Psuedo colorMariashoukat1206

The document discusses pseudo color images and techniques for converting grayscale images to color. It defines pseudo color images as grayscale images mapped to color according to a lookup table or function. It describes various color schemes for this mapping, including grayscale schemes that use shades of gray and oscillating schemes that emphasize certain grayscale ranges in color. The document also discusses using piecewise linear functions and smooth non-linear functions to transform grayscale levels to color for purposes such as enhancing contrast or reducing noise in images.

Analyse de données avec R : Une petite introductionAhmadou DICKO

Le document présente une introduction à l'analyse de données avec le langage R, en soulignant son efficacité dans le traitement de grandes quantités de données. Il aborde des méthodes d'analyse telles que l'analyse factorielle et les méthodes de classification, tout en illustrant des applications pratiques via des exemples. R est décrit comme un outil essentiel dans l'analyse exploratoire des données et le développement de modèles statistiques.

Gérer ses signets en ligne avec DiigoURFIST de Rennes

Le document présente Diigo, une plateforme de gestion et de partage de signets en ligne, explorant ses fonctionnalités telles que le marquage, l'annotation et la création de listes. Diigo permet également de créer des réseaux de partage, d'organiser des signets par tags et de collaborer avec d'autres utilisateurs. L'article aborde les comparaisons entre Diigo et d'autres outils de bookmarking, tout en soulignant l'importance de la gestion des tags et des contacts pour une veille collaborative efficace.

Multimedia synchronizationI World Tech

The document discusses synchronization, defining it as the coordination of events within systems, and highlights its significance in various fields such as computer science, multimedia, and telecommunication. It further explains multimedia synchronization, the types of media data, and the three levels of synchronization: intra-media, inter-media, and inter-party. Additionally, it introduces the Synchronized Multimedia Integration Language (SMIL) for creating interactive audiovisual presentations.

Viewing transformationUdayan Gupta

The document discusses viewport transformations which map objects from one coordinate system to another, such as mapping from world coordinates to screen coordinates. It explains that viewport transformations are used for viewing transformations like zooming and moving drawings. The document also describes how a matrix M can be determined to map a window defined in world coordinates to a viewport defined in screen pixel coordinates.

Application of ML in physical layerVARUN KUMAR

This document discusses the application of machine learning techniques in physical layer communication. It outlines the fundamentals and limitations of classical approaches to physical layer communication. It then introduces multi-layer perceptrons and recurrent neural networks as machine learning methodologies that can be applied. Specific use cases of machine learning for MIMO detection and modulation classification are discussed. The conclusion is that while classical approaches face limitations, machine learning shows promise in helping to solve physical layer communication problems, especially as more training data becomes available.

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.

Cisco ospf sarasanandam

More Related Content

What's hot (20)

Interactive osmimie_ghaz

Edge linking in image processingVARUN KUMAR

BigData_TP1: Initiation à Hadoop et Map-ReduceLilia Sfaxi

Cours d'introduction aux HTML5 & CSS3Abel LIFAEFI MBULA

Chap 16 bootp & dhcpNoctorous Jamal

Sonet kongara

Services web soap-el-habib-nfaouiEl Habib NFAOUI

A starmeriem sari

Multimedia system, Architecture & DatabasesHarshita Ved

Résumé ccna 1chapitre 1 v5.0EL AMRI El Hassan

Difference between dtd and xsdUmar Ali

Multimedia notesKoYe Click

Multimedia system(OPEN DOCUMENT ARCHITECTURE AND INTERCHANGING FORMAT)pavishkumarsingh

Introduction to computer graphics Priyodarshini Dhar

Psuedo colorMariashoukat1206

Analyse de données avec R : Une petite introductionAhmadou DICKO

Gérer ses signets en ligne avec DiigoURFIST de Rennes

Multimedia synchronizationI World Tech

Viewing transformationUdayan Gupta

Application of ML in physical layerVARUN KUMAR

Interactive osmimie_ghaz

Edge linking in image processingVARUN KUMAR

BigData_TP1: Initiation à Hadoop et Map-ReduceLilia Sfaxi

Cours d'introduction aux HTML5 & CSS3Abel LIFAEFI MBULA

Chap 16 bootp & dhcpNoctorous Jamal

Sonet kongara

Services web soap-el-habib-nfaouiEl Habib NFAOUI

A starmeriem sari

Multimedia system, Architecture & DatabasesHarshita Ved

Résumé ccna 1chapitre 1 v5.0EL AMRI El Hassan

Difference between dtd and xsdUmar Ali

Multimedia notesKoYe Click

Multimedia system(OPEN DOCUMENT ARCHITECTURE AND INTERCHANGING FORMAT)pavishkumarsingh

Introduction to computer graphics Priyodarshini Dhar

Psuedo colorMariashoukat1206

Analyse de données avec R : Une petite introductionAhmadou DICKO

Gérer ses signets en ligne avec DiigoURFIST de Rennes

Multimedia synchronizationI World Tech

Viewing transformationUdayan Gupta

Application of ML in physical layerVARUN KUMAR

Viewers also liked (6)

Link state routing protocolAung Thu Rha Hein

Cisco ospf sarasanandam

Distance vector routing algorithmGaurav Rawat

This document provides an example to illustrate how the distance vector routing algorithm works. It shows the vector tables of routers B, D, and C that store the distances to all other routers. It then calculates the routing table for router A based on the distances through neighboring routers B, D, and C, taking the minimum distances. The final routing table for A is (0, 2, 2, 1, 2, 2) with routes going through routers D, C, D, D, D respectively.

network convergence problem and solutionsSiddhi Viradiya

RIP is an interior gateway protocol that uses distance vector routing and the Bellman-Ford algorithm to dynamically adapt to network changes. It works by having each router calculate the distances to reachable networks and share these distances with neighboring routers. However, RIP has issues with slow convergence and count-to-infinity problems when network failures occur. Several techniques are used to address these issues, including hold downs, split horizon, poison reverse updates, and triggered updates.

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.

RIP - Routing Information Protocolselvakumar_b1985

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.

Link state routing protocolAung Thu Rha Hein

Cisco ospf sarasanandam

Distance vector routing algorithmGaurav Rawat

network convergence problem and solutionsSiddhi Viradiya

Distance vector routingSiddique Ibrahim

RIP - Routing Information Protocolselvakumar_b1985

Similar to Routing algorithm (20)

Routing AlgorithmKamal Acharya

The document describes routing algorithms used in computer networks. It discusses two main types of routing algorithms: link-state algorithms and distance-vector algorithms. Link-state algorithms use a complete map of the entire network topology to calculate the shortest paths between all nodes, while distance-vector algorithms use an iterative process where each router shares routing information with neighbors to determine the shortest paths. The document then provides examples of how Dijkstra's algorithm, a link-state algorithm, and the Bellman-Ford distance-vector algorithm work to calculate the optimal paths through a sample network.

Computer networks chapter 5 network layer : control planelaibaiqbal450

numeric network in the world of heart then ay iks jsnskassemKhalil1

Chapter 5 discusses the network layer's control plane, focusing on routing algorithms, SDN controllers, and network management tools like SNMP and NETCONF/YANG. It covers traditional routing methods such as link-state and distance-vector protocols, detailing how they determine optimal paths for data packets across networks. The chapter also introduces Dijkstra's and the Bellman-Ford algorithms for routing path calculations.

Lec12 on Computer Networks by Tarun Mangla.pdfShivamSawarn2

The document discusses the structure and functions of the network layer in computer networks, focusing on protocols and services that facilitate data transfer between devices. It explains key concepts such as forwarding, routing, and the use of algorithms (like Dijkstra's and Bellman-Ford) for determining optimal paths across network topologies. Additionally, it describes the data plane and control plane roles, and the importance of effective routing for internet scalability and performance.

Bellman Ford Routing Algorithm-Computer NetworksSimranJain63

The Bellman-Ford routing algorithm computes the shortest paths from a single source vertex to all other vertices in a weighted digraph. It is also known as the distance vector algorithm. The algorithm uses the principle of relaxation to iteratively update the cost of the shortest paths by relaxing edges until it either finds the shortest paths or detects a negative cost cycle. It runs in O(|V||E|) time in the worst case. Each node maintains a distance vector with the estimated cost to all other nodes and shares this information with neighbors to iteratively update the costs until reaching an optimal solution.

routing1 1X3 Router (capable of routing the data packets.pptJANARTHANANS22

The document outlines two primary routing strategies: link state-based and distance vector-based routing. It details how routing algorithms like Dijkstra's algorithm ensure the determination of the shortest path through a network and contrasts the decentralized distance vector approach. The document discusses the complexities, potential issues like oscillations in link state, and the robustness concerns related to router malfunctions for both routing methods.

Network Layer: Control Plane (Computer Network Course)okuwobi

Chapter 5 of 'Computer Networking: A Top-Down Approach' discusses the network layer control plane, outlining its functions and components such as traditional routing algorithms, SDN controllers, and network management protocols. It includes a detailed roadmap of routing protocols such as OSPF and BGP, and examines Dijkstra's algorithm for finding the least-cost paths in a network. The chapter also contrasts per-router control with logically centralized control in software-defined networking (SDN).

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.

Lecture set 5Gopi Saiteja

The network layer is responsible for transporting data segments from source to destination hosts. It encapsulates segments into datagrams and delivers them to the transport layer. Network layer protocols run on every host and router. Routers examine header fields to forward datagrams appropriately based on destination addresses. The network layer handles addressing, routing, and intermediate forwarding of datagrams between source and destination hosts.

Chapter 5 - Computer Networking a top-down Approach 7thAndy Juan Sarango Veliz

This document contains slides summarizing key concepts about network layer control planes from the textbook "Computer Networking: A Top Down Approach". The slides cover traditional routing algorithms like link state (e.g. Dijkstra's algorithm) and distance vector (e.g. Bellman-Ford), as well as software defined networking control planes. Specific routing protocols discussed include OSPF, BGP, OpenFlow and SDN controllers. The document also mentions ICMP and network management using SNMP.

P5 - Routing ProtocolsKurniawan Dwi Irianto

1. The document discusses routing protocols and the distance vector routing algorithm. 2. The distance vector algorithm is a decentralized routing algorithm where each router maintains a distance vector with the estimated distance to every destination and periodically shares this information with neighboring routers. 3. Over multiple iterations, each router will update its distance vector using the Bellman-Ford equation based on information received from neighbors until the estimates converge to the actual least cost paths.

Chapter_5_v8.0Routing Protocol for Computer network from kurose and rossdutt2309

BellmanfordAbhijeet Gokhale

The document discusses hierarchical routing in computer networks. It describes how routing is divided into intra-autonomous system (intra-AS) routing within an AS and inter-autonomous system (inter-AS) routing between ASes. Special routers called gateways perform both intra-AS routing with other routers in their AS and inter-AS routing with gateways in other ASes. This hierarchical structure allows scaling to large networks with many destinations by aggregating routers into regions.

5.2_video_slides.pptxDennyHermawan15

This document discusses routing algorithms at the network layer. It introduces link state and distance vector routing algorithms, which use either global or decentralized network topology information. Dijkstra's link-state algorithm is then explained in detail, showing how it uses global link cost information to iteratively find the least-cost path from a source node to all other nodes. The example demonstrates how Dijkstra's algorithm builds a shortest path tree with complexity O(n2). Routing oscillations are also discussed when link costs depend on traffic volume.

Week11 lec2syedhaiderraza

CnetworkADARSHN40

Introduction to Computer NetworksVenkatesh Iyer

The document outlines network essentials, detailing concepts such as the OSI 7-layer model, network and transport layer protocols, particularly IP, TCP, and UDP. It explains the functioning of IP address structures, subnetworks, routing protocols, and the differences between distance vector and link state routing algorithms. Moreover, it discusses TCP's connection-oriented features versus UDP's connectionless nature and introduces socket programming in upcoming sessions.

Intro 2 Computer Networksrakeshgoswami

VoxelNettaeseon ryu

The document presents VoxelNet, an end-to-end learning model for 3D object detection using point clouds. It describes the architecture involving voxel feature encoding layers, the processing of sparse lidar data, and the model's significant performance improvements over existing methods. The conclusion highlights VoxelNet's effective handling of 3D shape information and potential for integration with image data for enhanced detection accuracy.

Signals and Systems Assignment HelpMatlab Assignment Experts

The document discusses solving assignment-related queries and includes several problems related to z-transforms, properties of linear time-invariant (LTI) systems, and implications of system stability and causality. It covers methods for obtaining z-transforms, impulse responses, and analyzing stability for both continuous-time and discrete-time systems. Additionally, it includes proofs for various properties and theorems associated with LTI systems and their z-transforms.

Routing AlgorithmKamal Acharya

Computer networks chapter 5 network layer : control planelaibaiqbal450

numeric network in the world of heart then ay iks jsnskassemKhalil1

Lec12 on Computer Networks by Tarun Mangla.pdfShivamSawarn2

Bellman Ford Routing Algorithm-Computer NetworksSimranJain63

routing1 1X3 Router (capable of routing the data packets.pptJANARTHANANS22

Network Layer: Control Plane (Computer Network Course)okuwobi

Module 3- transport_layer .pptxhariprasad279825

Lecture set 5Gopi Saiteja

Chapter 5 - Computer Networking a top-down Approach 7thAndy Juan Sarango Veliz

P5 - Routing ProtocolsKurniawan Dwi Irianto

Chapter_5_v8.0Routing Protocol for Computer network from kurose and rossdutt2309

BellmanfordAbhijeet Gokhale

5.2_video_slides.pptxDennyHermawan15

Week11 lec2syedhaiderraza

CnetworkADARSHN40

Introduction to Computer NetworksVenkatesh Iyer

Intro 2 Computer Networksrakeshgoswami

VoxelNettaeseon ryu

Signals and Systems Assignment HelpMatlab Assignment Experts

Recently uploaded (20)

Paper 108 | Thoreau’s Influence on Gandhi: The Evolution of Civil DisobedienceRajdeep Bavaliya

Dive into the powerful journey from Thoreau’s 19th‑century essay to Gandhi’s mass movement, and discover how one man’s moral stand became the backbone of nonviolent resistance worldwide. Learn how conscience met strategy to spark revolutions, and why their legacy still inspires today’s social justice warriors. Uncover the evolution of civil disobedience. Don’t forget to like, share, and follow for more deep dives into the ideas that changed the world. M.A. Sem - 2 | Presentation Presentation Season - 2 Paper - 108: The American Literature Submitted Date: April 2, 2025 Paper Name: The American Literature Topic: Thoreau’s Influence on Gandhi: The Evolution of Civil Disobedience [Please copy the link and paste it into any web browser to access the content.] Video Link: https://youtu.be/HXeq6utg7iQ For a more in-depth discussion of this presentation, please visit the full blog post at the following link: https://rajdeepbavaliya2.blogspot.com/2025/04/thoreau-s-influence-on-gandhi-the-evolution-of-civil-disobedience.html Please visit this blog to explore additional presentations from this season: Hashtags: #CivilDisobedience #ThoreauToGandhi #NonviolentResistance #Satyagraha #Transcendentalism #SocialJustice #HistoryUncovered #GandhiLegacy #ThoreauInfluence #PeacefulProtest Keyword Tags: civil disobedience, Thoreau, Gandhi, Satyagraha, nonviolent protest, transcendentalism, moral resistance, Gandhi Thoreau connection, social change, political philosophy

OBSESSIVE COMPULSIVE DISORDER.pptx IN 5TH SEMESTER B.SC NURSING, 2ND YEAR GNM...parmarjuli1412

OBSESSIVE COMPULSIVE DISORDER INCLUDED TOPICS ARE INTRODUCTION, DEFINITION OF OBSESSION, DEFINITION OF COMPULSION, MEANING OF OBSESSION AND COMPULSION, DEFINITION OF OBSESSIVE COMPULSIVE DISORDER, EPIDERMIOLOGY OF OCD, ETIOLOGICAL FACTORS OF OCD, CLINICAL SIGN AND SYMPTOMS OF OBSESSION AND COMPULSION, MANAGEMENT INCLUDED PHARMACOTHERAPY(ANTIDEPRESSANT DRUG+ANXIOLYTIC DRUGS), PSYCHOTHERAPY, NURSING MANAGEMENT(ASSESSMENT+DIAGNOSIS+NURSING INTERVENTION+EVALUATION))

Code Profiling in Odoo 18 - Odoo 18 SlidesCeline George

Great Governors' Send-Off Quiz 2025 Prelims IIT KGPIIT Kharagpur Quiz Club

IIT KGP Quiz Week 2024 Sports Quiz (Prelims + Finals)IIT Kharagpur Quiz Club

LDMMIA Shop & Student News Summer Solstice 25LDM & Mia eStudios

6/18/25 Shop, Upcoming: Final Notes to Review as we Close Level One. Make sure to review the orientation and videos as well. There’s more to come and material to cover in Levels 2-3. The content will be a combination of Reiki and Yoga. Also energy topics of our spiritual collective. Thanks again all future Practitioner Level Students. Our Levels so far are: Guest, Grad, and Practitioner. We have had over 5k Spring Views. https://ldm-mia.creator-spring.com

Peer Teaching Observations During School InternshipAjayaMohanty7

THE PSYCHOANALYTIC OF THE BLACK CAT BY EDGAR ALLAN POE (1).pdfnabilahk908

Psychoanalytic Analysis of The Black Cat by Edgar Allan Poe explores the deep psychological dimensions of the narrator’s disturbed mind through the lens of Sigmund Freud’s psychoanalytic theory. According to Freud (1923), the human psyche is structured into three components: the Id, which contains primitive and unconscious desires; the Ego, which operates on the reality principle and mediates between the Id and the external world; and the Superego, which reflects internalized moral standards. In this story, Poe presents a narrator who experiences a psychological breakdown triggered by repressed guilt, aggression, and internal conflict. This analysis focuses not only on the gothic horror elements of the narrative but also on the narrator’s mental instability and emotional repression, demonstrating how the imbalance of these three psychic forces contributes to his downfall.

Vitamin and Nutritional Deficiencies.pptxVishal Chanalia

Vitamin and nutritional deficiency occurs when the body does not receive enough essential nutrients, such as vitamins and minerals, needed for proper functioning. This can lead to various health problems, including weakened immunity, stunted growth, fatigue, poor wound healing, cognitive issues, and increased susceptibility to infections and diseases. Long-term deficiencies can cause serious and sometimes irreversible health complications.

YSPH VMOC Special Report - Measles Outbreak Southwest US 6-14-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC)

BLUF: The Texas outbreak has slowed down, but sporadic cases continue to emerge in Kansas, Oklahoma, and New Mexico. Elsewhere in the US, we continue to see signs of acceleration due to outbreaks outside the Southwest (North Dakota, Montana, and Colorado) and travel-related cases. Measles exposures due to travel are expected to pose a significant challenge throughout the summer. The U.S. is on track to exceed its 30-year high for measles cases (1,274) within the next two weeks. Here is the latest update: CURRENT CASE COUNT: 919 •Texas: 744 (+2) (55% of cases are in Gaines County). •New Mexico: 81 (83% of cases are from Lea County). •Oklahoma: 20 (+2) •Kansas: 74 (+5) (38.89% of the cases are from Gray County). HOSPITALIZATIONS: 104 • Texas: 96 (+2) – This accounts for 13% of all cases in Texas. • New Mexico: 7 – This accounts for 9.47% of all cases in New Mexico. • Kansas: 3 – This accounts for 5.08% of all cases in the state of Kansas. DEATHS: 3 •Texas: 2 – This is 0.27% of all cases in Texas. •New Mexico: 1 – This is 1.23% of all cases in New Mexico. US NATIONAL CASE COUNT: 1,197 INTERNATIONAL SPREAD •Mexico: 2337 (+257), 5 fatalities ‒Chihuahua, Mexico: 2,179 (+239) cases, 4 fatalities, 7 currently hospitalized. •Canada: 3,207 (+208), 1 fatality ‒Ontario Outbreak, Canada: 2,115 (+74) cases, 158 hospitalizations, 1 fatality. ‒Alberta, Canada: 879(+118) cases, 5 currently hospitalized.

University of Ghana Cracks Down on Misconduct: Over 100 Students SanctionedKweku Zurek

How to Manage Different Customer Addresses in Odoo 18 AccountingCeline George

LAZY SUNDAY QUIZ "A GENERAL QUIZ" JUNE 2025 SMC QUIZ CLUB, SILCHAR MEDICAL CO...Ultimatewinner0342

🧠 Lazy Sunday Quiz | General Knowledge Trivia by SMC Quiz Club – Silchar Medical College Presenting the Lazy Sunday Quiz, a fun and thought-provoking general knowledge quiz created by the SMC Quiz Club of Silchar Medical College & Hospital (SMCH). This quiz is designed for casual learners, quiz enthusiasts, and competitive teams looking for a diverse, engaging set of questions with clean visuals and smart clues. 🎯 What is the Lazy Sunday Quiz? The Lazy Sunday Quiz is a light-hearted yet intellectually rewarding quiz session held under the SMC Quiz Club banner. It’s a general quiz covering a mix of current affairs, pop culture, history, India, sports, medicine, science, and more. Whether you’re hosting a quiz event, preparing a session for students, or just looking for quality trivia to enjoy with friends, this PowerPoint deck is perfect for you. 📋 Quiz Format & Structure Total Questions: ~50 Types: MCQs, one-liners, image-based, visual connects, lateral thinking Rounds: Warm-up, Main Quiz, Visual Round, Connects (optional bonus) Design: Simple, clear slides with answer explanations included Tools Needed: Just a projector or screen – ready to use! 🧠 Who Is It For? College quiz clubs School or medical students Teachers or faculty for classroom engagement Event organizers needing quiz content Quizzers preparing for competitions Freelancers building quiz portfolios 💡 Why Use This Quiz? Ready-made, high-quality content Curated with lateral thinking and storytelling in mind Covers both academic and pop culture topics Designed by a quizzer with real event experience Usable in inter-college fests, informal quizzes, or Sunday brain workouts 📚 About the Creators This quiz has been created by Rana Mayank Pratap, an MBBS student and quizmaster at SMC Quiz Club, Silchar Medical College. The club aims to promote a culture of curiosity and smart thinking through weekly and monthly quiz events. 🔍 SEO Tags: quiz, general knowledge quiz, trivia quiz, SlideShare quiz, college quiz, fun quiz, medical college quiz, India quiz, pop culture quiz, visual quiz, MCQ quiz, connect quiz, science quiz, current affairs quiz, SMC Quiz Club, Silchar Medical College 📣 Reuse & Credit You’re free to use or adapt this quiz for your own events or sessions with credit to: SMC Quiz Club – Silchar Medical College & Hospital Curated by: Rana Mayank Pratap

English 3 Quarter 1_LEwithLAS_Week 1.pdfDeAsisAlyanajaneH

How to Customize Quotation Layouts in Odoo 18Celine George

Intellectual Property Right (Jurisprudence).pptxVishal Chanalia

Romanticism in Love and Sacrifice An Analysis of Oscar Wilde’s The Nightingal...KaryanaTantri21

The story revolves around a college student who despairs not having a red rose as a condition for dancing with the girl he loves. The nightingale hears his complaint and offers to create the red rose at the cost of his life. He sang a love song all night with his chest stuck to the thorns of the rose tree. Finally, the red rose grew, but his sacrifice was in vain. The girl rejected the flower because it didn’t match her outfit and preferred a jewellery gift. The student threw the flower on the street and returned to studying philosophy

Plate Tectonic Boundaries and Continental Drift TheoryMarie

2025 June Year 9 Presentation: Subject selection.pptxmansk2

Pests of Maize: An comprehensive overview.pptxArshad Shaikh

Maize is susceptible to various pests that can significantly impact yields. Key pests include the fall armyworm, stem borers, cob earworms, shoot fly. These pests can cause extensive damage, from leaf feeding and stalk tunneling to grain destruction. Effective management strategies, such as integrated pest management (IPM), resistant varieties, biological control, and judicious use of chemicals, are essential to mitigate losses and ensure sustainable maize production.

Paper 108 | Thoreau’s Influence on Gandhi: The Evolution of Civil DisobedienceRajdeep Bavaliya

OBSESSIVE COMPULSIVE DISORDER.pptx IN 5TH SEMESTER B.SC NURSING, 2ND YEAR GNM...parmarjuli1412

Code Profiling in Odoo 18 - Odoo 18 SlidesCeline George

Great Governors' Send-Off Quiz 2025 Prelims IIT KGPIIT Kharagpur Quiz Club

IIT KGP Quiz Week 2024 Sports Quiz (Prelims + Finals)IIT Kharagpur Quiz Club

LDMMIA Shop & Student News Summer Solstice 25LDM & Mia eStudios

Peer Teaching Observations During School InternshipAjayaMohanty7

THE PSYCHOANALYTIC OF THE BLACK CAT BY EDGAR ALLAN POE (1).pdfnabilahk908

Vitamin and Nutritional Deficiencies.pptxVishal Chanalia

YSPH VMOC Special Report - Measles Outbreak Southwest US 6-14-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC)

University of Ghana Cracks Down on Misconduct: Over 100 Students SanctionedKweku Zurek

How to Manage Different Customer Addresses in Odoo 18 AccountingCeline George

LAZY SUNDAY QUIZ "A GENERAL QUIZ" JUNE 2025 SMC QUIZ CLUB, SILCHAR MEDICAL CO...Ultimatewinner0342

English 3 Quarter 1_LEwithLAS_Week 1.pdfDeAsisAlyanajaneH

How to Customize Quotation Layouts in Odoo 18Celine George

Intellectual Property Right (Jurisprudence).pptxVishal Chanalia

Romanticism in Love and Sacrifice An Analysis of Oscar Wilde’s The Nightingal...KaryanaTantri21

Plate Tectonic Boundaries and Continental Drift TheoryMarie

2025 June Year 9 Presentation: Subject selection.pptxmansk2

Pests of Maize: An comprehensive overview.pptxArshad Shaikh

Routing algorithm

1. Routing Algorithm 2004. 11. 3 Ahn Kook Jin

2. Contents Routing Protocol and Algorithm Classifications Link State Routing Algorithm Distance Vector Routing Algorithm LS Algorithm vs. DV Algorithm Hierarchical Routing

3. Routing Protocol and Algorithm Determining the path(route) source host destination host 5 2 1 2 3 1 3 5 2 1 B A C E D F first-hop router default router source router destination router least-cost path

4. Classifications Global vs. decentralized global(link state algorithm) : complete information about connectivity and link costs Static vs. dynamic static : routes change very slowly Load-sensitive vs. load-insensitive load-sensitive : link costs reflect congestion Typical used Dynamic link state routing algorithm Dynamic distance vector routing algorithm

5. Link State Routing Algorithm Each node broadcasts the identities and costs to its directly attached neighbors Dijkstra’s algorithm

6. Link State Routing Algorithm Oscillation(page 307) D B C A e 1 1 2+e 0 0 1+e 0 0 0 1 1 0 0 0 e 0 1+e 0 0 0 0 0 1+e 1 2+e 0 2+e 0 0 1+e 0 0 0 1

7. Distance Vector Routing Algorithm Iterative, asynchronous, distributed Distance table D X (Y,Z) : cost of the direct link from X to Z + Z’s currently known minmum-cost path to Y D X (Y,Z)=c(X,Z)+min w {D z (Y,w)}

8. Distance Vector Routing Algorithm Initialization: D X (*,v) = inifinite, D X (v,v)=c(x,v) Send min w D X (y,w) to each neighbor when they changes C(X,V) changes Neighbor node send its update

9. Distance Vector Routing Algorithm 7 2 1 Y X Z 7 ∞ Z ∞ 2 Y Z Y D X 1 ∞ Z ∞ 2 X Z X D Y 1 ∞ Y ∞ 7 X Y X D z

10. Distance Vector Routing Algorithm 7 2 1 Y X Z 7 3 Z 8 2 Y Z Y D X 1 9 Z 8 2 X Z X D Y 1 9 Y 3 7 X Y X D z

11. Distance Vector Routing Algorithm 7 2 1 Y X Z 7 3 Z 8 2 Y Z Y D X 1 5 Z 4 2 X Z X D Y 1 9 Y 3 7 X Y X D z

12. Distance Vector Routing Algorithm Decrease 50 4 1 1 Y X Z 6 4 X Z X D Y 5 50 X Y X D z

13. Distance Vector Routing Algorithm Decrease 50 4 1 1 Y X Z 6 1 X Z X D Y 5 50 X Y X D z

14. Distance Vector Routing Algorithm Decrease 50 4 1 1 Y X Z 6 1 X Z X D Y 2 50 X Y X D z

15. Distance Vector Routing Algorithm Decrease 50 4 1 1 Y X Z 6 1 X Z X D Y 2 50 X Y X D z

16. Distance Vector Routing Algorithm Increase 50 4 1 60 Y X Z 6 4 X Z X D Y 5 50 X Y X D z

17. Distance Vector Routing Algorithm Increase 50 4 1 60 Routing loop Y X Z 6 60 X Z X D Y 5 50 X Y X D z

18. Distance Vector Routing Algorithm Increase 50 4 1 60 Y X Z 6 60 X Z X D Y 7 50 X Y X D z

19. Distance Vector Routing Algorithm Increase 50 4 1 60 Y X Z 8 60 X Z X D Y 7 50 X Y X D z

20. Distance Vector Routing Algorithm Increase 50 4 1 60 Too many iterations! (count-to-infinity problem) Y X Z 8 60 X Z X D Y 9 50 X Y X D z

21. Distance Vector Routing Algorithm Poisoned reverse 50 4 1 60 Y X Z ∞ 4 X Z X D Y 5 50 X Y X D z

22. Distance Vector Routing Algorithm Poisoned reverse 50 4 1 60 Y X Z ∞ 60 X Z X D Y 5 50 X Y X D z

23. Distance Vector Routing Algorithm Poisoned reverse 50 4 1 60 Y X Z ∞ 60 X Z X D Y 61 50 X Y X D z

24. Distance Vector Routing Algorithm Poisoned reverse 50 4 1 60 Y X Z 51 60 X Z X D Y 61 50 X Y X D z

25. Distance Vector Routing Algorithm Poisoned reverse Cannot solve general count-to-infinity problem 50 4 1 60 Y X Z 51 60 X Z X D Y ∞ 50 X Y X D z

26. LS Algorithm vs. DV Algorithm Bad Good Robustness Slow(count-to-infinity problem) O(n 2 ) algorithm Speed of convergence Maybe small O(nE) Message complexity DV LS

27. Hierarchical Routing View network as interconnected routers Scale Administrative autonomy Organize routers into autonomy systems(AS)

28. Hierarchical Routing Autonomy system(AS) Gateway router Intra-AS Inter-AS B.a B.a A.a A.b A.c A.d C.b C.c C.a Host H1 Host H2

29. Hierarchical Routing Topological view for inter-AS routing protocol B.a A.a A.c C.a

30. END

Routing algorithm

Recommended

More Related Content

What's hot (20)

Viewers also liked (6)

Similar to Routing algorithm (20)

Recently uploaded (20)

Routing algorithm