Escolar Documentos
Profissional Documentos
Cultura Documentos
NETWORKING TECHNOLOGIES
Submitted By:-GAURAV CHANDRA
ABES ENGINEERING COLLEGE
CERTIFICATE
Date-27/07/2012
This is to certify that Mr. GAURAV CHANDRA , B.Tech (Electronics And
Communication Engineering) student of ABES Engineering College has
successfully completed his industrial training at ONGC,New Delhi from
18/06/2012 to 27/07/2012.
He has done his training on NETWORKING TECHNOLOGIES under
my guidance. I have observed that his work has been excellent and appreciate
his sincere learning. I wish him all the best for his future endeavour.
ACKNOWLEDGEMENT
I take this opportunity to express my profound sense of gratitude and
appreciation to all those who helped me throughout the duration of this
training.
First and foremost, I would like to express my thanks to Mr. B.L Suthar
CE (E&T), Corporate Infocom Services, Delhi for providing valueable
guidance and expert supervision for this training.
I am also truly thankful to Mr. Rakesh Arora (Networks) for
encouragement, support and providing necessary input for the training.
CONTENTS
PAGE NO
1.INTRODUCTION TO COMPUTER NETWORKING
2.IP ADDRESSING
15
3.ROUTER
23
4.IP ROUTING
29
5.SWITCHING
41
47
7.GNS3
52
INTRODUCTION TO COMPUTER
NETWORKING
A computer network, often simply referred to as a network, is a collection of computers and
other hardware components interconnected by communication channels that allow sharing
of resources and information
PROPERTIES OF COMPUTER NETWORKS
Computer networks:
Facilitate communications
Permit sharing of files, data, and other types of information
Share network and computing resources
May be insecure
May interfere with other technologies
May be difficult to set up
The communication technologies used in networks can be subdivide into wired and wireless
technologies
Wired technologies
The order of the following wired technologies is, roughly, from slowest to fastest
transmission speed.
Twisted pair wire is the most widely used medium for telecommunication. Twisted-pair
cabling consist of copper wires that are twisted into pairs. Ordinary telephone wires
consist of two insulated copper wires twisted into pairs. Computer networking cabling
(wired Ethernet as defined by IEEE 802.3) consists of 4 pairs of copper cabling that can
be utilized for both voice and data transmission. The use of two wires twisted together
helps to reduce crosstalk and electromagnetic induction. The transmission speed ranges
from 2 million bits per second to 10 billion bits per second. Twisted pair cabling comes in
two forms: unshielded twisted pair (UTP) and shielded twisted-pair (STP). Each form
comes in several category ratings, designed for use in various scenarios.
Coaxial cable is widely used for cable television systems, office buildings, and other
work-sites for local area networks. The cables consist of copper or aluminum wire
surrounded by an insulating layer (typically a flexible material with a high dielectric
constant), which itself is surrounded by a conductive layer. The insulation helps minimize
interference and distortion. Transmission speed ranges from 200 million bits per second
to more than 500 million bits per second.
An optical fiber is a glass fiber. It uses pulses of light to transmit data. Some advantages
of optical fibers over metal wires are less transmission loss, immunity from
electromagnetic radiation, and very fast transmission speed, up to trillions of bits per
second. One can use different colors of lights to increase the number of messages being
sent over a fiber optic cable.
Wireless technologies
A Metropolitan area network (MAN) is a large computer network that usually spans a city or
a large campus
3.Wide area network
A wide area network (WAN) is a computer network that covers a large geographic area such
as a city, country, or spans even intercontinental distances, using a communications channel
that combines many types of media such as telephone lines, cables, and air waves. A WAN
often uses transmission facilities provided by common carriers, such as telephone
companies. WAN technologies generally function at the lower three layers of the OSI
reference model: the physical layer, the data link layer, and the network layer.
A network topology is the layout of the interconnections of the nodes of a computer network.
Common layouts are:
On the basis of topology computer networks can be classified into:
Protocol specifies a common set of rules and signals, the computers on the network
use to communicate. Most networks use Ethernet, but some networks may use IBMs
Token Ring protocol.
Bridges
A network bridge connects multiple network segments at the data link layer (layer 2) of
the OSI model. Bridges broadcast to all ports except the port on which the broadcast was
received. However, bridges do not promiscuously copy traffic to all ports, as hubs do, but
learn which MAC addresses are reachable through specific ports. Once the bridge
associates a port and an address, it will send traffic for that address to that port only.
Bridges learn the association of ports and addresses by examining the source address of
frames that it sees on various ports. Once a frame arrives through a port, its source address
is stored and the bridge assumes that MAC address is associated with that port. The first
time that a previously unknown destination address is seen, the bridge will forward the frame
to all ports other than the one on which the frame arrived.
Bridges come in three basic types:
Switches
A network switch is a device that forwards and filters OSI layer 2 datagrams (chunks of data
communication) between ports (connected cables) based on the MAC addresses in the
packets. A switch is distinct from a hub in that it only forwards the frames to the ports
involved in the communication rather than all ports connected. A switch breaks the collision
domain but represents itself as a broadcast domain. Switches make forwarding decisions of
frames on the basis of MAC addresses. A switch normally has numerous ports, facilitating a
star topology for devices, and cascading additional switches. Some switches are capable of
routing based on Layer 3 addressing or additional logical levels; these are called multi-layer
switches.
Routers
A router is an internetworking device that forwards packets between networks by processing
information found in the datagram or packet (Internet protocol information fromLayer 3 of the
OSI Model). In many situations, this information is processed in conjunction with the routing
table (also known as forwarding table). Routers use routing tables to determine what
interface to forward packets (this can include the "null" also known as the "black hole"
interface because data can go into it, however, no further processing is done for said data).
OSI MODEL
The OSI, or Open System Interconnection, model defines a networking framework for
implementing protocols in seven layers. Control is passed from one layer to the next, starting
at the application layer in one station, and proceeding to the bottom layer, over the channel
to the next station and back up the hierarchy.
Application Layer (Layer 7)
The application layer is the OSI layer closest to the end user, which means that both the OSI
application layer and the user interact directly with the software application. This layer
interacts with software applications that implement a communicating component. Such
application programs fall outside the scope of the OSI model. Application-layer functions
typically include identifying communication partners, determining resource availability, and
synchronizing communication. When identifying communication partners, the application
layer determines the identity and availability of communication partners for an application
with data to transmit. When determining resource availability, the application layer must
decide whether sufficient network or the requested communications exist. In synchronizing
communication, all communication between applications requires cooperation that is
managed by the application layer. Some examples of application-layer implementations also
include:
On OSI stack:
o
X.400 Mail
Parallel SCSI buses operate in this layer, although it must be remembered that the
logical SCSI protocol is a transport layer protocol that runs over this bus. Various physicallayer Ethernet standards are also in this layer; Ethernet incorporates both this layer and the
data link layer. The same applies to other local-area networks, such as token
ring, FDDI, ITU-T G.hn and IEEE
802.11,
as well
as
personal area
networks
such as Bluetooth and IEEE 802.15.4.
IP ADDRESSING
An Internet Protocol address (IP address) is a numerical label assigned to each device
(e.g., computer, printer) participating in a computer network that uses the Internet Protocol
for communication. An IP address serves two principal functions: host or network interface
identification and location addressing.
32
In IPv4 an address consists of 32 bits which limits the address space to 4294967296 (2 )
possible unique addresses. IPv4 addresses are canonically represented in dot-decimal
notation, which consists of four decimal numbers, each ranging from 0 to 255, separated by
dots, e.g., 172.16.254.1. Each part represents a group of 8 bits (octet) of the address
IP addresses are basically of two types:
1) Static IP address
2) Shared IP address
Thus, using more than one site on an IP address is called a Shared IP address. If a site has
its own IP address, and shares with no one else, it is called a Static IP address.
The first three bits of the most significant octet of an IP address were defined as the class of
the address. Three classes (A, B, and C) were defined for universal unicast addressing
Class
A
B
0
10
0127
128191
A
a.b
b.c.d
c.d
110
192223
a.b.c
Number of
addresses per
network
24
2 = 128
2 = 16777216
14
16
2 = 16384 2 = 65536
2 21 =
8
2 = 256
2097152
There are five classes of available IP ranges: Class A, Class B, Class C, Class D and Class
E, while only A, B, and C are commonly used. Each class allows for a range of valid IP
addresses. Below is a listing of these addresses.
Class
Address Range
Supports
Class 192.0.1.1 to
C
223.255.254.254
Class 224.0.0.0 to
239.255.255.255
Class 240.0.0.0 to
E
254.255.255.254
In general the number of available hosts on a subnet is 2 2, where n is the number of bits
used for the host portion of the address.
Default Subnet Mask
For class a it is 255.0.0.0
For class b it is 255.255.0.0
For class c it is 255.255.255.0
Eg.class c subnetting
IP address 192.168.5.130
Subnet mask 255.255.255.0
Network prefix 192.168.5.0
Host part 0.0.0.130
Class a subnetting
IP address 68.1.5.99
Subnet mask 255.0.0.0
Network prefix 68.0.0.0
Host part 0.1.5.99
Class b subnetting
IP address 129.1.5.99
Subnet mask 255.255.0.0
Network prefix 129.1.0.0
Host part 0.0.5.99
Another Eg. of class c subnetting is:IP address 192.168.5.130
Subnet mask 255.255.255.192
Network prefix 192.168.5.128
Host part 0.0.0.2
IPV4
An IP packet consists of a header section and a data section.
Header
The IPv4 packet header consists of 14 fields, of which 13 are required. The 14th field is
optional (red background in table) and aptly named: options. The fields in the header are
packed with the most significant byte first (big endian), and for the diagram and discussion,
the most significant bits are considered to come first (MSB 0 bit numbering). The most
significant bit is numbered 0, so the version field is actually found in the four most significant
bits of the first byte, for example.
bit
offset
03
47
813
14-15
Version
Internet
Header
Length
Differentiated
Services Code
Point
Explicit
Congestion
Notification
1618
1931
Total Length
32
Identification
Time to Live
64
Flags
Protocol
96
Source IP Address
128
Destination IP Address
160
160
or
192+
Data
Fragment Offset
Header checksum
Version
The first header field in an IP packet is the four-bit version field. For IPv4, this has a
value of 4 (hence the name IPv4).
Internet Header Length (IHL)
The second field (4 bits) is the Internet Header Length (IHL), which is the number of
32-bit words in the header. Since an IPv4 header may contain a variable number of
options, this field specifies the size of the header (this also coincides with the offset
to the data). The minimum value for this field is 5 (RFC 791), which is a length of
532 = 160 bits = 20 bytes. Being a 4-bit value, the maximum length is 15 words
(1532 bits) or 480 bits = 60 bytes.
Differentiated Services Code Point (DSCP)
Originally defined as the Type of Service field, this field is now defined by RFC
2474 for Differentiated services (DiffServ). New technologies are emerging that
require real-time data streaming and therefore make use of the DSCP field. An
example is Voice over IP (VoIP), which is used for interactive data voice exchange.
Explicit Congestion Notification (ECN)
This field is defined in RFC 3168 and allows end-to-end notification of network
congestion without dropping packets. ECN is an optional feature that is only used
when both endpoints support it and are willing to use it. It is only effective when
supported by the underlying network.
Total Length
This 16-bit field defines the entire packet (fragment) size, including header and data,
in bytes. The minimum-length packet is 20 bytes (20-byte header + 0 bytes data) and
the maximum is 65,535 bytes the maximum value of a 16-bit word. The largest
datagram that any host is required to be able to reassemble is 576 bytes, but most
modern hosts handle much larger packets. Sometimes subnetworks impose further
restrictions on the packet size, in which case datagrams must be fragmented.
Fragmentation is handled in either the host or router in IPv4.
Identification
This field is an identification field and is primarily used for uniquely identifying
fragments of an original IP datagram. Some experimental work has suggested using
the ID field for other purposes, such as for adding packet-tracing information to help
trace datagrams with spoofed source addresses.
Flags
A three-bit field follows and is used to control or identify fragments. They are (in
order, from high order to low order):
If the DF flag is set, and fragmentation is required to route the packet, then the
packet is dropped. This can be used when sending packets to a host that does not
have sufficient resources to handle fragmentation. It can also be used for Path MTU
Discovery, either automatically by the host IP software, or manually using diagnostic
tools such as ping ortraceroute.
For unfragmented packets, the MF flag is cleared. For fragmented packets, all
fragments except the last have the MF flag set. The last fragment has a non-zero
Fragment Offset field, differentiating it from an unfragmented packet.
Fragment Offset
The fragment offset field, measured in units of eight-byte blocks, is 13 bits long and
specifies the offset of a particular fragment relative to the beginning of the original
unfragmented IP datagram. The first fragment has an offset of zero. This allows a
13
maximum offset of (2
packet length of 65,535 bytes with the header length included (65,528 + 20 = 65,548
bytes).
Time To Live (TTL)
An eight-bit time to live field helps prevent datagrams from persisting (e.g. going in
circles) on an internet. This field limits a datagram's lifetime. It is specified in
seconds, but time intervals less than 1 second are rounded up to 1. In practice, the
field has become a hop countwhen the datagram arrives at a router, the router
decrements the TTL field by one. When the TTL field hits zero, the router discards
the packet and typically sends a ICMP Time Exceeded message to the sender.
The program traceroute uses these ICMP Time Exceeded messages to print the
routers used by packets to go from the source to the destination.
Protocol
This field defines the protocol used in the data portion of the IP datagram.
The Internet Assigned Numbers Authority maintains a list of IP protocol
numbers which was originally defined in RFC 790.
Header Checksum
The 16-bit checksum field is used for error-checking of the header. When a packet
arrives at a router, the router calculates the checksum of the header and compares it
to the checksum field. If the values do not match, the router discards the packet.
Errors in the data field must be handled by the encapsulated protocol.
Both UDP and TCPhave checksum fields.
When a packet arrives at a router, the router decreases the TTL field. Consequently,
the router must calculate a new checksum. RFC 1071 defines the checksum
calculation:
The checksum field is the 16-bit one's complement of the one's complement sum of
all 16-bit words in the header. For purposes of computing the checksum, the value of
the checksum field is zero.
For example, consider Hex 4500003044224000800600008c7c19acae241e2b (20
bytes IP header):
Step 1) 4500 + 0030 + 4422 + 4000 + 8006 + 0000 + 8c7c + 19ac + ae24 + 1e2b =
2BBCF (16-bit sum)
Step 2) 2 + BBCF = BBD1 = 1011101111010001 (1's complement 16-bit sum)
Step 3) ~BBD1 = 0100010000101110 = 442E (1's complement of 1's complement
16-bit sum)
To validate a header's checksum the same algorithm may be used - the checksum of
a header which contains a correct checksum field is a word containing all zeros
(value 0):
2BBCF + 442E = 2FFFD. 2 + FFFD = FFFF. the 1'S of FFFF = 0.
Source address
This field is the IPv4 address of the sender of the packet. Note that this address may
be changed in transit by a network address translation device.
Destination address
This field is the IPv4 address of the receiver of the packet. As with the source
address, this may be changed in transit by a network address translation device.
Options
The options field is not often used. Note that the value in the IHL field must include
enough extra 32-bit words to hold all the options (plus any padding needed to ensure
that the header contains an integral number of 32-bit words). The list of options may
be terminated with an EOL (End of Options List, 0x00) option; this is only necessary
if the end of the options would not otherwise coincide with the end of the header. The
possible options that can be put in the header are as follows:
Size
(bits)
Field
Description
Copied
Option
Class
Option
Number
Specifies an option.
Option
Length
Indicates the size of the entire option (including this field). This field
may not exist for simple options.
Option
Data
Variable Option-specific data. This field may not exist for simple options.
If the header length is greater than 5, i.e. it is from 6 to 15, it means that the options field
is present and must be considered.
Copied, Option Class, and Option Number are sometimes referred to as a single eightbit field - the Option Type.
The following two options are discouraged because they create security
concerns: Loose Source and Record Route (LSRR) and Strict Source and Record
Route (SSRR). Many routers block packets containing these options.
Data
The data portion of the packet is not included in the packet checksum. Its contents are
interpreted based on the value of the Protocol header field.
ROUTER
A router is a device that forwards data packets between computer networks, creating an
overlay internetwork. A router is connected to two or more data lines from different networks.
When a data packet comes in on one of the lines, the router reads the address information in
the packet to determine its ultimate destination. Then, using information in its routing
table or routing policy, it directs the packet to the next network on its journey. Routers
perform the "traffic directing" functions on the Internet. A data packet is typically forwarded
from one router to another through the networks that constitute the internetwork until it gets
to its destination node.
Routers may provide connectivity within enterprises, between enterprises and the Internet,
and between internet service providers(ISPs) networks. The largest routers (such as
the Cisco CRS-1 or Juniper T1600) interconnect the various ISPs, or may be used in large
enterprise networks Smaller routers usually provide connectivity for typical home and office
networks.
Access routers, including 'small office/home office' (SOHO) models, are located at customer
sites such as branch offices that do not need hierarchical routing of their own. Typically, they
are optimized for low cost.
Distribution routers aggregate traffic from multiple access routers, either at the same site, or
to collect the data streams from multiple sites to a major enterprise location. Distribution
routers are often responsible for enforcing quality of service across a W AN, so they may
have considerable memory installed, multiple WAN interface connections, and substantial
onboard data processing routines. They may also provide connectivity to groups of file
servers or other external networks.
In enterprises, a core router may provide a "collapsed backbone" interconnecting the
distribution tier routers from multiple buildings of a campus, or large enterprise locations.
They tend to be optimized for high bandwidth.
Router(config)#line con 0
Router(config-line)#password cisco
Router(config-line)#login
Router(config)#line vty 0 4
Router(config-line)#password cisco
Router(config-line)#login
Router(config)#line con 0
Router(config-line)#exec-timeout 0 0
Enable an interface
Router(config-if)#no shutdown
To disable an interface
Router(config-if)#shutdown
Set the clock rate for a router with a DCE cable to 64K
Router(config)#line aux 0
Router(config-line)#password cisco
Router(config-line)#login
Hardware Components
There are 7 major internal components of a router:
o
o
o
o
o
o
o
CPU
NVRAM
DRAM
Flash
ROM
Console
Interfaces
CPU
The CPU performs functions just as it does in a normal PC. It executes commands given by
the IOS using other hardware components. High-end routers may contain multiple
processors or extra slots to add more CPUs later.
NVRAM
Nonvolatile RAM is used to store the startup configuration files. This type of RAM does not
lose its content when the router is restarted or powered off.
DRAM
Random Access Memory; this component is dynamic. Meaning, its content changes
constantly. The main role of the RAM is to: hold the ARP cache, Store routing tables, hold
fast-switching cache, performs packet buffering, and hold queues. It also provides temporary
memory for the configuration file of the router while the router is powered on. However, the
RAM loses content when router is restarted or powered off. This component is upgradeable
Flash
Flash memory is very important because it saves you if you screw up the operating system
configuration. It holds the Cisco IOS image file, as well as backups. This flash memory is
classified as an EEPROM. The flash ROM is upgradeable in most Cisco routers.
ROM
The ROM performs the same operations as a BIOS. It holds information about the systems
hardware components and runs POST when the router first starts up. This component can
be upgraded by "unplugging" the chip and installing a new one.
Console
The console consists of the physical plugs and jacks on the router. The purpose of the
console is to provide access for configurations.
Interfaces
The interfaces provide connectivity to LAN, WAN, and Console/Aux. They can be RJ-45
jacks soldered onto the motherboard, transceiver modules, or card modules. Cisco routers,
especially the higher-end models, can be configured in many different ways. They can use a
combination of transceivers, card modules and onboard interfaces.
We can connect to a Cisco router to configure it, verify its configuration, and check
statistics. There are following different ways to do this :
Console Port : usually an RJ-45 (8-pin modular) connection located at the back of
the routerby default, there may or may not be a password set. The new ISR routers
use cisco as the username and cisco as the password by default.
Auxiliary Port : same thing as a console port, so it follows that it can be used
as one. But an auxiliary port also allows to configure modem commands so that a
modem can be connected to the router. This is an important feature as it lets dial up
a remote router and attach to the auxiliary port if the router is down and we need to
configure it out-of-band (meaning from outside of the network).
Telnet : it is a terminal emulation program that acts as though its a dumb terminal.
We can use Telnet to connect to any active interface on a router, such as an
Ethernet or serial port. It is an is in-band way to connect to a Cisco router, through
the program Telnet. (In-band means configuring the router through the network, the
opposite of out-of-band.)
The modular routers had 3 interface slots available - 2 Synchronous Serial and 1 ISDN. The
ISDN modules were keyed so as not to be inserted into a Synchronous WAN module slot.
The following modules were available:
IP ROUTING
Routing is the process of selecting paths in a network along which to send network traffic
Static Routing
Static routing occurs when you manually add routes in each routers routing table. There are
pros and cons to static routing, but thats true for all routing processes.
Static routing has the following benefits:
There is no overhead on the router CPU, which means you could possibly buy a
cheaper router than you would use if you were using dynamic routing.
There is no bandwidth usage between routers, which means you could possibly save
money on WAN links.
It adds security because the administrator can choose to allow routing access to
certain networks only.
Static routing has the following disadvantages:
The administrator must really understand the internetwork and how each router is
connected in order to configure routes correctly.
If a network is added to the internetwork, the administrator has to add a route to it on
all routersby hand.
Its not feasible in large networks because maintaining it would be a full-time job in
itself.
Default Routing
We use default routing to send packets with a remote destination network not in the routing
table to the next-hop router. One should only use default routing on stub networksthose
with only one exit path out of the network.
Normally, if a specific route to a particular network does not exist, a router will drop all traffic
destined to that network. A default route, or gateway of last resort, allows traffic to be
forwarded, even without a specific route to a particular network.
The default route is identified by all zeros in both the network and subnet
mask (0.0.0.0 0.0.0.0). It is the least specific route possible, and thus will
only be used if a more specific route does not exist (hence gateway of last
resort).
To configure a default route:
Router(config)# ip route 0.0.0.0 0.0.0.0 172.17.1.2
It is possible to specify an entire default network on a Cisco device:
Router(config)# ip default-network 172.20.0.0
The default route in Internet Protocol Version 4 (IPv4) is designated as the zeroaddress 0.0.0.0/0 in CIDR notation, often called the quad-zero route. The subnet mask is
given as /0, which effectively specifies all networks, and is the shortest match possible. A
route lookup that does not match any other route, falls back to this route. Similarly, in IPv6,
the default route is specified by ::/0
Dynamic Routing
Dynamic routing is when protocols are used to find networks and update routing tables on
routers.Dynamic routing protocols are supported by software applications running on the
routing device (the router) which dynamically learn network destinations and how to get to
them and also advertise those destinations to other routers. This advertisement function
allows all the routers to learn about all the destination networks that exist and how to to
those networks.
A router using dynamic routing will 'learn' the routes to all networks that are directly
connected to the device. Next, the router will learn routes from other routers that run the
same routing protocol (RIP, RIP2, EIGRP, OSPF, IS-IS, BGP etc). Each router will then sort
through it's list of routes and select one or more 'best' routes for each network destination
the router knows or has learned.
Dynamic routing protocols will then distribute this 'best route' information to other routers
running the same routing protocol, thereby extending the information on what networks exist
and can be reached. This gives dynamic routing protocols the ability to adapt to logical
network topology changes, equipment failures or network outages 'on the fly'.
Administrative Distances
The administrative distance (AD) is used to rate the trustworthiness of routing information
received on a router from a neighbor router. An administrative distance is an integer from 0
to 255, where 0 is the most trusted and 255 means no traffic will be passed via this route.
If a router receives two updates listing the same remote network, the first thing the router
checks is the AD. If one of the advertised routes has a lower AD than the other, then the
route with the lowest AD will be placed in the routing table.
If both advertised routes to the same network have the same AD, then routing protocol
metrics (such as hop count or bandwidth of the lines) will be used to find the best path to the
remote network. The advertised route with the lowest metric will be placed in the routing
table. But if both advertised routes have the same AD as well as the same metrics, then the
routing protocol will load-balance to the remote network (which means that it sends packets
down each link).
Route Source
Default AD
Connected interface 0
Static route
1
EIGRP
90
IGRP
100
OSPF
110
RIP
120
External EIGRP
170
Unknown
255 (This route will never be used.)
Routing Protocols
There are three classes of routing protocols:
Distance vector The distance-vector protocols in use today find the best path to a remote
network by judging distance. For example, in the case of RIP routing, each time a packet
goes through a router, thats called a hop. The route with the least number of hops to the
network is determined to be the best route. The vector indicates the direction to the remote
network. Both RIP and IGRP are distance-vector routing protocols. They periodically send
the entire routing table to directly connected neighbors.
Link state In link-state protocols, also called shortest-path-first protocols, the routers each
create three separate tables. One of these tables keeps track of directly attached neighbors,
one determines the topology of the entire internetwork, and one is used as the routing table.
Linkstate routers know more about the internetwork than any distance-vector routing
protocol. OSPF is an IP routing protocol that is completely link state. Link-state protocols
send updates containing the state of their own links to all other directly connected routers on
the network, which is then propagated to their neighbors.
Hybrid Hybrid protocols use aspects of both distance vector and link statefor example,
EIGRP.
a neighbor router believes the information about remote networks without actually finding out
for itself.
RIP uses only hop count to determine the best path to a network. If RIP finds more than one
link with the same hop count to the same remote
network, it will automatically perform a round-robin load balancing. RIP can perform load
balancing for up to six equal-cost links (four by default).
Routing Loops
Distance-vector routing protocols keep track of any changes to the internetwork by
broadcasting periodic routing updates out all active interfaces.
This broadcast includes the complete routing table. This works just fine, but its expensive in
terms of CPU processing and link bandwidth. And if a network outage happens, real
problems can occur. Plus, the slow convergence of distance-vector routing protocols can
result in inconsistent routing tables and routing loops.
Maximum Hop Count
The routing loop problem just described can create an issue called counting to infinity, and
its caused by gossip (broadcasts) and wrong information being communicated and
propagated throughout the internetwork. Without some form of intervention, the hop count
increases indefinitely each time a packet passes through a router.
One way of solving this problem is to define a maximum hop count. RIP permits a hop count
of up to 15, so anything that requires 16 hops is deemed unreachable. In other words, after a
loop of 15 hops, Network 5 will be considered down. Thus, the maximum hop count will
control how long it takes for a routing table entry to become invalid or questionable.
Split Horizon
Another solution to the routing loop problem is called split horizon. This reduces incorrect
routing information and routing overhead in a distance vector
network by enforcing the rule that routing information cannot be sent back in the direction
from which it was received.
In other words, the routing protocol differentiates which interface a network route was
learned on, and once this is determined, it wont advertise the route back out that same
interface. This would have prevented Router A from sending the update information it
received from Router B back to Router B.
Route Poisoning
Another way to avoid problems caused by inconsistent updates and stop network loops is
route poisoning. For example, when Network 5 goes down, Router E initiates route
poisoning by advertising Network 5 with a hop count of 16, or unreachable (sometimes
referred to as infinite).
This poisoning of the route to Network 5 keeps Router C from being susceptible to incorrect
updates about the route to Network 5. When Router C receives a route poisoning from
Router E, it sends an update, called a poison reverse, back to Router E. This ensures that all
routers on the segment have received the poisoned route information.
Holddowns
A holddown prevents regular update messages from reinstating a route that is going up and
down (called flapping). Typically, this happens on a serial link thats losing connectivity and
then coming back up. If there wasnt a way to stabilize this, the network would never
converge and that one flapping interface could bring the entire network down!
Holddowns prevent routes from changing too rapidly by allowing time for either the downed
route to come back up or the network to stabilize somewhat before changing to the next best
route. These also tell routers to restrict, for a specific time period, changes that might affect
recently removed routes. This prevents inoperative routes from being prematurely restored
to other routers tables.
RIPv2
Distance vector
Maximum hop count of 15
Classless
Uses multicast 224.0.0.9
Supports VLSM networks
Allows for MD5 authentication
EIGRP
Enhanced Interior Gateway Routing Protocol (EIGRP) is a proprietary Cisco protocol that
runs on Cisco routers.
Enhanced IGRP (EIGRP) is a classless, enhanced distance-vector protocol that uses the
concept of an autonomous system to describe the set of contiguous routers that run the
same routing protocol and share routing information. EIGRP includes the subnet mask in its
route updates because it is considered classless
EIGRP is sometimes referred to as a hybrid routing protocol because it has characteristics of
both distance-vector and link-state protocols.
There are a number of powerful features that make EIGRP a real standout from other
protocols. The main ones are listed here:
Support for IP and IPv6 (and some other useless routed protocols) via protocoldependent modules
Considered classless (same as RIPv2 and OSPF)
Support for VLSM/CIDR
Support for summaries and discontiguous networks
Efficient neighbor discovery
Communication via Reliable Transport Protocol (RTP)
Best path selection via Diffusing Update Algorithm (DUAL)
One of the most interesting features of EIGRP is that it provides routing support for multiple
Network layer protocols: IP, IPX, AppleTalk, and now IPv6.
Feasible distance (FD) This is the best metric among all paths to a remote network,
including the metric to the neighbor that is advertising that remote network. The route with
the lowest FD is the route that you will find in the routing table because it is considered the
best path. The metric of a feasible distance is the metric reported by the neighbor (called
reported or advertised distance) plus the metric to the neighbour reporting the route.
Reported/advertised distance (AD) This is the metric of a remote network, as reported by
a neighbor. It is also the routing table metric of the neighbor and is the same as the second
number in parentheses as displayed in the topology table, the first number being the feasible
distance.
Neighbor table Each router keeps state information about adjacent neighbors. When a
newly discovered neighbor is learned, the address and interface of the neighbor are
recorded, and this information is held in the neighbor table, stored in RAM. There is one
neighbor table for each protocol-dependent module. Sequence numbers are used to match
acknowledgments with update packets. The last sequence number received from the
neighbor is recorded so that out-of-order packets can be detected.
Topology table The topology table is populated by the protocol-dependent modules and
acted upon by the Diffusing Update Algorithm (DUAL). It contains all destinations advertised
by neighboring routers, holding each destination address and a list of neighbors that have
advertised the destination. For each neighbor, the advertised metric (distance), which comes
only from the neighbors routing table, is recorded as well as the FD. If the neighbor is
advertising this destination, it must be using the route to forward packets.
Feasible successor A feasible successor is a path whose advertised distance is less than
the feasible distance of the current successor, and it is considered a backup route. EIGRP
will keep up to 16 feasible successors in the topology table. Only the one with the best
metric (the successor) is copied and placed in the routing table. The show ip eigrp topology
command will display all the EIGRP feasible successor routes known to a router.
Successor A successor route (think successful!) is the best route to a remote network. A
successor route is used by EIGRP to forward traffic to a destination and is stored in the
routing table. It is backed up by a feasible successor route that is stored in the topology
tableif one is available.
EIGRP uses a proprietary protocol called Reliable Transport Protocol (RTP) to manage the
communication of messages between EIGRP speaking routers.
EIGRP uses Diffusing Update Algorithm (DUAL) for selecting and maintaining the best path
to each remote network. This algorithm allows for the following:
Backup route determination if one is available
Support of VLSMs
Dynamic route recoveries
Queries for an alternate route if no feasible successor route can be found
OSPF
Open Shortest Path First (OSPF) is an open standard routing protocol thats been
implemented by a wide variety of network vendors, including
Cisco.
Open Shortest Path First (OSPF) is an adaptive routing protocol for Internet Protocol (IP)
networks. It uses a link state routing algorithm and falls into the group of interior routing
protocols, operating within a single autonomous system
In OSPF ,first a shortest path tree is constructed, and then the routing table is populated with
the resulting best paths. OSPF converges quickly, although perhaps not as quickly as
EIGRP, and it supports multiple, equal-cost routes to the same destination. Like EIGRP, it
does support both IP and IPv6 routed protocols.
OSPF provides the following features:
Consists of areas and autonomous systems
Minimizes routing update traffic
Allows scalability
Supports VLSM/CIDR
Has unlimited hop count
Allows multi-vendor deployment (open standard)
OSPF TERMINOLOGY
Link A link is a network or router interface assigned to any given network. When an interface
is added to the OSPF process, its considered by OSPF to be a link. This link, or interface,
will have state information associated with it (up or down) as well as one or more IP
addresses.
Router ID The Router ID (RID) is an IP address used to identify the router. Cisco chooses
the Router ID by using the highest IP address of all configured loopback interfaces. If no
loopback interfaces are configured with addresses, OSPF will choose the highest IP address
of all active physical interfaces.
Neighbor Neighbors are two or more routers that have an interface on a common network,
such as two routers connected on a point-to-point serial link.
Adjacency An adjacency is a relationship between two OSPF routers that permits the direct
exchange of route updates. OSPF is really picky about sharing routing informationunlike
EIGRP, which directly shares routes with all of its neighbors. Instead, OSPF directly shares
routes only with neighbors that have also established adjacencies. And not all neighbors will
become adjacentthis depends upon both the type of network and the configuration of the
routers.
Hello protocol The OSPF Hello protocol provides dynamic neighbor discovery and
maintains neighbor relationships. Hello packets and Link State Advertisements (LSAs) build
and maintain the topological database. Hello packets are addressed to multicast address
224.0.0.5.
Neighborship database The neighborship database is a list of all OSPF routers for which
Hello packets have been seen. A variety of details, including the Router ID and state, are
maintained on each router in the neighborship database.
Topological database The topological database contains information from all of the Link
State Advertisement packets that have been received for an area. The router uses the
information from the topology database as input into the Dijkstra algorithm that computes the
shortest path to every network.
Link State Advertisement A Link State Advertisement (LSA) is an OSPF data packet
containing link-state and routing information thats shared among OSPF routers. There are
different types of LSA packets, and Ill go into these shortly. An OSPF router will exchange
LSA packets only with routers to which it has established adjacencies.
Designated router A designated router (DR) is elected whenever OSPF routers are
connected to the same multi-access network. Cisco likes to call these broadcast networks,
but really, they are networks that have multiple recipients. Try not to confuse multi-access
with multipoint, which can be easy to do sometimes.
A prime example is an Ethernet LAN. To minimize the number of adjacencies formed, a DR
is chosen (elected) to disseminate/receive routing information to/from the remaining routers
on the broadcast network or link. This ensures that their topology tables are synchronized.
All routers on the shared network will establish adjacencies with the DR and backup
designated router (BDR)Ill define this next. The election is won by the router with the
highest priority, and the highest Router ID is used as a tiebreaker if the priority of more than
one router turns out to be the same.
Backup designated router A backup designated router (BDR) is a hot standby for the DR
on multi-access links (remember that Cisco sometimes likes to call these broadcast
networks). The BDR receives all routing updates from OSPF adjacent routers but doesnt
flood LSA updates.
OSPF areas An OSPF area is a grouping of contiguous networks and routers. All routers in
the same area share a common Area ID.Because a router can be a member of more than
one area at a time, the Area ID is associated with specific interfaces on the router. This
would allow some interfaces to belong to area 1 while the remaining interfaces can belong to
area 0. All of the routers within the same area have the same topology table. When
configuring OSPF, youve got to remember that there must be an area 0 and that this is
typically considered the backbone area. Areas also play a role in establishing a hierarchical
network organizationsomething that really enhances the scalability of OSPF!
Broadcast (multi-access) Broadcast (multi-access) networks such as Ethernet allow
multiple devices to connect to (or access) the same network as well as provide a broadcast
ability in which a single packet is delivered to all nodes on the network. In OSPF, a DR and a
BDR must be elected for each broadcast multi-access network.
Non-broadcast multi-access Non-broadcast multi-access (NBMA) networks are types such
as Frame Relay, X.25, and Asynchronous Transfer Mode (ATM). These networks allow for
multi-access but have no broadcast ability like Ethernet. So, NBMA networks require special
OSPF configuration to function properly and neighbor relationships must be defined.
AREA TYPES
An OSPF domain is divided into areas that are labelled with 32-bit area identifiers. The area
identifiers are commonly, but not always, written in the dot-decimal notation of an IPv4
address. However, they are not IP addresses and may duplicate, without conflict, any IPv4
address. While most OSPF implementations will right-justify an area number written in a
format other than dotted decimal format (e.g., area 1). Most implementations expand area 1
to the area identifier 0.0.0.1, but some have been known to expand it as 1.0.0.0.
Areas are logical groupings of hosts and networks, including their routers having interfaces
connected to any of the included networks. Each area maintains a separate link state
database whose information may be summarized towards the rest of the network by the
connecting router. Thus, the topology of an area is unknown outside of the area. This
reduces the amount of routing traffic between parts of an autonomous system.
Do not confuse the DR with an OSPF router type. A given physical router can have some
interfaces that are designated (DR), others that are backup designated (BDR), and others
that are non-designated. If no router is DR or BDR on a given subnet, the DR is first elected,
and then a second election is held if there is more than one BDR. (A DR Election Detail
Simulation shows a step-by-step DR election example: How neighbor list, neighbor state,
DR, and BDR are changed when receiving Hello) The DR is elected based on the following
default criteria:
If the priority setting on an OSPF router is set to 0, that means it can NEVER become a
DR or BDR (Backup Designated Router).
When a DR fails and the BDR takes over, there is another election to see who becomes
the replacement BDR.
The router sending the Hello packets with the highest priority wins the election.
If two or more routers tie with the highest priority setting, the router sending the Hello
with the highest RID (Router ID) wins. NOTE: a RID is the highest logical (loopback) IP
address configured on a router, if no logical/loopback IP address is set then the Router
uses the highest IP address configured on its active interfaces. (e.g. 192.168.0.1 would
be higher than 10.1.1.2).
Usually the router with the second highest priority number becomes the BDR.
The priority values range between 0 - 255, with a higher value increasing its chances of
becoming DR or BDR.
IF a HIGHER priority OSPF router comes online AFTER the election has taken place, it
will not become DR or BDR until (at least) the DR and BDR fail.
If the current DR 'goes down' the current BDR becomes the new DR and a new election
takes place to find another BDR. If the new DR then 'goes down' and the original DR is
now available, still previously chosen BDR will become DR.
DR's exist for the purpose of reducing network traffic by providing a source for routing
updates. The DR maintains a complete topology table of the network and sends the updates
to the other routers via multicast. All routers in a multi-access network segment will form a
slave/master relationship with the DR. They will form adjacencies with the DR and BDR only.
Every time a router sends an update, it sends it to the DR and BDR on the multicast address
224.0.0.6. The DR will then send the update out to all other routers in the area, to the
multicast address 224.0.0.5. This way all the routers do not have to constantly update each
other, and can rather get all their updates from a single source. The use of multicasting
further reduces the network load. DRs and BDRs are always setup/elected on OSPF
broadcast networks. DR's can also be elected on NBMA (Non-Broadcast Multi-Access)
networks such as Frame Relay or ATM. DRs or BDRs are not elected on point-to-point links
(such as a point-to-point WAN connection) because the two routers on either sides of the
link must become fully adjacent and the bandwidth between them cannot be further
optimized. DR LSDB Synch Simulation shows how DR and non-DR routers evolve from 2way to full adjacency relationships by exchanging DD, Request, and Update.
OSPF Configuration
The two basic elements for OSPF configuration are:
X Enabling OSPF
X Configuring OSPF areas
The command for activating OSPF routing process is:
Lab_A(config)#router ospf ?
<1-65535> A value in the range 1-65,535 identifies the OSPF process ID
For configuring OSPF areas:
Lab_A#config t
Lab_A(config)#router ospf 1
Lab_A(config)#network 10.0.0.0 0.255.255.255 area 0
Here 10.0.0.0 is the network number and 0.255.255.255 is the wildcard mask. The
combination is useful for identifying the interfaces that OSPF will operate on.
SWITCHING
Basic concepts of Switching
Switches are layer 2 devices that can link up four, six, eight or even more networks.
Switches are the only devices that allow for microsegmentation.
Cut-through switches run faster because when a packet comes in, it forwards it right
after looking at the destination address only.
Switches are considered dedicated data link device because they are close to a 100
% of the bandwidth.
While bridging does its most of its work by software, switches use ASICS hardware
to handle most of its work. A switch can be thought of as a multi-port bridge.
Store-and-forward
The entire frame is received before any forwarding takes place. The destination and/or the
source addresses are read and filters are applied before the frame is forwarded. Latency
occurs while the frame is being received; the latency is greater with larger frames because
the entire frame takes longer to read. Error detection is high because of the time available to
the switch to check for errors while waiting for the entire frame to be received. This method
discards frames smaller than 64 bytes (runts) and frames larger than 1518 bytes (giants).
Cut-Through
The switch reads the destination address before receiving the entire frame. The frame is
then forwarded before the entire frame arrives. This mode decreases the latency of the
transmission and has poor error detection. This method has two forms, Fast-forward and
fragment-free.
Fast-forward switching
Fast-forward switching offers the lowest level of latency by immediately forwarding a packet
after receiving the destination address. Because fast-forward switching does not check for
errors, there may be times when frames are relayed with errors. Although this occurs
infrequently and the destination network adapter discards the fault frame upon receipt. In
networks with high collision rates, this can negatively affect available bandwidth.
Fragment Free Switching
Use the fragment-free option to reduce the number of collisions frames forwarded with
errors. In fast-forward mode, latency is measured from the first bit received to the first bit
transmitted, or first in, first out (FIFO). Fragment-free switching filters out collision fragments,
which are the majority of packets errors, before forwarding begins. In a properly functioning
network, collision fragments must be smaller than 64 bytes.
Anything greater than 64 bytes is a valid packet and is usually received without error.
Fragment-free switching waits until the received packet has been determined not to be a
collision fragment before forwarding the packet. In fragment-free, latency is measured as
FIFO.
Advantages of switching:
Bandwidth---LAN switches provide excellent performance for individual users by
allocating dedicated bandwidth to each switch port (for example, each network
segment). This technique is known as microsegmenting.
VLANs---LAN switches can group individual ports into logical switched workgroups
called VLANs, thereby restricting the broadcast domain to designated VLAN member
ports. VLANs are also known as switched domains and autonomous switching
domains. Communication between VLANs requires a router.
Disadvantages of switching:
Not as good as a router in limiting Broadcasts.
Communication b/w VLAN's need interVLAN routing [Router], but these days there
are a number of Multilayer switches available in the market.
Handling Multicast packets needs quite a bit of configuration & proper designing.
Spanning-Tree Protocol
Spanning-Tree Protocol is a link management protocol that provides path redundancy while
preventing undesirable loops in the network. For an Ethernet network to function properly,
only one active path can exist between two stations.
Multiple active paths between stations cause loops in the network. If a loop exists in the
network topology, the potential exists for duplication of messages. When loops occur,some
switches see stations appear on both sides of the switch. This condition confuses the
forwarding algorithm and allows duplicate frames to be forwarded. To provide path
redundancy, Spanning-Tree Protocol defines a tree that spans all switches in an extended
network. Spanning-Tree Protocol forces certain redundant data paths into a standby
(blocked) state. If one network segment in the Spanning-Tree Protocol becomes
unreachable, or if Spanning-Tree Protocol costs change, the spanning-tree algorithm
reconfigures the spanning-tree topology and re-establishes the link by activating the standby
path.
Election of the Root Switch
All switches in an extended LAN participating in Spanning-Tree Protocol gather information
on other switches in the network through an exchange of data messages. These messages
are bridge protocol data units (BPDUs). This exchange of messages results in the following:
The election of a unique root switch for the stable spanning-tree network topology.
The election of a designated switch for every switched LAN segment.
The removal of loops in the switched network by placing redundant switch ports in a
backup state.
The Spanning-Tree Protocol root switch is the logical centre of the spanning-tree topology in
a switched network. All paths that are not needed to reach the root switch from anywhere in
the switched network are placed in Spanning-Tree Protocol backup mode.
BPDUs contain information about the transmitting switch and its ports, including switch and
port Media Access Control (MAC) addresses, switch priority, port priority, and port cost. The
Spanning-Tree Protocol uses this information to elect the root switch and root port for the
switched network, as well as the root port and designated port for each switched segment.
The path cost to the root associated with each switch port.
The port identifier (MAC address) associated with each switch port.
The cost of the path to the root from the transmitting port.
The switch sends configuration BPDUs to communicate and compute the spanning-tree
topology. A MAC frame conveying a BPDU sends the switch group address to the
destination address field. All switches connected to the LAN on which the frame is
transmitted receive the BPDU. BPDUs are not directly forwarded by the switch, but the
information contained in the frame can be used to calculate a BPDU by the receiving switch,
and, if the topology changes, instigate a BPDU transmission.
A BPDU exchange results in the following:
One switch is elected as the root switch.
The shortest distance to the root switch is calculated for each switch.
A designated switch is selected. This is the switch closest to the root switch through
which frames will be forwarded to the root.
A port for each switch is selected. This is the port providing the best path from the
switch to the root switch.
Learning
Forwarding
Disabled
You can modify each port state by using management software. When Spanning-Tree
Protocol is enabled, every switch in the network goes through the blocking state and the
transitory states of listening and learning at power up. If properly configured, the ports then
stabilize to the forwarding or blocking state. When the spanning-tree algorithm determines
that a port should be placed in the forwarding state, the following occurs:
The port is put into the listening state while it waits for protocol information that
suggests it should go to the blocking state.
The port waits for the expiration of a protocol timer that moves the port to the
learning state.
In the learning state, the port continues to block frame forwarding as it learns station
location information for the forwarding database.
The expiration of a protocol timer moves the port to the forwarding state, where both
learning and forwarding are enabled.
Blocking State
A port in the blocking state does not participate in frame forwarding, as shown in
Figure C-5. After initialization, a BPDU is sent to each port in the switch. A switch
initially assumes it is the root until it exchanges BPDUs with other switches. This
exchange establishes which switch in the network is really the root. If only one
switch resides in the network, no exchange occurs, the forward delay timer expires,
and the ports move to the listening state. A switch always enters the blocking state
following switch initialization.
A port in the blocking state performs as follows:
Discards frames received from the attached segment.
Does not incorporate station location into its address database. (There is no learning
at this point, so there is no address database update.)
Listening State
The listening state is the first transitional state a port enters after the blocking state, when
Spanning-Tree Protocol determines that the port should participate in frame forwarding.
Learning is disabled in the listening state.
A port in the listening state performs as follows:
Learning State
A port in the learning state is preparing to participate in frame forwarding. This is the second
transitional state through which a port moves in anticipation of frame forwarding. The port
enters the learning state from the listening state through the operation of Spanning-Tree
Protocol. A port in the learning state performs as follows:
Discards frames received from the attached segment.
Discards frames switched from another port for forwarding.
Incorporates station location into its address database.
Receives BPDUs and directs them to the system module.
Receives, processes, and transmits BPDUs received from the system module.
Receives and responds to network management messages.
Forwarding State
A port in the forwarding state forwards frames, as shown in Figure C-5. The port enters the
forwarding state from the learning state through the operation of Spanning-Tree Protocol. A
port in the forwarding state performs as follows:
Forwards frames received from the attached segment.
Forwards frames switched from another port for forwarding.
Incorporates station location information into its address database.
Receives BPDUs and directs them to the system module.
Processes BPDUs received from the system module.
Receives and responds to network management messages.
really be felt when good management tools are created which can allow network managers
to drag and drop users into different VLAN's or to set up aliases.
4) Security Periodically, sensitive data may be broadcast on a network. In such cases,
placing only those users who can have access to that data on a VLAN can reduce the
chances of an outsider gaining access to the data. VLAN's can also be used to control
broadcast domains, set up firewalls, restrict access, and inform the network manager of an
intrusion.
Types of VLAN's
1) Membership by Port Membership in a VLAN can be defined based on the ports that
belong to the VLAN. For example, in a bridge with four ports, ports 1, 2, and 4 belong to
VLAN 1 and port 3 belongs to VLAN 2.
2) Membership by MAC Address Here, membership in a VLAN is based on the MAC
address of the workstation. The switch tracks the MAC addresses which belong to each
VLAN. Since MAC addresses form a part of the workstation's network interface card, when a
workstation is moved, no reconfiguration is needed to allow the workstation to remain in the
same VLAN. This is unlike Layer 1 VLAN's where membership tables must be reconfigured.
MAC address
1534657987368
1267276378839
3457882782008
2363738300380
VLAN
1
2
2
1
VLAN
1
2
Types of Connections
Devices on a VLAN can be connected in three ways based on whether the connected
devices are VLAN-aware or VLAN-unaware. Recall that a VLAN-aware device is one which
understands VLAN memberships (i.e. which users belong to a VLAN) and VLAN formats.
1) Trunk Link All the devices connected to a trunk link, including workstations, must be
VLAN-aware. All frames on a trunk link must have a special header attached. These special
frames are called tagged frames.
2) Access Link An access link connects a VLAN-unaware device to the port of a VLANaware bridge. All frames on access links must be implicitly tagged (untagged). The VLANunaware device can be a LAN segment with VLAN-unaware workstations or it can be a
number of LAN segments containing VLAN-unaware devices (legacy LAN).
i)
ii)
Dynamic Entries Dynamic entries are learned by the bridge and cannot be
created or updated by management. The learning process observes the port from
which a frame, with a given source address and VLAN ID (VID), is received, and
updates the filtering database. The entry is updated only if all the following three
conditions are satisfied: a) This port allows learning, b) The source address is a
workstation address and not a group address, and c) There is space available in
the database.
Ether Channel
EtherChannel is a port link aggregation technology or port-channel architecture used
primarily on Cisco switches. It allows grouping several physical Ethernet links to create one
logical Ethernet link for the purpose of providing fault-tolerance and high-speed links
between switches, routers and servers. An EtherChannel can be created from between two
and eight active Fast, Gigabit or 10-Gigabit Ethernet ports, with an additional one to eight
inactive (failover) ports which become active as the other active ports fail. EtherChannel is
primarily used in the backbone network, but can also be used to connect end user machines.
Benefits: Using the maximum of 8 active ports a total bandwidth of 800 Mbit/s, 8 Gbit/s or
80 Gbit/s is possible depending on port speed. This assumes there is a traffic mixture, as
those speeds do not apply to a single application only. It can be used with Ethernet running
on twisted pair wiring, single-mode and multimode fibre. Because EtherChannel takes
advantage of existing wiring it makes it very scalable. It can be used at all levels of the
network to create higher bandwidth links as the traffic needs of the network increase. All
Cisco switches have the ability to support EtherChannel. When an EtherChannel is
configured all adapters that are part of the channel share the same Layer 2 (MAC) address.
This makes the EtherChannel transparent to network applications and users because they
only see the one logical connection; they have no knowledge of the individual links.
EtherChannel aggregates the traffic across all the available active ports in the channel. The
port is selected using a Cisco-proprietary hash algorithm, based on source or destination
MAC addresses, IP addresses or TCP and UDP port numbers. The hash function gives a
number between 0 and 7, and the following table shows how the 8 numbers are distributed
among the 2 to 8 physical ports. In the hypothesis of real random hash algorithm, 2, 4 or 8
ports configurations lead to fair load-balancing, whereas other configurations lead to unfair
load-balancing. Fault-tolerance is another key aspect of EtherChannel. Should a link fail, the
EtherChannel technology will automatically redistribute traffic across the remaining links.
This automatic recovery takes less than one second and is transparent to network
applications and the end user. This makes it very resilient and desirable for mission-critical
applications.
Spanning tree protocol can be used with an EtherChannel. STP treats all the links as a
single one and BPDUs are only sent down one of the links. Without the use of an
EtherChannel, STP would effectively shut down any redundant links between switches until
one connection goes down. This is where an EtherChannel is most desirable; it allows full
use of all available links between two devices.
EtherChannel can be also configured as VLAN trunks. If any single link of an EtherChannel
is configured as a VLAN trunk, the entire EtherChannel will act as a VLAN trunk. Cisco ISL,
VTP and IEEE 802.1Q are compatible with EtherChannel.
Limitations:
A limitation of EtherChannel is that all the physical ports in the aggregation group must
reside on the same switch. Avaya's SMLT protocol removes this limitation by allowing the
physical ports to be split between two switches in a triangle configuration or 4 or more
switches in a mesh configuration. Cisco's Virtual Switching System allows the creation of a
Multichassis EtherChannel (MEC) similar to the DMLT protocol allowing ports to be
aggregated towards different physical chassis that conform a single "virtual switch" entity.
Components: EtherChannel is made up of the following key elements:
done for the corresponding ports on both sides of the EtherChannel. The second
way is using Cisco Port Aggregation Protocol for the automated aggregation of
Ethernet ports.
INSTALLING GNS3
Step 1 Download GNS3
The easiest way to install GNS3 in a Windows environment is to download the all-in-one version.
The file is a little under 16 MB in size and will take less than a minute to download on a DSL or
cable connection. Dial-up connections will take somewhat longer.
Step 2 Install GNS3
router IOS
Router(config-line)#line vty 0 4
Router(config-line)# password admin2
Router(config-line)# login
Cisco Command
Router(config)#line con 0
Router(config-line)#password cisco
Router(config-line)#login
Router(config)#line vty 0 4
Router(config-line)#password cisco
Router(config-line)#login
Router(config)#line con 0
Router(config-line)#exec-timeout 0 0
To disable an interface
Router(config-if)#shutdown
To add an IP address
to a interface
Router(config-if)#no shutdown
show version
View current
configuration
(DRAM)
show running-config
show flash
show log
Shows all logs that the
router has in its
memory
Cisco Router Basic Operations
Enable
Disable
Exit Router
up arrow or <Ctrl-P>
Suspend or abort
<Shift> and
<Ctrl-R>
Complete Command
TAB
The time is in 24 hour mode. To see the information about the clock
settings, use:
Router# show clock detail 22:56:07.136 PDT Wed Jun 20 2012
Time source is user configuration
This will show the current date and time and the source of the
time configuration (in this case showing that the time was manually set).
.
When pinging to the other node r2 in the same network i.e connected to
the same interface the delivery ratio was 0.8