Routing Information Protocol
|
|
|
- Austen Jennings
- 5 years ago
- Views:
Transcription
1 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) Routing Information Protocol Friday, November 23, / 40
2 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
3 RIP version 1 Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
4 RIP version 1 Origin and application Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
5 RIP version 1 Origin and application RIP version 1 RFC 1058 Charles Hedrick, Rutgers University, 1988 Based on the (distributed) Bellman-Ford distance vector algorithm Also used as the first ARPANET routing protocol Many implementations were already present differing in details (timers, ) available before the specification itself GWINFO from Xerox PARC routed from BSD 4.2 Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
6 RIP version 1 Origin and application RIP application Inside homogeneous networks with a moderate size An interior routing protocol (IGP) Maximum diameter is 15 hops Based on a uniform cost (weight) of 1 Hence in this case = 16 Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
7 RIP version 1 Basic RIPv1 operation Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
8 RIP version 1 Basic RIPv1 operation Basic operation Keep a table of routes to destination networks with distance (metric), gateway (next hop) Periodically send out a complete table to all neighbours Send all destination networks with distances Do not send the gateways Update your table with newly collected information The distance can only decrease (become better) unless the information comes from the gateway itself, thereby overriding the old information which only occurs if the topology changes or links fail or come up Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
9 RIP version 1 Basic RIPv1 operation Split horizon (with poisoned reverse) Split horizon Do not advertize back routes you learned from your neighbour to the network you both are on Poisoned reverse Do advertise routes back but with distance which indicates unreachability explicitly Advantage is the faster convergence in case topology changes for instance when routers point to each other Disadvantage is the larger routing update packets Therefore implementation is optional or configurable Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
10 RIP version 1 Basic RIPv1 operation Timers Update timer: updates are sent every 30 seconds (default) Invalid timer: routes time out after 180 seconds (default) Called timeout in RFC 1058 Flush timer: routes disappear after 240 seconds (default) Called garbage-collection timer in RFC 1058 with a default value of 120 seconds after timeout Unreachable networks are included in updates until the flush timer expires them and they are eliminated from the routing table Infinity = = 16 Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
11 RIP version 1 Basic RIPv1 operation Timers (later additions) Triggered updates An update is being sent as soon as a route changes Hold-down timer (default 180 seconds) This is a later (Cisco) addition, not present in RFCs It exists to prevent incorporating possibly bad routing information which might be present in a network that didn t converge yet The semantics is not completely clear (not standardized) Essentially do not accept updates during hold-down on routes that have been marked unreachable Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
12 RIP version 1 RIPv1 packets Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
13 RIP version 1 RIPv1 packets RIP version 1 packets Packets are broadcast to or to a directed broadcast address or to an individual host or router as a response to a request Works on top of UDP and uses 520 as its well-known port The maximum size of this UDP packet is 512 bytes, including the 8 bytes long UDP header There is room for 25 route updates Each update needs 20 bytes Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
14 RIP version 1 RIPv1 packets RIPv1 packet format Command Version Reserved (must be 0) Address Family Identifier Reserved (must be 0) IP Address (network) Reserved (must be 0) Metric Repeated maximally 25 times Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
15 RIP version 1 RIPv1 packets RIPv1 packet fields RIPv1 fields Command Request(1) or Response(2) Version 1 AFI IP(2) IP Address Destination Network Metric Distance (max 16= ) Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
16 RIP version 1 RIP version 1 and subnetting Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
17 RIP version 1 RIP version 1 and subnetting Subnets RIPv1 supports fixed length, one level deep, subnet masks RIPv1 uses heuristics to derive the uniform subnet mask in use throughout the whole subnetted network from its own directly connected subnets RIPv1 differentiates between neighbours for updates about subnets being part of that same subnetted network being part of another network Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
18 Protocol extensions Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
19 Protocol extensions IGRP Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
20 Protocol extensions IGRP IGRP (1) IGRP stands for Interior Gateway Routing Protocol IGRP is a Cisco proprietary protocol IGRP is just like RIP a distance vector protocol The basics are the same as with RIP It runs directly on top of IP (protocol 9) It has a larger notion of, typically 100, maximum 255 It accepts up to four parallel paths which Cisco also used in its RIP implementation, deviating from the official specification Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
21 Protocol extensions IGRP IGRP (2) Division into independent domains is possible which are called (confusingly) autonomous systems connected together with static (or redistributed) routes Uses three types of network routes Interior route (with implicit subnet information, like in RIPv1) System route (which is possibly summarized) Exterior route (acting as a configured candidate default) Support for multiple default routes using fictitious network numbers contrary to RIP that only (optionally) includes Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
22 Protocol extensions IGRP IGRP (3) RIP The only metric is the hop count IGRP The metric is composite, based on Delay, Bandwidth, Reliability and Load The hop count is still communicated as a separate field to see when has been reached MTU information about the path is also communicated Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
23 Protocol extensions EIGRP Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
24 Protocol extensions EIGRP EIGRP (1) EIGRP stands for Enhanced Interior Gateway Routing Protocol EIGRP is still a Cisco proprietary protocol but also specified in RFC 7868 for informational purposes It runs directly on top of IP (protocol 88) Remembers all paths, not only the best path It carries explicit subnet information (VLSM) It keeps state about its neighbours It can take the MTU into account Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
25 Protocol extensions EIGRP EIGRP (2) It uses the DUAL (Diffusing Update Algorithm) algorithm for loop free routing and fast convergence It uses no regular (periodic) routing table updates Uses partial and incremental updates when the routing table changes It uses hello multicast packets ( ) to discover neighbours It forms adjacencies with neighbours It uses ack(nowledgement)s for reliable communication It can summarize on arbitrary bit boundaries (classless) Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
26 Protocol extensions EIGRP EIGRP (3) Use of DUAL Complicated algorithm, remotely similar to the propose and agree mechanism for Rapid Spanning Tree Suppose S-M-T is a path from S to T via neighbour M Suppose the link cost for S-M is c Suppose the path cost for M-T is p When is it safe (with respect to loop avoidance) to switch to a backup path via neighbour N when the link S-M fails? Say the link cost for S-N is d and the path cost for N-T is q Answer: q c + p (feasible successor condition) Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
27 RIP version 2 Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
28 RIP version 2 Extensions with respect to version 1 Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
29 RIP version 2 Extensions with respect to version 1 RIP version 2 Specified in RFC 2453 Gary Malkin, Bay Networks, 1998 It has extensions for Subnet masks Alternate next hop Authentication Multicasting Route tags Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
30 RIP version 2 Extensions with respect to version 1 RIPv2 packet format Command Version Reserved (must be 0) Address Family Identifier Route Tag IP Address (network) Subnet Mask Next Hop Metric Repeated maximally 25 times Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
31 RIP version 2 Extensions with respect to version 1 RIPv2 packet fields RIPv2 fields Command Request(1) or Response(2) Version 2 AFI IP(2) Route Tag Identification of route origin IP Address Destination Network Subnet Mask CIDR support Next Hop Gateway (if different from advertising router) Metric Distance (max 16= ) Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
32 RIP version 2 Extensions with respect to version 1 authentication data is added as a trailer to the RIP data Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40 First-routing-entry-as-authentication hack Address Family Identifier (=0xFFFF) Authentication Type Authentication Authentication type 2 means use of a plaintext password Authentication type 3 (RFC 4822) means use of Keyed-MD5 or HMAC-SHA-{1,256,384,512} where extended
33 RIP version 2 Summary of changes with respect to version 1 Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
34 RIP version 2 Summary of changes with respect to version 1 Summary of changes (1) Authentication fields First AFI is 0xFFFF Type 2: simple password of length 16 bytes Type 3: key id, sequence number and length and offset of a variable length authentication trailer Route tag field This is simply carried along It differentiates between internally and externally generated routes Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
35 RIP version 2 Summary of changes with respect to version 1 Summary of changes (2) Subnet mask field net/subnet/host route differentiation Next Hop field Used when best next hop does not speak RIP itself Multicast (not a field) replaces broadcast The destination of updates is (which is not forwarded) Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
36 Next Hop scenario Network A B E F A and B speak RIP internally. E and F speak some other protocol over the external network. E can speak RIP to A and B on behalf of F, setting the Next Hop to F as appropriate.
37 RIP Next Generation and RIP variants Outline 1 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting 2 Protocol extensions IGRP EIGRP 3 RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 4 RIP Next Generation and RIP variants Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
38 RIP Next Generation and RIP variants RIPng (for IPv6) Specified in RFC 2080 It still runs over UDP It uses port number 521 Packets can be any length that fits inside the network unfragmented Supports IPv6 prefix, route tags, next hop No authentication (which can be done at the IP level) It uses FF02::9, the all-rip-routers multicast address Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
39 RIP Next Generation and RIP variants RIPng packet format Command Version Reserved (must be 0) IPv6 Prefix Route Tag Prefix Length Metric As many as can fit in a packet unfragmented Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
40 RIP Next Generation and RIP variants RTE-with-big-metric-as-next-hop hack Next Hop 0x0000 0x00 Metric(=0xFF) The next hop must be a link local address Using :: as next hop means use originator as next hop Next Hop remains valid until next next-hop-rte Karst Koymans (UvA) Routing Information Protocol Friday, November 23, / 40
Routing 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
Routing 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
Routing 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
Routing 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
RIP 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
TDC 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
Basic 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:
Distance 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
Routing 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:
Routing Protocols Classification
Routing Protocols Classification Petr Grygárek rek 1 Classification criteria Internal (IGP) / External (EGP) number of handled routes possibilities of routing politics specification Convergence Time Distance-vector
RIP 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
CHAPTER 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
Distance 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
Internet 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
Chapter 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
SEMESTER 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?
Chapter 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
EECS 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
Default & 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.
Introduction 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
Configuring RIP. RIP Configuration Task List
Configuring RIP This chapter describes how to configure RIP. For a complete description of the RIP commands that appear in this chapter, refer to the RIP s chapter of the Network Protocols Reference, Part
Chapter 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,
Operation 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...
Table 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
Chapter 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
Determining IP Routes. 2000, Cisco Systems, Inc. 9-1
Determining IP Routes, Cisco Systems, Inc. 9- Objectives Upon completion of this chapter, you will be able to complete the following tasks: Distinguish the use and operation of static and dynamic routes
9.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
IP 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
Introduction 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
Part 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
Routing 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
Configuring RIP. Information About RIP CHAPTER
CHAPTER 23 This chapter describes how to configure the ASASM to route data, perform authentication, and redistribute routing information using the Routing Information Protocol (RIP). This chapter includes
BTEC 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
Top-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
EIGRP. Routing Protocols and Concepts Chapter 9. Video Frank Schneemann, MS EdTech
Video Frank Schneemann, MS EdTech EIGRP Routing Protocols and Concepts Chapter 9 ITE PC v4.0 Chapter 1 2007 Cisco Systems, Inc. All rights reserved. Cisco Public 1 9.0.1 Introduction Enhanced Interior
The 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
Section 6. Implementing EIGRP ICND2
ICND2 Section 6 Implementing EIGRP Enhanced Interior Gateway Routing Protocol (EIGRP) was introduced in Cisco IOS Release 9.21 as an enhancement to the limitations of IGRP. IGRP was developed by Cisco
Unit 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
shortcut 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
Routing 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
Building 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,
Network 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
COMPARATIVE 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
Routing. Basic principles. Karst Koymans. Informatics Institute University of Amsterdam. (version 16.4, 2017/02/23 10:58:58)
Routing Basic principles Karst Koymans Informatics Institute University of Amsterdam (version 16.4, 2017/02/23 10:58:58) Friday, February 24, 2017 Karst Koymans (UvA) Routing Friday, February 24, 2017
Network 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
Configuring EIGRP. Finding Feature Information
The Enhanced Interior Gateway Routing Protocol (EIGRP) is an enhanced version of the Interior Gateway Routing Protocol (IGRP) developed by Cisco. The convergence properties and the operating efficiency
Chapter 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
RFC Compliance Test Report. Release 3.0
.2 Type FRR FRR FRR FRR FRR FRR Commit ID 3e71b5d 5cf0c43 f633dc2 6289215 36a7e78 30283fd Commit Date 2017-04-02 2017-10-14 2017-11-08 2017-11-08 2017-11-08 ANVL-RIP-1.1 RFC 2453 s3.6 p20 Message Format
Configuring EIGRP. Overview CHAPTER
CHAPTER 24 This chapter describes how to configure the adaptive security appliance to route data, perform authentication, and redistribute routing information, using the Enhanced Interior Gateway Routing
Keywords RIP, OSPF, IGP, EGP, AS, LSA
Volume 4, Issue 2, February 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Evolution of
Draft Manuscript Draft M. Manuscript Draft Ma. t Manuscript Draft Manu. ipt Draft Manuscript Dra. anuscript Draft Manuscri
M aft Ma CHAPTER 5 ript Dra RIP Version 1 Objectives aft Ma Upon completion of this chapter, you should be able to answer the following questions: What are the functions, characteristics, and operation
Table of Contents. Cisco Introduction to EIGRP
Table of Contents Introduction to EIGRP...1 Introduction...1 Before You Begin...1 Conventions...1 Prerequisites...1 Components Used...1 What is IGRP?...2 What is EIGRP?...2 How Does EIGRP Work?...2 EIGRP
RIPv2. 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
Claim desired outcome
Assessment Authoring - Table of Specification (TOS) The Table of Specification (TOS) is a high-level design template for a given assessment. It identifies the claims, components skills, targeted number
Routing 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
Exam : : 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,
A 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
EIGRP. About EIGRP. CLI Book 1: Cisco ASA Series General Operations CLI Configuration Guide, 9.7 1
This chapter describes how to configure the Cisco ASA to route data, perform authentication, and redistribute routing information using the Enhanced Interior Gateway Routing Protocol (). About, page 1
CIS 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
HP FlexFabric 5700 Switch Series
HP FlexFabric 5700 Switch Series Layer 3 - IP Routing Configuration Guide Part number: 5998-6688 Software version: Release 2416 Document version: 6W100-20150130 Legal and notice information Copyright 2015
Redesde Computadores(RCOMP)
Redesde Computadores(RCOMP) Lecture 06 2016/2017 IPv4 routeing. Static routeing and dynamic routeing. Routeing protocols: RIP, RIPv2, EIGRP and OSPF. Autonomous systems and route redistribution Instituto
IP Enhanced IGRP Commands
IP Enhanced IGRP Commands Use the commands in this chapter to configure and monitor IP Enhanced IGRP. For configuration information and examples, refer to the Configuring IP Enhanced IGRP chapter of the
Link 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
CS118 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
Allows IGRP or Enhanced IGRP exterior routes to be advertised in updates.
IGRP Commands Use the commands in this chapter to configure and monitor Internet Gateway Routing Protocol (IGRP). For IGRP configuration information and examples, refer to the Configuring IGRP chapter
CCNA EXPLORATION V4.0 ROUTING PROTOCOLS AND CONCEPTS
CCNA EXPLORATION V4.0 ACCESSIBLE INSTRUCTOR MATERIALS COMPARISON OF NEW CURRICULA WITH EXISTING CURRICULA Prepared by Cisco Learning Institute June 23, 2008 Routing Protocols and Concepts Summary New CCNA
Introduction 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
Configuring IGRP. The Cisco IGRP Implementation
Configuring IGRP This chapter describes how to configure the Interior Gateway Routing Protocol (IGRP). For a complete description of the IGRP commands in this chapter, refer to the IGRP s chapter of the
Routing with a distance vector protocol - EIGRP
Routing with a distance vector protocol - EIGRP Introducing Routing and Switching in the Enterprise Chapter 5.2 Copyleft 2012 Vincenzo Bruno (www.vincenzobruno.it) Released under Crative Commons License
2008 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,
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
Configuring Networking Protocols
11 CHAPTER This chapter describes how to configure the ML-Series card for supported IP routing protocols. It is intended to provide enough information for a network administrator to get the protocols up
ITE PC v4.0. Chapter Cisco Systems, Inc. All rights reserved. Cisco Public
EIGRP Routing Protocols and Concepts Chapter 9 1 Objectives Describe the background and history of Enhanced Interior Gateway Routing Protocol (EIGRP). Examine the basic EIGRP configuration commands and
Routing Protocol Type Primarily IGP or EGP RIP Distance-Vector IGP EIGRP OSPF IS-IS BGP
Appendix D Memory Tables Chapter 1 Table 1-2 Routing Protocol Characteristics Routing Protocol Type Primarily IGP or EGP RIP Distance-Vector IGP EIGRP OSPF IS-IS BGP Chapter 3 Table 3-2 Hexadecimal/Binary
Routing 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?
Comparative 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
Last 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
FiberstoreOS IP Routing Configuration Guide
FiberstoreOS IP Routing Configuration Guide Contents 1 Configuring IP Unicast-Routing... 6 1.1 Overview...6 1.2 Topology... 6 1.3 Configuration... 6 1.4 Validation... 8 2 Configuring RIP... 10 2.1 Overview...10
Network Working Group Request for Comments: 2080 Category: Standards Track Ipsilon Networks January 1997
Network Working Group Request for Comments: 2080 Category: Standards Track G. Malkin Xylogics R. Minnear Ipsilon Networks January 1997 RIPng for IPv6 Status of this Memo This document specifies an Internet
CCNA 3 (v v6.0) Chapter 7 Exam Answers % Full
CCNA 3 (v5.0.3 + v6.0) Chapter 7 Exam Answers 2017 100% Full ccnav6.com /ccna-3-v5-0-3-v6-0-chapter-7-exam-answers-2017-100-full.html CCNA Exam Answers 2017 CCNA 3 (v5.0.3 + v6.0) Chapter 7 Exam Answers
EIGRP 04/01/2008. Routing Protocols and Concepts Chapter 9 Modified by Tony Chen
EIGRP Routing Protocols and Concepts Chapter 9 Modified by Tony Chen 04/01/2008 1 Introduction 2 EIGRP Roots of EIGRP: IGRP -Developed in 1985 to overcome RIPv1 s limited hop count -Distance vector routing
Lecture 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
IP 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
Link 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
Chapter 5. RIP Version 1 (RIPv1)
Chapter 5 RIP Version 1 (RIPv1) CCNA2-1 Chapter 5 Note for Instructors These presentations are the result of a collaboration among the instructors at St. Clair College in Windsor, Ontario. Thanks must
(Refer Slide Time: 01:08 to 01:25min)
COMPUTER NETWORKS Prof. Sujoy Ghosh Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture-27 RIP- Distance Vector Routing We have seen basic routing. Now we will
EIGRP. Finding Feature Information
The Enhanced Interior Gateway Routing Protocol () is an enhanced version of the Interior Gateway Routing Protocol (IGRP) developed by Cisco. The convergence properties and the operating efficiency of have
Chapter 4: VLSM and Classless Inter Domain Routing. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved.
Chapter 4: VLSM and Classless Inter Domain Routing 1 What will we Learn from chapter 4? Compare and contrast classful and classless IP addressing. Review VLSM and explain the benefits of classless IP addressing.
Why 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
Routing, 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
Chapter 6 Reading Organizer
Name Date Chapter 6 Reading Organizer After completion of this chapter, you should be able to: Describe and plan a network using OSPF Design and configure a network using single-area OSPF Work with multi-protocol
8. Refer to the exhibit. The ORL router is unable to form a neighbor relationship with the JAX router. What is a possible cause of this problem?
1. Refer to the exhibit. A new PC was deployed in the Sales network. It was given the host address of 192.168.10.31 with a default gateway of 192.168.10.17. The PC is not communicating with the network
RIP Commands. output-delay, page 32 passive-interface (RIP), page 33 poison-reverse, page 35 receive version, page 37 redistribute (RIP), page 39
RIP Commands This module describes the commands used to configure and monitor the Routing Information Protocol (RIP). For detailed information about RIP concepts, configuration tasks, and examples, see
Network Working Group. Obsoletes: 1723, 1388 November 1998 STD: 56 Category: Standards Track
Network Working Group G. Malkin Request for Comments: 2453 Bay Networks Obsoletes: 1723, 1388 November 1998 STD: 56 Category: Standards Track Status of this Memo RIP Version 2 This document specifies an
ICS 351: Today's plan. netmask exercises network and subnetwork design dynamic routing RIP distance-vector routing
ICS 351: Today's plan netmask exercises network and subnetwork design dynamic routing RIP distance-vector routing Netmask exercises how many bits in this netmask: 255.128.0.0 using this netmask and the
Antonio Cianfrani. Routing Protocols
Antonio Cianfrani Routing Protocols Routing protocols A routing protocol provides a communication channel among routers to exchange reachability information about networks Routing tables are properly configured
Chapter 9. Enhanced Interior Gateway Routing Protocol (EIGRP) Part I
Chapter 9 Enhanced Interior Gateway Routing Protocol (EIGRP) Part I CCNA2-1 Chapter 9-2 Note for Instructors These presentations are the result of a collaboration among the instructors at St. Clair College
Chapter 4: Manipulating Routing
: Manipulating Routing Updates CCNP ROUTE: Implementing IP Routing ROUTE v6 1 Objectives Describe network performance issues and ways to control routing updates and traffic (3). Describe the purpose of
CompSci 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
FiberstoreOS IP Routing Configuration Guide
FiberstoreOS IP Routing Configuration Guide Contents 1 Configuring IP Unicast-Routing... 1 1.1 Overview... 1 1.2 Topology...1 1.3 Configuration... 2 1.4 Validation... 3 2 Configuring RIP...5 2.1 Overview...