Top-Down Network Design
|
|
- Hollie Dixon
- 5 years ago
- Views:
Transcription
1 Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Original slides by Cisco Press & Priscilla Oppenheimer
2 Selection Criteria for Switching and Routing Protocols Network traffic characteristics Bandwidth, memory and CPU usage The number of peers routers or switches supported The capability to adapt to changes quickly Support for authentication of route updates
3 Switching and Routing Choices Switching Layer 2 transparent bridging (switching) Multilayer switching Spanning Tree Protocol enhancements VLAN technologies Routing Static or dynamic Distance-vector and link-state protocols Interior and exterior
4
5 Making Decisions Goals must be established Many options should be explored The consequences of the decision should be investigated Contingency plans should be made A decision table can be used
6 Example Decision Table After a decision has been made, check: If this option is chosen, what could go wrong? Has this option been tried before (possibly with other customers)? If so, what problems occurred? How will the customer react to this decision? What are the contingency plans if the customer does not approve of the decision?
7 Transparent Bridging (Switching) Tasks Forward frames transparently Learn which port to use for each MAC address Flood frames when the destination unicast address hasn t been learned yet Filter frames from going out ports that don t include the destination address Flood broadcasts and multicasts
8 Forwarding Store-and-forward processing a bridge receives a complete frame, determines which outgoing port to use, prepares the frame for the outgoing port, calculates a cyclic redundancy check (CRC), and transmits the frame when the medium is free on the outgoing port. Cut-through processing a switch quickly looks at the destination address (the first field in a LAN frame), determines the outgoing port, and immediately starts sending bits to the outgoing port A disadvantage with cut-through processing is that it forwards illegal frames (for example, Ethernet runts) and frames with CRC errors. On a network that is prone to runts and errors, cut-through processing should not be used. Adaptive cut-through switching Automatically move from cut-through mode to store-and-forward mode when an error threshold is reached. Parallel forwarding When a typical bridge is forwarding a frame from one port to another, no other frame can be forwarded. There is only one forwarding path. A switch, on the other hand, allows multiple, parallel forwarding paths, which means a switch can handle a high volume of traffic more quickly than a bridge. High-end switches may support numerous simultaneous forwarding paths, depending on the structure of the switching fabric.
9 Switching Table on a Bridge or Switch MAC Address B C-60-7C C-02 Port 1 2 3
10 MAC Address Table Initial MAC address table is empty
11 Learning Addresses Station A sends a frame to station C. Switch caches the MAC address of station A to port E0 by learning the source address of data frames. The frame from station A to station C is flooded out to all ports except port E0 (unknown unicasts are flooded).
12 Learning Addresses (Cont.) Station D sends a frame to station C. Switch caches the MAC address of station D to port E3 by learning the source address of data frames. The frame from station D to station C is flooded out to all ports except port E3 (unknown unicasts are flooded).
13 Filtering Frames Station A sends a frame to station C. Destination is known; frame is not flooded.
14 Multilayer Switching Multilayer switching can refer to a switch that understands multiple layers. Cisco uses the term to refer to an advanced technology whereby routers (or route processors within a switch) communicate with switches to tell the switches how to forward frames without the router's help. There are three components: A route processor or router A switching engine The Multilayer Switching Protocol (MLSP) The route processor handles the first packet in every flow and makes a forwarding decision based on the Layer 3 destination address. The switching engine tracks packets that flow to the route processor and back again, and learns how the route processor handles the packets. After the first packet in a flow, the switching engine forwards the packets for that flow without sending them to the route processor. MLSP is a simple protocol used by the route processor to enable multilayer switching and to tell the switching engine to flush its Layer 3 switching table if there is a change in the routing table or access control list configuration.
15 Redundant Uplinks Core Layer X Distribution Layer Access Layer Switch B Primary Uplink Switch C X Secondary Uplink X = blocked by STP Switch A Users are connected to Switch A in the access layer. The access layer switch is attached to two distribution layer switches. One of the uplinks is blocked by STP. (STP has also blocked one of the links between the distribution and core layers.) If the uplink to Switch B fails, STP eventually unblocks the uplink to Switch C, hence restoring connectivity With the default STP parameters, the recovery takes between 30 and 50 seconds With UplinkFast, the recovery takes about one second: The UplinkFast feature is based on the definition of an uplink group. On a given switch, the uplink group consists of the root port and all the ports that provide an alternate connection to the root bridge. If the root port fails or the primary uplink fails, a port from the uplink group is selected to immediately replace the root port.
16 Protocols for Transporting VLAN Information Inter-Switch Link (ISL) Tagging protocol Cisco proprietary IEEE 802.1Q Tagging protocol IEEE standard VLAN Trunk Protocol (VTP) VLAN management protocol
17 Selecting Routing Protocols They all have the same general goal: To share network reachability information among routers They differ in many ways: Interior versus exterior Metrics supported Dynamic versus static and default Distance-vector versus link-state Classful versus classless Scalability
18 Interior Versus Exterior Routing Protocols Interior routing protocols are used within an autonomous system Exterior routing protocols are used between autonomous systems Autonomous system (two definitions that are often used): A set of routers that presents a common routing policy to the internetwork A network or set of networks that are under the administrative control of a single entity
19 Interior Versus Exterior Routing Protocols
20 Classful Routing Classful routing protocols do not include the subnet mask with the route advertisement. Within the same network, consistency of the subnet masks is assumed. Summary routes are exchanged between foreign networks. Examples of classful routing protocols: RIP Version 1 (RIPv1) IGRP
21 Classless Routing Classless routing protocols include the subnet mask with the route advertisement. Classless routing protocols support variable-length subnet masking (VLSM). Summary routes can be manually controlled within the network. Examples of classless routing protocols: RIP Version 2 (RIPv2) EIGRP OSPF IS-IS
22 Routing Protocol Metrics Metric: the determining factor used by a routing algorithm to decide which route to a network is better than another Examples of metrics: Bandwidth - capacity Delay - time Load - amount of network traffic Reliability - error rate Hop count - number of routers that a packet must travel through before reaching the destination network Cost - arbitrary value defined by the protocol or administrator
23 Routing Protocol Metrics
24 Static routing Routing Algorithms Calculated beforehand, offline Default routing If I don t recognize the destination, just send the packet to Router X Dynamic routing protocol Distance-vector algorithms Link-state algorithms
25 Static Routing Example Router A Router B Router C s0 s0 s0 s1 e0 e0 e Host A Host B Host C RouterA(config)#ip route Send packets for subnet 50 to (Router B)
26 Static Routing Advantages of static routing -It can backup multiple interfaces/networks on a router -Easy to configure -No extra resources are needed -More secure Disadvantages of static routing -Network changes require manual reconfiguration -Does not scale well in large topologies
27 Default Routing Example Router A Router B Router C s0 s0 s0 s1 e0 e0 e Host A Host B Host C RouterA(config)#ip route If it s not local, send it to (Router B)
28 Distance-Vector Routing Router maintains a routing table that lists known networks, direction (vector) to each network, and the distance to each network Router periodically (every 30 seconds, for example) transmits the routing table via a broadcast packet that reaches all other routers on the local segments Router updates the routing table, if necessary, based on received broadcasts
29 Distance-Vector Routing Tables Router A Router B Router A s Routing Table Network Distance Send To Port Router B Router B s Routing Table Network Distance Send To Port Router A
30 Routing Loops with Distance-Vector Routing When routers broadcast their routing tables, they simply send the Network and Distance columns of the table. They do not send the Send To (Next Hop) column, which is one of the causes of the loop problem. The sequence of events that can lead to a routing loop is as follows: Router A's connection to Network fails. Router A removes Network from its routing table. Based on previous announcements from Router A, Router B broadcasts its routing table saying that Router B can reach network Router A adds Network to its routing table with a Send To (Next Hop) value of Router B and a distance of 2. Router A receives a frame for a host on network Router A sends the frame to Router B. Router B sends the frame to Router A. The packet loops back and forth from Router A to Router B until the IP time-to-live value expires. To make matters worse, at some point Router A sends a route update saying it can get to Network , causing Router B to update the route in its table with a distance of 3. Both Router A and Router B continue to send route updates until finally the distance field reaches infinity. (Routing protocols arbitrarily define a distance that means infinity. For example, 16 means infinity for RIP.) When the distance reaches infinity, the routers remove the route. So the protocol finally works but the convergence time is high and during that time IP packets travel in loops.
31 Avoiding Routing Loops with Distance-Vector Routing Split-horizon If the protocol supports the split-horizon technique, the router sends only routes that are reachable via other ports (equivalently, it does not send a route to a port that is reachable via the same port). This reduces the size of the update and, more importantly, improves the accuracy of routing information. With split horizon, a router does not tell another router information that is better learned locally. Poison-reverse Poison-reverse messages are another way of speeding convergence and avoiding loops. With poison-reverse, when a router learns a route from another router, it responds by sending an update back to that router that lists the distance to the network as infinity. By doing so, the router explicitly states that the route is not directly reachable via itself. Triggered updates Triggered updates are another advanced feature of distance-vector protocols that can speed convergence. With triggered updates, a routing protocol announces route failures immediately. Rather than simply waiting for the next regularly scheduled routing update and not including in the update any routes that have failed, a router can immediately send an update. The immediate (triggered) update lists the failed route with the distance set to infinity. Hold-down timer Most distance-vector protocols also implement a hold-down timer so that new information about a route to a suspect network is not believed right away, in case the information is based on stale data. Hold-down timers are a standard way to avoid loops that can happen during convergence.
32 Link-State Routing Routers send updates only when there s a change Router that detects change creates a link-state advertisement (LSA) and sends it to neighbors Neighbors propagate the change to their neighbors Routers update their topological database if necessary
33 Distance-Vector Vs. Link-State Distance-vector algorithms keep a list of networks, with next hop and distance (metric) information Link-state algorithms keep a database of routers and links between them Link-state algorithms think of the internetwork as a graph instead of a list When changes occur, link-state algorithms apply Dijkstra s shortest-path algorithm to find the shortest path between any two nodes
34 Choosing Between Distance- Vector and Link-State Choose Distance-Vector Simple, flat topology Hub-and-spoke topology Junior network administrators Convergence time not a big concern Choose Link-State Hierarchical topology More senior network administrators Fast convergence is critical
35 Dynamic IP Routing Protocols Distance-Vector Routing Information Protocol (RIP) Version 1 and 2 Interior Gateway Routing Protocol (IGRP) Enhanced IGRP Border Gateway Protocol (BGP) Link-State Open Shortest Path First (OSPF) Intermediate System-to- Intermediate System (IS-IS)
36 Routing Information Protocol (RIP) First standard routing protocol developed for TCP/IP environments RIP Version 1 is documented in RFC 1058 (1988) RIP Version 2 is documented in RFC 2453 (1998) Easy to configure and troubleshoot Broadcasts its routing table every 30 seconds; 25 routes per packet Uses a single routing metric (hop count) to measure the distance to a destination network; max hop count is 15
37 RIP V2 Features Includes the subnet mask with route updates Supports prefix routing (classless routing, supernetting) Supports variable-length subnet masking (VLSM) Includes simple authentication to foil crackers sending routing updates
38 IGRP Solved Problems with RIP 15-hop limitation in RIP IGRP supports 255 hops Reliance on just one metric (hop count) IGRP uses bandwidth, delay, reliability, load (By default just uses bandwidth and delay) RIP's 30-second update timer IGRP uses 90 seconds
39 Open Shortest Path First (OSPF) Open standard, defined in RFC 2328 Adjusts to changes quickly Supports very large internetworks Does not use a lot of bandwidth Authenticates protocol exchanges to meet security goals
40 OSPF Metric A single dimensionless value called cost. A network administrator assigns an OSPF cost to each router interface on the path to a network. The lower the cost, the more likely the interface is to be used to forward data traffic. On a Cisco router, the cost of an interface defaults to 100,000,000 divided by the bandwidth for the interface. For example, a 100-Mbps Ethernet interface has a cost of 1.
41 OSPF Areas Connected via Area Border Routers (ABRs) Area 0 (Backbone) ABR ABR ABR Area 1 Area 2 Area 3
42 IS-IS Intermediate System-to-Intermediate System Link-state routing protocol Designed by the ISO for the OSI protocols Integrated IS-IS handles IP also
43 Border Gateway Protocol (BGP) Allows routers in different autonomous systems to exchange routing information Exterior routing protocol Used on the Internet among large ISPs and major companies Supports route aggregation Main metric is the length of the list of autonomous system numbers, but BGP also supports routing based on policies
44 Routing table comparison
45 Summary Ethernet switches increase the available bandwidth of a network by creating dedicated network segments and interconnecting the segments. Switches can use one of the following operating modes to transmit frames: store and forward, cut-through, adaptive cut-through and parallel forwarding Switches maintain a MAC address table to store address-to-port mappings so it can determine the locations of connected devices. In a redundant topology, multiple copies of the same frame can arrive at the intended host, potentially causing problems with the receiving protocol. If a change occurs to the network topology, STP maintains connectivity by transitioning some blocked ports to the forwarding state.
46 Summary Routing is the process by which an item gets from one location to another A routing protocol defines the set of rules used by a router when it communicates with neighboring routers. A default route is a special type of static route used for situations when the route from a source to a destination is not known. Dynamic routing relies on a routing protocol to disseminate knowledge. A distance vector routing algorithm sends its entire routing table to its neighbors. Link-state routing algorithms maintain a complex database of topology information, which routers use to maintain full awareness of distant routers.
Top-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 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 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 informationIntroduction to Routing
1 Introduction to Routing Session 2 Presentation_ID.scr 1 Agenda Addressing Concepts Routing Protocols Statics and Defaults 3 ISO OSI Reference Model Routing Information Protocol (RIP and RIPv2) L7 L6
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 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 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 information9.1. Routing Protocols
9.1. Routing Protocols Each organization that has been assigned a network address from an ISP is considered an autonomous system (AS). That organization is free to create one large network, or divide the
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 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 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 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 informationBTEC Level 3 Extended Diploma
BTEC Level 3 Extended Diploma Unit 9 Computer Network Routing and Routing Protocols BTEC Level 3 Extended Diploma Introduction to Routing Routing is the process that a router uses to forward packets toward
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 informationRIP Version 2. The Classless Brother
RIP Version 2 The Classless Brother (C) Herbert Haas 2005/03/11 1 Why RIPv2 Need for subnet information and VLSM Need for Next Hop addresses for each route entry Need for external route tags Need for multicast
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 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 informationSEMESTER 2 Chapter 3 Introduction to Dynamic Routing Protocols V 4.0
SEMESTER 2 Chapter 3 Introduction to Dynamic Routing Protocols V 4.0 3.1.1 What are the four routing RIP, RIPv2, EIGRP, OSPFv2 protocols that are the focus of this course? 3.1.1.2 What are routing protocols?
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 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 informationBuilding the Routing Table. Introducing the Routing Table Directly Connected Networks Static Routing Dynamic Routing Routing Table Principles
Building the Routing Table Introducing the Routing Table Directly Connected Networks Static Routing Dynamic Routing Routing Table Principles Introducing the Routing Table R1# show ip route Codes: C - connected,
More informationRouting Architecture. Objectives. Module 2 Routing Fundamentals. Author: Rolf Augstein January 2006
Routing Architecture Module 2 Routing Fundamentals Basic Problems Principles, Classification Operation Author: Rolf Augstein raugstein@rolfaugstein.com January 2006 Feel free to use this publication for
More informationChapter 5 RIP version 1
Cisco CCNA 2 Exploration - Routing Chapter 5 RIP version 1 João José jjose@ualg.pt http://w3.ualg.pt/~jjose/cisco/ Based on: Graziani, R. (2008) CIS 82 Routing Theory and Concepts RIPv1: A Distance Vector,
More informationTop-Down Network Design
Top-Down Network Design Chapter Five Designing a Network Topology Original slides copyright by Cisco Press & Priscilla Oppenheimer Network Topology Design Issues Hierarchy Redundancy Modularity Well-defined
More informationREDDIG II Computer Networking Training
REDDIG II Computer Networking Training JM SANCHEZ / PH RASSAT -20/06/2012 Invierno 2011 Capacitacion en fabrica - CORPAC Dynamic Routing Dynamic Routing Function(s) of Dynamic Routing Protocols: Dynamically
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 informationChapter 3. Introduction to Dynamic Routing Protocols. CCNA2-1 Chapter 3
Chapter 3 Introduction to Dynamic Routing Protocols CCNA2-1 Chapter 3 Introduction to Dynamic Routing Protocols Introduction to Dynamic Routing Protocols CCNA2-2 Chapter 3 Perspective and Background Dynamic
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 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 informationHierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice
Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!
More informationCCNA. Course Catalog
CCNA Course Catalog 2012-2013 This course is intended for the following audience: Network Administrator Network Engineer Systems Engineer CCNA Exam Candidates Cisco Certified Network Associate (CCNA 640-802)
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 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 informationRIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers
Table of Contents RIP Configuration 1 RIP Overview 1 Operation of RIP 1 Operation of RIP 2 RIP Version 2 RIP Message Format 3 Protocols and Standards 4 Configuring RIP Basic Functions 5 Configuration Prerequisites
More informationITEC310 Computer Networks II
ITEC310 Computer Networks II Chapter 22 Network Layer:, and Routing Department of Information Technology Eastern Mediterranean University Objectives 2/131 After completing this chapter you should be able
More informationRouting Protocols and
Introduction to Dynamic Routing Protocol Routing Protocols and Concepts Chapter 3 1 Objectives Describe the role of dynamic routing protocols and place these protocols in the context of modern network
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 informationCCNA IP ROUTING. Revision no.: PPT/2K605/03
CCNA 640-801 IP ROUTING Revision no.: PPT/2K605/03 Routing Basics The term routing is used for taking a packet from one device and sending it through the network to another device on a different network.
More informationPart II. Chapter 3. Determining IP Routes
Part II Chapter 3 Routers perform two main functions: switching and routing. The switching function is the process of moving packets from an inbound interface to an outbound interface. The switching function
More informationCS 43: Computer Networks. 24: Internet Routing November 19, 2018
CS 43: Computer Networks 24: Internet Routing November 19, 2018 Last Class Link State + Fast convergence (reacts to events quickly) + Small window of inconsistency Distance Vector + + Distributed (small
More informationCSCD 433/533 Advanced Networks Spring 2016
CSCD 433/533 Advanced Networks Spring 2016 Lecture 13 Router Algorithms and Design Chapter 5 1 Topics Router Algorithms Routing in General Hierarchical routing Interior Gateway Protocols OSPF mention of
More informationBasic IP Routing. Finding Feature Information. Information About Basic IP Routing. Variable-Length Subnet Masks
This module describes how to configure basic IP routing. The Internet Protocol (IP) is a network layer (Layer 3) protocol that contains addressing information and some control information that enables
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 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 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 informationIntroduction to Dynamic Routing Protocols
Introduction to Dynamic Routing Protocols 1 Objectives Describe the role of dynamic routing protocols and place these protocols in the context of modern network design. Identify several ways to classify
More informationIntroduction to Local and Wide Area Networks
Introduction to Local and Wide Area Networks Lecturers Amnach Khawne Jirasak Sittigorn Chapter 1 1 Routing Protocols and Concepts Chapter 4 : Distance Vector Routing Protocols Chapter 5 : RIP version 1
More informationThe most simple way to accelerate a Router is at 9.8 m/sec/sec.
Routing Introduction Direct vs. Indirect Delivery Static vs. Dynamic Routing Distance Vector vs. Link State (C) Herbert Haas 2005/03/11 The most simple way to accelerate a Router is at 9.8 m/sec/sec. Seen
More informationCIS 83 Midterm Spring 2004 Answer Sheet Name Score Grade Question Answer Question Answer
CIS 83 Midterm Spring 2004 Answer Sheet Name: Score: Grade: Question Answer Question Answer 1 A B C D E F 51 A B C D E F 2 A B C D E F 52 A B C D E F 3 A B C D E F 53 A B C D E F 4 A B C D E F 54 A B C
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 informationshortcut Tap into learning NOW! Visit for a complete list of Short Cuts. Your Short Cut to Knowledge
shortcut Your Short Cut to Knowledge The following is an excerpt from a Short Cut published by one of the Pearson Education imprints. Short Cuts are short, concise, PDF documents designed specifically
More informationIP Protocols. ALTTC/Oct
IP Protocols Internet or IP technology over the years has emerged as the most prominent data communication technology. TCP/IP protocol has become de-facto data comm standard throughout the world. It can
More informationCourse Routing Classification Properties Routing Protocols 1/39
Course 8 3. Routing Classification Properties Routing Protocols 1/39 Routing Algorithms Types Static versus dynamic Single-path versus multipath Flat versus hierarchical Host-intelligent versus router-intelligent
More informationSmall additions by Dr. Enis Karaarslan, Purdue - Aaron Jarvis (Network Engineer)
Routing Basics 1 Small additions by Dr. Enis Karaarslan, 2014 Purdue - Aaron Jarvis (Network Engineer) Routing Concepts IPv4 Routing Forwarding Some definitions Policy options Routing Protocols 3 IPv4
More informationExam : : Building Scalable Cisco Internetworks (BSCI) Title. Ver :
Exam : 642-801 Title : Building Scalable Cisco Internetworks (BSCI) Ver : 03-22-05 QUESTION 1 A packet that needs to be forwarded arrives on an interface of a router. In order for a router to route data,
More informationBasic IP Routing. Finding Feature Information. Information About Basic IP Routing. Variable-Length Subnet Masks
This module describes how to configure basic IP routing. The Internet Protocol (IP) is a network layer (Layer 3) protocol that contains addressing information and some control information that enables
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 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 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 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 informationNetwork Technologies. Unit 5, Chapter 8 Switching and Routing. Cisco Learning Institute Network+ Fundamentals and Certification
Network Technologies Unit 5, Chapter 8 Switching and Routing Cisco Learning Institute Network+ Fundamentals and Certification Copyright 2005 by Pearson Education, Inc. Upper Saddle River, New Jersey 07458
More informationCS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017
CS 43: Computer Networks Internet Routing Kevin Webb Swarthmore College November 16, 2017 1 Hierarchical routing Our routing study thus far - idealization all routers identical network flat not true in
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 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 informationRIPv2. Routing Protocols and Concepts Chapter 7. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved. Cisco Public
RIPv2 Routing Protocols and Concepts Chapter 7 1 Objectives Encounter and describe the limitations of RIPv1 s limitations. Apply the basic Routing Information Protocol Version 2 (RIPv2) configuration commands
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 informationCOMPARATIVE ANALYSIS OF ROUTING PROTOCOLS
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS S.Kokila, Assistant Professor, Department of Computer Science, A.V.P College of Arts and Science, Tiruppur, Tamilnadu, India. G.Pramela, Assistant Professor, Department
More informationNetwork Layer: Routing
Network Layer: Routing The Problem A B R 1 R 2 R 4 R 3 Goal: for each destination, compute next hop 1 Lecture 9 2 Basic Assumptions Trivial solution: Flooding Dynamic environment: links and routers unreliable:
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 informationOverview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load
Dynamic Routing Overview Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph C
More informationConfiguring IP Unicast Routing
28 CHAPTER This chapter describes how to configure IP unicast routing on the Catalyst 3750 Metro switch. Note For more detailed IP unicast configuration information, refer to the Cisco IOS IP and IP Routing
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 informationLecture 19: Network Layer Routing in the Internet
Lecture 19: Network Layer Routing in the Internet COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F
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 informationRouting Overview for Firepower Threat Defense
Path Determination This chapter describes underlying concepts of how routing behaves within the Cisco Firepower Threat Defense, and the routing protocols that are supported. Routing is the act of moving
More informationCisco Questions & Answers
Cisco 200-101 Questions & Answers Number: 200-101 Passing Score: 800 Time Limit: 120 min File Version: 23.7 http://www.gratisexam.com/ Cisco 200-101 Questions & Answers Exam Name: Interconnecting Cisco
More informationOverview 4.2: Routing
Overview 4.2: Routing Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph A 6 1
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 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 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 informationCCNA EXPLORATION V4.0 ROUTING PROTOCOLS AND CONCEPTS ACCESSIBLE INSTRUCTOR MATERIALS POWERPOINT OBJECTIVES
CCNA EXPLORATION V4.0 ROUTING PROTOCOLS AND CONCEPTS ACCESSIBLE INSTRUCTOR MATERIALS Prepared by Cisco Learning Institute June 23, 2008 Chapter 1 Introduction to Routing and Packet Forwarding Objectives
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 informationIP Routing Tecnologie e Protocolli per Internet II rev 1
IP Routing Tecnologie e Protocolli per Internet II rev 1 Andrea Detti Electronic Engineering dept. E-mail: andrea.detti@uniroma2.it Some sources: Cisco CCNA Routing and Switching ICND1 and ICND2 Slide
More informationSymbols. Numerics I N D E X
I N D E X Symbols? (question mark), CLI help system, 126 Numerics A 2-router BGP topology, configuring, 279 284 4-router BGP topology, configuring, 266, 276 279 ABRs (area border routers), 9, 87, 95, 141
More informationBGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Daniel Zappala CS 460 Computer Networking Brigham Young University 2/20 Scaling Routing for the Internet scale 200 million destinations - can t store all destinations or all prefixes in routing tables
More information9 Routing Introduction
9 Routing Introduction CERTIFICATION OBJECTIVES 9.01 Types of Routes 9.02 Static Routes 9.03 Router on a Stick 9.04 Dynamic Routing Protocols 9.05 Problems with Distance Vector Protocols Two-Minute Drill
More informationCSC458 Lecture 6. Administrivia. Inter-domain Routing IP Addressing. Midterm will Cover Following Topics (2) Midterm will Cover Following Topics
CSC458 Lecture 6 Inter-domain Routing IP Addressing Administrivia Homework: #2 due today #3 out today, due in two weeks (same date as midterm) No lecture next week Reading Week Midterm in two weeks 60
More informationABR (Area Border Router), 206, 216 access, dedicated networks, 23 access layer, three-layer hierarchical design model, 6
1358_fmi.book Page 460 Thursday, May 27, 2004 2:21 PM A ABR (Area Border Router), 206, 216 access, dedicated networks, 23 access layer, three-layer hierarchical design model, 6 access lists, scalable networks,
More informationConfiguring IP Unicast Routing
CHAPTER 39 This chapter describes how to configure IP Version 4 (IPv4) unicast routing on the switch. Unless otherwise noted, the term switch refers to a standalone switch and to a switch stack. A switch
More informationCCNA 3 (v v6.0) Chapter 5 Exam Answers % Full
CCNA 3 (v5.0.3 + v6.0) Chapter 5 Exam Answers 2017 100% Full ccnav6.com /ccna-3-v5-0-3-v6-0-chapter-5-exam-answers-2017-100-full.html CCNA Exam Answers 2017 CCNA 3 (v5.0.3 + v6.0) Chapter 5 Exam Answers
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 informationCCNP 1: Advanced Routing
Scope and Sequence CCNP 1: Advanced Routing Cisco Networking Academy Program Version 3.1 TABLE OF CONTENTS CCNP 1: ADVANCED ROUTING...1 TARGET AUDIENCE...3 PREREQUISITES...3 COURSE DESCRIPTION...3 COURSE
More informationIntroduction to IP Routing. Geoff Huston
Introduction to IP Routing Geoff Huston Routing How do packets get from A to B in the Internet? A Internet B Connectionless Forwarding Each router (switch) makes a LOCAL decision to forward the packet
More informationRouting Protocols- Dynamic Routing
Routing Protocols- Dynamic Routing Packet routing in the Internet is divided into two general groups Interior and Exterior Routing. Interior routing with (IGP s) Interior Gateway protocols happens inside
More informationINTERNET PROTOCOLS NETWORK ASSIGNEMENT. Alexander Havbo Steen ITT 2015 ERHVERVSAKADEMI DANIA
INTERNET PROTOCOLS NETWORK ASSIGNEMENT Alexander Havbo Steen ERHVERVSAKADEMI DANIA Table of contents Introduction to routing... 2 Sooo Which router should I get?... 2 Introduction to routing protocols...
More informationChapter 5. RIP Version 1 (RIPv1) CCNA2-1 Chapter 5
Chapter 5 RIP Version 1 (RIPv1) CCNA2-1 Chapter 5 RIP Version 1 RIPv1: Distance Vector, Classful Routing Protocol CCNA2-2 Chapter 5 Background and Perspective RIP evolved from the Xerox Network System
More informationA study of WAN design, routing protocols and connectivity between Head office to Branch office
A study of WAN design, routing protocols and connectivity between Head office to Branch office Dr. Anil Kumar Singh ABSTRACT Jagran Institute of Management, 620-W Block Saket Nagar, Kanpur 3.LAB SETUP
More informationIP Routing Volume Organization
IP Routing Volume Organization Manual Version 20091105-C-1.03 Product Version Release 6300 series Organization The IP Routing Volume is organized as follows: Features IP Routing Overview Static Routing
More informationEXAM CERTIFICATION MAPPING
EAM CERTIFICATION MAPPING CCNA 3: SWITCHING BASICS AND INTERMEDIATE ROUTING 1 EAM MAPPING AND EAM TOPICS/AREAS 2 CCNA 3 Certification Exam Mappings Mapping of Cisco Academy CCNA 3 to the One exam certification
More informationCSE 473 Introduction to Computer Networks. Final Exam. Your Name: 12/17/2014 PLEASE WRITE LEGIBLY NO POINTS FOR ILLEGIBLE ANSWERS
CSE 47 Introduction to Computer Networks Roch Guérin Final Exam Your Name: 12/17/2014 PLEASE WRITE LEGIBLY NO POINTS FOR ILLEGIBLE ANSWERS 1. [10 points] Bob has been provided with the following pair of
More information