CSCD 433/533 Advanced Networks Spring 2016
|
|
- Simon Johns
- 5 years ago
- Views:
Transcription
1 CSCD 433/533 Advanced Networks Spring 2016 Lecture 13 Router Algorithms and Design Chapter 5 1
2 Topics Router Algorithms Routing in General Hierarchical routing Interior Gateway Protocols OSPF mention of RIP Brief Comparison Properties of OSPF OSPF Areas 2
3 Routing in General Recall Networks appear as graphs Abstraction where nodes are routers, switches or hosts Edges are links between nodes Physical or virtual Assign weight to them Network links are bi-directional Useful for modeling networks
4 Purpose of Routing Recall Routers interconnects two or more networks Two major problems in delivering packets in networks What are they? How to build forwarding tables in all network nodes How to do forwarding (efficiently) could say optimal
5 Routing Algorithms Ideally, how should routing work? Think long-term, Think globally, Think shared networks
6 Routing Algorithms Properties Robust Stable Fair Efficient Robust Should run for years without system-wide failure Expected - hardware and software failures Hosts, routers and lines will fail repeatedly, network topology change frequently Ideally, good routing algorithm should be able to cope with changes without rebooting network
7 Routing Algorithms Properties Stable Important goal for routing algorithm Routing algorithm should converge quickly to set of paths and stay there Communication may be disrupted until routing algorithm reaches equilibrium Fair Means traffic sources get a fair share of resources Should be equitable distribution across bandwidth
8 Routing Algorithms Properties Efficient What are we trying to optimize? Packet delay Number of hops or minimum distance packets must travel Ether way tends to improve delay and improve throughput!!!
9 Routing Properties More Questions How well do existing protocols achieve Robustness, Stability, Fairness and Efficiency? And How can a network be organized to improve upon these properties? Want routing to happen effortlessly No-one should notice it at all Alice and Bob can carry on endless conversations without interruption...
10 Routing Protocols Design Design decisions that affect routing performance include How often to send information to neighbors? How much information to send? Can we create hierarchy to reduce number of routers? And, number of router messages sent
11 Tiered Routing
12 Tiered Routing in Internet Network Gets Bigger Router table grows proportionally Router memory consumed by ever increasing tables More CPU time needed to scan Hierarchy Network divided up into regions Routers know only whats in their region Why is this good? Each router knows all details about routing in own region Does not need to know about internal structure of other regions 12
13 Aggregated Network vs. Reality AS Autonomous Systems BGP for links between regions The AS graph may look like this Other routing protocols within regions Reality may be closer to this
14 Tiered Routing in Internet Different networks Interconnected Natural to regard each one as a separate region Frees routers in one network from having to know topology of other networks Just Increasing from Single to Two level tables Reduced entries from 17 down to 7 Gains in space of table Design Question - Is there an optimal number of routing levels?
15 Hierarchical Routing 7 Entries 17 Entries Hierarchical Routing
16 Tiered Routing in Internet Answer to Question What is the optimal number of levels in routing? Hypothesized back in 1979 Optimal number of levels for N routers Is, ln N for N router subnet Requires a total of e ln N entries per level Began with Farouk Kamoun and Leonard Kleinrock paper, doi= &rep=rep1&type=pdf
17 Internet Organized into AS's Someone observed... Use Principle of Hierarchy to organize Internet and thus reduce routing tables in size Flat routing linearly increases routing table size Hierarchy, table size increases logarithmically Created Autonomous Systems as organization structure for routing (AS's) Mentioned in CSCD330
18 Active BGP Entries Source:
19 Hierarchy vs. Fully Connected What is the trade-off between fully connecting routers vs. more hierarchy? Hierarchy - More complexity Designate special purpose routers Protocols more complicated Will need backups for potential failures Fully Connected Router tables need more space More routers to run router algorithms Convergence take more time
20 AS Numbers (ASNs) ASNs are 16 bit values EWU: 3935 MIT: 3 Northwestern University: 103 UC San Diego: 7377 AT&T: 7018, 6341, 5074, UUNET: 701, 702, 284, 12199, Sprint: 1239, 1240, 6211, 6242, ASNs represent units of routing policy
21 Internet Organized into AS s Internet organized into a series of Administrative Systems Each controlled by a single administrative entity Distinct regions of administrative control Hierarchy of Autonomous Systems Large, tier-1 provider create network backbone Medium-sized regional provider with smaller backbone Small network run by a single company or university Like EWU 21
22 Autonomous System Defined A collection of routers under same technical and administrative domain Each AS, has globally unique number assigned to them from a centralized authority (ARIN) The American Registry for Internet Numbers (ARIN) Responsible for tracking and assigning these numbers 22
23 Org Chart for ICAAN and IANA ICAAN
24 AS Based Routing in Internet Two Types of Internet Routing 1. Interdomain routing between ASes Routing policies based on Business relationships No common metrics, and limited cooperation BGP: policy-based, path-vector routing protocol 2. Intradomain routing within an AS Shortest-path routing based on Link metrics Routers all managed by single institution OSPF and IS-IS: link-state routing protocol RIP and EIGRP: distance-vector routing protocol 24
25 OSPF and little bit of RIP
26 Link State Algorithm Terms Link Interface on a router LS - Link state Description of interface and of its relationship to its neighboring routers, including: IP address/mask of the interface, The type of network it is connected to The routers connected to that network The metric (cost) of that link LSA - Link State Advertisements LSDB - The collection of all the link-states would form a link-state database.
27 27 Brief Review of RIP Original Interior AS protocol Works well in small systems Maximum hop count is 15 Only uses hop count as link weight Sends entire database every 30 seconds Only sends to its neighbors Suffers from problems Count to Infinity Problem Slow Convergence
28 28 Review of OSPF Broadcasts link-state advertisements (LSAs) to all other routers, when change in link status Also, broadcasts state Once every 30 minutes, even if link state not changed!!! OSPF cost advertised in LSAs (Link State Advertisements) Can configure cost Delay, data rate, monetary cost, or other factors Cisco s OSPF metric based on bandwidth
29 OSPF Operation OSPF Over time, OSPF routers gather received LSAs into LSDB Synchronize LSDBs between all neighboring routers Every router has same LSDB From LSDB, entries for router s routing table are calculated using Djikstra's SPF Algorithm Looked at an example in CSCD330 29
30 Choosing the Best Path From RouterA - After running Djikstra's Algorithm Shortest Path First Best routes identified / /8 15 B / /8 A / /8 2 C /8 D / /8 E / /8 30
31 Results Put into Routing Table RouterA s Routing Table /8 connected e /8 connected s /8 connected s /8 connected s /8 17 s /8 17 s /8 4 s / /8 4 s1 e /8 14 s /8 6 s /8 16 s /8 s0 A s2 s / / /8 B C D / / / / /8 E /8 2
32 OSPF Hierarchy
33 33 OSPF Adds Hierarchy OSPF Areas Were defined to limit reachability of routers in large networks Areas puts boundaries on explosion of link-state updates Flooding and calculation of Dijkstra's algorithm on a router is limited to changes within an area
34 Multiple OSPF Areas, WHY? Three issues can overwhelm an OSPF router in heavily populated OSPF network 1.High demand for router processing and memory resources 2.Large routing tables, and 3.Large topology tables OSPF allows large areas to be separated into smaller, more manageable areas
35 More Terms for OSPF Internal router Routers that have all their interfaces within the same area are called internal routers Internal routers in the same area have identical link-state databases and run a single copy of the routing algorithm. Area Border Router (ABR) Router that has an interface to a specific area and also the Backbone area, Area 0 Autonomous System Border Router (ASBR) These routers can import non-ospf network information to the OSPF network, and vice versa this is referred to as redistribution
36 Optimization of OSPF Area Why? An identical LSDB only in its area. Detailed LSAs Area 0 stopped at the area bondary. Area 1 Area 2 No detailed knowledge of the topology outside of area 1. The necessary databases require more memory. The complex algorithm requires more CPU time. So, fewer LSAs, The flooding less impact of LSAs on adversely the CPU, affects less demand for system resources. available bandwidth, particularly in unstable internetworks. 36
37 Areas Make OSPF Scalable Area: Collection of OSPF routers. Every OSPF router must belong to at least one area Every OSPF network must have an Area 0 (backbone area) All other Areas should touch Area 0 Routers in same area have same link-state database Creates a tree-like structure with Area 0 as root 37
38 38 Traffic Types Three types of traffic: Intra-area Traffic Inter-area Traffic External AS External Traffic
39 Router Types Backbone Router Autonomous system Boundary Router (ASBR) Area Border Router (ABR) External AS Internal Router Note: ABR are also Backbone Routers. 39
40 Network Hierarchy Transit Area (Backbone Area or Area 0) Nonbackbone Area Q: What is the backbone used for? 40
41 Network Hierarchy Backbone Area Area 0 Area 19 Area 12 Area 13 This prevents routing loops because is now hierarchy within areas Routers are not all equal and there is limited passage of LSA's by area 41
42 LSA types Type Code Description Produced by 1 Router LSA Each router 2 Network LSA DR 3 Network Summary LSA ABR 4 ASBR Summary LSA ABR 5 AS External LSA ASBR 6 Group Membership LSA 7 NSSA External LSA ASBR 8 External Attributes LSA for BGP 9 Opaque LSA (link-local scope) not been deployed 42
43 LS Type Advertisements 1. Router Link advertisements. Generated by each router for each area it belongs to. They describe the states of the router's link to the area. These are only flooded within a particular area. 2. Network Link advertisements. Generated by Designated Routers. They describe the set of routers attached to a particular network. Flooded in the area that contains the network 3 or 4. Summary Link advertisements. Generated by Area Border routers. They describe inter-area (between areas) routes. Type 3 describes routes to networks, also used for aggregating routes Type 4 describes routes to ASBR. 5. AS external link advertisements. Originated by ASBR. They describe routes to destinations external to the AS. Flooded all over except stub areas.
44 LS Type Advertisement 1 Router Link advertisements. Generated by each router for each area it belongs to. They describe the states of the router's link to the area. These are only flooded within a particular area.
45 Router LSA (Type1) Produced by every router in an area. Now, LSA type1 is produced by Identified by the router ID of the originating router. RID: Link1 Link2 Area0 Floods within its area only, does not cross ABR. Area1 Area2 Includes list of directly attached links. 45
46 LS Type Advertisement 2 Network Link advertisements. Generated by Designated Routers. They describe the set of routers attached to a particular network. Flooded in the area that contains the network. 46
47 Network LSA (Type2) Network (type 2) LSA for each transit broadcast or NBMA network in an area. Originated by the DR of broadcast network. Includes subnet mask of link. RID: Link: /29 Area0 Floods within its area only, does not cross ABR. RID: Area1 Area2 Describes the network and list of attached routers. 47
48 LS Link Advertisement 3 or 4 Summary Link advertisements. Generated by Area Border routers. They describe inter-area (between areas) routes. Type 3 describes routes to networks, also used for aggregating routes Type 4 describes routes to ASBR. 48
49 49 Network Summary LSA( Type3) Also advertises the intra-area and inter-area routes into the backbone LSA type3 is originated by the ABR of originating area. Link: /2 4 Area0 Also advertises the intra-area and interarea routes into the backbone. Link: / 28 Tells the internal Routers what destinations the ABR can reach The destination is network which ABR can reach Area1 Through a single area, and belonging to the AS. Area2
50 ASBR Summary LSA (Type 4) RIP ASBR( ) LSA type4 is originated by the ABR of originating area. Area0 The destination they advertise is an ASBR router. Area1 Area2 Type 4 LSA is identical to Type3 LSAs, except that the destination they advertise is an ASBR router. 50
51 LS Type Advertisement 5 AS external link advertisements. Originated by ASBR. They describe routes to destinations external to the AS. Flooded all over except stub areas. 51
52 External LSAs (Type5) / LSA type 5 is originated by the ASBR of originating area. ASBR( ) Area0 The Destination external to the OSPF AS. Area1 Type 5 LSAs, the only type flooded throughout the entire AS. Area2 52
53 53 Types of Areas Backbone Area Stub Area Totally Stubby Area NSSAs (Not-so-stubby Area) Not Backbone Not Stubby Area (Regular)
54 Stub Areas and Not So Stubby Areas Stub Area is A stub area is an area into which AS External LSAs are not flooded. Not so stubby Area is Allows the injection of external routes in a limited fashion into the stub area. Why? In many cases, these External LSAs may make up a large percentage of the LSAs in the databases of every router And, not every router needs to know about all the external destinations 54
55 Stub Area Rules LSAs type 4&5 are blocked. LSAs type 3&4&5 are blocked. Stub areas cannot have an ASBR, and they should have one ABR. There can be two or more ABRs, but because of default route, suboptimal routing paths to external autonomous systems can occur. Stub areas must not have virtual links going through them. 55
56 LSA Types Allowed Per Area Type Area Type 1&2 3&4 5 7 Backbone (area 0) Yes Yes Yes No Non-backbone, non-stub Yes Yes Yes No Stub Yes Yes No No Totally stubby Yes No * No No Not-so-stubby Yes Yes No Yes Except for a single type 3 LSA per ABR, advertising the default route. 56
57 Summary Advantages: Fast Converge. Loop-free Hierarchical Management. Authentication Supported. Suitable for Large-scale Network. Disadvantages: Complicated Configuration. Equal priority Load balance. 57
58 This week, Reminder, no Lab due to Takehome Midterm Takehome Midterm on Wednesday 58
59 1
60
61
62
63
64
65
66
67
68 Routing Protocols Design Design decisions that affect routing performance include How often to send information to neighbors? How much information to send? Can we create hierarchy to reduce number of routers? And, number of router messages sent 10
69
70
71 13
72
73
74
75
76 Active BGP Entries 5/2/16 18 Source:
77 Hierarchy vs. Fully Connected What is the trade-off between fully connecting routers vs. more hierarchy? Hierarchy - More complexity Designate special purpose routers Protocols more complicated Will need backups for potential failures Fully Connected Router tables need more space More routers to run router algorithms Convergence take more time 19
78 20
79
80
81 Org Chart for ICAAN and IANA ICAAN 23
82
83
84
85
86
87
88 A 30
89 31
90 OSPF Hierarchy 32 32
91
92
93 More Terms for OSPF Internal router Routers that have all their interfaces within the same area are called internal routers Internal routers in the same area have identical link-state databases and run a single copy of the routing algorithm. Area Border Router (ABR) Router that has an interface to a specific area and also the Backbone area, Area 0 Autonomous System Border Router (ASBR) These routers can import non-ospf network information to the OSPF network, and vice versa this is referred to as redistribution 35
94 Optimization of OSPF Area Why? An identical LSDB only in its area. Detailed LSAs Area 0 stopped at the area bondary. Area 1 Area 2 No detailed knowledge of the topology outside of area 1. The necessary databases require more memory. The complex algorithm requires more CPU time. So, fewer LSAs, The flooding less impact of LSAs on adversely the CPU, affects less demand for system resources. available bandwidth, particularly in unstable internetworks. 36 Dividing an internetwork into areas is a response to three concerns commonly expressed about link state protocols. The necessary databases require more memory than a distance vector protocol requires. The complex algorithm requires more CPU time than a distance vector protocol requires. The flooding of link state packets adversely affects available bandwidth, particularly in unstable internetworks. No detailed knowledge of the topology outside of their area. An identical link state database only in its area Most flooding limited to the area. Smaller link state databases, fewer LSAs, less impact on the CPU. 36
95
96 Traffic Types Three types of traffic: Intra-area Traffic Inter-area Traffic External AS External Traffic 38
97 Router Types Backbone Router Autonomous system Boundary Router (ASBR) Area Border Router (ABR) External AS Internal Router Note: ABR are also Backbone Routers. 39 Internal Routers are routers whose interfaces all belong to the same area. These routers have a single link state database. Area Border Routers (ABRs) connect one or more areas to the backbone and act as a gateway for inter-area traffic. An ABR always has at least one interface that belongs to the backbone, and must maintain a separate link state database for each of its connected areas. For this reason, ABRs often have more memory and perhaps more powerful processors than internal routers. An ABR will summarize the topological information of its attached areas into the backbone, which will then propagate the summary information to the other areas. Backbone Routers are routers with at least one interface attached to the backbone. Although this requirement means that ABRs are also Backbone Routers, Figure 9.21 shows that not all Backbone Routers are ABRs. An Internal Router whose interfaces all belong to area 0 is also a Backbone Router. Autonomous System Boundary Routers (ASBRs) are gateways for external traffic, injecting routes into the OSPF domain that were learned (redistributed) from some other protocol, such as the BGP and EIGRP processes shown in Figure An ASBR can be located anywhere within the OSPF autonomous system; it may be an Internal, Backbone, or ABR. 39
98 Network Hierarchy Transit Area (Backbone Area or Area 0) Nonbackbone Area Q: What is the backbone used for? 40 It is best to avoid the need for them by ensuring that areas, particularly backbone areas, are designed with redundant links to prevent partitioning. When two or more internetworks are merged, sufficient planning should take place beforehand so that no area is left without a direct link to the backbone. 40
99 Network Hierarchy Backbone Area Area 0 Area 19 Area 12 Area 13 This prevents routing loops because is now hierarchy within areas Routers are not all equal and there is limited passage of LSA's by area 41
100 LSA types Type Code Description Produced by 1 Router LSA Each router 2 Network LSA DR 3 Network Summary LSA ABR 4 ASBR Summary LSA ABR 5 AS External LSA ASBR 6 Group Membership LSA 7 NSSA External LSA ASBR 8 External Attributes LSA for BGP 9 Opaque LSA (link-local scope) not been deployed 42
101 LS Type Advertisements 1. Router Link advertisements. Generated by each router for each area it belongs to. They describe the states of the router's link to the area. These are only flooded within a particular area. 2. Network Link advertisements. Generated by Designated Routers. They describe the set of routers attached to a particular network. Flooded in the area that contains the network 3 or 4. Summary Link advertisements. Generated by Area Border routers. They describe inter-area (between areas) routes. Type 3 describes routes to networks, also used for aggregating routes Type 4 describes routes to ASBR. 5. AS external link advertisements. Originated by ASBR. They describe routes to destinations external to the AS. Flooded all over except stub areas. 43
102 LS Type Advertisement 1 Router Link advertisements. Generated by each router for each area it belongs to. They describe the states of the router's link to the area. These are only flooded within a particular area. 44
103 Router LSA (Type1) Produced by every router in an area. Now, LSA type1 is produced by Identified by the router ID of the originating router. RID: Link1 Link2 Area0 Floods within its area only, does not cross ABR. Area1 Area2 Includes list of directly attached links. 45
104 LS Type Advertisement 2 Network Link advertisements. Generated by Designated Routers. They describe the set of routers attached to a particular network. Flooded in the area that contains the network. 46
105 Network LSA (Type2) Network (type 2) LSA for each transit broadcast or NBMA network in an area. Originated by the DR of broadcast network. Includes subnet mask of link. RID: Link: /29 Area0 Floods within its area only, does not cross ABR. RID: Area1 Area2 Describes the network and list of attached routers. 47
106 LS Link Advertisement 3 or 4 Summary Link advertisements. Generated by Area Border routers. They describe inter-area (between areas) routes. Type 3 describes routes to networks, also used for aggregating routes Type 4 describes routes to ASBR. 48
107 Network Summary LSA( Type3) Also advertises the intra-area and inter-area routes into the backbone LSA type3 is originated by the ABR of originating area. Link: /2 4 Area0 Also advertises the intra-area and interarea routes into the backbone. Link: / 28 Tells the internal Routers what destinations the ABR can reach The destination is network which ABR can reach Area1 Through a single area, and belonging to the AS. Area2 49 When another router receives a Network Summary LSA from an ABR, it does not run the SPF algorithm. Rather, it simply adds the cost of the route to the ABR and the cost included in the LSA. A route to the advertised destination, via the ABR, is entered into the route table along with the calculated cost. This behavior depending on an intermediate router instead of determining the full route to the destination is distance vector behavior. So, while OSPF is a link state protocol within an area, it uses a distance vector algorithm to find inter-area routes.[13] [13] This distance vector behavior is the reason for requiring a backbone area and requiring that all inter-area traffic pass through the backbone. By forming the areas into what is essentially a hub-and-spoke topology, the route loops to which distance vector protocols are prone are avoided. 49
108 ASBR Summary LSA (Type 4) RIP ASBR( ) LSA type4 is originated by the ABR of originating area. Area0 The destination they advertise is an ASBR router. Area1 Area2 Type 4 LSA is identical to Type3 LSAs, except that the destination they advertise is an ASBR router. 50 When another router receives a Network Summary LSA from an ABR, it does not run the SPF algorithm. Rather, it simply adds the cost of the route to the ABR and the cost included in the LSA. A route to the advertised destination, via the ABR, is entered into the route table along with the calculated cost. This behavior depending on an intermediate router instead of determining the full route to the destination is distance vector behavior. So, while OSPF is a link state protocol within an area, it uses a distance vector algorithm to find inter-area routes.[13] [13] This distance vector behavior is the reason for requiring a backbone area and requiring that all inter-area traffic pass through the backbone. By forming the areas into what is essentially a hub-and-spoke topology, the route loops to which distance vector protocols are prone are avoided. 50
109 LS Type Advertisement 5 AS external link advertisements. Originated by ASBR. They describe routes to destinations external to the AS. Flooded all over except stub areas. 51
110 External LSAs (Type5) / LSA type 5 is originated by the ASBR of originating area. ASBR( ) Area0 The Destination external to the OSPF AS. Area1 Type 5 LSAs, the only type flooded throughout the entire AS. Area2 52 When another router receives a Network Summary LSA from an ABR, it does not run the SPF algorithm. Rather, it simply adds the cost of the route to the ABR and the cost included in the LSA. A route to the advertised destination, via the ABR, is entered into the route table along with the calculated cost. This behavior depending on an intermediate router instead of determining the full route to the destination is distance vector behavior. So, while OSPF is a link state protocol within an area, it uses a distance vector algorithm to find inter-area routes.[13] [13] This distance vector behavior is the reason for requiring a backbone area and requiring that all inter-area traffic pass through the backbone. By forming the areas into what is essentially a hub-and-spoke topology, the route loops to which distance vector protocols are prone are avoided. 52
111 Types of Areas Backbone Area Stub Area Totally Stubby Area NSSAs (Not-so-stubby Area) Not Backbone Not Stubby Area (Regular) 53
112 Stub Areas and Not So Stubby Areas Stub Area is A stub area is an area into which AS External LSAs are not flooded. Not so stubby Area is Allows the injection of external routes in a limited fashion into the stub area. Why? In many cases, these External LSAs may make up a large percentage of the LSAs in the databases of every router And, not every router needs to know about all the external destinations 54 The performance of routers within a stub area can be improved, and memory conserved, by the reduced size of their databases. Of course, the improvement will be more marked in internetworks with a large number of type 5 LSAs. There are, however, four restrictions on stub areas 54
113 Stub Area Rules LSAs type 4&5 are blocked. LSAs type 3&4&5 are blocked. Stub areas cannot have an ASBR, and they should have one ABR. There can be two or more ABRs, but because of default route, suboptimal routing paths to external autonomous systems can occur. Stub areas must not have virtual links going through them. 55 Totally stubby areas use a default route to reach not only destinations external to the autonomous system but also all destinations external to the area. The ABR of a totally stubby area will block not only AS External LSAs but also all Summary LSAs with the exception of a single type 3 LSA to advertise the default route. 55
114 LSA Types Allowed Per Area Type Area Type 1&2 3&4 5 7 Backbone (area 0) Yes Yes Yes No Non-backbone, non-stub Yes Yes Yes No Stub Yes Yes No No Totally stubby Yes No * No No Not-so-stubby Yes Yes No Yes Except for a single type 3 LSA per ABR, advertising the default route. 56
115 Summary Advantages: Fast Converge. Loop-free Hierarchical Management. Authentication Supported. Suitable for Large-scale Network. Disadvantages: Complicated Configuration. Equal priority Load balance. 57
116
Introduction 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 informationPlanning for Information Network
Planning for Information Network Lecture 8: Network Routing Protocols Assistant Teacher Samraa Adnan Al-Asadi 1 Routing protocol features There are many ways to characterize routing protocols, including
More 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 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 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 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 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 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 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 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 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 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 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 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 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 informationCS 43: Computer Networks. 24: Internet Routing November 19, 2018
CS 43: Computer Networks 24: Internet Routing November 19, 2018 Last Class Link State + Fast convergence (reacts to events quickly) + Small window of inconsistency Distance Vector + + Distributed (small
More informationOSPF Demand Circuit Feature
OSPF Demand Circuit Feature Document ID: 5132 Contents Introduction Prerequisites Requirements Components Used Conventions How Is OSPF over Demand Circuit Different from a Normal Circuit? Suppressed Periodic
More informationStandard Areas OSPF AREA TYPES:
OSPF AREA TYPES: OSPF relies on several types of Link State Advertisements (LSAs) to communicate link state information between neighbors. A brief review of the most applicable LSA types: Type 1 - Represents
More informationWhy dynamic route? (1)
Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update
More 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 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 informationCS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017
CS 43: Computer Networks Internet Routing Kevin Webb Swarthmore College November 16, 2017 1 Hierarchical routing Our routing study thus far - idealization all routers identical network flat not true in
More 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 informationCS 640: Introduction to Computer Networks. Intra-domain routing. Inter-domain Routing: Hierarchy. Aditya Akella
CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol) Intra-domain routing The Story So Far Routing protocols generate the forwarding
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 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 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 informationBGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Daniel Zappala CS 460 Computer Networking Brigham Young University 2/20 Scaling Routing for the Internet scale 200 million destinations - can t store all destinations or all prefixes in routing tables
More 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 informationCSCE 463/612 Networks and Distributed Processing Spring 2018
CSCE 463/612 Networks and Distributed Processing Spring 2018 Network Layer IV Dmitri Loguinov Texas A&M University April 12, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter
More 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 informationLink State Routing. Link State Packets. Link State Protocol. Link State Protocols Basic ideas Problems and pitfalls
Link State Routing In particular OSPF Karst Koymans Informatics Institute University of Amsterdam (version 16.3, 2017/03/09 11:25:31) Tuesday, March 7, 2017 Link State Protocols Basic ideas Problems and
More 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 informationCCNA 3 (v v6.0) Chapter 6 Exam Answers % Full
CCNA 3 (v5.0.3 + v6.0) Chapter 6 Exam Answers 2017 100% Full ccnav6.com /ccna-3-v5-0-3-v6-0-chapter-6-exam-answers-2017-100-full.html CCNA Exam Answers 2017 CCNA 3 (v5.0.3 + v6.0) Chapter 6 Exam Answers
More informationInternet Routing : Fundamentals of Computer Networks Bill Nace
Internet Routing 14-740: Fundamentals of Computer Networks Bill Nace Material from Computer Networking: A Top Down Approach, 6 th edition. J.F. Kurose and K.W. Ross Looking Ahead Lab #2 just due Quiz #2
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 informationLecture 16: Interdomain Routing. CSE 123: Computer Networks Stefan Savage
Lecture 16: Interdomain Routing CSE 123: Computer Networks Stefan Savage Overview Autonomous Systems Each network on the Internet has its own goals Path-vector Routing Allows scalable, informed route selection
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 informationSEMESTER 2 Chapter 3 Introduction to Dynamic Routing Protocols V 4.0
SEMESTER 2 Chapter 3 Introduction to Dynamic Routing Protocols V 4.0 3.1.1 What are the four routing RIP, RIPv2, EIGRP, OSPFv2 protocols that are the focus of this course? 3.1.1.2 What are routing protocols?
More informationIP Addressing & Interdomain Routing. Next Topic
IP Addressing & Interdomain Routing Next Topic IP Addressing Hierarchy (prefixes, class A, B, C, subnets) Interdomain routing Application Presentation Session Transport Network Data Link Physical Scalability
More informationInter-AS routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley
Inter-AS routing Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley Some materials copyright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved Chapter 4:
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 informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department of Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Stephan Günther
More informationImportant Lessons From Last Lecture Computer Networking. Outline. Routing Review. Routing hierarchy. Internet structure. External BGP (E-BGP)
Important Lessons From Last Lecture 15-441 Computer Networking Inter-Domain outing BGP (Border Gateway Protocol) Every router needs to be able to forward towards any destination Forwarding table must be
More 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 informationLast time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm
Last time Transitioning to IPv6 Tunneling Gateways Routing Graph abstraction Link-state routing Dijkstra's Algorithm Distance-vector routing Bellman-Ford Equation 10-1 This time Distance vector link cost
More informationRouting 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 informationUnicast Routing. Information About Layer 3 Unicast Routing CHAPTER
CHAPTER 1 This chapter introduces the underlying concepts for Layer 3 unicast routing protocols in Cisco 1000 Series Connected Grid Routers (hereafter referred to as the Cisco CG-OS router) and WAN backhaul
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 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 informationChapter 7 Routing Protocols
Chapter 7 Routing Protocols Nonroutable Protocols In the early days of networking, networks were small collections of computers linked together For the purposes of sharing information and expensive peripherals
More informationBasic Idea. Routing. Example. Routing by the Network
Basic Idea Routing Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:
More informationRouting in the Internet
Routing in the Internet Daniel Zappala CS 460 Computer Networking Brigham Young University Scaling Routing for the Internet 2/29 scale 200 million destinations - can t store all destinations or all prefixes
More informationTwo types of routing protocols are used in internetworks: interior gateway protocols (IGPs) and exterior gateway protocols (EGPs).
Introduction Dynamic routing is when protocols are used to find networks and update routing tables on routers. True, this is easier than using static or default routing, but it ll cost you in terms of
More informationImplementing Cisco IP Routing E-Learning
Implementing Cisco IP Routing E-Learning Duration: 1 Day Course Code: E-ROUTE Overview: In this course, administrators of medium-to-large network sites will learn to use advanced routing to provide scalability
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 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 informationOverview. Information About Layer 3 Unicast Routing. Send document comments to CHAPTER
CHAPTER 1 This chapter introduces the basic concepts for Layer 3 unicast routing protocols in Cisco NX-OS. This chapter includes the following sections: Information About Layer 3 Unicast Routing, page
More 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 informationNetwork Layer, Part 2 Routing. Terminology
Network Layer, Part Routing These slides are created by Dr. Huang of George Mason University. Students registered in Dr. Huang s courses at GMU can make a single machine readable copy and print a single
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 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 informationChapter 4: Advanced Internetworking. Networking CS 3470, Section 1
Chapter 4: Advanced Internetworking Networking CS 3470, Section 1 Intra-AS and Inter-AS Routing a C C.b b d A A.a a b A.c c B.a a B c Gateways: perform inter-as routing amongst themselves b perform intra-as
More 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 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 informationCisco Building Scaleable Cisco Internetworks (BSCI) Practice Test. Version https://certkill.com
Cisco 642-901 642-901 Building Scaleable Cisco Internetworks (BSCI) Practice Test Version 2.12 QUESTION NO: 1 Cisco 642-901: Practice Exam A company has a BGP network and a BGP route of 196.27.125.0/24
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 information9.1. Routing Protocols
9.1. Routing Protocols Each organization that has been assigned a network address from an ISP is considered an autonomous system (AS). That organization is free to create one large network, or divide the
More informationHands-On ROUTE Implementing Cisco IP Routing CCNP Course 1
Hands-On CCNP Course 1 Course Description Revised CCNP Curriculum and Exams Cisco has redesigned the CCNP courses and exams to reflect the evolving job tasks of global network professionals. Course 1 ROUTE
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 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 informationLink State Routing. Link State Packets. Link State Protocol. Link State Protocols Basic ideas Problems and pitfalls
Link State Routing In particular OSPF Karst Koymans Informatics Institute University of Amsterdam (version 17.4, 2017/11/30 12:33:57) Tuesday, November 28, 2017 Link State Protocols Basic ideas Problems
More 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 informationChapter 7: Routing Dynamically. Routing & Switching
Chapter 7: Routing Dynamically Routing & Switching The Evolution of Dynamic Routing Protocols Dynamic routing protocols used in networks since the late 1980s Newer versions support the communication based
More informationCCNA 3 (v v6.0) Chapter 6 Exam Answers % Full
CCNA 3 (v5.0.3 + v6.0) Chapter 6 Exam Answers 2017 100% Full ccnav6.com /ccna-3-v5-0-3-v6-0-chapter-6-exam-answers-2017-100-full.html CCNA Exam Answers 2017 CCNA 3 (v5.0.3 + v6.0) Chapter 6 Exam Answers
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 informationCourse Routing Classification Properties Routing Protocols 1/39
Course 8 3. Routing Classification Properties Routing Protocols 1/39 Routing Algorithms Types Static versus dynamic Single-path versus multipath Flat versus hierarchical Host-intelligent versus router-intelligent
More informationCSE 461 Interdomain routing. David Wetherall
CSE 461 Interdomain routing David Wetherall djw@cs.washington.edu Interdomain routing Focus: Routing across internetworks made up of different parties Route scaling Application Route policy Transport The
More informationCS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 14, 2013
CS 43: Computer Networks Internet Routing Kevin Webb Swarthmore College November 14, 2013 1 Reading Quiz Hierarchical routing Our routing study thus far - idealization all routers identical network flat
More informationBTEC Level 3 Extended Diploma
BTEC Level 3 Extended Diploma Unit 9 Computer Network Routing and Routing Protocols BTEC Level 3 Extended Diploma Introduction to Routing Routing is the process that a router uses to forward packets toward
More 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 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 informationConfiguring OSPF. Finding Feature Information. Last Updated: June 24, 2011
Configuring OSPF Finding Feature Information Configuring OSPF Last Updated: June 24, 2011 This module describes how to configure Open Shortest Path First (OSPF). OSPF is an Interior Gateway Protocol (IGP)
More informationIntroduction to Routing
1 Introduction to Routing Session 2 Presentation_ID.scr 1 Agenda Addressing Concepts Routing Protocols Statics and Defaults 3 ISO OSI Reference Model Routing Information Protocol (RIP and RIPv2) L7 L6
More informationRouting. 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 informationOutline Computer Networking. Inter and Intra-Domain Routing. Internet s Area Hierarchy Routing hierarchy. Internet structure
Outline 15-441 15-441 Computer Networking 15-641 Lecture 10: Inter-Domain outing Border Gateway Protocol -BGP Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 outing hierarchy Internet structure
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 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 informationThe Quickest Way To Get Certified (BSCI ) TestKing's Building Scalable Cisco Internetworks. Version 20.
WWW.REAL-EXAMS.NET The Quickest Way To Get Certified 642-801 (BSCI ) TestKing's Building Scalable Cisco Internetworks Version 20.1 WWW.REAL-EXAMS.NET Please Read Carefully This Study Guide has been carefully
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 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 informationRouting, Routing Algorithms & Protocols
Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a
More informationAny individual involved in implementation and verification of routing protocols in the enterprise networks
IMPLEMENTING CISCO IP ROUTING Information Length: 5 Days Courseware : Course code: Delivery Type Included CIS_ROUTE Classroom Description Implementing Cisco IP Routing (ROUTE) v1.0 is a five-day course
More informationDynamics of Hot-Potato Routing in IP Networks
Dynamics of Hot-Potato Routing in IP Networks Jennifer Rexford AT&T Labs Research http://www.research.att.com/~jrex Joint work with Renata Teixeira (UCSD), Aman Shaikh (AT&T), and Timothy Griffin (Intel)
More informationInter-domain Routing. Outline. Border Gateway Protocol
Inter-domain Routing Outline Border Gateway Protocol Internet Structure Original idea CS 640 2 Internet Structure Today CS 640 3 Route Propagation in the Internet Autonomous System (AS) corresponds to
More informationThis chapter covers the following subjects:
This chapter covers the following subjects: Link-State Routing Protocol and OSPF Concepts Balanced Hybrid Routing Protocol and EIGRP Concepts OSPF Configuration EIGRP Configuration C H A P T E R 6 OSPF
More informationInterplay Between Routing, Forwarding
Internet Routing 1 Interplay Between Routing, Forwarding routing algorithm local forwarding table header value output link 0100 0101 0111 1001 3 1 value in arriving packet s header 0111 3 1 Graph Abstraction
More informationCSCD 330 Network Programming Spring 2018
CSCD 330 Network Programming Spring 018 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 017 1 Network
More 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 informationCSCD 330 Network Programming Spring 2017
CSCD 330 Network Programming Spring 017 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 1996-007
More information