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 'CIDR' Category

BSCI IP Foundation – IP Addressing

Published
by
Deon Botha
on July 29, 2008
in Addressing, BSCI, BSCI Notes, CIDR, Certification, Cisco Systems and Concepts and Constructs
. 0 Comments

IP-Addressing
IPv4 uses 32-bit numbers that combine a network and a host address. IP addresses are written in four dotted decimal fields. Each number represents a byte (meaning 192 would be a byte cause in decimal its actually made up of 8 bits). The far left bits are the network address because all hosts on this network have addresses that start with that pattern, the right bits are host addresses and each host has a different value.

Resources for IP address Internetworking Technology Handbook: Internet Protocol

Binary Review

IP Addresses are composed of four bytes (8 bits) and in networking binary works one bit at a time from 0000 0000 to 1111 1111 (0 to 2555) IRL networking that’s what you need to know (test are different cause they ask more than just 255). This is a CCNA topic and I filled note pads with examples just to be able to get it as natural as quick as possible, after a while you start remembering 1010 1100 (172) and 1100 0000 (192). The old CCNA Prep Centre (now Cisco Learning Network) had a Java based game to get this into your head where you had to convert Binary to Decimal against the clock. Helped me because its repetition, repetition, repetition.

Classfull Network Ranges
Classfull-Network-Address

The above network address (192.168.16.2) at the top of the post starts with 192.xxx.xxx.xxx if you didnt have this table to the right here are the steps to find out which network it belongs to.

Step 1: Converting the first byte to binary 1100 0000 (192).

Step 2: You take the first 4 bits and compare them to what you know:

  • Class A starts with 0,
  • Class B starts with 10, and
  • Class C starts with 110.

This means that the address is a Class C address.

This is something that you must just know, get to know the first column and associate that column with the Class on the table above and then the you can figure out the range easily enough (if you are good with memorizing tables just memorize the bits, range and class).

Network Range by Subnet Masks

Subnetting is when you take the assigned network and break it into smaller pieces this can be useful to conserve IP address space (or when I was doing the CCNA I did this to practice on my office network). The book I am using (Brent D. Stewart, CCNP BSCI Official Exam Certification Guide; Fourth Ed.) uses a Truth Table for AND that is really easy to use and master.

Another method would be to use a table, its also not rocket science but means that you don’t actually know how to do this on the fly.

Addressing-Table

Moving along lets use the AND method and an example. What network does PC 3 belong to with the IP 192.168.5.100 and the subnet mask 255.255.255.224 and what are the usable addresses on this network.

STEP 1: If the mask is given in decimal notation, convert it to CIDR notation (maybe a long way but you going to need the binary in a second anyway).

Step-1

STEP 2: To determine the network address of the IP address, copy the network bits from the address as shown by the CIDR notation. Fill in the remaining bits with zeros.

Step-2

STEP 3: The last Address in the range is the broadcast address. To find this out do the following:

Step-3

STEP 4: The usable network addresses fall between STEP 2 and STEP 3.

Step-4

STEP 5:To check this subtract the CIDR notation from 32 that’s 32 – 27 (not the other way around cause you going to get a negative number). To determine the “amount” of addresses then plug it into this formula 2n-2 (n = number of host bits).

Step-5

Resources for Subnet Mask and Classes: Internetworking Technology Handbook IP Address Classes

Summarization

Summarization (route summarization) is a technique used to group IP networks together to minimize IP advertisements. Doing this allows one to hide unimportant details (flapping links) and to simplify the routing process (make better use of router CPU and memory than to process and store routing information). One of the keys to scalable routing is to take large complicated sets of advertisements and reduce them as much as possible (think internet).

Step 1: Write each network in binary

Summarization Step-1
Step 2: Determine the number of bits that match. This gives a single summary that includes all the routes, but may include a range of addresses that is too large (over-summarization)

Summarization Step-2

Step 3: If step 2 unacceptably over-summarizes, start from the first address and add bits to the prefix until a portion of the range is summarizes. Take the remaining addresses and start this process again.

Summarization Step-3

Step 4: Write each network in binary

Step 5: Determine the number of bits that match.

Summarization Step-4

Step 6: Because step 2 did not over-summarize, the process is complete. Answer is 192.168.0.0/21 and 192.168.0.0/23

Address Planning

Summarization is not possible if network numbers are randomly assigned within an organization. When designing a network it is important to keep in mind the requirements for summarization.

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.

BSCI Design Foundation – Routing Protocols

Published
by
Deon Botha
on July 25, 2008
in BGP, BSCI, BSCI Notes, CIDR, Certification, Cisco Systems, Concepts and Constructs, EIGRP, IGRP, IS-IS, OSPF, RIP, RIPv2 and VLSM
. 2 Comments

Routing protocols employ one of two basic strategies to communicate/propagate routing information:

  • Distance vector routing protocols work by passing copies of their routing tables to their neighbours (a.k.a routing by rumour).
  • Link State routing protocols work by advertising a list of neighbours and the network attachment state to their neighbours until all routers have a copy of all the lists, routers then run the Shortest Path First Algorithm to analyse all paths and determine the best paths available.

Routing-Protocol-Diagram

