Skip to content

Network Ninja

The Long Road to Cisco

  • Home
  • About
  • Legal Disclaimer
  • Archives

Less
More
Trim
Untrim
« Older
Home
Loading
Newer »

Archive for the 'DR' Category

Open Shortest Path First – OSPF Fundamentals – Scenario

Published
by
Deon Botha
on June 29, 2009
in BSCI, BSCI Questions, Certification, Cisco Systems, Concepts and Constructs, DR and OSPF
. 1 Comment

GIVEN: For a Given Network, all routers share a common multi-access segment. One router is elected the Designated Router (DR) and another is elected the Backup Designated Router (BDR).

1. Which Parameter determines the router that will be selected as the DR in an OSPF network?

The router with the Highest OSPF Priority on a particular network segment will become the designated router (more info).  The DR default OSPF priority for a Cisco Router is 1 but can be manually changed. If there are multiple routers with default OSPF Priority then the Routers elect a Designated Router using the Router ID (more info) (RID) which is basically the highest IP Address with loopbacks being preferred (if configured)

2. Could a router with a priority value of zero assume the role of a DR or a BDR in the OSPF?

An OSPF Priority of 0 (zero) means that the Router is not eligible to be elected for either DR or BDR. The zero interface state is DROTHER. 

3. How is the OSPF router ID determined on a Cisco Router?

The OSPF Router ID (RID) on a Cisco Router is determined by the highest IP address configured on an interface (if not manually configured), or IP Address on a loopback interface.

4. What is the role of the DR and BDR in the OSPF network?

The role of the DR and BDR in an OSPF Network is to handle and monitor adjacencies with other routers in the network. This is because in an OSPF network adjacencies grow at a quadratic rate. This means that instead of exchanging routing information with all other routers the routers exchange information with the DR and BDR. Then in turn the DR and BDR relay the information to other routers.

Resources:

Stewart, B,D., Gough, C (2008). CCNP BSCI Official Exam Certification Guide, Fourth Edition. Indianapolis: Cisco Press.

Notes and Notices: This is a part of my personal BSCI notes and research to assist myself in learning and understanding the concepts and theory for the BSCI exam. I learn by making notes reading and writing things down and wish to file them where I cannot lose them. These notes are not to be seen, judged or mistaken for replacements to Cisco recognized and authorized training which I personally support and attend and suggest you undertake if you are going for the BSCI Certification.

Open Shortest Path First – OSPF Fundamentals – Multiple Areas

Published
by
Deon Botha
on March 3, 2009
in BDR, BSCI, BSCI Notes, Certification, Cisco Systems, Concepts and Constructs, DR and OSPF
. 0 Comments

An OSPF area is a logical grouping of routers that runs OSPF with identical topological databases. An area is a subdivision of the OSPF routing domain. Each area runs SPF separately and summaries are passed between each area.

OSPF AREAS

Problems associated with OSPF in a Single Area

Consider a growing OSPF network with a single area. Several problems come out in relation to capacity capabilities:

  • The SPF algorithm runs more frequently the larger the network gets, the greater the probability of a network change and a recalculation of the entire area (iow the more resources OSPF chews up).  Each of these recalculations in a large network takes longer and involves more “work” with each recalculation for a small area (the expenditure of scarce resources time, cpu, memory, etc).
  • The larger the OSPF area, the greater the size of the routing table (duh). The routing table is not sent out (like in Distance Vector Routing Protocols). In OSPF this means that the the greater the size of the table the longer the lookup becomes. The memory requirements on the router also increase as the size of the routing table increases.
  • In a large network, the routers topological database increases in size and eventually becomes unmanageable (the topological database is exchanged between adjacent routers at least every 30 minutes).

As the various databases (Routing Table, Topological Database, Neighbor Table) increase in size and the calculation increase in frequency the CPU utilization increases and memory availability decreases (inverse relationship). This can affect network latency or cause link congestion, resulting in various additional problems (convergence times, loss of connectivity, loss of packets, system hangs) which is bad for networks.

Area Structure

