Link-state protocols and Open Shortest Path First (OSPF)
|
|
- Sheila Richards
- 6 years ago
- Views:
Transcription
1 Fixed Internetworking Protocols and Networks Link-state protocols and Open Shortest Path First (OSPF) Rune Hylsberg Jacobsen Aarhus School of Engineering 0 ITIFN
2 Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and requirements of link state routing protocols and compare with distance vector protocols. Describe the basic operation of link state protocol such as neighbor discovery, flooding, exchange. Learn to calculate routes by SPF algorithm. Describe the background and basic features of OSPF. 0 ITIFN
3 Distance vector versus link state routing With distance vector routing, each node has information only about the next hop: Node A: to reach F go to B Node B: to reach F go to D Node D: to reach F go to E Node E: go directly to F Distance vector routing makes poor routing decisions if directions are not completely correct (e.g., because a node is down). If parts of the directions is incorrect, the routing may be incorrect until the routing algorithms has re-converged. A B C D E F 0 ITIFN
4 Distance vector versus link state routing In link state routing, each node has a complete map of the topology. A B C A B C A B C D E F D E F D E F If a node fails, each node can calculate the new route. A B C Challenge: All nodes need to have a consistent view of the network. A B C D D E F A B C E D E F F A B C D E F 4 0 ITIFN
5 Classification of routing protocols Link state routing protocols Also known as shortest path first algorithms These protocols built around Dijkstra s SPF algorithm Classful Classless IPv6 Distance vector routing protocols Link state routing protocols RIP IGRP EGP RIPv EIGRP OSPFv IS-IS BGPv4 RIPng EIGRP for IPv6 OSPFv IS-IS for IPv6 Exterior gateway protocols path vectors BGPv4 for IPv6 5 0 ITIFN
6 Link state routing: basic principles. Each router establishes a relationship ( adjacency ) with its neighbors (link state routers).. Each router generates link state advertisements (LSAs) which are distributed to all routers. LSA = (link id, state of the link, cost, neighbors of the link).. Each router maintains a database of all received LSAs (topological database or link state database), which describes the network as a graph with weighted edges. 4. Each router uses its link state database to run a shortest path algorithm (Dijikstra s algorithm) to produce the shortest path to each network. 6 0 ITIFN
7 Link-state routing process Link state routing protocols reach convergence: Each routers learns about its own directly connected networks. Link state routers exchange hello packet to meet other directly. Connected link state routers. Each router builds its own Link State Packet (LSP) which includes information about neighbors such as neighbor ID, link type, & bandwidth. After the LSP is created the router floods it to all neighbors who then store the information and then forward it until all routers have the same information. Once all the routers have received all the LSPs, the routers then construct a topological map of the network which is used to determine the best routes to a destination. 7 0 ITIFN
8 Link state information A link is attached to an interface on a router Link state is the information about the state of the links The numbers on each link shows the cost for that link /6 sl 5 eth0 sl R / /6 R 0 0 R Link : Network: /6 Type of network: Serial Cost of that link: 0 Neighbor routers: R R5 Link : Network: /6 Type of network: Serial Cost of that link: 5 Neighbor routers: R 8 0 ITIFN sl /6 Link : Network: /6 Type of network: Ethernet Cost of that link: Neighbor routers: None 0 0 R4 0 Link 4: Network: /6 Type of network: Serial Cost of that link: 0 Neighbor routers: R4
9 Link state database (DB) Received database entry (LSAs) Link state database SPF calculation IP routing table LSAs are flooded to other interfaces The collection of all LSAs is called the link state database. Each router has and identical link state database and hence a complete description of the network. When neighboring routers discover each other for the first time, they will exchange their link state databases The link-state databases are synchronized using reliable flooding. 9 0 ITIFN
10 Discovery of neighbors Routers multicasts Hello packets on all interfaces running the link state routing protocol. If two routers share a link, they can become neighbors, and establish an adjacency. Scenario: Router restarts After becoming a neighbor, routers exchange their link state databases. 0 0 ITIFN
11 Flooding All links have cost = Link A D Link Link Link 6 Link 4 AD: From A, to B, link, infinite, number = DE: Updates its DB and relays A s message to E EC,B: Updates its DB and relay A s message C & B CB: Updates its DB and relay A s message to B BE: No update, number number in B s DB; relay to E ED: No update, number number in E s DB; relay to D DA: No update, number number in B s DB; relay to D A: Update message number and triggers new route calculation. No further flooding B E C A s link state database From To Link Dist. Num. A B A D B A B C B E 4 C B C E 5 D A D E 6 E B 4 E C 5 E D 6 Link breaks. A and B notice. The information is flooded in the network 0 ITIFN
12 Shortest path () Uses a calculation of shortest paths based on a distributed map of the network topology R R R R R4 The shortest path for host on R LAN to reach host on R LAN: R to R (0) + R to R (5) + R to LAN () = 7 0 ITIFN
13 Shortest path () The shortest path to a destination is not necessarily the path with the least number of hops R R R R5 From source node: R 0 0 R4 0 Destination Shortest path Cost R LAN R to R R LAN R to R 7 R4 LAN R to R to R4 7 Shortest path is hops R5 LAN R to R to R4 to R5 7 0 ITIFN
14 Dijkstra s algorithm E: represents a set of nodes for which shortest path already found. Initialization: (Start with source node S) E = {S}, D s = 0, S has distance zero from itself D j = C sj for all j S, Step : find next closest node i Find i E such that D i = min (D j ) for j E Add i to E where C sj represents link cost for directly connected neighbors j If E contains all the nodes, terminate the algorithm Step : update minimum costs For each node j E D j = min (D j, D i +C ij ) Go to Step D j becomes the minimum distance from s to j through node i in E. 4 0 ITIFN
15 5 0 ITIFN Execution of Dijkstra s algorithm Iteration E D D D 4 D 5 D 6 Initial {} 5 {,} 4 {,,} 4 7 {,,,6} {,,,4,6} {,,,4,5,6} A shortest path three from node to all other nodes has been calculated. A shortest path three from node to all other nodes has been calculated.
16 Equal multi-path cost Equal cost metric is a condition where a router has multiple paths to the same destination that all have the same metric. To solve this dilemma, a router will use Equal Cost Load Balancing - this means the router sends packets over the multiple exit interfaces listed in the routing table. 6 0 ITIFN
17 Link state routing protocol requirements Requirements for using a link state routing protocol Memory requirements Typically link state routing protocols use more memory Processing requirements More CPU processing is required of link state routing protocols Bandwidth requirements Initial startup of link state routing protocols can consume lots of bandwidth Generally link state routers have to be more powerful devices compared to distance vector routers. In practice, both distance vector and link state routing protocols are supported in modern routers. 7 0 ITIFN
18 Multiple areas Need for network hierarchy due to large memory requirement, demanding route computation and high transmission overhead for large networks. Areas act as independent networks. Area border routers (ABR) summarizes routing information. Summary records represents the link between ABR and a network in the backbone area. To another AS IR Router classification Internal Router (IR) Area Border Router (ABR) Backbone Router (BR) Autonomous System Border Router (ASBR) Area Area IR ABR BR Area 4 ASBR Area 0 Backbone Area ABR ABR External routes Area ABR ABR IR IR IR Intra-area routes Inter-area routes 8 0 ITIFN
19 Open Shortest Path First (OSPF) protocol The OSPF routing protocol is the most important link state routing protocol on the Internet. The complexity of OSPF is significant. Features Provides authentication of routing messages. Enables load balancing by allowing traffic to be split evenly across routes with equal cost. Type-of-Service (TOS) routing allows to setup different routes dependent on the TOS field. Supports subnetting. Supports multicasting. Allows hierarchical routing. 9 0 ITIFN
20 OSPF development timeline Background of OSPF Specification work began in OSPFv released in RFC This version was experimental & never deployed 99 OSPFv released in RFC OSPFv updated in RFC OSPFv published in RFC ITIFN
21 OSPF packet format OSPF packets are not carried as UDP payload! OSPF has its own IP protocol number: 89 TTL: set to (in most cases) Destination IP: neighbor s IP address or (ALL OSPF Routers) or (All D Routers) 0 ITIFN
22 OSPF packet format : current version is OSPF V Message types: : Hello (tests reachability) : Database description : Link status request 4: Link state update 5: Link state acknowledgement Standard IP checksum taken over entire packet ID of the Area from which the packet originated 0: no authentication : Cleartext password : MD5 checksum (added to end packet) Authentication passwd = : 64 cleartext password Authentication passwd = : 0x0000 (6 bits) KeyID (8 bits) Length of MD5 checksum (8 bits) Nondecreasing sequence number ( bits) Prevents replay attacks 0 ITIFN
23 OSPF LSA format Contains number of links Message type specification data LSA LSA Header LSA Data LSA Header Link Link 0 ITIFN
24 Lollipop sequence space The link state sequence number is increase in accordance with the lollipop sequence space. N = -N+ N- N/ ITIFN
25 Example network 4 Router IDs are selected independent of interface addresses 5 Link costs are called Metric Metric is in the range [0, 6 ] Metric can be asymmetric 5 0 ITIFN
26 Neighbor discovery Scenario: Router restarts Discovery of adjacency After neighbors are discovered the nodes exchange their databases Sends database description. (description only contains LSA headers) Acknowledges receipt of description Sends empty database description Database description of ITIFN
27 OSPF s hello packages Hello packets Discover OSPF neighbors & establish adjacencies Advertise guidelines on which routers must agree to become neighbors. Used by multi-access networks to elect a DR and a BDR Contents of a Hello Packet router ID of transmitting router OSPF Hello Intervals Usually multicast ( ) Sent every 0 seconds for NBMA segments OSPF dead intervals This is the time that must transpire before the neighbor is considered down Default time is 4 times the hello interval Designated Router (DR): DR is responsible for updating all other OSPF routers Backup Designated Router (BDR): This router takes over DR s responsibilities if DR fails 7 0 ITIFN
28 Link state advertisement (LSA) The LSA of router is as follows: Link State ID: Advertising Router: = Router ID = Router ID 4 Number of links: = links plus router itself Description of Link : Link ID = 0..., Metric = 4 Description of Link : Link ID = 0..., Metric = Description of Link : Link ID = , Metric = 0 Each router sends its LSA to all routers in the network (using a method called reliable flooding) 8 0 ITIFN
29 Network and link state database 4 Each router has a database which contains the LSAs from all other routers 5 LS Type Link StateID Adv. Router Checksum LS SeqNo LS Age Router-LSA x9b47 0x Router-LSA x9e 0x Router-LSA x6b5 0x Router-LSA xe9a 0x800000a 0 Router-LSA xda6 0x Router-LSA x05c 0x ITIFN
30 Regular LSA exchanges explicitly requests each LSA from sends requested LSAs has more recent value for and sends it to (with higher sequence number) 0 0 ITIFN
31 Reliable flooding LSA-Updates are distributed to all other routers via Reliable Flooding Example: Flooding of LSA from For every LSA sent out there must be an acknowledgem ent of receipt sent back to transmitting router 4 LSA ACK Update database LSA Update database ACK LSA Update database ACKs can be explicit ACK, or implicit via reception of an LSA-Update Update database 5 LSA Update database 0 ITIFN
32 OSPF in multi-access networks Large networks may experience extensive flooding of LSAs Solution to LSA flooding issue is the use of Designated router (DR) Backup designated router (BDR) DR & BDR selection Routers are elected to send & receive LSAs Sending & receiving LSAs DR others send LSAs via multicast to DR & BDR DR forward LSAs via multicast address to all other routers 0 ITIFN
33 Summary of Interior routing protocols Routing Advantages Buildsof a Link-State Router can Convergence Routing Protocol protocol Topological map independently determine the shortest path to every network. A periodic/ event driven routing updates Use of LSP Distance vector No No Slow Generally No No Link State Yes Yes Fast Generally Yes Yes 0 ITIFN
34 Summary of lecture () Link state routing protocols are also known as Shortest Path First (SPF) protocols. Summarizing the link state process Routers st learn of directly connected networks Routers then say hello to neighbors Routers then build link state packets Routers then flood LSPs to all neighbors Routers use LSP database to build a network topology map & calculate the best path to each destination. Link State Information about an interface such as IP address Subnet mask Type of network Cost associated with link Neighboring routers on the link 4 0 ITIFN
35 Summary of lecture () RFC 8 describes OSPF link state concepts and operations OSPF Characteristics A commonly deployed link state routing protocol Employs DRs & BDRs on multi-access networks DRs & BDRs are elected DR & BDRs are used to transmit and receive LSAs Uses 5 packet types: : HELLO : DATABASE DESCRIPTION : LINK STATE REQUEST 4: LINK STATE UPDATE 5: LINK STATE ACKNOWLEDGEMENT 5 0 ITIFN
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 10 : Link-State Routing Protocols Chapter 11 : OSPF Chapter 1 2
More informationOSPF Fundamentals. Agenda. OSPF Principles. L41 - OSPF Fundamentals. Open Shortest Path First Routing Protocol Internet s Second IGP
OSPF Fundamentals Open Shortest Path First Routing Protocol Internet s Second IGP Agenda OSPF Principles Introduction The Dijkstra Algorithm Communication Procedures LSA Broadcast Handling Splitted Area
More informationOSPF - Open Shortest Path First. OSPF Fundamentals. Agenda. OSPF Topology Database
OSPF - Open Shortest Path First OSPF Fundamentals Open Shortest Path First Routing Protocol Internet s Second IGP distance vector protocols like RIP have several dramatic disadvantages: slow adaptation
More informationConfiguring OSPF. Information About OSPF CHAPTER
CHAPTER 22 This chapter describes how to configure the ASASM to route data, perform authentication, and redistribute routing information using the Open Shortest Path First (OSPF) routing protocol. The
More informationTable of Contents. OSPF Configuration 1
Table of Contents OSPF Configuration 1 Introduction to OSPF 1 Basic Concepts 2 Area Based OSPF Network Partition 3 Router Types 7 Classification of OSPF Networks 9 DR and BDR 9 OSPF Packet Formats 11 Supported
More informationOSPF Domain / OSPF Area. OSPF Advanced Topics. OSPF Domain / OSPF Area. Agenda
OSPF Domain / OSPF Area OSPF Advanced Topics Areas,, Backbone, Summary-LSA, ASBR, Stub Area, Route Summarization, Virtual Links, Header Details OSPF domain can be divided in multiple OSPF areas to improve
More informationITE PC v4.0. Chapter Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF Routing Protocols and Concepts Chapter 11 1 Objectives Describe the background and basic features of OSPF Identify and apply the basic OSPF configuration commands Describe, modify and calculate l
More informationConfiguring the maximum number of external LSAs in LSDB 27 Configuring OSPF exit overflow interval 28 Enabling compatibility with RFC Logging
Contents Configuring OSPF 1 Overview 1 OSPF packets 1 LSA types 1 OSPF areas 2 Router types 4 Route types 5 Route calculation 6 OSPF network types 6 DR and BDR 6 Protocols and standards 8 OSPF configuration
More informationIntroduction to OSPF. ISP Workshops. Last updated 11 November 2013
Introduction to OSPF ISP Workshops Last updated 11 November 2013 1 OSPF p Open Shortest Path First p Open: n Meaning an Open Standard n Developed by IETF (OSPF Working Group) for IP RFC1247 n Current standard
More informationLink State Routing. In particular OSPF. dr. C. P. J. Koymans. Informatics Institute University of Amsterdam. March 4, 2008
Link State Routing In particular OSPF dr. C. P. J. Koymans Informatics Institute University of Amsterdam March 4, 2008 dr. C. P. J. Koymans (UvA) Link State Routing March 4, 2008 1 / 70 1 Link State Protocols
More informationLink State Routing. In particular OSPF. Karst Koymans. Informatics Institute University of Amsterdam. (version 16.3, 2017/03/09 11:25:31)
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 Karst Koymans (UvA) Link State Routing Tuesday,
More informationOSPF. Routing Protocols and Concepts Chapter 11. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF Routing Protocols and Concepts Chapter 11 1 Objectives Describe the background and basic features of OSPF Identify and apply the basic OSPF configuration commands Describe, modify and calculate the
More informationQuestion No: 2 In an OSPF Hello packet, which of the following fields must match for all neighbor routers on the segment? Choose three answers.
Volume: 335 Questions Question No: 1 What is the default preference value for a static route in the Alcatel-Lucent 7750 SR? A. 0 B. 5 C. 10 D. 15 Answer: B Question No: 2 In an OSPF Hello packet, which
More informationConfiguring OSPF. The Cisco OSPF Implementation
Configuring OSPF This chapter describes how to configure Open Shortest Path First (OSPF). For a complete description of the OSPF commands in this chapter, refer to the OSPF s chapter of the Cisco IOS IP
More informationLink State Routing. In particular OSPF. Karst Koymans. Informatics Institute University of Amsterdam. (version 17.4, 2017/11/30 12:33:57)
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 Karst Koymans (UvA) Link State Routing Tuesday,
More informationOSPF. Routing Protocols and Concepts Chapter 11
OSPF Routing Protocols and Concepts Chapter 11 Objectives Describe the background and basic features of OSPF Identify and apply the basic OSPF configuration commands Describe, modify and calculate the
More informationJunos Intermediate Routing
Junos Intermediate Routing Chapter 4: Open Shortest Path First 2012 Juniper Networks, Inc. All rights reserved. www.juniper.net Worldwide Education Services Chapter Objectives After successfully completing
More informationIP Routing: OSPF Configuration Guide, Cisco IOS XE Release 3SE (Catalyst 3650 Switches)
IP Routing: OSPF Configuration Guide, Cisco IOS XE Release 3SE (Catalyst 3650 Switches) First Published: dd, yyyy Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706
More informationOSPF for IPv6. ISP Workshops
OSPF for IPv6 ISP Workshops These materials are licensed under the Creative Commons Attribution-NonCommercial 4.0 International license (http://creativecommons.org/licenses/by-nc/4.0/) Last updated 17
More informationCS 457 Lecture 16 Routing Continued. Spring 2010
CS 457 Lecture 16 Routing Continued Spring 2010 Scaling Link-State Routing Overhead of link-state routing Flooding link-state packets throughout the network Running Dijkstra s shortest-path algorithm Introducing
More informationKillTest *KIJGT 3WCNKV[ $GVVGT 5GTXKEG Q&A NZZV ]]] QORRZKYZ IUS =K ULLKX LXKK [VJGZK YKX\OIK LUX UTK _KGX
KillTest Q&A Exam : JN0-643 Title : Enterprise Routing and Switching, Professional (JNCIP-ENT) Version : Demo 1 / 10 1.Which connection method do OSPF routers use to communicate with each other? A. IP
More informationGuide to OSPF Application on the CSS 11000
Guide to OSPF Application on the CSS 11000 Document ID: 12638 Contents Introduction Before You Begin Conventions Prerequisites Components Used Description OSPF Configuration Task List Configuration Global
More informationIP Routing: OSPF Configuration Guide, Cisco IOS Release 12.2SX
IP Routing: OSPF Configuration Guide, Cisco IOS Release 12.2SX Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS
More informationIP Routing: OSPF Configuration Guide, Cisco IOS Release 12.4
IP Routing: OSPF Configuration Guide, Cisco IOS Release 12.4 Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS
More informationmaterial. For more information on how to get additional questions, please see a.
Review Questions The following questions are designed to test your understanding of this chapter s material. For more information on how to get additional questions, please see www.lammle.com/ccn a. You
More informationIP Routing: OSPF Configuration Guide, Cisco IOS XE Release 2
IP Routing: OSPF Configuration Guide, Cisco IOS XE Release 2 Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS
More informationOSPF Enhanced Traffic Statistics for OSPFv2 and OSPFv3
OSPF Enhanced Traffic Statistics for OSPFv2 and OSPFv3 This document describes new and modified commands that provide enhanced OSPF traffic statistics for OSPFv2 and OSPFv3. The ability to collect and
More informationLink State Routing. Link state routing principles Dijkstra s shortest-path-first algorithm The OSPF protocol. (Chapter 6 in Huitema) E7310/Comnet 1
Link State Routing Link state routing principles Dijkstra s shortest-path-first algorithm The OSPF protocol (Chapter 6 in Huitema) 7310/Comnet 1 Link State Routing Principles 7310/Comnet 2 Link state routing
More informationCisco IOS IP Routing: OSPF Command Reference
Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS (6387) Fax: 408 527-0883 THE SPECIFICATIONS AND INFORMATION
More informationOSPF Version 3 for IPv6
OSPF Version 3 for IPv6 Modified: 2017-01-23 Juniper Networks, Inc. 1133 Innovation Way Sunnyvale, California 94089 USA 408-745-2000 www.juniper.net All rights reserved. Juniper Networks, Junos, Steel-Belted
More informationCCNA Routing and Switching Study Guide Chapters 5 & 19: Multi-Area OSPF
CCNA Routing and Switching Study Guide Chapters 5 & 19: Multi-Area OSPF Instructor & Todd Lammle Chapter 20 objectives The ICND2 topics covered in this chapter include: IP Routing Technologies Configure
More informationRev a. Single-Area OSPF. c cnac o okbook.com
Rev. 00.00 a. Single-Area OSPF c cnac o okbook.com C O N F I G U R A T I O N Technically, we're using OSPFv for IPv, but that only matters because IPv uses OSPFv. Wildcard a bitmask controlling address
More informationCSE/EE 461. Link State Routing. Last Time. This Lecture. Routing Algorithms Introduction Distance Vector routing (RIP)
CSE/EE 46 Link State Routing Last Time Routing Algorithms Introduction Distance Vector routing (RIP) Application Presentation Session Transport Network Data Link Physical This Lecture Routing Algorithms
More informationOSPF Enhanced Traffic Statistics
This document describes new and modified commands that provide enhanced OSPF traffic statistics for OSPFv2 and OSPFv3. The ability to collect and display more detailed traffic statistics increases high
More informationOSPF. OSPF Areas. BSCI Module Cisco Systems, Inc. All rights reserved. Cisco Public. Review of OSPF area characteristics:
OSPF BSCI Module 3 1 Minimizes routing table entries Localizes impact of a topology change within an area Detailed LSA flooding stops at the area boundary Requires a hierarchical network design OSPF Areas
More informationSybex ICND Chapter 4 and 18: OSPF. Instructor & Todd Lammle
Sybex ICND2 200-105 Chapter 4 and 18: OSPF Instructor & Todd Lammle Chapter 4 objectives The ICND2 topics covered in this chapter include: 2 OSPF design example. An OSPF hierarchical design minimizes routing
More informationOSPF Mechanism to Exclude Connected IP Prefixes from LSA Advertisements
OSPF Mechanism to Exclude Connected IP Prefixes from LSA Advertisements This document describes the Open Shortest Path First (OSPF) mechanism to exclude IP prefixes of connected networks from link-state
More informationOSPF Inbound Filtering Using Route Maps with
OSPF Inbound Filtering Using Route Maps with a Distribute List Finding Feature Information OSPF Inbound Filtering Using Route Maps with a Distribute List Last Updated: July 19, 2011 The OSPF Inbound Filtering
More informationLink State Routing. Stefano Vissicchio UCL Computer Science CS 3035/GZ01
Link State Routing Stefano Vissicchio UCL Computer Science CS 335/GZ Reminder: Intra-domain Routing Problem Shortest paths problem: What path between two vertices offers minimal sum of edge weights? Classic
More informationJunos OS. OSPF Version 3 for IPv6 Feature Guide. Release Published: Copyright 2011, Juniper Networks, Inc.
Junos OS OSPF Version 3 for IPv6 Feature Guide Release 11.4 Published: 2011-11-08 Juniper Networks, Inc. 1194 North Mathilda Avenue Sunnyvale, California 94089 USA 408-745-2000 www.juniper.net This product
More informationLink State Routing. Brad Karp UCL Computer Science. CS 3035/GZ01 3 rd December 2013
Link State Routing Brad Karp UCL Computer Science CS 33/GZ 3 rd December 3 Outline Link State Approach to Routing Finding Links: Hello Protocol Building a Map: Flooding Protocol Healing after Partitions:
More informationOSPF Nonstop Routing. Finding Feature Information. Prerequisites for OSPF NSR
The feature allows a device with redundant Route Processors (RPs) to maintain its Open Shortest Path First (OSPF) state and adjacencies across planned and unplanned RP switchovers. The OSPF state is maintained
More informationLecture 8 Link-State Routing
6998-02: Internet Routing Lecture 8 Link-State Routing John Ioannidis AT&T Labs Research ji+ir@cs.columbia.edu Copyright 2002 by John Ioannidis. All Rights Reserved. Announcements Lectures 1-5, 7-8 are
More informationNetwork Layer (Routing)
Network Layer (Routing) Where we are in the ourse Moving on up to the Network Layer! Application Transport Network Link Physical SE 61 University of Washington Topics Network service models Datagrams (packets),
More informationROUTING PROTOCOLS. Dr. Ahmed Khattab. EECE Department Cairo University Fall 2012 ELC 659/ELC724
ROUTING PROTOCOLS Dr. Ahmed Khattab EECE Department Cairo University Fall 2012 ELC 659/ELC724 Dr. Ahmed Khattab Fall 2012 2 Routing Network-wide process the determine the end to end paths that packets
More informationhttp://www.expertnetworkconsultant.com/configuring/ospf-neighbor-adjacency/ Brought to you by Expert Network Consultant.com OSPF Neighbor Adjacency Once upon a time, we walked together holding hands, we
More informationEnergy-Efficient MANET Routing: Ideal vs. Realistic Performance
Energy-Efficient MANET Routing: Ideal vs. Realistic Performance Paper by: Thomas Knuz IEEE IWCMC Conference Aug. 2008 Presented by: Farzana Yasmeen For : CSE 6590 2013.11.12 Contents Introduction Review:
More informationC Commands. Send comments to
This chapter describes the Cisco NX-OS Open Shortest Path First (OSPF) commands that begin with C. UCR-583 clear ip ospf neighbor clear ip ospf neighbor To clear neighbor statistics and reset adjacencies
More informationScalable Routing Protocols for Mobile Ad Hoc Networks
Helsinki University of Technology T-79.300 Postgraduate Course in Theoretical Computer Science Scalable Routing Protocols for Mobile Ad Hoc Networks Hafeth Hourani hafeth.hourani@nokia.com Contents Overview
More informationZebra MCR Software 1.0 Manual Yin Wang Networking Laboratory of Helsinki University of Technology
Zebra MCR Software 1.0 Manual Yin Wang Networking Laboratory of Helsinki University of Technology yinwang@netlab.hut.fi Please note: operating system requirement: Linux 2.4.20-30.9 (at least) 1. Configure
More informationLab Topology R16 R12 R15. Lo R /32 R /32 R /32 R /32 R / /
Lab Topology R16 So-5/0/0 So-4/2/0 100.3.0/30 100.5.0/30 So-1/3/0 100.0/30 So-1/0/0 So-2/0/0 So-2/1/0 Ge-2/3/0 Ge-1/2/0 R6 So-0/3/0 100.0/30 So-4/0/0 R12 So-3/0/0 100.4.0/30 So-1/0/0 R15 100.6.0/30 R7
More informationaccurate as possible, the enclosed material is presented on an as is basis. Neither the authors nor
OSPF Disclaimer This Configuration Guide is designed to assist members to enhance their skills in particular technology area. While every effort has been made to ensure that all material is as complete
More informationolsr.org 'Optimized Link State Routing' and beyond December 28th, 2005 Elektra
olsr.org 'Optimized Link State Routing' and beyond December 28th, 2005 Elektra www.scii.nl/~elektra Introduction Olsr.org is aiming to an efficient opensource routing solution for wireless networks Work
More informationOverview. Ad Hoc and Wireless Mesh Networking. Ad hoc network. Ad hoc network
Ad Hoc and Wireless Mesh Networking Laura Marie Feeney lmfeeney@sics.se Datakommunikation III, HT 00 Overview Ad hoc and wireless mesh networks Ad hoc network (MANet) operates independently of network
More informationA Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks
A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks Elisabeth M. Royer, Chai-Keong Toh IEEE Personal Communications, April 1999 Presented by Hannu Vilpponen 1(15) Hannu_Vilpponen.PPT
More informationNetwork Working Group Request for Comments: Category: Standards Track A. Zinin Alcatel-Lucent R. Coltun Acoustra Productions July 2008
Network Working Group Request for Comments: 5250 Obsoletes: 2370 Category: Standards Track L. Berger LabN I. Bryskin Adva A. Zinin Alcatel-Lucent R. Coltun Acoustra Productions July 2008 The OSPF Opaque
More informationDistance-Vector Routing
Distance-Vector Routing Antonio Carzaniga Faculty of Informatics University of Lugano June 8, 2007 c 2005 2007 Antonio Carzaniga 1 Recap on link-state routing Distance-vector routing Bellman-Ford equation
More informationSimulative Comparison of MPLS Protection Switching vs. OSPF Re-routing
C O R P O R A T E T E C H N O L O Y Simulative Comparison of MPLS Protection Switching vs. OSPF Re-routing nformation & Sandrine PASQUALINI Antoine FROT Andreas Iselt Andreas Kirstädter C O R P O R A T
More informationM U LT I C A S T C O M M U N I C AT I O N S. Tarik Cicic
M U LT I C A S T C O M M U N I C AT I O N S Tarik Cicic 9..08 O V E R V I E W One-to-many communication, why and how Algorithmic approach: Steiner trees Practical algorithms Multicast tree types Basic
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Josh Broch, David Maltz, David Johnson, Yih-Chun Hu and Jorjeta Jetcheva Computer Science Department Carnegie Mellon University
More informationOSPF Per-Interface Link-Local Signaling
OSPF Per-Interface Link-Local Signaling The OSPF Per-Interface Link-Local Signaling feature allows you to selectively enable or disable Link-Local Signaling (LLS) for a specific interface regardless of
More informationInterlayer routing issues for wireless networks
NRL Cross-Layer Workshop Interlayer routing issues for wireless networks June 2, 2004 Tom Henderson Marcelo Albuquerque Phil Spagnolo Jae H. Kim Boeing Phantom Works 1 Report Documentation Page Form Approved
More informationComputer Networks II
ipartimento di Informatica e Sistemistica omputer Networks II Routing protocols Overview Luca Becchetti Luca.Becchetti@dis.uniroma.it.. 2009/200 Goals escribe approaches and give overview of mechanisms
More informationOLSR Standards. Emmanuel BACCELLI. INRIA / Hitachi
OLSR Standards Emmanuel BACCELLI INRIA / Hitachi Main Topics Standardization of OSLR Where are we at? What are we dealing with? The IETF. The future of OLSR Standards and Concepts. Example: MANET WG (Mobile
More informationWireless Internet Routing. IEEE s
Wireless Internet Routing IEEE 802.11s 1 Acknowledgments Cigdem Sengul, Deutsche Telekom Laboratories 2 Outline Introduction Interworking Topology discovery Routing 3 IEEE 802.11a/b/g /n /s IEEE 802.11s:
More informationAdvanced Modeling and Simulation of Mobile Ad-Hoc Networks
Advanced Modeling and Simulation of Mobile Ad-Hoc Networks Prepared For: UMIACS/LTS Seminar March 3, 2004 Telcordia Contact: Stephanie Demers Robert A. Ziegler ziegler@research.telcordia.com 732.758.5494
More informationIntroduction to OSPF
Itroductio to OSPF ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 3 rd October
More informationEnergy Saving Routing Strategies in IP Networks
Energy Saving Routing Strategies in IP Networks M. Polverini; M. Listanti DIET Department - University of Roma Sapienza, Via Eudossiana 8, 84 Roma, Italy 2 june 24 [scale=.8]figure/logo.eps M. Polverini
More informationISP Operations Troubleshooting OSPF for IPv4 and IPv6
www.iparchitechs.com ISP Operations Troubleshooting OSPF for IPv4 and IPv6 P R E S E N T E D BY: KEVIN MYERS, NETWORK ARCHITECT Profile: About Kevin Myers Background: 19+ years in Networking Designed/Built
More informationRouting and Wavelength Assignment in All-Optical DWDM Transport Networks with Sparse Wavelength Conversion Capabilities. Ala I. Al-Fuqaha, Ph.D.
Routing and Wavelength Assignment in All-Optical DWDM Transport Networks with Sparse Wavelength Conversion Capabilities Ala I. Al-Fuqaha, Ph.D. Overview Transport Network Architectures: Current Vs. IP
More informationLAB15: OSPF IPv6. OSPF: Not So Stubby Area. Disclaimer
Page1 LAB15: OSPF IPv6 Disclaimer This Configuration Guide is designed to assist members to enhance their skills in respective technology area. While every effort has been made to ensure that all material
More informationThe Pennsylvania State University. The Graduate School. College of Engineering PERFORMANCE ANALYSIS OF END-TO-END
The Pennsylvania State University The Graduate School College of Engineering PERFORMANCE ANALYSIS OF END-TO-END SMALL SEQUENCE NUMBERS ROUTING PROTOCOL A Thesis in Computer Science and Engineering by Jang
More informationOSPF Link-State Database Overload Protection
OSPF Link-State Database Overload Protection The OSPF Link-State Database Overload Protection feature allows you to limit the number of nonself-generated link-state advertisements (LSAs) for a given Open
More informationPapers. Ad Hoc Routing. Outline. Motivation
CS 15-849E: Wireless Networks (Spring 2006) Ad Hoc Routing Discussion Leads: Abhijit Deshmukh Sai Vinayak Srinivasan Seshan Dave Andersen Papers Outdoor Experimental Comparison of Four Ad Hoc Routing Algorithms
More informationWireless Mesh Networks
Wireless Mesh Networks Renato Lo Cigno www.disi.unitn.it/locigno/teaching Part of this material (including some pictures) features and are freely reproduced from: Ian F.Akyildiz, Xudong Wang,Weilin Wang,
More informationBabel A flexible routing protocol
Babel A flexible routing protocol Juliusz Chroboczek PPS Université Paris-Diderot (Paris 7) 11 March 2014 1/33 The story In December 2006, I started on a quest to bring wifi to the Ph.D. students couch:
More informationIdentifying OSPF Anomalies Using Recurrence Quantification Analysis
Identifying OSPF Anomalies Using Recurrence Quantification Analysis Bahaa Al-Musawi and Philip Branch Faculty of Engineering, University of Kufa, Al-Najaf, Iraq School of Software and Electrical Engineering,
More informationIntroduction. Introduction ROBUST SENSOR POSITIONING IN WIRELESS AD HOC SENSOR NETWORKS. Smart Wireless Sensor Systems 1
ROBUST SENSOR POSITIONING IN WIRELESS AD HOC SENSOR NETWORKS Xiang Ji and Hongyuan Zha Material taken from Sensor Network Operations by Shashi Phoa, Thomas La Porta and Christopher Griffin, John Wiley,
More informationVulnerability modelling of ad hoc routing protocols a comparison of OLSR and DSR
5 th Scandinavian Workshop on Wireless Ad-hoc Networks May 3-4, 2005 Vulnerability modelling of ad hoc routing protocols a comparison of OLSR and DSR Mikael Fredin - Ericsson Microwave Systems, Sweden
More informationGrundlagen der Rechnernetze. Introduction
Grundlagen der Rechnernetze Introduction Overview Building blocks and terms Basics of communication Addressing Protocols and Layers Performance Historical development Grundlagen der Rechnernetze Introduction
More informationMore Efficient Routing Algorithm for Ad Hoc Network
More Efficient Routing Algorithm for Ad Hoc Network ENSC 835: HIGH-PERFORMANCE NETWORKS INSTRUCTOR: Dr. Ljiljana Trajkovic Mark Wang mrw@sfu.ca Carl Qian chunq@sfu.ca Outline Quick Overview of Ad hoc Networks
More informationInternet Routing Protocols Lecture 02 Intra-domain Routing
Internet Routing Protocol Lecture Intra-domain Routing dvanced Sytem Topic Lent Term, 8 Timothy G. Griffin Computer Lab Cambridge UK Shortet Path Generalize ditance to weighted etting igraph G = (V,E)
More informationCSE 123: Computer Networks
Total Points = 27 CSE 123: Computer Networks Homework 3 Solutions Out: 5/11, Due: 5/18 Problems 1. Distance Vector Routing [9 points] For the network shown below, give the global distance vector tables
More informationFoundations of Distributed Systems: Tree Algorithms
Foundations of Distributed Systems: Tree Algorithms Stefan Schmid @ T-Labs, 2011 Broadcast Why trees? E.g., efficient broadcast, aggregation, routing,... Important trees? E.g., breadth-first trees, minimal
More informationOSPF and MANET WG meetings, IETF64. OSPF MANET Design Team outbrief. November, Tom Henderson
OSPF and MANET WG meetings, IETF64 OSPF MANET Design Team outbrief November, 2005 Tom Henderson {thomas.r.henderson@boeing.com} Design team members: Emmanuel Baccelli, Madhavi Chandra, Thomas Clausen,
More informationOSPF Sham-Link MIB Support
This feature introduces MIB support for the OSPF Sham-Link feature through the addition of new tables and trap MIB objects to the Cisco OSPF MIB (CISCO-OSPF-MIB) and the Cisco OSPF Trap MIB (CISCO-OSPF-TRAP-MIB).
More informationA HYBRID GENETIC ALGORITHM FOR THE WEIGHT SETTING PROBLEM IN OSPF/IS-IS ROUTING
A HYBRID GENETIC ALGORITHM FOR THE WEIGHT SETTING PROBLEM IN OSPF/IS-IS ROUTING L.S. BURIOL, M.G.C. RESENDE, C.C. RIBEIRO, AND M. THORUP Abstract. Intra-domain traffic engineering aims to make more efficient
More informationSignature and Database Exchange for Wireless OSPF Interfaces
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Signature and Database Exchange for Wireless OSPF Interfaces Thomas Clausen Philippe Jacquet Emmanuel Baccelli N 5096 Janvier 2004 THÈME
More informationSecure Ad-Hoc Routing Protocols
Secure Ad-Hoc Routing Protocols ARIADNE (A secure on demand RoutIng protocol for Ad-Hoc Networks & TESLA ARAN (A Routing protocol for Ad-hoc Networks SEAD (Secure Efficient Distance Vector Routing Protocol
More informationA Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information
A Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information Xin Yuan Wei Zheng Department of Computer Science, Florida State University, Tallahassee, FL 330 {xyuan,zheng}@cs.fsu.edu
More informationDepartment of Computer Science and Engineering. CSE 3213: Communication Networks (Fall 2015) Instructor: N. Vlajic Date: Dec 13, 2015
Department of Computer Science and Engineering CSE 3213: Communication Networks (Fall 2015) Instructor: N. Vlajic Date: Dec 13, 2015 Final Examination Instructions: Examination time: 180 min. Print your
More informationSurvey of MANET based on Routing Protocols
Survey of MANET based on Routing Protocols M.Tech CSE & RGPV ABSTRACT Routing protocols is a combination of rules and procedures for combining information which also received from other routers. Routing
More informationDynamic TTL Variance Foretelling Based Enhancement Of AODV Routing Protocol In MANET
Latest Research Topics on MANET Routing Protocols Dynamic TTL Variance Foretelling Based Enhancement Of AODV Routing Protocol In MANET In this topic, the existing Route Repair method in AODV can be enhanced
More informationSemiring Pruning for Information Dissemination in Mobile Ad Hoc Networks
2009 First International Conference on Networks & Communications Semiring Pruning for Information Dissemination in Mobile Ad Hoc Networks Kiran K. Somasundaram, John S. Baras Institute of Systems Research
More informationPERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR P INCLUDING PROPAGATION MODELS
PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR 802.11P INCLUDING PROPAGATION MODELS Mit Parmar 1, Kinnar Vaghela 2 1 Student M.E. Communication Systems, Electronics & Communication Department, L.D. College
More informationRequest for Comments: 4750
Network Working Group Request for Comments: 4750 Obsoletes: 1850 Category: Standards Track D. Joyal, Ed. Nortel P. Galecki, Ed. Airvana S. Giacalone, Ed. CSFB Original Authors: R. Coltun Touch Acoustra
More informationRouting Algorithm Classification. A Distance Vector Routing Algorithm
Routing lgorithm lassification Global or decentralied information? Global: ll routers have complete topolog, link cost info Link state algorithms Decentralied: Router knows phsicallconnected neighbors,
More informationData Dissemination in Wireless Sensor Networks
Data Dissemination in Wireless Sensor Networks Philip Levis UC Berkeley Intel Research Berkeley Neil Patel UC Berkeley David Culler UC Berkeley Scott Shenker UC Berkeley ICSI Sensor Networks Sensor networks
More informationGAME THEORY MANET ROUTING FOR JAMMING ENVIRONMENT. Yi Zhu
GAME THEORY MANET ROUTING FOR JAMMING ENVIRONMENT by Yi Zhu A thesis submitted to the Faculty of the University of Delaware in partial fulfillment of the requirements for the degree of Master of Science
More informationNAVAL POSTGRADUATE SCHOOL THESIS
NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS PERFORMANCE ANALYSIS OF MOBILE AD HOC NETWORKING ROUTING PROTOCOLS by Lee Kok Thong December 24 Thesis Advisor: Second Reader: Geoffrey Xie Su Wen
More information