Distance vector routing are less processor and memory intensive than link state routing, but can have loops because routing decisions are made on incomplete information.

Link state routing is loop-proof because routers know all possible routes, but link state routing requires more CPU time and memory.

Classless and Classful Routing

An important characteristic of routing protocols is how they advertise their routes. Older routing protocols (RIP and IGRP) assumed the subnet mask the same as the one the receiving on the interface or that it is the default one (Class A is /8, Class B is /16 and Class C is /24). This is called classful because the assumption is based on the Class of the IP address.

Modern routing protocols (OSPF, IS-IS, and EIGRP) explicitly advertise the mask. There is no assumption made with regard to the mask, it is clearly indicated. This is called classless because no assumption is made and an address alone is not a good indicator subnet mask.

Variable Length Subnet Masks (VLSM) refers to the property of a network that allows different subnet masks to be mixed throughout the network.

Classless Interdomain Routing (CIDR) is a property of a network that allows classful networks to be aggregated.

Classless routing protocols support both VLSM and CIDR.

Interior and Exterior Gateway Protocols

Most protocols are “Interior Gateway”, meaning that they are designed to be run inside a network (inside the trusted boundaries of the company).

BGP on the other hand is an exterior gateway protocol (EGP) and is used for routing between autonomous systems (AS) on the Internet (outside the trusted boundaries of the company). As BGP is the only EGP you will have to consider using it if you connect your network to the Internet.

Convergence Times

Routing-Protocol-Convergenc

A distinguishing characteristic of routing protocols is the speed of convergence times. To explain convergence, when a routing protocol is forwarding data, it is converged. In this state the routing protocol has shared routing table information and each router in the topology knows the best paths available. If there was a change (a router going down, another router being added, etc) this would require all routers to share information again because there are routes they do not have information on. The time between network change and forwarding would be “convergence”. This is generally classed as either slow or fast.

Fast convergence would mean that the routing protocol is able to recognize a problem on the network and fix that problem faster than a user can call to report a given problem.

Slow protocols, such as RIP and IGRP, can take up to minutes to converge when a problem occurs.

Fast protocols (OSPF, IS-IS, EIGRP) generally take less than 10 seconds to converge.

Proprietary and Open Standard Protocols

The important aspects to look for in routing protocols is speed of convergence and whether the protocol is classless (OSPF, IS-IS, and EIGRP). While OSPF and IS-IS are open standards (plays well with other vendors kit), EIGRP is Cisco proprietary (Cisco Only). Of the three protocols EIGRP is the easiest to configure and maintain but requires a pure Cisco environment to run.

Routing Protocol and the ECNM

Routing-Protocol-Size-of-Ne

The ECNM mentioned in previous posts can assist in showing where a particular routing protocol will run in the enterprise. Using information discussed above and using the ECNM the above diagram shows what the advanced routing protocols (EIGRP, OSPF, IS-IS) are best suited for when considering size of network, speed of convergence, VLSM, open or proprietary, and support staff knowledge needs.

The object (ideal) is to have a single routing protocol running throughout the enterprise (reality however is another story) where the enterprise edge will require BGP as the only EGP and at least one if not more of the IGPs within the enterprise boundaries depending on needs/requirements of end-points or design specifications.

In Summation

Routing-Summary

Older routing protocols (RIP, RIPv2 and IGRP) are slow because they send a full copy of their information periodically, these periodic transmissions act as both routing advertisement and keepalive message. In addition to being slow they consume a lot of bandwidth relative to their function (RIP every 30 seconds).

More modern routing protocols are faster because they separate the routing advertisements and the keepalive messages. Updates are only sent out when new networks need to be advertised or old networks need to be withdrawn; otherwise routers just need to verify that neighbours are still alive (EIGRP every 5 seconds).

RIP and IGRP

These are older distance vector routing protocols that are slow and classful. Some legacy systems (UNIX) expect to learn their default gateway by eavesdropping on RIP advertisements. If you deploy RIP use RIPv2 which is classless.

EIGRP

A modern distance vector routing protocol. It is classless and fast as well as being easy to configure and maintain. Some organizations refuse to implement proprietary standards though (EIGRP provides equivalent performance to OSPF but is easier to implement and maintain).

OSPF

OSPF is a modern classless and fast link-state routing protocol. OSPF has a steep learning curve and uses more processor time and memory than EIGRP. This is the open standard if an organization supports a heterogeneous mixture of routers or has a philosophical problem with proprietary standards.

IS-IS

This routing protocol was developed to compete with OSPF and the two are more similar than they are dissimilar. It is moderately difficult to find anyone who has experience working with IS-IS even if it is open, fast, and classless. There is still however some interest in IS-IS because it can be adapted to support MPLS and IPv6.

BGP

BGP is a routing protocol used between AS on the Internet and you will have to use it to connect your network to the Internet.

Resources:

Internetworking Technology Handbook Routing Basics

Internetworking Technology Handbook RIP

Internetworking Technology Handbook IGRP

Internetworking Technology Handbook OSPF

Internetworking Technology Handbook EIGRP

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 CIDR 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 WordPressabc and K21.0-RC7

Entries Feed and Comments Feed

42 queries. 3.6270 seconds.