Link State Routing. Link State Packets. Link State Protocol. Link State Protocols Basic ideas Problems and pitfalls
|
|
- Clinton Pope
- 6 years ago
- Views:
Transcription
1 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 pitfalls OSPF Rationale Parameters Databases Network representation and architecture OSPF packet details OSPF packet header The different types of OSPF packets Link State Advertisement packets OSPF for IPv6 Link State Protocol Link State Packets A Link State Protocol Builds on complete information about the network topology Uses Dijkstra s Single Source Shortest Path Tree algorithm Replaces a distance vector protocol in the case of more complex topologies Has a faster convergence time than distance vector protocols Link State Packets (LSPs) represent the state of a router and its links to the rest of the network This representation would suffice for point to point links Broadcast networks (LANs) and NBMA networks are represented by virtual nodes inside the topology Designated routers (DRs) speak on their behalf
2 Non-broadcast networks Learn to know your neighbours NBMA Non-Broadcast Multiple Access Full mesh of connectivity, but not all at once in one packet Topological connectivity via elected DR Point-to-Multipoint A subset of the collection of all point-to-point links No full mesh of connectivity Considered as multiple instances of point-to-point links Hence no DR is elected Easy on point to point links Just send out greetings (hello packets) Both ends will become adjacent A little more advanced on broadcast networks Send out hello packets using multicast Not all neighbours will become adjacent Only those that are neighbors in the virtual topology One of the adjacent routers is always a DR LSP generation LSP distribution Periodic announcements with a long period (like 30 minutes) Very much different from RIP (30 seconds) Triggered updates are sent as soon as there are changes Detection of a new neighbour (link or node coming up) Detection of a link or node failure Change of link cost LSPs are distributed throughout the network Distribution can t use the routing database for distant nodes Why? What is the difference with RIP here? Ordinary flooding is problematic..., why? It would need a TTL to prevent loops It could cause exponential multiplication of packets Smart flooding recognizes identical LSPs Causing propagation to be tree-like
3 Most recent LSP problem Pitfalls LSPs may arrive out of order Therefore we need a mechanism to recognize older packets What mechanisms are available for this recognition? What about using timestamps? Timestamps cause trouble if clocks are not synchronised or out of order! What about using sequence numbers? Sequence numbers need an ageing procedure to protect from stale information for instance when a router reboots and starts from scratch Sequence numbers may wrap Sequence number ordering is not a total ordering, not even a partial ordering a < b < c < d < e < f < g < h < a Intermezzo ARPANET lockup (real historic event 1 ) Suppose we have sequence numbers a, b, c with a < b < c < a The devilish dice There are three dice, A, B and C such that A is better than B B is better than C C is better than A A: B: C: Why didn t ageing do its job? 1 According to Radia Perlman in the Interconnections book
4 Lockup solution OSPF advantages (1) Use an age (or ttl) field which will be increased (or decreased) periodically and always increase the age (decrease the ttl) by at least one when passing the LSP on Forgetting this was the main problem in the total ARPANET lockup Use a very large sequence number space and wait for timeouts after overflow while reflooding LSPs with maximum age Causing those to time out prematurely OSPF Introduces hierarchical routing Supports subnets Uses efficient multicast for flooding Supports point-to-point, broadcast, NBMA and point-to-multipoint networks Uses metrics built on cost, per interface OSPF advantages (2) OSPF fun :) OSPF Supports virtual links for backbone connectivity Supports load balancing Supports unnumbered interfaces/networks Has built in authentication IETF T-shirt IS IS = 0 The old time IETF versus ISO controversy But OSPF in fact really builds on BBN s research on SPF Early versions of OSI s IS-IS
5 Some OSPF facts Timers and Overflow OSPF builds directly upon IP (not on UDP) OSPF uses protocol type 89 Current OSPF version is 2 RFC 2328 (Moy, 1998) RFC 2740 (OSPF for IPv6, 1999) version 3 Obsoleted by RFC 5340 (2008) OSPF uses LSA (Link State Advertisement) terminology instead of LSP (Link State Packet) These must be the same for all OSPF neighbours Otherwise the neighbours won t talk at all HelloInterval (default 10 sec) RouterDeadInterval (default 40 sec) In the case of a database overflow external routing information is dropped first Consistent LSA Databases (Backup) Designated Router LSAs must be acknowledged LSAs (and their acks) are queued/flagged for transmission LSAs must time out at about the same time by using triggered (re)distribution of age MaxAge packets for LSAs with an existing sequence number which must be honored only if there is already an LSA for this node in the local database A Designated Router (DR) and a Backup Designated Router (BDR) is elected on every multi-access network using Hello packets The (B)DR represents the network as a virtual node in the graph and acts on the network s behalf The DR/BDR election process is sticky This is one of the main differences with IS-IS The priority of routers can be configured
6 Multicast usage Hierarchical routing On LANs every router becomes adjacent to the Designated Router Area 0 is the backbone area Limbs (non-backbone) are all other areas, not equal to 0 Multicast 2 to AllDRouters ( ) Multicast 2 to AllSPFRouters ( ) There is also a unicast Ack from the DR back to R 2 OSPFv3 for IPv6 uses FF02::6 and FF02::5 Virtual Links Inter Area Summary (IAS) Area 5 is not physically connected to the backbone A virtual link extends the backbone to the new ABR and behaves as an unnumbered point to point link IASs are injected by ABRs IASs make use of a hub and spoke topology Summary information is spread RIP-like There are no loops or slow convergence Virtual links maintain the hub and spoke topology These virtual spokes are in fact paths through their transit area treated as unnumbered links in the backbone
7 Router roles Area Border Router (ABR) Backbone router Has at least one interface inside area 0 Internal router All interfaces are completely within a single area (backbone or otherwise) Area Border Router (ABR) Has an interface inside area 0 and one or more other areas Autonomous System Boundary Router (ASBR) Participates in another (external) routing protocol Attaches to multiple areas Runs multiple copies of the basic algorithm One copy for each area Summarizes area data (destination networks) towards the backbone Receives summarized data from the backbone about other areas including the backbone itself Can aggregate summary data Autonomous System Boundary Router (ASBR) Stub(by) area Can be part of any area Interfaces with other routing protocols BGP, RIP, IS-IS, OSPF,... Injects external routes into OSPF ASBR notion is independent of backbone, internal or ABR router A stub(by) area is an area into which no external routing information is injected by the ABRs It uses a default route for all external destinations The default route is injected by all ABRs A totally stubby area is a stubby area into which not even inter-area summaries are injected A not so stubby area is a stubby area inside which certain external information is originated and flooded locally
8 OSPF packet header (24 bytes) OSPF packet header fields Version Type Packet length Router ID Area ID Checksum AuType Authentication OSPF packet header fields Version 2 Type 1 5 (see next slide) Packet length Total length, including this header Router ID ID of packet sending router Area ID The area a packet belongs to (is destined for) Checksum One s complement checksum AuType Null, Simple or Crypto Authentication Pointer to message digest (Crypto) OSPF packet types OSPF Hello packet (20 + N 4 bytes) OSPF packet types Type Meaning 1 Hello 2 Database Description 3 Link State Request 4 Link State Update 3 5 Link State Acknowledgement Network Mask HelloInterval Options Rtr Pri RouterDeadInterval Designated Router Backup Designated Router Neighbor #1. Neighbor #N Repeated for each neighbor that is alive 3 These contain the Link State Advertisements 4 Don t confuse these with LSAs
9 OSPF Hello packet fields OSPF DD packet (8 + N 20 bytes) Hello fields Network Mask HelloInterval Options Rtr Pri RouterDeadInterval Designated Router Backup Designated Router Neighbor Subnet mask of link Interval in seconds between hello packets Multiple metrics (T 5 ); no stub area (E) Router priority, used for DR election Interval to consider a silent neighbor dead IP address of designated router IP address of backup designated router Living neighbor IDs Interface MTU Options I M M S DD sequence number LSA header #1. LSA header #N Fragment of database with only headers 5 Deprecated because of lack of experience with TOS OSPF DD packet fields OSPF LS request packet (N 12 bytes) DD fields Interface MTU Detection of MTU mismatch Options Same as for Hello packets I Init bit (first packet) M More bit (more packets follow) MS Master/Slave bit DD sequence number Used for recognizing old DD packets LSA header Link state database LSA instance identity LS type Link State ID Advertising Router Multiple occurrences 6 Specific LSA instance, including age and sequence number
10 OSPF LS request packet fields OSPF LS Update packet LS request fields LS type Link State ID Advertising Router Link type of the LSA ID of (link type specific part of) the LSA Router ID of originating router These three fields are part of the LSA header. Note that these request packets do not include an age or sequence number. Together these entries uniquely identify an LSA, but not an LSA instance. The Database Description packets refer to a specific LSA instance, but still without actual data # LSAs (N) LSA #1 LSA #N N occurrences OSPF LS Update packet fields OSPF LS Acknowledgement packet (N 20 bytes) LS Update fields # LSAs Number of LSAs inside the update packet LSA #i A complete Link State Advertisement 0 31 LSA header #1 N occurrences Link State Updates contain complete and specific instances of Link State Advertisements (LSAs) with all relevant data. The LSAs have a variable size, depending on LS type. LSA header #N
11 OSPF LS Acknowledgement packet fields Link State Advertisements LS Acknowledgement fields LSA header #i A complete Link State Advertisement header Link State Acknowledgements again refer to specific instances, but contain no actual data. Multiple LSAs may be found inside a Link State Update packet Every LSA consists of LSA header (20 bytes) LS(A) type specific content LSA header (20 bytes) LSA header fields LSA header fields LS age Options LS type Link State ID Advertising Router LS sequence number LS Checksum Length LS age Options LS type Link State ID Advertising Router LS sequence number LS Checksum Length Time in seconds since the LSA was originated Same as for Hello packets Link type of the LSA (see next slide) ID of (link type specific part of) the LSA Router ID of originating router Used for most recent check of LSA packets The Fletcher checksum of the LSA (without age) Length in bytes of the LSA, including the header
12 LS types NSSA LS types LS Type Meaning 1 Router LSA 2 Network LSA 3 Network Summary LSA 4 AS Boundary Router Summary LSA 5 AS External LSA 7 NSSA LSA (see next slide) NSSA stands for Not So Stubby Area Support for certain external routes throughout the area itself NSSA uses its own special type (7) These LSAs are translated at the ABR into ordinary external LSAs (type 5) for the rest of the OSPF domain It is common to inject a type 7 default route from the NSSA boundary router(s) into the NSSA Topological (1,2), prefix (3,5,7) and mixed (4) information Link State IDs Link State IDs Link State IDs LS Type Link State ID meaning 1 ID of originating router 2 IP address of the network s DR 3 The destination network s prefix 4 ID of described ASBR 5 The destination network s prefix 7 The destination network s prefix Link State IDs LS Type Link State ID meaning 1 ID of originating router 2 IP address of the network s DR 3 The destination network s prefix 4 ID of described ASBR 5 The destination network s prefix 7 The destination network s prefix Router LSA Link State ID Network LSA Link State ID Summary LSA Link State ID External LSA Link State ID Router LSA Link State ID Network LSA Link State ID Summary LSA Link State ID External LSA Link State ID
13 Router LSA (LS type = 1) without header Router LSA fields repeated # Links times V E B 0 # Links Link ID Link Data Type # TOS Metric } TOS 0 TOS metric # TOS times 7 Originated by every router Flooded throughout the area(s) the router belongs to Router LSA fields V Router is virtual link endpoint E Router is AS Boundary Router B Router is Area Border Router # Links Number of router links described Link ID ID of the connected network Link Data Extra information on network Type Type of connected network # TOS Number of extra TOSs (usually 0) Metric Cost of link 7 For backward compatibility (but never really implemented or used) Router LSA type field Router LSA Link ID field Router LSA type field Type Meaning 1 Point-to-point link 2 Transit network 3 Stub network 4 Virtual link Router LSA Link ID field Type Meaning 1 ID of neighbor router 2 IP address of designated router 3 IP (sub)network number 8 4 ID of neighbor router 8 This can also be a host (with a /32 mask in the link data)
14 Router LSA Link Data field Link State IDs Link State IDs Router LSA Link Data field Type Meaning 1 Originating router s interface IP address 2 Originating router s interface IP address 3 Connected (sub)network mask 4 Originating router s interface IP address LS Type Link State ID meaning 1 ID of originating router 2 IP address of the network s DR 3 The destination network s prefix 4 ID of described ASBR 5 The destination network s prefix 7 The destination network s prefix Router LSA Link State ID Network LSA Link State ID Summary LSA Link State ID External LSA Link State ID Network LSA (LS type = 2) without header 4 + N 4 bytes Network LSA fields 0 31 Network Mask Attached Router } Repeated for each attached router Network LSA fields Network Mask (Sub)network mask 9 Attached Router Router ID of router(s) on network Originated by Designated Router Flooded throughout the area 9 Where is the network itself defined?
15 Link State IDs Summary LSA (type = 3, 4) without header Link State IDs LS Type Link State ID meaning 1 ID of originating router 2 IP address of the network s DR 3 The destination network s prefix 4 ID of described ASBR 5 The destination network s prefix 7 The destination network s prefix Router LSA Link State ID Network LSA Link State ID Summary LSA Link State ID External LSA Link State ID Network Mask 10 0 Metric TOS TOS metric Originated by Area Border Router Flooded throughout the area(s) } for each desired TOS 10 Only relevant for type 3 Summary LSA fields Link State IDs Link State IDs Summary LSA fields Network Mask 11 Address mask for the advertised destination Metric Cost to advertised destination LS Type Link State ID meaning 1 ID of originating router 2 IP address of the network s DR 3 The destination network s prefix 4 ID of described ASBR 5 The destination network s prefix 7 The destination network s prefix Router LSA Link State ID Network LSA Link State ID Summary LSA Link State ID External LSA Link State ID 11 Only relevant for type 3
16 AS External LSA (LS type 5) without header AS External LSA fields Network Mask E 0 Metric Forwarding address External Route Tag E TOS TOS metric Forwarding address External Route Tag for each desired TOS AS External LSA fields Network Mask Address mask for the advertised destination E External cost is higher than internal cost Metric Cost to advertised destination Forwarding address Comparable to Next Hop in RIP External Route Tag Comparable to Route Tag in RIP Originated by AS Boundary Router Flooded throughout the whole AS Representation of routers and networks Representation of point to multipoint networks Source: RFC 2328 Source: RFC 2328
17 Example OSPF network from RFC 2328 The directed graph for the example network Source: RFC 2328 Source: RFC 2328 The shortest path tree from router RT6 Router (RT12) and network (N9) LSAs Source: RFC 2328 Source: RFC 2328
18 OSPF for IP version 6 Important changes Also referred to as OSPFv3 Published as RFC 5340 Extensive, incompatible modification of OSPFv2 Therefore needs a new version number (3) Basic functionality is the same Flooding, areas, SPT, DRs,... All addressing semantics moved to LSA payload Works per-link instead of per-subnet Introduces a new link-lsa Introduces explicit flooding scope Link scope, Area scope and AS scope Removes authentication from packet header Authentication uses AH and ESP headers Router and network LSAs LSA renamings Do not contain address information any more Only topological connectivity No IPv6 prefix information Network protocol independent Prefix information on transit and stub networks is inside a new intra-area-prefix-lsa Link-LSAs now distribute Link local addresses of routers IPv6 prefixes used on the link Option announcements for network LSAs Type-3 summary-lsas are now called inter-area-prefix-lsas Type-4 summary LSAs are now called inter-area-router-lsas
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
More informationDD2490 p Link-state routing and OSPF. Olof Hagsand KTH/CSC
DD2490 p4 200 Link-state routing and OSPF Olof Hagsand KTH/CSC Literature RFC 232: Browse through Section. Section 2 gives a very good understanding of OSPF issues. The example is realistic (complex) and
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 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 informationDD2490 p Link-state routing and OSPF. Olof Hagsand KTH/CSC
DD2490 p4 2009 Link-state routing and OSPF Olof Hagsand KTH/CSC Literature RFC 232: Browse through Section. Section 2 gives a very good understanding of OSPF issues. The example is realistic (complex)
More informationDD2490 p Link state routing and OSPF. Olof Hagsand KTH/CSC
DD490 p4 00 Link state routing and OSPF Olof Hagsand KTH/CSC Literature RFC 3: Section except.. Section 3 (areas), but only last two paragraphs of 3.5 Link state routing Each router spreads information
More informationOSPF. Unless otherwise noted, OSPF refers to OSPFv2 throughout this document.
Open Shortest Path First () is a link state based interior gateway protocol developed by the working group of the Internet Engineering Task Force (IETF). At present, version 2 (RFC2328) is used. Introduction
More informationIntroduction to OSPF
Introduction to OSPF ISP/IXP Workshops ISP/IXP Workshops 1999, Cisco Systems, Inc. 1 OSPF Dynamic Routing Protocol Link State technology Runs over IP, protocol 89 Designed by IETF for TCP/IP Supports VLSM
More informationConfiguring OSPF network management 39 Enabling message logging 39 Enabling the advertisement and reception of opaque LSAs 40 Configuring OSPF to
Contents Configuring OSPF 1 Introduction to OSPF 1 Basic concepts 1 OSPF areas 3 Router types 6 OSPF network classification 7 DR and BDR 8 OSPF packet formats 9 Supported OSPF features 17 Protocols and
More informationOSPF (Open Shortest Path First)
OSPF (Open Shortest Path First) Open : specification publicly available RFC 1247, RFC 2328 Working group formed in 1988 Goals: Large, heterogeneous internetworks Uses the Link State algorithm Topology
More informationIntroduction to OSPF
Introduction to OSPF ISP/IXP Workshops ISP/IXP Workshops 1999, Cisco Systems, Inc. 1 Agenda OSPF Primer OSPF in Service Provider Networks OSPF BCP - Adding Networks OSPF Command Summary 2 OSPF Primer 3
More informationLogging neighbor state changes 38 Configuring OSPF network management 39 Enabling message logging 39 Enabling the advertisement and reception of
Contents Configuring OSPF 1 Introduction to OSPF 1 Basic concepts 1 Area based OSPF network partition 3 Router types 6 OSPF network classification 7 DR and BDR 8 OSPF packet formats 9 Supported features
More informationIntroduction to OSPF OSPF. Link State Routing. Link State. Fast Convergence. Low Bandwidth Utilisation
Introduction to OSPF ISP/IP Workshops OSPF Open Shortest Path First Link state or SPF technology Developed by OSPF working group of IETF (RFC 47) Designed for TCP/IP Internet environment Fast convergence
More informationOSPF (Open Shortest Path First)
OSPF (Open Shortest Path First) Open : specification publicly available RFC 1247, RFC 2328 Working group formed in 1988 Goals: Large, heterogeneous internetworks Uses the Link State algorithm Topology
More informationOSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190
Chapter 17 OSPF Protocol Overview The Open Shortest Path First (OSPF) protocol is an interior gateway protocol (IGP) that routes packets within a single autonomous system (AS). OSPF uses link-state information
More informationDD2490 p Lecture 4: OSPF. Link-state routing and Open Shortest Path First. Olof Hagsand KTH CSC
DD2490 p4 20 Lecture 4: OSPF Link-state routing and Open Shortest Path First Olof Hagsand KTH CSC OSPF is the routing protocol that we deal with in most detail in this course. OSPF is a complex protocol,
More informationNetwork Working Group. Category: Standards Track Juniper Networks J. Moy Sycamore Networks December 1999
Network Working Group Requests for Comments: 2740 Category: Standards Track R. Coltun Siara Systems D. Ferguson Juniper Networks J. Moy Sycamore Networks December 1999 OSPF for IPv6 Status of this Memo
More informationOSPF. OSPF processs can be enabled on 2 levels
OSPF UDP port 89 Metic cost Link state protocol Flood the link state information in the entire topology Builds the topology table Stores in LSDB Runs SPF(Djsktra algorithm) for best path to reach destination
More informationCabrillo College. Rick Graziani, Instructor
Cabrillo College CCNP Advanced Routing Ch. 5 - Multi-areas (Part I) Rick Graziani, Instructor Mar. 4, 2002 1 Multi-Area Part I Areas LSAs show ip ospf database (summary of link state database) show ip
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 informationwith
Version 3 Page Topic/Header ------------------------------------- 2 2.1 3 Ethernet II 4 ARP 5 IP 6 ICMP 7 UDP TCP 9 RIPv1 1 RIPv2 11 RIP authentication 12 EIGRP 13 EIGRP TLVs 14-25 OSPFv2 25-end OSPFv3
More informationOSPF Commands. Cisco IOS IP Command Reference, Volume 2 of 3: Routing Protocols IP2R-61
OSPF Commands Use the commands in this chapter to configure and monitor the Open Shortest Path First (OSPF) routing protocol. For OSPF configuration information and examples, refer to the Configuring OSPF
More informationRouting II: Protocols (RIP, EIGRP, OSPF, PNNI, IS-IS): Brief Version
Routing II: Protocols (RIP, EIGRP, OSPF, PNNI, IS-IS): Brief Version Rensselaer Polytechnic Institute shivkuma@ecse.rpi.edu Based in part upon slides of Prof. Raj Jain (OSU), S. Keshav (Cornell), J. Kurose
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 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 informationTDC 363 Introduction to LANs
TDC 363 Introduction to LANs OSPF Greg Brewster DePaul University TDC 363 Greg Brewster, DePaul University 1 OSPF Link State Routing Algorithms Open Shortest Path First (OSPF) Message Types Operations
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 informationVendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability.
Vendor: Alcatel-Lucent Exam Code: 4A0-101 Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability Version: Demo QUESTION 1 When a router receives an IP packet, but does not find a match
More informationFiberstoreOS V3.3 IPv6 Routing Command Line Reference
FiberstoreOS V3.3 IPv6 Routing Command Line Reference Contents 1 OSPFv3 Commands... 4 1.1 area default-cost...4 1.2 area range...5 1.3 area stub... 6 1.4 auto-cost...7 1.5 clear ipv6 ospf...8 1.6 default-information
More informationHow To Configure Basic OSPFv3 Scenarios
How To Configure Basic OSPFv3 Scenarios Contents 1. Contents...... 1 2. Introduction...... 2 3. OSPFv3 Basic Configuration...... 3 Commands for basic OSPFv3 configuration... 4 OSPFv3 basic configuration
More informationAlcatel-lucent EXAM - 4A Alcatel-Lucent Interior Routing Protocols and High Availability. Buy Full Product.
Alcatel-lucent EXAM - 4A0-101 Alcatel-Lucent Interior Routing Protocols and High Availability Buy Full Product http://www.examskey.com/4a0-101.html Examskey Alcatel-lucent 4A0-101 exam demo product is
More informationFSOS IPv6 Routing Command Line Reference
FSOS IPv6 Routing Command Line Reference Contents 1 OSPFv3 Commands... 5 1.1 area default-cost...5 1.2 area range...6 1.3 area stub... 7 1.4 auto-cost...8 1.5 clear ipv6 ospf...9 1.6 default-information
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 informationFiberstoreOS. IPv6 Routing Command Line Reference
FiberstoreOS IPv6 Routing Command Line Reference 1 Contents 1 OSPFv3 Commands... 6 1.1 area default-cost... 6 1.2 area range...7 1.3 area stub... 7 1.4 auto-cost...8 1.5 clear ipv6 ospf...9 1.6 default-information
More informationVanguard Managed Solutions
Vanguard Managed Solutions Vanguard Applications Ware IP and LAN Feature Protocols Open Shortest Path First (OSPF) Notice 2003 Vanguard Managed Solutions, LLC 575 West Street Mansfield, Massachusetts 02048
More informationConfiguring OSPF. Cisco s OSPF Implementation
Configuring OSPF This chapter describes how to configure OSPF. For a complete description of the OSPF commands in this chapter, refer to the OSPF s chapter of the Network Protocols Reference, Part 1. To
More informationOSPFv2 deep dive. Михайловский Василий Cisco TAC Poland Ноябрь 17, 2015
OSPFv2 deep dive Михайловский Василий vamikhai@cisco.com Cisco TAC Poland Ноябрь 17, 2015 Содержание TBD OSPFv2 transport Using IP-multicast 224.0.0.5 and 224.0.0.6; Protocol number 89; Unicast for immediate
More informationPrepAwayExam. High-efficient Exam Materials are the best high pass-rate Exam Dumps
PrepAwayExam http://www.prepawayexam.com/ High-efficient Exam Materials are the best high pass-rate Exam Dumps Exam : 4A0-101 Title : Alcatel-Lucent Interior Routing Protocols and High Availability Vendor
More informationIPv6 Routing: OSPFv3
Open Shortest Path First version 3 (OSPFv3) is an IPv4 and IPv6 link-state routing protocol that supports IPv6 and IPv4 unicast address families (AFs). Finding Feature Information, page 1 Prerequisites
More informationConfiguring OSPF with CLI
OSPF Configuring OSPF with CLI This section provides information to configure Open Shortest Path First (OSPF) using the command line interface. Topics in this section include: OSPF Configuration Guidelines
More informationOperation Manual Routing Protocol. Table of Contents
Table of Contents Table of Contents Chapter 1 IP Routing Protocol Overview... 1-1 1.1 Introduction to IP Route and Routing Table... 1-1 1.1.1 IP Route... 1-1 1.1.2 Routing Table... 1-1 1.2 Routing Management
More informationOSPF. About OSPF. CLI Book 1: Cisco ASA Series General Operations CLI Configuration Guide, 9.4 1
This chapter describes how to configure the Cisco ASA to route data, perform authentication, and redistribute routing information using the Open Shortest Path First () routing protocol. About, page 1 Guidelines
More informationOSPF Commands: A through Z
OSPF Commands: A through Z area nssa, page 3 area nssa translate, page 5 area virtual-link, page 9 capability vrf-lite, page 13 capability vrf-lite (OSPFv3), page 15 clear ip ospf, page 17 compatible rfc1587,
More informationChapter 8 Configuring OSPF
Chapter 8 Configuring OSPF This chapter describes how to configure OSPF on HP routing switches using the CLI and Web management interface. To display OSPF configuration information and statistics, see
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 informationLab 4: Routing using OSPF
Network Topology:- Lab 4: Routing using OSPF Device Interface IP Address Subnet Mask Gateway/Clock Description Rate Fa 0/0 172.16.1.17 255.255.255.240 ----- R1 LAN R1 Se 0/0/0 192.168.10.1 255.255.255.252
More informationRouting Protocols. Technology Description BGP CHAPTER
CHAPTER 11 This chapter describes the level of support that Cisco ANA provides for routing protocols, as follows: Technology Description, page 11-1 Information Model Objects (IMOs), page 11-3 Vendor-Specific
More informationChapter 3 Lab 3-2, Multi-Area OSPFv2 and OSPFv3 with Stub Area
Chapter 3 Topology Objectives Configure multi-area OSPFv2 for IPv4. Configure multi-area OSPFv3 for IPv6 Verify multi-area behavior. Configure stub and totally stubby areas for OSPFv2. Configure stub and
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 informationTeldat Router. OSPF Protocol
Teldat Router OSPF Protocol Doc. DM714-I Rev. 10.90 November, 2011 INDEX Chapter 1 Introduction... 1 1. The OSPF Protocol... 2 2. The OSPF Routing Protocol... 3 3. Configuring OSPF... 4 3.1. Enabling the
More informationdebug ip ospf database external default-metric subnet area 0 stub distribute-list in Serial0/1
Which statement about stateless autoconfiguration is true? A host can autoconfigure itself by appending its MAC address to the local link prefix (64 bits). 2 Autoconfiguration allows devices to connect
More informationLink State. 1 Flooding of link-state information. 5 Routing Table. 3 SPF Algorithm. 2 Building a Topological Database. 4 SPF Tree
Link State 1 Flooding of link-state information 5 Routing Table 2 Building a Topological Database 3 SPF Algorithm 4 SPF Tree OSPF Hello Protocol OSPF routers send Hellos on OSPF enabled interfaces: Default
More informationROUTING CONSORTIUM. Open Shortest Path First (OSPF) Multi-System Interoperability Test Suite. Technical Document. Revision 1.6
ROUTING CONSORTIUM Open Shortest Path First (OSPF) Multi-System Interoperability Test Suite Technical Document Revision 1.6 University of New Hampshire 121 Technology Drive, Suite 2 Durham, NH 03824-3525
More informationConfiguring OSPF. Finding Feature Information. Contents
Configuring OSPF First Published: May 5, 2008 Last Updated: March 18 2011 This module describes how to configure Open Shortest Path First (OSPF). OSPF is an Interior Gateway Protocol (IGP) developed by
More informationSample Configuration for OSPFv3
Sample Configuration for OSPFv3 Document ID: 112100 Contents Introduction Prerequisites Requirements Components Used Conventions Configure Network Diagram Configuration Verify Troubleshoot Related Information
More informationUnicast Routing. TCP/IP class
Unicast Routing TCP/IP class Routing Protocols intro RIP and son of RIP OSPF BGP odd bodkins NAT TCP/IP Internetworking Protocols 2 divide routing world into 3 parts topology IETF ISO/OSI same link or
More informationOSPF Not So Stubby Area (NSSA)
OSPF Not So Stubby Area (NSSA) Document ID: 6208 Contents Introduction Prerequisites Requirements Components Used Conventions What Is a Type 7 LSA? Configuration Tasks Defining a Not So Stubby Area Defining
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 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 informationConfiguring 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
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
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 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 informationConfiguring OSPF. Finding Feature Information
This module describes how to configure Open Shortest Path First (OSPF). OSPF is an Interior Gateway Protocol (IGP) developed by the OSPF working group of the Internet Engineering Task Force (IETF). OSPF
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 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 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 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 informationPassit4Sure.4A Questions 4A Alcatel-Lucent Interior Routing Protocols and High Availability
Passit4Sure.4A0-101.300Questions Number: 4A0-101 Passing Score: 800 Time Limit: 120 min File Version: 7.5 http://www.gratisexam.com/ 4A0-101 Alcatel-Lucent Interior Routing Protocols and High Availability
More informationExplanation: In order to verify proper route redistribution, use the "show ip route" command on all routers
QUESTION 401 The 192.168.0.0/16 network is not being propagated throughout the network via BGP as expected. Observe the BGP configuration commands from the advertising router shown below. Router bgp 65111
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 informationCreating Multiple OSPF Areas. 2001, Cisco Systems, Inc. 6-1
Creating Multiple OSPF Areas 6-1 Issues with Maintaining a Large OSPF Network I am only receiving LSAs, no data. OSPF The SPF is running too often for me to route. OSPF OSPF OSPF OSPF My routing table
More informationOperation Manual OSPF. Table of Contents
Table of Contents Table of Contents... 1-1 1.1 OSPF Overview... 1-1 1.1.1 Introduction to OSPF... 1-1 1.1.2 Process of OSPF Route Calculation... 1-2 1.1.3 OSPF Packets... 1-2 1.1.4 LSA Type... 1-3 1.1.5
More informationRouting 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
More informationConfiguring OSPF. Finding Feature Information
This module describes how to configure Open Shortest Path First (OSPF). OSPF is an Interior Gateway Protocol (IGP) developed by the OSPF working group of the Internet Engineering Task Force (IETF). OSPF
More information4A Alcatel-Lucent. Alcatel-Lucent Interior Routing Protocols and High Availability
Alcatel-Lucent 4A0-101 Alcatel-Lucent Interior Routing Protocols and High Availability Download Full Version : http://killexams.com/pass4sure/exam-detail/4a0-101 QUESTION: 297 Click on the exhibit. In
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 informationExam Questions 4A0-101
Exam Questions 4A0-101 Alcatel-Lucent Interior Routing Protocols and High Availability https://www.2passeasy.com/dumps/4a0-101/ 1.When a router receives an IP packet, but does not find a match in the routing
More informationVeryx ATTEST TM. Sample Test cases Overview. Conformance Test Suite. Open Shortest Path First version 2 (OSPFv2)
Veryx ATTEST TM Conformance Test Suite Open Shortest Path First version 2 (OSPFv2) Sample Test cases Overview Part Number: T / TCLS OSPFv2 1.0-1110/1.0 This page is intentionally left blank. Introduction
More informationChapter 16 OSPF Version 3 Commands
Chapter 16 OSPF Version 3 Commands NOTE: The OSPF version 3 configuration level is present only on HP devices that support IPv6. area Assigns OSPF version 3 areas. You can assign an IPv4 address or a number
More informationIT-Operation (2) OSPF. Who am I
IT-Operation (2) OSPF yasu@wide.ad.jp Who am I Name: Yasuhiro Ohara 3rd grade of doctoral course in KEIO Univ. Author of Zebra ospf6d One of WIDE 6Bone operators developer or researcher rather than operator
More informationNetwork Working Group. Category: Standards Track Stanford University March 1994
Network Working Group Request for Comments: 1587 Category: Standards Track R. Coltun RainbowBridge Communications V. Fuller Stanford University March 1994 The OSPF NSSA Option Status of this Memo This
More informationCCNA Exploration: Routing Protocols and Concepts Chapter 11 Case Study
bjectives: Consolidate SPF knowledge. Describe the operation of SPF multi-area. Introduce the concept of route summarization with SPF. Introduce the concept of SPF optimization. Intro: Trevni Inc. needed
More informationMULTICAST EXTENSIONS TO OSPF (MOSPF)
MULTICAST EXTENSIONS TO OSPF (MOSPF) Version 2 of the Open Shortest Path First (OSPF) routing protocol is defined in RFC-1583. It is an Interior Gateway Protocol (IGP) specifically designed to distribute
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 informationCOURSE OUTLINE: Course: CCNP Route Duration: 40 Hours
COURSE OUTLINE: Course: CCNP Route 300-101 Duration: 40 Hours CCNP Route Training Day 1: Connecting Remote Locations Principles of Static Routing Configuring an IPv4 Static Route Configuring a Static Default
More informationChapter 15 OSPF Commands
Chapter 15 OSPF Commands NOTE: This chapter contains information about OSPF version 2 commands only. For information about OSPF version 3 commands, see OSPF Version 3 Commands on page 16-1. area Assigns
More informationImplementing Cisco IP Routing (ROUTE)
Implementing Cisco IP Routing (ROUTE) Foundation Learning Guide Foundation learning for the ROUTE 642-902 Exam Diane Teare Cisco Press 800 East 96th Street Indianapolis, IN 46240 Implementing Cisco IP
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 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 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 informationHP Load Balancing Module
HP Load Balancing Module Appendix Protocol Reference Part number: 5998-4222 Software version: Feature 3221 Document version: 6PW100-20130326 Legal and notice information Copyright 2013 Hewlett-Packard
More informationBrocade 5600 vrouter OSPFv3 Configuration Guide
CONFIGURATION GUIDE Brocade 5600 vrouter OSPFv3 Configuration Guide Supporting Brocade 5600 vrouter 4.2R1 53-1004266-01 16 May 2016 2016, Brocade Communications Systems, Inc. All Rights Reserved. Brocade,
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 informationThis document is exclusive property of Cisco Systems, Inc. Permission is granted to print and copy this document for non-commercial distribution and
This document is exclusive property of Cisco Systems, Inc. Permission is granted to print and copy this document for non-commercial distribution and exclusive use by instructors in the CCNP: Building Scalable
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 informationOSPFv3 Commands. address-family (OSPFv3), page 4. authentication (OSPFv3), page 7
This module describes the commands used to configure and monitor the IP Version 6 (IPv6) Open Shortest Path First Version 3 (OSPFv3) routing protocol. For detailed information about OSPFv3 concepts, configuration
More informationCCNA 3 (v v6.0) Chapter 10 Exam Answers % Full
CCNA 3 (v5.0.3 + v6.0) Chapter 10 Exam Answers 2017 100% Full ccnav6.com /ccna-3-v5-0-3-v6-0-chapter-10-exam-answers-2017-100-full.html CCNA Exam Answers 2017 CCNA 3 (v5.0.3 + v6.0) Chapter 10 Exam Answers
More informationSymbols. Numerics I N D E X
I N D E X Symbols %OSPF-4-BADLSATYPE error messages, 529 Numerics A 128-bit addressing scheme, IPv6, 5 2-way state, OSPF neighbors, 336 getting stuck, 398 400 32-bit addressing scheme, IPv4, 5 classes,
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 information