OSPF creates a two-level hierarchy of areas.

Area Zero (Naught) a.k.a the backbone are or transit area. This is always the central area; all the other areas (stub areas that move towards the edge) attach to Area Zero. Area Zero forms the top level in the hierarchy and remaining areas form the bottom level of the hierarchy. This hierarchical design supports summarization and minimizes routing table entries.

Routers within Area Zero are called backbone routers. Routers that link to Area Zero and another area are called Area Border Routers (ABR). OSPF routers that redistribute routing information from another protocol are called Autonomous System Boundary Routers (ASBR).

OSPF Type Packets

As OSPF link-state information is shared between areas, an intricate set of mechanisms is followed, relying on a number of different OSPF packet types. All OSPF traffic is transmitted inside IP Packets. Receivers recognize OSPF traffic because it is marked as IP Protocol (89).

OSPF includes five packet types:

  1. Hello Packets – Establish communication with directly attached neighbors.
  2. Database Descriptor (DBD) - Sends a list of router IDs from whom the router has an Link State Advertisements (LSA) and the current sequence number. This information is used to compare information about the network.
  3. Link State Requests (LSR) – Follow the Database Descriptors (DBDs) to ask for any missing Link State Advertisements (LSAs)
  4. Link State Update (LSU) – Replies to a link-state request with the requested data.
  5. Link State acknowledgments (LSAck) - Confirm receipt of link-state information.

All OSPF packets have a common format that contains the following nine fields:

  1. Version – All packets are assumed to be Version 2 (at least for this part of Cisco stuff)
  2. Type - There are five packet types, numbered 1 to 5
  3. Packet Length - The length in bytes
  4. Router ID – 32-bit identifier for the router
  5. Area ID – 32-bit identifier for the area
  6. Checksum - Standard 16-bit check sum
  7. Authentication Type - OSPFv2 supports three authentication methods:
    1. no authentication
    2. plain text passwords
    3. MD5 hashes
  8. Authentication Data – 64-bit data, either empty, with a plain-text word, or with a “message digest” of a shared secret
  9. Data – Values being communicated

And this took me almost 2 weeks. Shame on me.

Notes and Notices: This is a part of my personal BSCI notes and research to assist myself in learning and understanding the concepts and theory for the BSCI exam. I learn by making notes reading and writing things down and wish to file them where I cannot lose them. These notes are not to be seen, judged or mistaken for replacements to Cisco recognized and authorized training which I personally support and attend and suggest you undertake if you are going for the BSCI Certification.

Open Shortest Path First – OSPF Fundamentals – DR and BDR

Published
by
Deon Botha
on February 18, 2009
in BDR, BSCI, BSCI Notes, Certification, Cisco Systems, Concepts and Constructs, DR, OSPF and VLAN
. 10 Comments

When routers are connected to the same broadcast segment (I.O.W. several routers are in the same VLAN, on the same switch you getting the idea). One router is assigned the duty to maintain adjacencies with all other routers on the segment. This is the designated router (DR) and the DR  router is selected using information in the Hello messages. For redundancy purposes a backup designated router (BDR) is also elected (There is a reason for this, read on).

DRs are created on multi-access links because the number of adjacencies grows at a quadratic rate. For a network of n routers, the number of adjacencies required would be:

ospf adjacency

Two (2) routers require the following adjacencies:

ospf adjacency 2

Four (4) routers require the following adjacencies:

ospf adjacency 4

Ten (10) Routers require the following adjacencies:

ospf adjacency 45

Maintaining a OSPF segment consumes more bandwidth and requires more processing resources (CPU and memory) as more routers are added onto a OSPF network (Due to keeping the tables updated and probability of changes occuring more frequently etc).

The DR and maintaining relationships

The purpose of a DR is to be the “one router” (sounds like the matrix) to which all other routers are adjacent (the router that has all the routes on the network). Using a DR reduces the number of adjacencies that consume bandwidth and processing to n – 1 (Larger networks will however still require more processing even if you are using a DR). With a DR the adjacencies scale more effectively and efficiently with the network (as one can see in the below figure and table).

