Topology. Youki Kadobayashi NAIST. Outline. Routing system: its function. Gateway Model Revisited. Routing system: its structure
|
|
- Aubrey Cunningham
- 6 years ago
- Views:
Transcription
1 Information Network 1 Routing (1) Topology Topology 1: 2a (1): a branch of mathematics concerned with those properties of geometric configurations (as point sets) which are unaltered by elastic deformations (as a stretching or twisting) that are homeomorphisms (2): the set of all open subsets of a topological space b: configuration <topology of a molecule> <topology of a magnetic field> (Source: Merriam-Webster Online Dictionary) Youki Kadobayashi NAIST 1 Image: Visualization of global Internet AS topology, Hiroaki Hazeyama 2 Outline Routing system: its function! Introduction to routing! Its function and structure! Types of routing algorithm! Provision of end-to-end reachability! Automatic detection of shortest path! Distribution of traffic! Distance vector routing! Tuple expression of route! Counting to infinity, split horizon! Avoid failing links! Fault isolation! Reflect administrative policies! Link-state routing! Graph expression of route 3 4 Routing system: its structure Gateway Model Revisited! Routing protocol! Discovers neighbor router;! Exchanges topology information;! Exchanges link information Routing software Multiple RIBs compute route RIB: Routing Information Base)! Multiple routing protocols! Multiple RIBs! Consolidate Multiple RIBs into single FIB (FIB: Forwarding Information Base) FIB 5 Input interfaces Output interfaces 6
2 Types of Routing Algorithm Questions?! Distance vector! Link state! Path vector! Key difference of these algorithms:! Topology representation! Propagation range / frequency / timing of link state! Algorithm for computing shortest path! Design trade-offs:! Scalability! Convergence time! Algorithm simplicity 7 8 Distance vector routing 9 Distance vector routing! 1. assign distance vector to myself 0; for others, assign! 2. send my distance vectors to all neighbor routers! 3. router calculates minimum distance vectors by 1) distance vectors advertised by neighbor routers and 2) distance from myself to individual neighbor router!! DN p Problem of distance vector routing Counting to infinity! For the given number of routers N,! Time complexity: O(N 3 )! Traffic: O(N 2 )! Convergence speed is slow, since it sends distance vector periodically In case of newly created route, or dismissed route! Slow convergence speed results in inconsistent and transitional state! Counting to infinity problem A B Suppose link B-C went down. B thinks: (C, inf) A says: (C, 2) B thinks: (C, 3) via A B says: (C, 3) A thinks: (C, 4) via B 1 inf C 11 12
3 Split horizon Limitation of split horizon! Workaround for counting to infinity! Router doesn t send learned information to source router A Suppose link B-C went down. B thinks: (C, inf) A says: (C, 2) to everyone except B B 1 inf C A D B 1 inf C Suppose link B-C went down. B thinks: (C, inf) A says: (C, 2) to everyone except B D thinks: (C, 3) via A D says: (C, 3) B thinks: (C, 4) via D RIP: Routing Information Protocol RFC 2453, RFC 2080 Route representation in RIP! Distance vector routing! RIP-2 (IPv4), RIPng (IPv6)! Used in relatively small network Due to ease of implementation and operation prefix, metric)! 1 <= metric <= 16 can t use large metric, due to counting to infinity problem! Metric 16 means unreachable! Broadcast/Multicast to UDP port Behavior of RIP Router! Learns route! Sends RIP query packet! Receives RIP response packet! Updates route information! Advertises route information every 30 seconds! with split horizon, triggered update! Deletes route information No route advertisement for 180 sec! metric 16 No route advertisement for another 120 sec! delete route information Routing tricks! Why it works even when 2r > 16?! Divide and conquer! Partitioning into routing domains! Routing between domains (covered in next lecture) 17 18
4 Questions? Link-state routing Link-state routing Dijkstra algorithm Demo : GIDEN! Collect router and link information Digraph: router as a node, link as an arc! Create link state database (LSDB) Network map that collects link state information! Based on LSDB, calculate the shortest path with the Dijkstra s shortest path algorithm! Time complexity: O(N 2 ) Can be further optimized by improved data structure 21!!!!!! 22 Pros and Cons of Link-State Routing OSPF: Open Shortest Path First RFC 2328, 5340! Time complexity: lower than distance vector routing! Traffic: increases in proportion to the number of links and routers! Storage complexity: increases in proportion to the number of links and routers! Convergence time: must be short! Counting to infinity doesn t happen! Flexible configuration of link cost is possible! Link state routing protocol for TCP/IP world! OSPFv2 (IPv4), OSPFv3 (IPv6)! Functions! Recognize neighbor router! Exchange link state information and create LSDB! Calculate shortest path tree (spanning tree)! + Designated Router, Backup Designated Router! + Hierarchical structure by area! + Collaboration with EGP 23 24
5 OSPF Hello! Discover neighbor router on the same link send Hello packet to , ff02::5 (AllSPFRouters)! List of neighbor routers in Hello packet check bidirectional communication select designated router and backup designated router Adjacency formation! Neighbor! Adjacent! Routers don t exchange routing information unless they are adjacent! Formation process:! Hello Neighbor! Synchronize each LSDB! Synchronized! Adjacent! Send Hello packet periodically to detect link down Questions? Topology Representation in OSPF! (Link State Advertisement) Type 1: Router Type 2: Network Type 3: Summary (network) Type 4: Summary (AS boundary) Type 5: AS External! common header Validity period and sequence number in header Helps routers to tell if given is fresh Topology Representation in OSPF Link State Update! Flooding! Forward received s to other interfaces if given s are fresh! Update LSDB, compute shortest path tree again 29 30
6 Questions? to RIB LSDB Dijkstra RIB directed graph shortest path tree fragments of directed graph to RIB! The following 3 slides:! Example of OSPF network Example of OSPF Network! Derived directed graph Subgraph represented by individual! Shortest path tree; rooted at RT6 Generated by Dijkstra s algorith Digraph Shortest path tree; rooted at RT
7 OSPF area! Solution by divide and conquer algorithm! Time complexity: For intra-area link changes, the Dijkstra's Algorithm used in OSPF has a time complexity of O(s*log s), where s is the size of the Area. (X. Xiao et al., Reducing Routing Table Computation Cost in OSPF, INET 99)! Traffic volume (fault isolation)! The following 2 slides:! Example of OSPF area! Partitioned digraph Gateway Model Revisited Routing software Multiple RIBs RIP OSPF FIB 39 Input interfaces Output interfaces 40 Questions? Summary! Distance vector routing! Bellman-Ford algorithm! RIP protocol! Link state routing! Dijkstra algorithm! OSPF protocol! Coming in next lecture:! IGP and EGP, hierarchical routing! Path vector routing! Implementation of routing policy 41 42
Youki Kadobayashi NAIST
Information Network 1 Routing (1) Youki Kadobayashi NAIST 1 The Routing Problem! How do I get from source to destination?! Which path is best? In terms of:! Number of hops! Delay! Bandwidth! Policy constraints!
More informationYouki Kadobayashi NAIST
Information Network 1 Routing (1) Image: Part of the entire Internet topology based on CAIDA dataset, using NAIST Internet viewer Youki Kadobayashi NAIST 1 The Routing Problem! How do I get from source
More informationYouki Kadobayashi NAIST
Information Network 1 Routing (1) Image: Part of the entire Internet topology based on CAIDA dataset, using NAIST Internet viewer Youki Kadobayashi NAIST 1 The Routing Problem How do I get from source
More informationYouki Kadobayashi NAIST
Information Network 1 Routing (1) Image: Part of the entire Internet topology based on CAIDA dataset, using NAIST Internet viewer Youki Kadobayashi NAIST 1 The Routing Problem How do I get from source
More informationRouting(2) Inter-domain Routing
Routing(2) Inter-domain Routing Information Network I Youki Kadobayashi 1 Outline! Continued from previous lecture on:! Distance vector routing! Link state routing! IGP and EGP Interior gateway protocol,
More informationRouting(2) Inter-domain Routing
Routing(2) Inter-domain Routing Information Network I Youki Kadobayashi 1 Outline! Distance vector routing! Link state routing! IGP and EGP Intra-domain routing protocol, inter-domain routing protocol!
More informationRouting(2) Inter-domain Routing
Routing(2) Inter-domain Routing Information Network I Youki Kadobayashi 1 Outline Continued from previous lecture on: Distance vector routing Link state routing IGP and EGP Interior gateway protocol, Exterior
More informationRouting Protocols of IGP. Koji OKAMURA Kyushu University, Japan
Routing Protocols of IGP Koji OKAMURA Kyushu University, Japan Routing Protocol AS (Autonomous System) Is operated autonomous in the organization. 6bit IGP (Interior Gateway Protocol) Routing Control inside
More information! Distance vector routing! Link state routing.! Path vector routing! BGP: Border Gateway Protocol! Route aggregation
! Distance vector routing! Link state routing Information Network I Youki Kadobayashi! IGP and EGP Intra-domain routing protocol, inter-domain routing protocol! Path vector routing! BGP: Border Gateway
More informationBasic Idea. Routing. Example. Routing by the Network
Basic Idea Routing Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:
More informationRouting by the Network
Routing Basic Idea Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:
More informationNetwork Protocols. Routing. TDC375 Autumn 03/04 John Kristoff - DePaul University 1
Network Protocols Routing TDC375 Autumn 03/04 John Kristoff - DePaul University 1 IPv4 unicast routing All Internet hosts perform basic routing for local net destinations, forward to local host for non-local
More informationChapter 7: Routing Dynamically. Routing & Switching
Chapter 7: Routing Dynamically Routing & Switching The Evolution of Dynamic Routing Protocols Dynamic routing protocols used in networks since the late 1980s Newer versions support the communication based
More informationComputer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First)
Computer Networking Intra-Domain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) IP Forwarding The Story So Far IP addresses are structured to reflect Internet structure IP
More informationRouting Protocol. Seiya Tsubone. Apr The University of Tokyo. Seiya Tsubone (The University of Tokyo) Routing Protocol Apr. 25.
Routing Protocol Seiya Tsubone The University of Tokyo Apr. 25. 2013 Seiya Tsubone (The University of Tokyo) Routing Protocol Apr. 25. 2013 1 / 60 Table of Contents 1 The Concept of Routing 2 RIP 3 OSPF
More informationUnit 3: Dynamic Routing
Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about
More informationWhy dynamic route? (1)
Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update
More informationPlanning for Information Network
Planning for Information Network Lecture 8: Network Routing Protocols Assistant Teacher Samraa Adnan Al-Asadi 1 Routing protocol features There are many ways to characterize routing protocols, including
More informationCHAPTER 4: ROUTING DYNAMIC. Routing & Switching
CHAPTER 4: ROUTING DYNAMIC Routing & Switching CHAPTER4 4.1 Dynamic Routing Protocols 4.2 Distance Vector Dynamic Routing 4.3 RIP and RIPng Routing 4.4 Link-State Dynamic Routing 4.5 The Routing Table
More informationNetwork Protocols. Routing. TDC375 Winter 2002 John Kristoff - DePaul University 1
Network Protocols Routing TDC375 Winter 2002 John Kristoff - DePaul University 1 IP routing Performed by routers Table (information base) driven Forwarding decision on a hop-by-hop basis Route determined
More informationLecture 12. Introduction to IP Routing. Why introduction? Routing
Lecture. Introduction to IP Routing Why introduction? Routing: very complex issue need in-depth study entire books on routing our scope: give a flavour of basic routing structure and messaging give an
More informationRouting Protocols. Autonomous System (AS)
Routing Protocols Two classes of protocols: 1. Interior Routing Information Protocol (RIP) Open Shortest Path First (OSPF) 2. Exterior Border Gateway Protocol (BGP) Autonomous System (AS) What is an AS?
More informationTDC 363 Introduction to LANs
TDC 363 Introduction to LANs Routing Protocols and RIP Greg Brewster DePaul University TDC 363 1 Dynamic Routing Routing Protocols Distance Vector vs. Link State Protocols RIPv1 & RIPv2 RIP Problems Slow
More informationCSCD 330 Network Programming Spring 2018
CSCD 330 Network Programming Spring 018 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 017 1 Network
More informationChapter 4: Advanced Internetworking. Networking CS 3470, Section 1
Chapter 4: Advanced Internetworking Networking CS 3470, Section 1 Intra-AS and Inter-AS Routing a C C.b b d A A.a a b A.c c B.a a B c Gateways: perform inter-as routing amongst themselves b perform intra-as
More informationCS118 Discussion Week 7. Taqi
CS118 Discussion Week 7 Taqi Outline Hints for project 2 Lecture review: routing About Course Project 2 Please implement byte-stream reliable data transfer Cwnd is in unit of bytes, not packets How to
More informationCSCD 330 Network Programming Spring 2017
CSCD 330 Network Programming Spring 017 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 1996-007
More informationInternet Routing Protocols Tuba Saltürk
Internet Routing Protocols 15505068 Tuba Saltürk Outline Internet Routers Routing Protocol Interior Gateway Protocol (IGP) Distance- Vector Routing Protocol Routing Information Protocol (RIP) Interior
More informationCOM-208: Computer Networks - Homework 6
COM-208: Computer Networks - Homework 6. (P22) Suppose you are interested in detecting the number of hosts behind a NAT. You observe that the IP layer stamps an identification number sequentially on each
More informationEECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.
EECS 122, Lecture 16 Kevin Fall kfall@cs.berkeley.edu edu Link Costs and Metrics Routing protocols compute shortest/cheapest paths using some optimization criteria Choice of criteria has strong effect
More informationCSE 461 Routing. Routing. Focus: Distance-vector and link-state Shortest path routing Key properties of schemes
CSE 46 Routing Routing Focus: How to find and set up paths through a network Distance-vector and link-state Shortest path routing Key properties of schemes Application Transport Network Link Physical Forwarding
More informationTable of Contents 1 Static Routing Configuration RIP Configuration 2-1
Table of Contents 1 Static Routing Configuration 1-1 Introduction 1-1 Static Route 1-1 Default Route 1-1 Application Environment of Static Routing 1-1 Configuring a Static Route 1-2 Configuration Prerequisites
More informationCS4450. Computer Networks: Architecture and Protocols. Lecture 11 Rou+ng: Deep Dive. Spring 2018 Rachit Agarwal
CS4450 Computer Networks: Architecture and Protocols Lecture 11 Rou+ng: Deep Dive Spring 2018 Rachit Agarwal 2 Goals for Today s Lecture Learning about Routing Protocols Link State (Global view) Distance
More informationROUTING PROTOCOLS. Mario Baldi Routing - 1. see page 2
ROUTING PROTOCOLS Mario Baldi www.baldi.info Routing - 1 Copyright Notice This set of transparencies, hereinafter referred to as slides, is protected by copyright laws and provisions of International Treaties.
More informationRouting. 4. Mar INF-3190: Switching and Routing
Routing 4. Mar. 004 1 INF-3190: Switching and Routing Routing: Foundations! Task! To define the route of packets through the network! From the source! To the destination system! Routing algorithm! Defines
More informationComputer Networks ICS 651. IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery
Computer Networks ICS 651 IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery Routing Information Protocol DV modified with split horizon and poisoned reverse distance
More informationRouting in the Internet
Routing in the Internet Daniel Zappala CS 460 Computer Networking Brigham Young University Scaling Routing for the Internet 2/29 scale 200 million destinations - can t store all destinations or all prefixes
More informationOverview. Information About Layer 3 Unicast Routing. Send document comments to CHAPTER
CHAPTER 1 This chapter introduces the basic concepts for Layer 3 unicast routing protocols in Cisco NX-OS. This chapter includes the following sections: Information About Layer 3 Unicast Routing, page
More informationRouting in a network
Routing in a network Focus is small to medium size networks, not yet the Internet Overview Then Distance vector algorithm (RIP) Link state algorithm (OSPF) Talk about routing more generally E.g., cost
More informationTop-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Switching 2 Page 1 Objectives MAC address table Describe the features
More informationCompSci 356: Computer Network Architectures. Lecture 13: Dynamic routing protocols: Link State Chapter 3.3.3, Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 13: Dynamic routing protocols: Link State Chapter 3.3.3, 3.2.9 Xiaowei Yang xwy@cs.duke.edu Today Clarification on RIP Link-state routing Algorithm Protocol:
More informationTwo types of routing protocols are used in internetworks: interior gateway protocols (IGPs) and exterior gateway protocols (EGPs).
Introduction Dynamic routing is when protocols are used to find networks and update routing tables on routers. True, this is easier than using static or default routing, but it ll cost you in terms of
More informationIntroduction to OSPF
Introduction to OSPF 1 OSPF Open Shortest Path First Link state or SPF technology Developed by OSPF working group of IETF (RFC 1247) OSPFv2 standard described in RFC2328 Designed for: TCP/IP environment
More informationLast time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm
Last time Transitioning to IPv6 Tunneling Gateways Routing Graph abstraction Link-state routing Dijkstra's Algorithm Distance-vector routing Bellman-Ford Equation 10-1 This time Distance vector link cost
More informationRouting Information Protocol
Routing Information Protocol A simple distance vector scheme Karst Koymans Informatics Institute University of Amsterdam (version 18.2, 2018/11/21 13:11:09) Friday, November 23, 2018 Karst Koymans (UvA)
More informationNortel Ethernet Routing Switch 5000 Series Configuration IP Routing Protocols. Release: 6.1 Document Revision:
Configuration IP Routing Protocols Release: 6.1 Document Revision: 05.01 www.nortel.com NN47200-503. . Release: 6.1 Publication: NN47200-503 Document release date: 25 May 2009 While the information in
More informationICS 351: Today's plan. distance-vector routing game link-state routing OSPF
ICS 351: Today's plan distance-vector routing game link-state routing OSPF distance-vector routing game 1. prepare a list of all neighbors and the links to them, and the metric for each link 2. create
More informationLink State Routing. Link State Packets. Link State Protocol. Link State Protocols Basic ideas Problems and pitfalls
Link State Routing In particular OSPF Karst Koymans Informatics Institute University of Amsterdam (version 16.3, 2017/03/09 11:25:31) Tuesday, March 7, 2017 Link State Protocols Basic ideas Problems and
More informationRouting Information Protocol. RIP application. RIP version 1
Routing Information Protocol A simple distance vector scheme Karst Koymans Informatics Institute University of Amsterdam (version 16.3, 2017/03/01 13:00:45) Friday, March 3, 2017 RIP version 1 Origin and
More informationTop-Down Network Design
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Original slides by Cisco Press & Priscilla Oppenheimer Selection Criteria for Switching and Routing Protocols Network traffic
More informationCampus Networking Workshop CIS 399. Core Network Design
Campus Networking Workshop CIS 399 Core Network Design Routing Architectures Where do we route? At the point where we want to limit our layer-2 broadcast domain At your IP subnet boundary We can create
More informationOpen Shortest Path First (OSPF)
CHAPTER 42 Open Shortest Path First (OSPF) Background Open Shortest Path First (OSPF) is a routing protocol developed for Internet Protocol (IP) networks by the interior gateway protocol (IGP) working
More information2008 NDP Lectures 7 th Semester
2008 NDP Lectures 7 th Semester Neeli R. Prasad, Associate Professor Head of Wireless Security and Sensor Networks Group Networking and Security Aalborg University Niels Jernes Vej 12, 9220 Aalborg East,
More informationCSc 450/550 Computer Networks Internet Routing
CSc 450/550 Computer Networks Internet Routing Jianping Pan Summer 2007 7/12/07 CSc 450/550 1 Review Internet Protocol (IP) IP header addressing class-based, classless, hierarchical, NAT routing algorithms
More informationRouting Information Protocol
Routing Information Protocol A simple distance vector scheme dr. C. P. J. Koymans Informatics Institute University of Amsterdam February 24, 2008 dr. C. P. J. Koymans (UvA) Routing Information Protocol
More informationArchitectures and Protocols for Integrated Networks. Intra-domain and Inter-domain Routing Protocols
Architectures and Protocols for Integrated Networks Intra-domain and Inter-domain Routing Protocols How is the routing table built? Path finding Paths from a device to any other device. Aggregated according
More informationDistance Vector Routing Protocols
Distance Vector Routing Protocols Routing Protocols and Concepts Chapter 4 Version 4.0 1 Objectives Identify the characteristics of distance vector routing protocols. Describe the network discovery process
More informationDistance vector and RIP
DD2490 p4 2008 Distance vector and RIP Olof Hagsand KTHNOC/NADA Literature RIP lab RFC 245: RIPv2. Sections 1 2 contains some introduction that can be useful to understand the context in which RIP is specified..1.4
More informationRouting, Routing Algorithms & Protocols
Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a
More informationECE 333: Introduction to Communication Networks Fall 2001
ECE : Introduction to Communication Networks Fall 00 Lecture : Routing and Addressing I Introduction to Routing/Addressing Lectures 9- described the main components of point-to-point networks, i.e. multiplexed
More informationTo contain/reduce broadcast traffic, we need to reduce the size of the network (i.e., LAN).
2.3.3 Routers 2.3.3.1 Motivation Bridges do not stop broadcast traffic. This can lead to broadcast storms (e.g., more than 100 nonunicast frames/sec) which can be catastrophic. This can bring the network
More informationComputer Networks. Routing Algorithms
Computer Networks Routing Algorithms Topics Routing Algorithms Shortest Path (Dijkstra Algorithm) Distance Vector Routing Count to infinity problem Solutions for count to infinity problem Link State Routing
More informationSEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 RIP, IGRP, EIGRP
SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 4.1.1 What are the three distance vector routing protocols? What are the key characteristics of RIP? What are the key characteristics of IGRP?
More informationCSCE 463/612 Networks and Distributed Processing Spring 2018
CSCE 463/612 Networks and Distributed Processing Spring 2018 Network Layer IV Dmitri Loguinov Texas A&M University April 12, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter
More informationRouting Information Protocol. A simple distance vector scheme
Routing Information Protocol A simple distance vector scheme RIP version 1 RFC 1058 Charles Hedrick, Rutgers University, 1988 Based on Bellman-Ford distance vector Also used as ARPANET routing protocol
More informationCompSci 356: Computer Network Architectures. Lecture 12: Dynamic routing protocols: Link State Chapter Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 12: Dynamic routing protocols: Link State Chapter 3.3.3 Xiaowei Yang xwy@cs.duke.edu Today Routing Information Protocol Link-state routing Algorithm
More informationRouting. Advanced Computer Networks: Routing 1
Routing Advanced Computer Networks: Routing 1 Gateway To internet or wide area network Metropolitan Area Network (MAN) s s Organization Servers Backbone R S R R Departmental Server s R S R s S R s s s
More informationInternet Routing Protocols, DHCP, and NAT
Internet Routing Protocols, DHCP, and NAT Hwajung Lee Modified from Slides Courtesy of Cisco Networking Academy and the book titled Communication Networks by Leon-Garcia Contents Basic Routing Single Area
More informationRouting Protocols. The routers in an internet are responsible for receiving and. forwarding IP datagrams through the interconnected set of
Routing Protocols MITA DUTTA The routers in an internet are responsible for receiving and forwarding IP datagrams through the interconnected set of sub-networks from source to destination. Routing protocols
More informationUnit 9. Author: W.Buchanan. Routing Protocols (1)
Unit 9 uthor: W.Buchanan. Routing Protocols (1) Routing Protocols B H F B D E G C uthor: W.Buchanan. Routing Protocols (2) Mobile s (Unit 10) Router Programming (Unit 8) Routing Protocols (Unit 9) IP ddressing/subnets
More informationICS 351: Today's plan. OSPF BGP Routing in general routing protocol comparison encapsulation network dynamics
ICS 351: Today's plan OSPF BGP Routing in general routing protocol comparison encapsulation network dynamics OSPF OSPF generally used within a single Autonomous System (AS), i.e. within an organization
More informationHelsinki University of Technology Telecommunications Laboratory. OSPF Routing Protocol Licenciate course seminar paper
Helsinki University of Technology Telecommunications Laboratory OSPF Routing Protocol Licenciate course seminar paper Shkumbin I. Hamiti, 08.10.1996 Communications Laboratory, TKK-HUT email: bini#tiltu.hut.fi
More informationHomework 3 Discussion
Homework 3 Discussion Address Resolution Protocol (ARP) Data Link Layer Network Layer Data Link Layer Network Layer Protocol Data Unit(PDU) Frames Packets Typical Device Switch/Bridge Router Range Local
More informationICS 351: Today's plan. OSPF BGP Routing in general
ICS 351: Today's plan OSPF BGP Routing in general link-state routing in distance-vector (Bellman-Ford, Ford-Fulkerson, RIP-style) routing, each router distributes its routing table to its neighbors an
More informationComparative Study of Routing Protocols Convergence using OPNET Chapter Three: Simulation & Configuration
3.1 Optimized Network Engineering Tools:- Optimized Network Engineering Tools () Modeler is the industry s leading simulator specialized for network research and development. It allows users to design
More informationImportant Lessons From Last Lecture Computer Networking. Outline. Routing Review. Routing hierarchy. Internet structure. External BGP (E-BGP)
Important Lessons From Last Lecture 15-441 Computer Networking Inter-Domain outing BGP (Border Gateway Protocol) Every router needs to be able to forward towards any destination Forwarding table must be
More informationRouting Information Protocol. RIP application. RIP version 1
Routing Information Protocol A simple distance vector scheme dr. C. P. J. Koymans Informatics Institute University of Amsterdam (version 1.1, 2010/02/19 12:38:50) Wednesday, February 24, 2010 RIP version
More informationChapter 4: Network Layer. TDTS06 Computer networks. Subnets. Subnets. Subnets. IP Addressing: introduction
hapter 4: Network Layer TDTS06 omputer s Lecture 6: Network layer III Routing in the Internet Jose M. Peña, jospe@ida.liu.se ID/DIT, LiU 2009-09-16 4. 1 Introduction 4.2 Virtual circuit and datagram s
More informationETSF05/ETSF10 Internet Protocols Routing on the Internet
ETSF05/ETSF10 Internet Protocols Routing on the Internet 2014, (ETSF05 Part 2), Lecture 1.1 Jens Andersson Circuit switched routing 2014 11 05 ETSF05/ETSF10 Internet Protocols 2 Packet switched Routing
More informationDynamic Routing. The Protocols
Dynamic Routing The Protocols Desirable Characteristics of Dynamic Routing Automatically detect and adapt to topology changes Provide optimal routing Scalability Robustness Simplicity Rapid convergence
More informationOperation Manual IPv4 Routing H3C S3610&S5510 Series Ethernet Switches. Table of Contents
Table of Contents Table of Contents Chapter 1 Static Routing Configuration... 1-1 1.1 Introduction... 1-1 1.1.1 Static Route... 1-1 1.1.2 Default Route... 1-1 1.1.3 Application Environment of Static Routing...
More informationCS118 Discussion 1A, Week 7. Zengwen Yuan Dodd Hall 78, Friday 10:00 11:50 a.m.
CS118 Discussion 1A, Week 7 Zengwen Yuan Dodd Hall 78, Friday 10:00 11:50 a.m. 1 Outline Network control plane Routing Link state routing (OSPF) Distance vector routing (RIP) BGP ICMP Midterm/Project 2
More informationEEC-684/584 Computer Networks
EEC-684/584 Computer Networks Lecture 14 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of last lecture Internetworking
More informationReal4Test. Real IT Certification Exam Study materials/braindumps
Real4Test http://www.real4test.com Real IT Certification Exam Study materials/braindumps Exam : 400-101 Title : CCIE Routing and Switching Written Exam v5.1 Vendor : Cisco Version : DEMO Get Latest & Valid
More informationModule 8. Routing. Version 2 ECE, IIT Kharagpur
Module 8 Routing Lesson 27 Routing II Objective To explain the concept of same popular routing protocols. 8.2.1 Routing Information Protocol (RIP) This protocol is used inside our autonomous system and
More informationInter-Domain Routing: BGP
Inter-Domain Routing: BGP Richard T. B. Ma School of Computing National University of Singapore CS 3103: Compute Networks and Protocols Inter-Domain Routing Internet is a network of networks Hierarchy
More informationETSF05/ETSF10 Internet Protocols. Routing on the Internet
ETSF05/ETSF10 Internet Protocols Routing on the Internet Circuit switched routing ETSF05/ETSF10 - Internet Protocols 2 Routing in Packet Switching Networks Key design issue for (packet) switched networks
More information6.02 Fall 2014! Lecture #21. Failures in routing Routing loops Counting to infinity
6.02 Fall 2014! Lecture #21 Failures in routing Routing loops Counting to infinity Unanswered questions (about packet-switched networks) How do nodes determine routes to every other node? Nodes determine
More informationRouting Protocol comparison
Routing Protocol comparison Introduction to routing Networks allow people to communicate, collaborate, and interact in many ways. Networks are used to access web pages, talk using IP telephones, participate
More informationDefault & Static Routes and Routing Information Protocol. Presented by : Mohammed Hamad
Default & Static Routes and Routing Information Protocol Presented by : Mohammed Hamad When a device has multiple paths to reach a destination, it always selects one path by preferring it over others.
More informationLecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday
Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing
More informationLecture 4: Intradomain Routing. CS 598: Advanced Internetworking Matthew Caesar February 1, 2011
Lecture 4: Intradomain Routing CS 598: Advanced Internetworking Matthew Caesar February 1, 011 1 Robert. How can routers find paths? Robert s local DNS server 10.1.8.7 A 10.1.0.0/16 10.1.0.1 Routing Table
More informationTable of Contents 1 OSPF Configuration 1-1
Table of Contents 1 OSPF Configuration 1-1 Introduction to OSPF 1-1 Basic Concepts 1-2 OSPF Area Partition 1-4 Router Types 1-7 Classification of OSPF Networks 1-9 DR and BDR 1-9 OSPF Packet Formats 1-11
More informationIP Routing. Bharat S. Chaudhari International Institute of Information Technology Pune, India
IP Routing Bharat S. Chaudhari International Institute of Information Technology Pune, India June 21, 2005 Network Devices: Ø The networking and internetworking devices are divided in the following categories:
More informationPolitecnico di Milano Scuola di Ingegneria Industriale e dell Informazione. 06 Routing protocols. Fundamentals of Communication Networks
Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione 06 Routing protocols Fundamentals of Communication Networks Topics o Routing basics o Routing algorithms (Bellman-Ford, Dijkstra)
More informationChapter 7 Routing Protocols
Chapter 7 Routing Protocols Nonroutable Protocols In the early days of networking, networks were small collections of computers linked together For the purposes of sharing information and expensive peripherals
More informationICMP, ARP, RARP, IGMP
Internet Layer Lehrstuhl für Informatik 4 Raw division into three tasks: Data transfer over a global network Route decision at the sub-nodes Control of the network or transmission status Routing Protocols
More informationIntroduction to routing
DD2490 p4 2010 Introduction to routing Olof Hagsand KTH/CSC Network example: KTH Intranet Levels of abstraction The Internet is huge Necessary to divide the routing problem into sub-problems. There are
More informationLink State Routing. Link State Packets. Link State Protocol. Link State Protocols Basic ideas Problems and pitfalls
Link State Routing In particular OSPF Karst Koymans Informatics Institute University of Amsterdam (version 17.4, 2017/11/30 12:33:57) Tuesday, November 28, 2017 Link State Protocols Basic ideas Problems
More informationOutline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting
Outline Routing Fundamentals of Computer Networks Guevara Noubir Introduction Broadcasting and Multicasting Shortest Path Unicast Routing Link Weights and Stability F2003, CSG150 Fundamentals of Computer
More information