To show this in a graphic way one can see how this “adjacency” relationship works without a DR, with a DR, and with a DR and BDR with a small example network using 5 routers.

OSPF Adjacenies

Taking this a step further and plotting out the exponential growth requirements of OSPF adjacencies the table below shows the number of adjacencies needed for 1 – 10 routers (imagine the CPU and Memory requirements, not to mention the bandwidth consumption). Plan accordingly when implementing OSPF (at this point you generally use OSPF because you have a non-homogenous network environment and need the open standard because of this fact, I dont really see a point otherwise cause its such a resource hog and mission to setup).

OSPF Adjacency with DR

The job of the DR

The role of the DR is to receive updates and distribute these updates to each segment router, making sure that each router acknowledges receipt and has a synchronized copy of the Link-State Database (LSDB).

Routers advertise changes to the “AllDRs” multicast address of 224.0.0.6 where the DR then advertise the Link-State advertisements (LSAs) using the “AllSPF” multicast address 224.0.0.5 where each router then ack receipt.

The BDR listens passively to this exchange and maintains a relationship with all the routers.

If the DR stops producing hellos, the BDR promotes itself and assumes the role of DR.

NB. DRs and BDRs are only useful on multi-access links because they reduce adjacencies. The concept of a DR is not used nor usefull on point-to-point links because there can only be one adjacency.

DRs are still however elected on Point-to-Point Ethernet links (most common type of links in networking these days) which is a rather pointless and resource waste/hog (as a DR is not really needed) which is why you will find that many design guides recommend changing Ethernet links to Point-to-Point mode to stop this from happening.

If a DR fails, the BDR is pomoted. The BDR is elected on the basis of highest OSPF priority, ties in OSPF priority are broken in favour of the highest IP ADDRESS.

The default priority is 1 and a priority of 0 (zero) prevents a router from being elected to the DR or BDR role.

Priority can be set from 0-255 (manually) to change the priority from default from the interface,

Router(config-if)#ip ospf priority number

DRs  are inherently seen as stable entities  once elected into the position, even if a Router joins a network with a “greater” priority the DR will not change.

OSPF Segment with Priorities

To give an example of this an OSPF Segment with 5 Routers ( A – E, with different priorities 0 – 3). Taking what has been discussed previously A would be the DR, B the BDR, and E would never be elected. However this neglects the following set of circumstances:

Imagine the following sequence of events in this small segment,

  1. Router C starts first.
    1. Router C sends out Hellos and waits the dead time for a response from other routers.
    2. Receiving no Response, Router C conducts an Election and becomes the BDR.
    3. As there is no DR on this network, Router C then promotes itself to DR.
  2. Router E starts (priority= 0)
    1. Router E will not become the BDR due to its priority setting
  3. Router B starts and becomes the BDR.
  4. Router A starts
  5. Router D starts

In the above scenario the startup sequence of the routers caused the election of the DR and BDR (namely Router C is DR and Router B is BDR) which is not what would have been expected. This is because designated routers do not preempt, the elected DR/BDR serves in its role until reboot/failure (DR and BDR are stable entities on the network once elected).

In this network as it stands now If Router C restarts, Router B promotes itself to DR and Router A is elected BDR while C is down. If Router B goes down, Router A promotes itself and elects Router C or Router D (whichever has the highest IP Address). Finally when the BDR is rebooted, Router B wins the election for BDR.

NOTE: In addition to rebooting, clearing the OSPS process using the the command clear ip ospf process * on the DR will force the DR and BDR election.

Notes and Notices: This is a part of my personal BSCI notes and research to assist myself in learning and understanding the concepts and theory for the BSCI exam. I learn by making notes reading and writing things down and wish to file them where I can’t lose them. These notes are not to be seen, judged or mistaken for replacements to Cisco recognized and authorized training which I personally support and attend and suggest you undertake if you are going for the BSCI Certification.


Search

About

You are currently browsing the Network Ninja weblog archives for the DR category.

Latest

RSS
  • Digital Growth with your Job
  • Open Shortest Path First – OSPF Fundamentals – Scenario
  • Open Shortest Path First – OSPF Fundamentals – Questions and Answers – Question 13
  • Open Shortest Path First – OSPF Fundamentals – Questions and Answers – Question 12
  • Open Shortest Path First – OSPF Fundamentals – Questions and Answers – Question 11
  • Open Shortest Path First – OSPF Fundamentals – Questions and Answers – Question 10
  • Open Shortest Path First – OSPF Fundamentals – Questions and Answers – Question 9
  • Open Shortest Path First – OSPF Fundamentals – Questions and Answers – Question 8
  • Open Shortest Path First – OSPF Fundamentals – Questions and Answers – Question 7
  • Open Shortest Path First – OSPF Fundamentals – Questions and Answers – Question 6

Archives

  • June 2009
  • April 2009
  • March 2009
  • February 2009
  • November 2008
  • October 2008
  • September 2008
  • August 2008
  • July 2008
  • June 2008
  • May 2008
  • April 2008

Categories

  • 802.11 (7)
  • 802.1Q (1)
  • 802.1X (1)
  • AAA (1)
  • Access Point (7)
  • ACL (4)
  • Addressing (3)
  • Asides (31)
  • auto-summary (3)
  • AutoQoS (1)
  • Bandwidth (2)
  • BCMSN (55)
  • BDR (2)
  • BGP (1)
  • BPDU Filtering (1)
  • BPDU Guard (2)
  • BPDU Root Guard (1)
  • BSCI (67)
  • BSCI Notes (18)
  • BSCI Questions (48)
  • Business (1)
  • Cabling and Equiptment (3)
  • CAM (1)
  • CCDA (1)
  • CDP (1)
  • CEF (1)
  • Certification (123)
  • CIDR (2)
  • CIR (2)
  • Cisco Systems (144)
  • Concepts and Constructs (76)
  • CoS (1)
  • Cost (3)
  • DAI (1)
  • DDNS (1)
  • Debug (2)
  • DHCP Snooping (1)
  • DHCP Spoofing (1)
  • DR (3)
  • DUAL (1)
  • Dynamic ARP Inspection (1)
  • ECNM (5)
  • EIGRP (5)
  • Enterprise Architecture (7)
  • EtherChannel (1)
  • GLBP (1)
  • Hello Timer (2)
  • Hold Timer (2)
  • Hot Standby Router Protocol (1)
  • HSRP (1)
  • IGRP (1)
  • IIN (2)
  • Inter-Vlan Routing (1)
  • Interconnection Technologies (2)
  • IP Source Guard (1)
  • IS-IS (1)
  • ISL (1)
  • LACP (1)
  • Link State Advertisements (2)
  • Load Balancing (2)
  • Loop Guard (1)
  • MAC Address Flooding (1)
  • MLS (1)
  • MSTP (1)
  • NBAR (1)
  • NBMA (1)
  • Off-Topic (12)
  • OSPF (18)
  • PAgP (1)
  • passive-interface (1)
  • PoE (1)
  • Port Security (1)
  • Priority (2)
  • Proxy ARP (1)
  • PVC (1)
  • QoS (2)
  • RIP (1)
  • RIPv2 (1)
  • Root Guard (1)
  • RSTP (1)
  • Show (6)
  • Software (1)
  • SONA (2)
  • SSH (2)
  • STP (5)
  • Stub Router (3)
  • summary-address (1)
  • Support (4)
  • Switch Spoofing (1)
  • TCAM (1)
  • Telnet (2)
  • Troubleshooting (1)
  • Trunk (6)
  • Unidirectional Link Detection (1)
  • VACL (3)
  • VC (1)
  • Vine (20)
  • VLAN (11)
  • VLAN Hopping (1)
  • VLSM (1)
  • VoIP (1)
  • VRRP (1)
  • VTP (4)
  • VTY (1)
  • Wireless (7)


Styled with Sawchuk

Powered by WordPress3.4.1 and K21.0-RC7

Entries Feed and Comments Feed

53 queries. 1.6340 seconds.