Huawei Certification

HCIA-Routing and / e n
o m
c
Switching ENTRY we i .
ua
h .
Huawei Networking Technology and
g
in Device
r n
l e a
: / /
t tp
: h
es
r c
ou
es
R
i n g
a rn
Le
r e
o
M Huawei Technologies Co.,Ltd.
 Copyright © Huawei Technologies Co., Ltd. 2016.

All rights reserved.

Huawei owns all copyrights, except for references to other parties. No part of this

document may be reproduced or transmitted in any form or by any means without

prior written consent of Huawei Technologies Co., Ltd.

e n
Trademarks and Permissions
/
and other Huawei trademarks are trademarks of Huawei Technologies Co.,
. c om
Ltd.
e i
a w
All other trademarks and trade names mentioned in this document are the property

hu
of their respective holders.

g .
Notice
nin
r
//lea
:
The information in this manual is subject to change without notice. Every effort has

p
t
been made in the preparation of this manual to ensure accuracy of the contents, but
t
h
all statements, information, and recommendations in this manual do not constitute
:
s
the warranty of any kind, express or implied.
e
r c
ou
es
R
i n g
n
ar
Le
Huawei Certification

r e
o HCIA-Routing and Switching
M Huawei Networking Technology and Device

Entry

Version 2.2
 Huawei Certification System

Relying on its strong technical and professional training and certification system
and in accordance with customers of different ICT technology levels, Huawei
certification is committed to providing customers with authentic, professional
certification, and addresses the need for the development of quality engineers that
are capable of supporting Enterprise networks in the face of an ever changing ICT

e n
industry. The Huawei certification portfolio for routing and switching (R&S) is
/
om
comprised of three levels to support and validate the growth and value of customer
skills and knowledge in routing and switching technologies.
i . c
The Huawei Certified ICT Associate (HCIA) certification level validates the skills
we
a
hu
and knowledge of IP network engineers to implement and support small to
medium-sized enterprise networks. The HCIA certification provides a rich
g .
foundation of skills and knowledge for the
n in
establishment of such

r
enterprise networks, along with the capability to implement services and

lea
features within existing enterprise networks, to effectively support true industry

//
operations.
p :
t
HCIA certification covers fundamentals skills for TCP/IP, routing, switching and
t
h
related IP network technologies, together with Huawei data communications
:
s
products, and skills for versatile routing platform (VRP) operation and management.
e
r c
The Huawei Certified
ou ICT Professional (HCIP) certification is aimed at

s
enterprise network engineers involved in design and maintenance, as well as
e
R
professionals who wish to develop an in depth knowledge of routing,
switching,
i n g network efficiency and optimization technologies. HCIP
consists
n of three units including Implementing Enterprise Routing and

e ar
Switching Network , Improving Enterprise Network Performance , and

e LImplementing Enterprise Network Engineering Project , which includes

or
advanced IPv4 routing and switching technology principles, network security,
high availability and QoS, as well as application of the covered
M technologies in Huawei products.
The Huawei Certified ICT Expert (HCIE) certification is designed to imbue
engineers with a variety of IP network technologies and proficiency in
maintenance, for the diagnosis and troubleshooting of Huawei products, to equip
engineers with in-depth competency in the planning, design and optimization
of large-scale IP networks.
 Foreword
Outline

The Routing and Switching guide contains content relating to the HCIA certification, for

development of engineers who wish to prepare for the HCIA-Routing and Switching

examination or familiarize with TCP/IP technologies and protocols, as well as LAN, WAN

technologies and products, including VRP.

Content
e n
/
om
The book contains a total of five modules, starting from the basic knowledge of data

i . c
communications; this guide introduces the fields of switching, routing, WAN, IP security and

we
other basic knowledge, as well as configuration and implementation of covered technologies
a
using the VRP platform.
. hu
in g
Module 1 systematically introduces the IP network infrastructure, TCP/IP models aid in the

r n
lea
establishment of a firm technical foundation on which data communications technologies can

: //
be applied. In highlighting functions and roles of the network layer, transport layer and

t t p
application layer, this module enables engineers to master the function and roles of

: h
s
communication networks in a variety of products.
e
r c
Module 2 describes the basics for navigation and operation of the Huawei versatile routing

ou
es
platform (VRP), to enhance the skills for navigation and management of Huawei VRP

R
i n g
supported products.

n
Module 3 introduces link layer technologies, and demonstrates how Ethernet based local area

e ar
network (LAN) products are used together with technologies such as STP and RSTP, in order

e L
or
to improve the ability of engineers in establishing and maintaining local networks.

M Module 4 describes the basics of routing technologies, as well as static routing and dynamic

routing protocols. This module builds an understanding the principles of routing along with

skills and knowledge for basic implementation and support of RIP and OSPF protocols.

Module 5 introduces common application services for IP networks in the form of DHCP, FTP

and Telnet for the enterprise network, to build competency of engineers and administrators in

supporting application layer services within Huawei products.

 Contents

Basic Enterprise Network Architectures ...................................................................................1

Introduction to Transmission Media .........................................................................................9
Ethernet Framing .....................................................................................................................22

n
IP Addressing............................................................................................................................42
Internet Control Message Protocol .........................................................................................69
/ e
Address Resolution Protocol ...................................................................................................84

. c om
e i
Transport Layer Protocols .......................................................................................................99

a w
Data Forwarding Scenario .....................................................................................................116

hu
VRP Foundation .....................................................................................................................133
.
in g
Navigating the CLI ..................................................................................................................148

r n
File System Navigation and Management. ...........................................................................167

lea
VRP Operating System Image Management.........................................................................186

//
p :
Establishing a Single Switched Network ...............................................................................200

t t
h
Spanning Tree Protocol .........................................................................................................212

s :
Rapid Spanning Tree Protocol ...............................................................................................244

r c e
Basic Knowledge of IP Routing ..............................................................................................270

ou
s
IP Static Routes ......................................................................................................................283

R e
Distance Vector Routing with RIP .........................................................................................299

n g
Link State Routing with OSPF ................................................................................................326
i
n
ar
DHCP Protocol Principles .......................................................................................................355

L e
FTP Protocol Principles ..........................................................................................................372

e
or
Telnet Protocol Principles......................................................................................................383

M
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

1／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

2／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

3／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The enterprise network originally represents the interconnection of systems

: h
belonging to a given functional group or organization to primarily enable the
sharing of resources such as printers and file servers, communication support

es
through means such as email, and the evolution towards applications that

c
enable collaboration between users. Enterprise networks can be found today
r
ou
present within various industries from office environments to larger energy,
finance and government based industries, which often comprise of enterprise

es
networks that span multiple physical locations.

R
The introduction of the Internet as a public network domain allowed for an

i n g
extension of the existing enterprise network to occur, through which
geographically dispersed networks belonging to a single organization or entity

rn
could be connected, bringing with it a set of new challenges to establish

a
interconnectivity between geographically dispersed enterprise networks, whilst

L emaintaining the privacy and security of data belonging to an individual

enterprise.

r e
o
M

4／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Various challenges impact today’s industries in providing solutions for

: h
establishment of interconnectivity between remote locations, which often take
the form of regional branch and head offices, as well as employees that

es
represent a non fixed entity within the enterprise network, often being present

c
in locations beyond the conventional boundaries of the existing enterprise.
r
ou
Challenges for industries have created a demand for ubiquitous networks that
allow the enterprise network to be available from any location and at any time,

es
to ensure access to resources and tools that allow for the effective delivery of

R
support and services to industry partners and customers.

i n g
The evolution in enterprise solutions has enabled for public and third party IP
networks to provide this anywhere anytime connectivity, along with the

rn
development of technologies that establish private network connections over

a
this public network infrastructure, to extend the remote capabilities of the

L eenterprise network beyond the physical boundaries of the enterprise, allowing

remote office and users alike to establish a single enterprise domain that

r e spans over a large geographic expanse.

o
M

5／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Enterprise network architecture solutions vary significantly depending on the

: h
requirement of the industry and the organization. Smaller enterprise
businesses may often have a very limited requirement in terms of complexity

es
and demand, opting to implement a flat form of network, mainly due to the size

c
of the organization that is often restricted to a single geographical location or
r
ou
within a few sites, supporting access to common resources, while enabling
flexibility within the organization to support a smaller number of users. The

es
cost to implement and maintain such networks is significantly reduced,

R
however the network is often susceptible to failure due to lack of redundancy,
and performance may vary based on daily operations and network demand.

i n g
Larger enterprise networks implement solutions to ensure minimal network

rn
failure, controlled access and provision for a variety of services to support the

a
day-to-day operations of the organization. A multi layered architecture is

L edefined to optimize traffic flow, apply policies for traffic management and
controlled access to resources, as well as maintain network availability and

r e stable operation through effective network redundancy. The multi layer design

o also enables easy expansion, and together with a modular design that
provides for effective isolation and maintenance should problems in the
M network occur, without impacting the entire network.

6／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
1. Small enterprise networks that implement a flat network architecture may

: h
limit the capability to scale the network in the event of growth in the number of
users. Where it is expected that a larger number of users will need to be

es
supported, a hierarchical approach to enterprise networks should be

c
considered. Medium-sized networks will generally support a greater number of
r
ou
users, and therefore will typically implement a hierarchical network
infrastructure to allow the network to grow and support the required user base.

es
2. Small and medium sized enterprise networks must take into account the

R
performance of the network as well as providing redundancy in the event of

i n g
network failure in order to maintain service availability to all users. As the
network grows, the threat to the security of the network also increases which

rn
may also hinder services.

e a
e L
o r
M

7／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

8／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

9／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

10／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

11／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
A network can be understood to be the capability of two or more entities to

: h
communicate over a given medium. The development of any network relies on
this same principle for establishing communication. Commonly the entities

es
within a network that are responsible for the transmission and reception of

c
communication are known as end stations, while the means by which
r
ou
communication is enabled is understood to be the medium. Within an
enterprise network, the medium exists in a variety of forms from a physical

es
cable to radio waves.

R
i n g
arn
L e
r e
o
M

12／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The coaxial cable represents a more historic form of transmission medium that

: h
may today be limited in usage within the enterprise network. As a transmission
medium, the coaxial cable comprises generally of two standards, the 10Base2

es
and 10Base5 forms, that are known as Thinnet or Thinwire, and Thicknet or
Thickwire respectively.
r c
u
The standards both support a transmission capacity of 10Mbps transmitted as

o
s
baseband signals for respective distances of 185 and 500 meters. In today’s

R e
enterprise networks, the transmission capacity is extremely limited to be of
any significant application. The Bayonet Neill-Concelman (BNC) connector is

i n g
the common form of connector used for thin 10Base2 coaxial cables, while a
type N connector was applied to the thicker 10Base5 transmission medium.

arn
L e
r e
o
M

13／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Ethernet cabling has become the standard for many enterprise networks

: h
providing a transmission medium that supports a much higher transmission
capacity. The medium supports a four copper wire pair contained within a

es
sheath which may or may not be shielded against external electrical

c
interference. The transmission capacity is determined mainly based on the
r
ou
category of cable with category 5 (CAT5) supporting Fast Ethernet
transmission capacity of up to 100Mbps, while a higher Gigabit Ethernet

es
transmission capacity is supported from Category 5 extended (CAT5e)

R
standards and higher.

i n g
The transmission over Ethernet as a physical medium is also susceptible to
attenuation, causing the transmission range to be limited to 100 meters. The

rn
RJ-45 connector is used to provide connectivity with wire pair cabling requiring

a
specific pin ordering within the RJ-45 connector, to ensure correct

L etransmission and reception by end stations over the transmission medium.

r e
o
M

14／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Optical media uses light as a means of signal transmission as opposed to

: h
electrical signals found within both Ethernet and coaxial media types. The
optical fiber medium supports a range of standards of 10Mbps, 100Mbps,

es
1Gbps and also 10Gbps (10GBASE) transmission. Single or multi-mode fiber

c
defines the use of an optical transmission medium for propagating of light,
r
ou
where single mode refers to a single mode of optical transmission being
propagated, and is used commonly for high speed transmission over long
distances.
es
R
Multi mode supports propagation of multiple modes of optical transmission

i n g
that are susceptible to attenuation as a result of dispersion of light along the
optical medium, and therefore is not capable of supporting transmission over

rn
longer distances. This mode is often applied to local area networks which

a
encompass a much smaller transmission range. There are an extensive

L enumber of fiber connector standards with some of the more common forms
being recognized as the ST connector, LC connector and SC, or snap

r e connector.

o
M

15／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t
Serial represents a standard initially developed over 50 years ago to support
t
: h
reliable transmission between devices, during which time many evolutions of
the standard have taken place. The serial connection is designed to support

es
the transmission of data as a serial stream of bits. The common standard

c
implemented is referred to as (Recommended Standard) RS-232 but it is
r
u
limited somewhat by both distance and speed. Original RS-232 standards

s o
define that communication speeds supported be no greater that 20Kbps,
based on a cable length of 50ft (15 meters), however transmission speeds for

R e
serial is unlikely to be lower than 115 Kbps. The general behavior for serial
means that as the length of the cable increases, the supported bit rate will

n g
decrease, with an approximation that a cable of around 150 meters, or 10
i
times the original standards, the supported bit rate will be halved.

arn
Other serial standards have the capability to achieve much greater

L etransmission ranges, such as is the case with the RS-422 and RS-485
standards that span distances of up to 4900ft (1200 meters) and are often

r e supported by V.35 connectors that were made obsolete during the late 1980’s

o but are still often found and maintained today in support of technologies such
as Frame Relay and ATM, where implemented. RS-232 itself does not define
M connector standards, however two common forms of connector that support
the RS-232 standard include the DB-9 and DB-25 connectors. Newer serial
standards have been developed to replace much of the existing RS-232 serial
technology, including both FireWire and the universal serial bus (USB)
standards, that latter of which is becoming common place in many newer
products and devices.

16／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
In order to enable communication over physical links, signals must be

: h
transmitted between the transmitting and receiving stations. This signal will
vary depending on the medium that is being used, as in the case of optical and

es
wireless transmission. The main purpose of the signal is to ensure that

c
synchronization (or clocking) between the sender and receiver over a physical
r
ou
medium is maintained, as well as support transmission of the data signal in a
form that can be interpreted by both the sender and receiver.

es
A waveform is commonly recognized as a property of line encoding where the

R
voltage is translated into a binary representation of 0 and 1 values that can be

i n g
translated by the receiving station. Various line coding standards exist, with
10Base Ethernet standards supporting a line encoding standard known as

rn
Manchester encoding. Fast Ethernet with a frequency range of 100MHz

a
invokes a higher frequency than can be supported when using Manchester

L eencoding.
An alternative form of line encoding is therefore used known as NZRI, which in

r e itself contains variations dependant on the physical media, thus supporting

o MLT-3 for 100Base-TX and 100Base-FX together with extended line encoding

M known as 4B/5B encoding to deal with potential clocking issues. 100Base-T4

for example uses another form known as 8B/6T extended line encoding.
Gigabit Ethernet supports 8B/10B line encoding with the exception of
1000Base-T which relies on a complex block encoding referred to as 4D-
PAM5.

17／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Ethernet represents what is understood to be a multi-access network, in which

: h
two or more end stations share a common transmission medium for the
forwarding of data. The shared network is however susceptible to transmission

es
collisions where data is forwarded by end stations simultaneously over a

c
common medium. A segment where such occurrences are possible is referred
r
u
to as a shared collision domain.

o
s
End stations within such a collision domain rely on contention for the

R e
transmission of data to an intended destination. This contentious behavior
requires each end station monitor for incoming data on the segment before

i n g
making any attempt to transmit, in a process referred to as Carrier Sense
Multiple-Access Collision Detection (CSMA/CD). However, even after taking

rn
such precautions the potential for the occurrence of collisions as a result of

a
simultaneous transmission by two end stations remains highly probable.

L e
r e
o
M

18／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Transmission modes are defined in the form of half and full duplex, to

physical medium.
: h
determine the behavior involved with the transmission of data over the

es
Half duplex refers to the communication of two or more devices over a shared

r c
physical medium in which a collision domain exists, and with it CSMA/CD is

u
required to detect for such collisions. This begins with the station listening for

o
s
reception of traffic on its own interface, and where it is quiet for a given period,

R e
will proceed to transmit its data. If a collision were to occur, transmission
would cease, followed by initiation of a backoff algorithm to prevent further

i n g
transmissions until a random value timer expires, following which
retransmission can be reattempted.

rn
Full duplex defines the simultaneous bidirectional communication over

e a
dedicated point-to-point wire pairs, ensuring that there is no potential for
collisions to occur, and thus there is no requirement for CSMA/CD.

e L
o r
M

19／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
1. Gigabit Ethernet transmission is supported by CAT 5e cabling and higher,

h
and also any form of 1000Base Fiber Optic cabling or greater.

:
es
2. A collision domain is a network segment for which the same physical
medium is used for bi-directional communication. Data simultaneously

r c
transmitted between hosts on the same shared network medium is

u
susceptible to a collision of signals before those signals reach the

o
s
intended destination. This generally results in malformed signals either

R e
larger or smaller than the acceptable size for transmission (64 bytes –
1500 bytes), also know as runts and giants, being received by the

i n g
recipient.
3. CSMA/CD is a mechanism for detecting and minimizing the possibility of

rn
collision events that are likely to occur in a shared network. CSMA

e a requires that the transmitting host first listen for signals on the shared
medium prior to transmission. In the event that no transmissions are

e L detected, transmission can proceed. In the unfortunate circumstance that

o r signals are transmitted simultaneously and a collision occurs, collision

detection processes are applied to cease transmission for a locally

M generated period of time, to allow collision events to clear and to avoid

further collisions from occurring between transmitting hosts.

20／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

21／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

22／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

23／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

24／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Communication over networks relies on the application of rules that govern

: h
how data is transmitted and processed in a manner that is understood by both
the sending and receiving entities. As a result, multiple standards have been

es
developed over the course of time with some standards becoming widely

c
adopted. There exists however a clear distinction between the standards that
r
ou
manage physical data flow and the standards responsible for logical
forwarding and delivery of traffic.

es
The IEEE 802 standards represent a universal standard for managing the

R
physical transmission of data across the physical network and comprises of

i n g
standards including the Ethernet standard 802.3 for physical transmission over
local area networks. Alternative standards exist for transmission over wide

rn
area networks operating over serial based media, including Frame Relay,

a
HDLC and more legacy standards such as ATM. TCP/IP has been widely

L eadopted as the protocol suite defining the upper layer standards, regulating
the rules (protocols) and behavior involved in managing the logical forwarding

r e and delivery between end stations.

o
M

25／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The TCP/IP reference model primarily concerns with the core principles of the

: h
protocol suite, which can be understood as the logical transmission and
delivery of traffic between end stations. As such the TCP/IP protocol reference

es
model provides a four layer representation of the network, summarizing

c
physical forwarding behavior under the network interface layer, since lower
r
u
layer operation is not the concern of the TCP/IP protocol suite.

o
s
Primary focus remains on the network (or Internet) layer which deals with how

R e
traffic is logically forwarded between networks, and the transport (sometimes
referred to as host-to-host) layer that manages the end-to-end delivery of

i n g
traffic, ensuring reliability of transportation between the source and destination
end stations. The application layer represents an interface through a variety of

rn
protocols that enable services to be applied to end user application processes.

e a
e L
o r
M

26／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Although the TCP/IP reference model is primarily supported as the standard

: h
model based on TCP/IP protocol suite, the focus of the TCP/IP reference
model does not clearly separate and distinguish the functionality when

es
referring lower layer physical transmission.

r c
In light of this, the open systems interconnection, or OSI reference model is

u
often recognized as the model for reference to IEEE 802 standards due to the

o
s
clear distinction and representation of the behavior of lower layers which

R e
closely matches the LAN/MAN reference model standards that are defined as
part of the documented IEEE 802-1990 standards for local and metropolitan

i n g
area networks. In addition, the model that is generally in reference to the ISO
protocol suite, provides an extended breakdown of upper layer processing.

arn
L e
r e
o
M

27／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
As upper layer application data is determined for transmission over a network

: h
from an end system, a series of processes and instructions must be applied to
the data before transmission can be successfully achieved. This process of

es
appending and pre-pending instructions to data is referred to as encapsulation

c
and for which each layer of the reference model is designed to represent.
r
u
As instructions are applied to the data, the general size of the data increases.

o
s
The additional instructions represent overhead to the existing data and are

R e
recognized as instructions to the layer at which the instructions were applied.
To other layers, the encapsulated instructions are not distinguished from the

i n g
original data. The final appending of instructions is performed as part of the
lower layer protocol standards (such as the IEEE 802.3 Ethernet standard)

rn
before being carried as an encoded signal over a physical medium.

e a
e L
o r
M

28／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
As part of the IEEE 802.3 Ethernet standard, data is encapsulated with

: h
instructions in the form of a header and a trailer before it can be propagated
over physical media on which Ethernet is supported. Each stage of

es
encapsulation is referred to by a protocol data unit or PDU, which at the data

c
link layer is known as a frame.
r
u
Ethernet frames contain instructions that govern how and whether data can be

o
s
transmitted over the medium between two or more points. Ethernet frames

R e
come in two general formats, the selection of which is highly dependant on the
protocols that have been defined prior to the framing encapsulation.

i n g
arn
L e
r e
o
M

29／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Two frame formats are recognized as standard for Ethernet based networks.

: h
The DIX version 2 frame type standard was originally developed during the
early 1980’s, where today it is recognized as the Ethernet II frame type.

es
Ethernet II was eventually accepted and integrated into the IEEE 802

c
standards, highlighted as part of section 3.2.6 of the IEEE 802.3x-1997
r
ou
standards documentation. The IEEE 802.3 Ethernet standard was originally
developed in 1983, with key differences between the frame formats including a

es
change to the type field that is designed to identify the protocol to which the

R
data should be forwarded to once the frame instructions have been processed.
In the IEEE 802.3 Ethernet format, this is represented as a length field which

n g
relies on an extended set of instructions referred to as 802.2 LLC to identify
i
rn
the forwarding protocol.

ea
Ethernet II and IEEE 802.3 associate with upper layer protocols that are
distinguished by a type value range, where protocols supporting a value less

e L than or equal to 1500 (or 05DC in Hexadecimal) will employ the IEEE 802.3

or
Ethernet frame type at the data link layer. Protocols represented by a type
value greater than or equal to 1536 (or 0600 in Hexadecimal) will employ the
Ethernet II standard, and which represents the majority of all frames within
M Ethernet based networks.
Other fields found within the frame include the destination and source MAC
address fields that identify the sender and the intended recipient(s), as well as
the frame check sequence field that is used to confirm the integrity of the
frame during transmission.

30／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The Ethernet II frame references a hexadecimal type value which identifies the

: h
upper layer protocol. One common example of this is the Internet Protocol (IP)
which is represented by a hexadecimal value of 0x0800. Since this value for

es
IP represents a value greater than 0x0600, it is determined that the Ethernet II

c
frame type should be applied during encapsulation. Another common protocol
r
ou
that relies on the Ethernet II frame type at the data link layer is ARP, and is
represented by the hexadecimal value of 0x0806.

es
R
i n g
arn
L e
r e
o
M

31／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
For the IEEE 802.3 frame type, the type field is contained as part of the SNAP

: h
extension header and is not so commonly applied the protocols in today’s
networks, partially due to the requirement for additional instructions which

es
results in additional overhead per frame. Some older protocols that have

c
existed for many years but that are still applied in support of Ethernet networks
r
ou
are likely to apply the IEEE 802.3 frame type. One clear example of this is
found in the case of the Spanning Tree Protocol (STP) that is represented by a

es
value of 0x03 within the type field of the SNAP header.

R
i n g
arn
L e
r e
o
M

32／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Ethernet based networks achieve communication between two end stations on

: h
a local area network using Media Access Control (MAC) addressing that
allows end systems within a multi access network to be distinguished. The

es
MAC address is a physical address that is burned into the network interface

c
card to which the physical medium is connected. This same MAC address is
r
ou
retrieved and used as the destination MAC address of the intended receiver
by the sender, before the frame is transferred to the physical layer for

es
forwarding over the connected medium.

R
i n g
arn
L e
r e
o
M

33／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Each MAC address is a 48 bit value commonly represented in a hexadecimal

: h
(base 16) format and comprised of two parts that attempt to ensure that every
MAC address is globally unique. This is achieved by the defining of an

es
organizationally unique identifier that is vendor specific, based on which it is

c
possible to trace the origin of a product back to its vendor based on the first 24
r
ou
bits of the MAC address. The remaining 24 bits of the MAC address is a value
that is incrementally and uniquely assigned to each product (e.g. a Network

es
Interface Card or similar product supporting port interfaces for which a MAC is
required).
R
i n g
arn
L e
r e
o
M

34／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The transmission of frames within a local network is achieved using one of

: h
three forwarding methods, the first of these is unicast and refers to the
transmission from a single source location to a single destination. Each host

es
interface is represented by a unique MAC address, containing an

c
organizationally unique identifier, for which the 8th bit of the most significant
r
ou
octet (or first byte) in the MAC address field identifies the type of address. This
8th bit is always set to 0 where the MAC address is a host MAC address, and

es
signifies that any frame containing this MAC address in the destination MAC

R
address field is intended for a single destination only.

i n g
Where hosts exist within a shared collision domain, all connected hosts will
receive the unicast transmission but the frame will be generally ignored by all

rn
hosts where the MAC address in the destination MAC field of the frame does

a
not match the MAC value of the receiving host on a given interface, leaving

L eonly the intended host to accept and process the received data. Unicast
transmissions are only forwarded from a single physical interface to the

r e intended destination, even in cases where multiple interfaces may exist.

o
M

35／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Broadcast transmission represents a forwarding method that allows frames to

: h
be flooded from a single source received by all destinations within a local area
network. In order to allow traffic to be broadcasted to all hosts within a local

es
area network, the destination MAC address field of the frame is populated with

c
a value that is defined in hexadecimal as FF:FF:FF:FF:FF:FF, and which
r
ou
specifies that all recipients of a frame with this address defined should accept
receipt of this frame and process the frame header and trailer.

es
Broadcasts are used by protocols to facilitate a number of important network

R
processes including discovery and maintenance of network operation,

i n g
however also generate excessive traffic that often causes interrupts to end
systems and utilization of bandwidth that tend to reduce the overall

rn
performance of the network.

e a
e L
o r
M

36／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
A more efficient alternative to broadcast that has begun to replace the use of

: h
broadcasts in many newer technologies is the multicast frame type. Multicast
forwarding can be understood as a form of selective broadcast that allows

es
select hosts to listen for a specific multicast MAC address in addition to the

c
unicast MAC address that is associated with the host, and process any frames
r
frame.
ou
containing the multicast MAC address in the destination MAC field of the

es
Since there is no relative distinction between unicast MAC addresses and

R
multicast MAC address formats, the multicast address is differentiated using

i n g
the 8th bit of the first octet. Where this bit value represents a value of 1, it
identifies that the address is part of the multicast MAC address range, as

rn
opposed to unicast MAC addresses where this value is always 0.

ea
In a local area network, the true capability of multicast behavior at the data link
layer is limited since forwarding remains similar to that of a broadcast frame in

e L which interrupts are still prevalent throughout the network. The only clear

or
difference with broadcast technology is in the selective processing by
receiving end stations. As networks expand to support multiple local area

M networks, the true capability of multicast technology as an efficient means of

transmission becomes more apparent.

37／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
As traffic is prepared to be forwarded over the physical network, it is

: h
necessary for hosts in shared collision domains to determine whether any
traffic is currently occupying the transmission medium. Transmission media

es
such as in the case of 10Base2 provides a shared medium over which

c
CSMA/CD must be applied to ensure collisions are handled should they occur.
r
ou
If the transmission of a frame is detected on the link, the host will delay the
forwarding of its own frames until such time as the line becomes available,

es
following which the host will begin to forward frames from the physical

R
interface towards the intended destination.

i n g
Where two hosts are connected over a medium capable of supporting full
duplex transmission as in the case of media such as 10BaseT, it is considered

rn
not possible for transmitted frames to suffer collisions since transmission and

a
receipt of frames occurs over separate wires and therefore there is no

L erequirement for CSMA/CD to be implemented.

r e
o
M

38／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Once a frame is forwarded from the physical interface of the host, it is carried

: h
over the medium to its intended destination. In the case of a shared network,
the frame may be received by multiple hosts who will assess whether the

es
frame is intended for their interface by analyzing the destination MAC address

c
in the frame header. If the destination MAC address and the MAC address of
r
ou
the host are not the same, or the destination MAC address is not a MAC
broadcast or multicast address to which the host is listening for, the frame will

es
be ignored and discarded.

R
For the intended destination, the frame will be received and processed, initially

i n g
by confirming that the frame is intended for the hosts physical interface. The
host must also confirm that the integrity of the frame has been maintained

rn
during transmission by taking the value of the frame check sequence (FCS)

a
field and comparing this value with a value determined by the receiving host. If

L ethe values do not match, the frame will be considered as corrupted and will be
subsequently discarded.

r e For valid frames, the host will then need to determine the next stage of

o processing by analyzing the type field of the frame header and identify the

M protocol to which this frame is intended. In this example the frame type field
contains a hexadecimal value of 0x0800 that identifies that the data taken from
the frame should be forwarded to the Internet Protocol, prior to which, the
frame header and trailer are discarded.

39／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
1. Data link layer frames contain a Type field that references the next

: h
protocol to which data contained within the frame should be forwarded.
Common examples of forwarding protocols include IP (0x0800) and ARP
(0x0806).
es
r c
2. The destination MAC address contained within the frame header is

u
analyzed by the receiving end station and compared to the MAC address

o
s
associated with the interface on which the frame was received. If the

R e
destination MAC address and interface MAC address do not match, the
frame is discarded.

i n g
arn
L e
r e
o
M

40／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

41／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

42／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

43／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

44／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Prior to discarding the frame header and trailer, it is necessary for the next set

: h
of instructions to be processed to be determined from the frame header. As
highlighted, this is identified by determining the field value in the type field,

es
which in this instance represents a frame that is destined for the IP protocol

c
following completion of the frame process.
r
u
The key function of the frame is to determine whether the intended physical

o
s
destination has been reached, that the integrity of the frame has remained

R e
intact. The focus of this section will identify how data is processed following
the discarding of the frame headers and propagation of the remaining data to

i n g
the Internet Protocol.

arn
L e
r e
o
M

45／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The IP header is used to support two key operations, routing and

: h
fragmentation. Routing is the mechanism that allows traffic from a given
network to be forwarded to other networks, since the data link layer represents

es
a single network for which network boundaries exist. Fragmentation refers to

c
the breaking down of data into manageable blocks that can be transmitted
r
over the network.

ou
s
The IP header is carried as part of the data and represents an overhead of at

R e
least 20 bytes that references how traffic can be forwarded between networks,
where the intended destination exists within a network different from the

i n g
network on which the data was originally transmitted. The version field
identifies the version of IP that is currently being supported, in this case the

rn
version is known as version four or IPv4. The DS field was originally referred

a
to as the type of service field however now operates as a field for supporting

L edifferentiated services, primarily used as a mechanism for applying quality of

service (QoS) for network traffic optimization, and is considered to be outside

r e of the scope of this training.

o The source and destination IP addressing are logical addresses assigned to

M hosts and used to reference the sender and the intended receiver at the
network layer. IP addressing allows for assessment as to whether an intended
destination exists within the same network or a different network as a means
of aiding the routing process between networks in order to reach destinations
beyond the local area network.

46／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Each IPv4 address represents a 32 bit value that is often displayed in a dotted

: h
decimal format but for detailed understanding of the underlying behavior is
also represented in a binary (Base 2) format. IP addresses act as identifiers

es
for end systems as well as other devices within the network, as a means of

c
allowing such devices to be reachable both locally and by sources that are
r
u
located remotely, beyond the boundaries of the current network.

o
s
The IP address consists of two fields of information that are used to clearly

R e
specify the network to which an IP address belongs as well as a host identifier
within the network range, that is for the most part unique within the given
network.

i n g
arn
L e
r e
o
M

47／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Each network range contains two important addresses that are excluded from

: h
the assignable network range to hosts or other devices. The first of these
excluded addresses is the network address that represents a given network as

es
opposed to a specific host within the network. The network address is

c
identifiable by referring to the host field of the network address, in which the
r
ou
binary values within this range are all set to 0, for which it should also be
noted that an all 0 binary value may not always represent a 0 value in the

es
dotted decimal notation.

R
The second excluded address is the broadcast address that is used by the

i n g
network layer to refer to any transmission that is expected to be sent to all
destinations within a given network. The broadcast address is represented

rn
within the host field of the IP address where the binary values within this range

a
are all set to 1. Host addresses make up the range that exists between the

L enetwork and broadcast addresses.

r e
o
M

48／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The use of binary, decimal and hexadecimal notations are commonly applied

: h
throughout IP networks to represent addressing schemes, protocols and
parameters, and therefore knowledge of the fundamental construction of these

es
base forms is important to understanding the behavior and application of
values within IP networks.
r c
u
Each numbering system is represented by a different base value that

o
s
highlights the number of values used as part of the base notations range. In

R e
the case of binary, only two values are ever used, 0 and 1, which in
combination can provide for an increasing number of values, often

i n g
represented as 2 to the power of x, where x denotes the number of binary
values. Hexadecimal represents a base 16 notation with values ranging from 0

rn
to F, (0-9 and A-F) where A represents the next value following 9 and F thus

a
represents a value equivalent to 15 in decimal, or 1111 in binary.

L e
r e
o
M

49／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
A byte is understood to contain 8 bits and acts as a common notation within IP

: h
networks, thus a byte represents a bit value of 256, ranging from 0 through to
255. This information is clearly represented through translation of decimal

es
notation to binary, and application of the base power to each binary value, to

c
achieve the 256 bit value range. A translation of the numbering system for
r
ou
binary can be seen given in the example to allow familiarization with the
numbering patterns associated with binary. The example also clearly

es
demonstrates how broadcast address values in decimal, binary and

R
hexadecimal are represented to allow for broadcasts to be achieved in both IP
and MAC addressing at the network and data link layers.

i n g
arn
L e
r e
o
M

50／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The combination of 32 bits within an IP address correlates to four octets or

: h
bytes for which each can represent a value range of 256, giving a theoretical
number of 4’294’967’296 possible IP addresses, however in truth only a

es
fraction of the total number of addresses are able to be assigned to hosts.

c
Each bit within a byte represents a base power and as such each octet can
r
ou
represent a specific network class, with each network class being based on
either a single octet or a combination of octets. Three octets have been used

es
as part of this example to represent the network with the fourth octet

R
representing the host range that is supported by the network.

i n g
arn
L e
r e
o
M

51／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The number of octets supported by a network address is determined by

: h
address classes that break down the address scope of IPv4. Classes A, B and
C are assignable address ranges, each of which supports a varied number of

es
networks, and a number of hosts that are assignable to a given network. Class

c
A for instance consist of 126 potential networks, each of which can support
r
ou
224, or 16’777’216 potential host addresses, bearing in mind that network and
broadcast addresses of a class range are not assignable to hosts.

es
In truth, a single Ethernet network could never support such a large number of

R
hosts since Ethernet does not scale well, due in part to broadcasts that

i n g
generate excessive network traffic within a single local area network. Class C
address ranges allow for a much more balanced network that scales well to

rn
Ethernet networks, supplying just over 2 million potential networks, with each

a
network capable of supporting around 256 addresses, of which 254 are

L eassignable to hosts.
Class D is a range reserved for multicast, to allow hosts to listen for a specific

r e address within this range, and should the destination address of a packet

o contain a multicast address for which the host is listening, the packet shall be

M processed in the same way as a packet destined for the hosts assigned IP
address. Each class is easily distinguishable in binary by observing the bit
value within the first octet, where a class A address for instance will always
begin with a 0 for the high order bit, whereas in a Class B the first two high
order bits are always set as 1 and 0, allowing all classes to be easily
determined in binary.

52／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Within IPv4, specific addresses and address ranges have been reserved for

: h
special purposes. Private address ranges exist within the class A, B and C
address ranges to prolong the rapid decline in the number of available IP

es
addresses. The number of actual end systems and devices that require IP

c
addressing in the world today exceeds the 4’294’967’296 addresses of the 32
r
ou
bit IPv4 address range, and therefore a solution to this escalating problem was
to allocate private address ranges that could be assigned to private networks,

es
to allow for conservation of public network addresses that facilitate

R
communication over public network infrastructures such as the Internet.

i n g
Private networks have become common throughout the enterprise network but
hosts are unable to interact with the public network, meaning that address

rn
ranges can be reused in many disparate enterprise networks. Traffic bound for

a
public networks however must undergo a translation of addresses before data

L ecan reach the intended destination.

Other special addresses include a diagnostic range denoted by the 127.0.0.0

r e network address, as well as the first and last addresses within the IPv4

o address range, for which 0.0.0.0 represents any network and for which its

M application shall be introduced in more detail along with principles of routing.

The address 255.255.255.255 represents a broadcast address for the IPv4
(0.0.0.0) network, however the scope of any broadcast in IP is restricted to the
boundaries of the local area network from which the broadcast is generated.

53／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
In order for a host to forward traffic to a destination, it is necessary for a host

: h
to have knowledge of the destination network. A host is naturally aware of the
network to which it belongs but is not generally aware of other networks, even

es
when those networks may be considered part of the same physical network.

c
As such hosts will not forward data intended for a given destination until the
r
ou
host learns of the network and thus with it the interface via which the
destination can be reached.

es
For a host to forward traffic to another host, it must firstly determine whether

R
the destination is part of the same IP network. This is achieved through

i n g
comparison of the destination network to the source network (host IP address)
from which the data is originating. Where the network ranges match, the

rn
packet can be forwarded to the lower layers where Ethernet framing presides,

a
for processing. In the case where the intended destination network varies from

L ethe originating network, the host is expected to have knowledge of the

intended network and the interface via which a packet/frame should be

r e forwarded before the packet can be processed by the lower layers. Without

o this information, the host will proceed to drop the packet before it even
reaches the data link layer.
M

54／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The identification of a unique network segment is governed by the

: h
implementation of a mask value that is used to distinguish the number of bits
that represent the network segment, for which the remaining bits are

es
understood as representing the number of hosts supported within a given

c
network segment. A network administrator can divide a network address into
r
ou
sub-networks so that broadcast packets are transmitted within the boundaries
of a single subnet. The subnet mask consists of a string of continuous and

es
unbroken 1 values followed by a similar unbroken string of 0 values. The 1

R
values correspond to the network ID field whereas the 0 values correspond to
the host ID field.

i n g
arn
L e
r e
o
M

55／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
For each class of network address, a corresponding subnet mask is applied to

: h
specify the default size of the network segment. Any network considered to be
part of the class A address range is fixed with a default subnet mask

es
pertaining to 8 leftmost bits which comprise of the first octet of the IP address,

c
with the remaining three octets remaining available for host ID assignment.
r
u
In a similar manner, the class B network reflects a default subnet mask of 16

o
s
bits, allowing a greater number of networks within the class B range at the

R e
cost of the number of hosts that can be assigned per default network. The
class C network defaults to a 24 bit mask that provides a large number of

i n g
potential networks but limits greatly the number of hosts that can be assigned
within the default network. The default networks provide a common boundary

rn
to address ranges, however in the case of class A and class B address

a
ranges, do not provide a practical scale for address allocation for Ethernet

L ebased networks.

r e
o
M

56／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Application of the subnet mask to a given IP address enables identification of

: h
the network to which the host belongs. The subnet mask will also identify the
broadcast address for the network as well as the number of hosts that can be

es
supported as part of the network range. Such information provides the basis

c
for effective network address planning. In the example given, a host has been
r
ou
identified with the address of 192.168.1.7 as part of a network with a 24 bit
default (class C) subnet mask applied. In distinguishing which part of the IP

es
address constitutes the network and host segments, the default network

R
address can be determined for the segment.

i n g
This is understood as the address where all host bit values are set to 0, in this
case generating a default network address of 192.168.1.0. Where the host

rn
values are represented by a continuous string of 1 values, the broadcast

a
address for the network can be determined. Where the last octet contains a

L estring of 1 values, it represents a decimal value of 255, for which a broadcast

address of 192.168.1.255 can be derived.

r e Possible host addresses are calculated based on a formula of 2n where n

o represents the number of host bits defined by the subnet mask. In this

M instance n represents a value of 8 host bits, where 28 gives a resulting value of

256. The number of usable host addresses however requires that the network
and broadcast addresses be deducted from this result to give a number of
valid host addresses of 254.

57／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The case scenario provides a common class B address range to which it is

: h
necessary to determine the network to which the specified host belongs, along
with the broadcast address and the number of valid hosts that are supported

es
by the given network. Applying the same principles as with the class C

c
address range, it is possible for the network address of the host to be
r
u
determined, along with the range of hosts within the given network.

o
es
R
i n g
arn
L e
r e
o
M

58／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
One of the main constraints of the default subnet mask occurs when multiple

: h
network address ranges are applied to a given enterprise in order to generate
logical boundaries between the hosts within the physical enterprise network.

es
The application of a basic addressing scheme may require a limited number of

c
hosts to be associated with a given network, for which multiple networks are
r
ou
applied to provide the logical segmentation of the network. In doing so
however, a great deal of address space remains unused, displaying the

es
inefficiency of default subnet mask application.

R
i n g
arn
L e
r e
o
M

59／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
As a means of resolving the limitations of default subnet masks, the concept of

: h
variable length subnet masks are introduced, which enable a default subnet
mask to be broken down into multiple sub-networks, which may be of a fixed

es
length (a.k.a. fixed length subnet masks or FLSM) or of a variable length

c
known commonly by the term VLSM. The implementation of such subnet
r
ou
masks consists of taking a default class based network and dividing the
network through manipulation of the subnet mask.

es
In the example given, a simple variation has been made to the default class C

R
network which by default is governed by a 24 bit mask. The variation comes in

i n g
the form of a borrowed bit from the host ID which has been applied as part of
the network address. Where the deviation of bits occurs in comparison to the

rn
default network, the additional bits represent what is known as the subnet ID.

ea
In this case a single bit has been taken to represent the sub-network for which
two sub-networks can be derived, since a single bit value can only represent

e L two states of either 1 or 0. Where the bit is set to 0 it represents a value of 0,

or
where it is set to 1 it represents a value of 128. In setting the host bits to 0, the
sub-network address can be found for each sub-network, by setting the host

M bits to 1, the broadcast address for each sub-network is identifiable. The

number of supported hosts in this case represents a value of 27 minus the
sub-network address and broadcast address for each sub-network, resulting in
each sub-network supporting a total of 126 valid host addresses.

60／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
In relation to problem of address limitations in which default networks resulted

: h
in excessive address wastage, the concept of variable length subnet masks
can be applied to reduce the address wastage and provide a more effective

es
addressing scheme to the enterprise network.

r c
A single default class C address range has been defined, for which variable

u
length subnet masks are required to accommodate each of the logical

o
s
networks within a single default address range. Effective subnet mask

R e
assignment requires that the number of host bits necessary to accommodate
the required number of hosts be determined, for which the remaining host bits

i n g
can be applied as part of the subnet ID, that represents the variation in the
network ID from the default network address.

arn
L e
r e
o
M

61／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Classless inter-domain routing was initially introduced as a solution to handle

: h
problems that were occurring as a result of the rapid growth of what is now
known as the Internet. The primary concerns were to the imminent exhaustion

es
of the class B address space that was commonly adopted by mid-sized

c
organizations as the most suited address range, where class C was
r
ou
inadequate and where class A was too vast, and management of the 65534
host addresses could be achieved through VLSM. Additionally, the continued

es
growth meant that gateway devices such as routers were beginning to

R
struggle to keep up with the growing number of networks that such devices
were expected to handle. The solution given involves transitioning to a

n g
classless addressing system in which classful boundaries were replaced with
i
rn
address prefixes.

ea
This notation works on the principle that classful address ranges such as that
of class C can be understood to have a 24 bit prefix that represents the subnet

e L or major network boundary, and for which it is possible to summarize multiple

or
network prefixes into a single larger network address prefix that represents the
same networks but as a single address prefix. This has helped to alleviate the
number of routes that are contained particularly within large scale routing
M devices that operate on a global scale, and has provided a more effective
means of address management. The result of CIDR has had far reaching
effects and is understood to have effectively slowed the overall exhaustion
rate of the IPv4 address space.

62／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The forwarding of packets requires that the packet first determine a forwarding

: h
path to a given network, and the interface via which a packet should be
forwarded from, before being encapsulated as a frame and forwarded from the

es
physical interface. In the case where the intended network is different from the

c
originating network, the packet must be forwarded to a gateway via which the
r
u
packet is able to reach it’s intended destination.

o
s
In all networks, the gateway is a device that is capable of handling packets

R e
and making decisions as to how packets should be routed, in order to reach
their intended destination. The device in question however must be aware of a

i n g
route to the intended destination IP network before the routing of packets can
take place. Where networks are divided by a physical gateway, the interface

rn
IP address (in the same network or sub-network) via which that gateway can

a
be reached is considered to be the gateway address.

L eIn the case of hosts that belong to different networks that are not divided by a
physical gateway, it is the responsibility of the host to function as the gateway,

r e for which the host must firstly be aware of the route for the network to which

o packets are to be forwarded, and should specify the hosts own interface IP

M address as the gateway IP address, via which the intended destination

network can be reached.

63／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The data of forwarded packets exists in many formats and consists of varying

: h
sizes, often the size of data to be transmitted exceeds the size that is
supported for transmission. Where this occurs it is necessary for the data

es
block to be broken down into smaller blocks of data before transmission can

c
occur. The process of breaking down this data into manageable blocks is
r
u
known as fragmentation.

o
s
The identification, flags and fragment offset fields are used to manage

R e
reassembly of fragments of data once they are received at their final intended
destination. Identification distinguishes between data blocks of traffic flows

i n g
which may originate from the same host or different hosts. The flags field
determines which of a number of fragments represents the last fragment at

rn
which time initiation of a timer is started prior to reassembly, and to notify that

a
reassembly of the packet should commence.

L eFinally the fragment offset labels the bit value for each fragment as part of a
number of fragments, the first fragment is set with a value of 0 and

r e subsequent fragments specify the value of first bit following the previous

o fragment, for example where the initial fragment contains data bits 0 through

M to 1259, the following fragment will be assigned an offset value of 1260.

64／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
As packets are forwarded between networks, it is possible for packets to fall

: h
into loops where routes to IP networks have not been correctly defined within
devices responsible for the routing of traffic between multiple networks. This

es
can result in packets becoming lost within a cycle of packet forwarding that

c
does not allow a packet to reach its intended destination. Where this occurs,
r
ou
congestion on the network will ensue as more and more packets intended for
the same destination become subject to the same fate, until such time as the

es
network becomes flooded with erroneous packets.

R
In order to prevent such congestion occurring in the event of such loops, a

i n g
time to live (TTL) field is defined as part of the IP header, that decrements by
a value of 1 each time a packet traverses a layer 3 device in order to reach a

rn
given network. The starting TTL value may vary depending on the originating

a
source, however should the TTL value decrement to a value of 0, the packet

L ewill be discarded and an (ICMP) error message is returned to the source,

based on the source IP address that can be found in the IP header of the

r e wandering packet.

o
M

65／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Upon verification that the packet has reached its intended destination, the

: h
network layer must determine the next set of instructions that are to be
processed. This is determined by analyzing the protocol field of the IP header.

es
As with the type field of the frame header, a hexadecimal value is used to

c
specify the next set of instructions to be processed.
r
u
It should be understood that the protocol field may refer to protocols at either

o
s
the network layer, such as in the case of the Internet Control Message

R e
Protocol (ICMP), but may also refer to upper layer protocols such as the
Transmission Control Protocol (06/0x06) or User Datagram Protocol

i n g
(17/0x11), both of which exist as part of the transport layer within both the
TCP/IP and OSI reference models.

arn
L e
r e
o
M

66／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
1. The IP subnet mask is a 32 bit value that describes the logical division

: h
between the bit values of an IP address. The IP address is as such
divided into two parts for which bit values represent either a network or

es
sub-network, and the host within a given network or sub-network.

r c
2. IP packets that are unable to reach the intended network are susceptible

u
to being indefinitely forwarded between networks in an attempt to discover

o
s
their ultimate destination. The Time To Live (TTL) feature is used to

R e
ensure that a lifetime is applied to all IP packets, so as to ensure that in
the event that an IP packet is unable to reach it’s destination, it will

i n g
eventually be terminated. The TTL value may vary depending on the
original source.

rn
3. Gateways represent points of access between IP networks to which traffic

e a can be redirected, or routed in the event that the intended destination

network varies from the network on which the packet originated.

e L
o r
M

67／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

68／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

69／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

70／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

71／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The Internet Control Message Protocol is an integral part of IP designed to

: h
facilitate the transmission of notification messages between gateways and
source hosts where requests for diagnostic information, support of routing,

es
and as a means of reporting errors in datagram processing are needed. The

c
purpose of these control messages is to provide feedback about problems in
r
ou
the communication environment, and does not guarantee that a datagram will
be delivered, or that a control message will be returned.

es
R
i n g
arn
L e
r e
o
M

72／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
ICMP Redirect messages represent a common scenario where ICMP is used

: h
as a means of facilitating routing functions. In the example, a packet is
forwarded to the gateway by host A based on the gateway address of host A.

es
The gateway identifies that the packet received is destined to be forwarded to

c
the address of the next gateway which happens to be part of the same
r
ou
network as the host that originated the packet, highlighting a non-optimal
forwarding behavior between the host and the gateways.

es
In order to resolve this, a redirect message is sent to the host. The redirect

R
message advises the host to send its traffic for the intended destination

i n g
directly to the gateway to with which the destination network is associated,
since this represents a shorter path to the destination. The gateway proceeds

rn
however to forward the data of the original packet to its intended destination.

e a
e L
o r
M

73／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
ICMP echo messages represent a means of diagnosis for determining

: h
primarily connectivity between a given source and destination, but also
provides additional information such as the round trip time for transmission as

es
a diagnostic for measuring delay. Data that is received in the echo message is

c
returned as a separate echo reply message.
r
ou
es
R
i n g
arn
L e
r e
o
M

74／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
ICMP provides various error reporting messages that often determine

: h
reachability issues and generate specific error reports that allow a clearer
understanding from the perspective of the host as to why transmission to the
intended destination failed.
es
r c
Typical examples include cases where loops may have occurred in the

u
network, and consequentially caused the time to live parameter in the IP

o
s
header to expire, resulting in a “ttl exceeded in transit” error message being

R e
generated. Other examples include an intended destination being
unreachable, which could relate to a more specific issue of the intended

i n g
network not being known by the receiving gateway, or that the intended host
within the destination network not being discovered. In all events an ICMP

rn
message is generated with a destination based on the source IP address

a
found in the IP header, to ensure the message notifies the sending host.

L e
r e
o
M

75／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
ICMP messages are sent using the basic IP header, which functions together

: h
as an integral part of the ICMP message, such is the case with the TTL
parameter that is used to provide support for determining whether a

es
destination is reachable. The format of the ICMP message relies on two fields

c
for message identification in the form of a type/code format, where the type
r
ou
field provides a general description of the message type, and the code and a
more specific parameter for the message type.

es
A checksum provides a means of validating the integrity of the ICMP message.

R
An additional 32 bits are included to provide variable parameters, often

i n g
unused and thus set as 0 when the ICMP message is sent, however in cases
such as an ICMP redirect, the field contains the gateway IP address to which

rn
a host should redirect packets. The parameter field in the case of echo

a
requests will contain an identifier and a sequence number, used to help the

L esource associate sent echo requests with received echo replies, especially in
the event multiple requests are forwarded to a given destination.

r e As a final means of tracing data to a specific process, the ICMP message may

o carry the IP header and a portion of the data that contains upper layer

M information that enables the source to identify the process for which an error
occurred, such as cases where the ICMP TTL expires in transit.

76／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
A wide number of ICMP type values exist to define clearly the different

: h
applications of the ICMP control protocol. In some cases the code field is not
required to provide a more specific entry to the type field, as is found with

es
echo requests that have a type field of 8 and the corresponding reply, which is

c
generated and sent as a separate ICMP message to the source address of the
r
u
sender, and defined using a type field of 0.

o
s
Alternatively, certain type fields define a very general type for which the

R e
variance is understood through the code field, as in the case of the type 3
parameter. A type field of 3 specifies that a given destination is unreachable,

i n g
while the code field reflects the specific absence of either the network, host,
protocol, port (TCP/UDP), ability to perform fragmentation (code 4), or source

rn
route (code 5) in which a packet, for which a forwarding path through the

a
network is strictly or partially defined, fails to reach its destination.

L e
r e
o
M

77／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The application of ICMP can be understood through the use of tools such as

: h
Ping. The Ping application may be used as a tool in order to determine
whether a destination is reachable as well as collect other related information.

es
The parameters of the Ping application allow an end user to specify the

c
behavior of the end system in generating ICMP messages, with consideration
r
ou
of the size of the ICMP datagram, the number of ICMP messages generated
by the host, and also the duration in which it is expected a reply is received

es
before a timeout occurs. This is important where a large delay occurs since a

R
timeout may be reported by the Ping application before the ICMP message
has had the opportunity to return to the source.

i n g
arn
L e
r e
o
M

78／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The general output of an ICMP response to a Ping generated ICMP request

: h
details the destination to which the datagram was sent and the size of the
datagram generated. In addition the sequence number of the sequence field

es
that is carried as part of the echo reply (type 0) is displayed along with the TTL

c
value that is taken from the IP header, as well as the round trip time which
r
u
again is carried as part of the IP options field in the IP header.

o
es
R
i n g
arn
L e
r e
o
M

79／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Another common application to ICMP is traceroute, which provides a means of

: h
measuring the forwarding path and delay on a hop-by-hop basis between
multiple networks, through association with the TTL value within the IP header.

es
For a given destination, the reachability to each hop along the path is

r c
measured by initially defining a TTL value in the IP header of 1, causing the

u
TTL value to expire before the receiving gateway is able to propagate the

o
s
ICMP message any further, thus generating a TTL expired in transit message

R e
together with timestamp information, allowing for a hop-by-hop assessment of
the path taken through the network by the datagram to the destination, and a

i n g
measurement of the round trip time. This provides an effective means of
identifying the point of any packet loss or delay that may be incurred in the

rn
network and also aids in the discovery of routing loops.

e a
e L
o r
M

80／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The implementation of traceroute in Huawei ARG3 series routers adopts the

: h
use of the UDP transport layer protocol to define a service port as the
destination. Each hop sends three probe packets, for which the TTL value is

es
initially set to a value of 1 and incremented after every three packets. In

c
addition, a UDP destination port of 33434 is specified for the first packet and
r
ou
incremented for every successive probe packet sent. A hop-by-hop result is
generated, allowing for the path to be determined, as well as for any general

es
delay that may occur to be discovered.

R
This is achieved by measuring the duration between when the ICMP message

i n g
was sent and when the corresponding TTL expired in transit ICMP error is
received. When receiving a packet, the ultimate destination is unable to

rn
discover the port specified in the packet, and thus returns an ICMP Type 3,

a
Code 3 (Port Unreachable) packet, and after three attempts the traceroute test

L eends. The test result of each probe is displayed by the source, in accordance
with the path taken from the source to the destination. If a fault occurs when

r e the trace route command is used, the following information may be displayed:

o !H: The host is unreachable.

M !N: The network is unreachable.

!: The port is unreachable.
!P: The protocol type is incorrect.
!F: The packet is incorrectly fragmented.
!S: The source route is incorrect.

81／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
1. The Ping application uses the echo request message of type 8 to attempt

: h
to discover the destination. A separate echo reply message, defined by a
type field of 0, is returned to the original source based on the source IP

es
address in the IP header field.

r c
2. In the event that the TTL value of an IP datagram reaches 0 before the

u
datagram is able to reach the intended destination, the gateway device

o
s
receiving the datagram will proceed to discard it and return an ICMP

R e
message to the source to notify that the datagram in question was unable
to reach the intended destination. The specific reason will be defined by

i n g
the code value to reflect for example whether the failure was due to a
failure to discover the host, a port on the host or whether the service for a

rn
given protocol was not supported etc.

e a
e L
o r
M

82／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

83／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

84／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

85／392
 e n
/
o m
i . c
we
a
.hu
in g
r n
//lea
p :
t t
: h
es
r c
ou
es
R
i n g
arn
L e
r e
o
M

86／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
As data is encapsulated, the IP protocol at the network layer is able to specify

: h
the target IP address to which the data is ultimately destined, as well as the
interface via which the data is to be transmitted, however before transmission

es
can occur, the source must be aware of the target Ethernet (MAC) address to

c
which data should be transmitted. The Address Resolution Protocol (ARP)
r
ou
represents a critical part of the TCP/IP protocol suite that enables discovery of
MAC forwarding addresses to facilitate IP reachability. The Ethernet next hop

es
must be discovered before data encapsulation can be completed.

R
i n g
arn
L e
r e
o
M

87／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The ARP packet is generated as part of the physical target address discovery

: h
process. Initial discovery will contain partial information since the destination
hardware address or MAC address is to be discovered. The hardware type

es
refers to Ethernet with the protocol type referring to IP, defining the

c
technologies associated with the ARP discovery. The hardware and protocol
r
ou
length identifies the address length for both the Ethernet MAC address and the
IP address, and is defined in bytes.

es
The operation code specifies one of two states, where the ARP discovery is

R
set as REQUEST for which reception of the ARP transmission by the

i n g
destination will identify that a response should be generated. The response
will generate REPLY for which no further operation is necessary by the

rn
receiving host of this packet, and following which the ARP packet will be

a
discarded. The source hardware address refers to the MAC address of the

L esender on the physical segment to which ARP is generated. The source

protocol address refers to the IP address of the sender.

r e The destination hardware address specifies the physical (Ethernet) address to

o which data can be forwarded by the Ethernet protocol standards, however this

M information is not present in an ARP request, instead replaced by a value of 0.

The destination protocol address identifies the intended IP destination for
which reachability over Ethernet is to be established.

88／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The network layer represents a logical path between a source and a

: h
destination. Reaching an intended IP destination relies on firstly being able to
establish a physical path to the intended destination, and in order to do that,

es
an association must be made between the intended IP destination and the

c
physical next hop interface to which traffic can be forwarded.
r
u
For a given destination the host will determine the IP address to which data is

o
s
to be forwarded, however before encapsulation of the data can commence,

R e
the host must determine whether a physical forwarding path is known. If the
forwarding path is known encapsulation to the destination can proceed,

i n g
however quite often the destination is not known and ARP must be
implemented before data encapsulation can be performed.

arn
L e
r e
o
M

89／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The ARP cache (pronounced as [kash]) is a table for association of host

: h
destination IP addresses and associated physical (MAC) addresses. Any host
that is engaged in communication with a local or remote destination will first

es
need to learn of the destination MAC via which communication can be
established.
r c
u
Learned addresses will populate the ARP cache table and remain active for a

o
s
fixed period of time, during which the intended destination can be discovered

R e
without the need for addition ARP discovery processes. Following a fixed
period, the ARP cache table will remove ARP entries to maintain the ARP

i n g
cache table’s integrity, since any change in the physical location of a
destination host may result in the sending host inadvertently addressing data

rn
to a destination at which the destination host no longer resides.

ea
The ARP cache lookup is the first operation that an end system will perform
before determining whether it is necessary to generate an ARP request. For

e L destinations beyond the boundaries of the hosts own network, an ARP cache

or
lookup is performed to discover the physical destination address of the
gateway, via which the intended destination network can be reached.

90／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Where an ARP cache entry is unable to be determined, the ARP request

: h
process is performed. This process involves generation of an ARP request
packet, and population of the fields with the source and destination protocol

es
addresses, as well as the source hardware address. The destination hardware

c
address is unknown. As such the destination hardware address is populated
r
ou
with a value equivalent to 0. The ARP request is encapsulated in an Ethernet
frame header and trailer as part of the forwarding process. The source MAC

es
address of the frame header is set as the source address of the sending host.

R
The host is currently unaware of the location of the destination and therefore

i n g
must send the ARP request as a broadcast to all destinations within the same
local network boundary. This means that a broadcast address is used as the

rn
destination MAC address. Once the frame is populated, it is forwarded to the

a
physical layer where it is propagated along the physical medium to which the

L ehost is connected. The broadcasted ARP packet will be flooded throughout the
network to all destinations including any gateway that may be present,

r e however the gateway will prevent this broadcast from being forwarded to any

o network beyond the current network.

91／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
If the intended network destination exists, the frame will arrive at the physical

: h
interface of the destination at which point lower layer processing will ensue.
ARP broadcasts mean that all destinations within the network boundary will

es
receive the flooded frame, but will cease to process the ARP request, since

c
the destination protocol address does not match to the IP address of those
r
destinations.

ou
s
Where the destination IP address does match to the receiving host, the ARP

R e
packet will be processed. The receiving host will firstly process the frame
header and then process the ARP request. The destination host will use the

i n g
information from the source hardware address field in the ARP header to
populate its own ARP cache table, thus allowing for a unicast frame to be

rn
generated for any frame forwarding that may be required, to the source from

a
which the ARP request was received.

L e
r e
o
M

92／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
The destination will determine that the ARP packet received is an ARP

: h
request and will proceed to generate an ARP reply that will be returned to the
source, based on the information found in the ARP header. A separate ARP

es
packet is generated for the reply, for which the source and destination protocol

c
address fields will be populated. However, the destination protocol address in
r
ou
the ARP request packet now represents the source protocol address in the
ARP reply packet, and similarly the source protocol address of the ARP

es
request becomes the destination protocol address in the ARP reply.

R
The destination hardware address field is populated with the MAC of the

i n g
source, discovered as a result of receiving the ARP request. For the required
destination hardware address of the ARP request, it is included as the source

rn
hardware address of the ARP reply, and the operation code is set to reply, to

a
inform the destination of the purpose of the received ARP packet, following

L ewhich the destination is able to discard the ARP packet without any further
communication. The ARP reply is encapsulated in the Ethernet frame header

r e and trailer, with the destination MAC address of the Ethernet frame containing

o the MAC entry in the ARP cache table, allowing the frame to be forwarded as
a unicast frame back to the host that originated the ARP request.
M

93／392
 e n
/
o m
i . c
we
a
. hu
in g
r n
//lea
p :
t t
Upon receiving the ARP reply, the originating host will validate that the

: h
intended destination is correct based on the frame header, identify that the
packet header is ARP from the type field and discard the frame headers. The

es
ARP reply will then be processed, with the source hardware address of the

c
ARP reply being used to populate the ARP cache table of the originating host
r
(Host A).

ou
s
Following the processing of the ARP reply, the packet is discarded and the

R e
destination MAC information is used to facilitate the encapsulation process of
the initial application or protocol that originally requested discovery of the

i n g
destination at the data link layer.

arn
L e
r e
o
M

94／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The ARP protocol is also applied to other cases such as where transparent

:h
subnet gateways are to be implemented to facilitate communication across
physical networks, where hosts are considered to be part of the same

e s
subnetwork. This is referred to as Proxy ARP since the gateway operates as a

c
proxy for the two physical networks. When an ARP request is generated for a
r
ou
destination that is considered to be part of the same subnet, the request will
eventually be received by the gateway. The gateway is able to determine that

es
the intended destination exists beyond the physical network on which the ARP

R
request was generated.

i n g
Since ARP requests cannot be forwarded beyond the boundaries of the
broadcast domain, the gateway will proceed to generate its own ARP request

n
to determine the reachability to the intended destination, using its own protocol
r
a
and hardware addresses as the source addresses for the generated ARP

Le request. If the intended destination exists, an ARP reply shall be received by

the gateway for which the destinations source hardware address will be used

e
or
to populate the ARP cache table of the gateway.
The gateway upon confirming the reachability to the intended destination will

M then generate an ARP reply to the original source (Host A) using the hardware
address of the interface on which the ARP reply was forwarded. The gateway
will as a result operate as an agent between the two physical networks to
facilitate data link layer communication, with both hosts forwarding traffic
intended for destinations in different physical networks to the relevant physical
address of the “Proxy” gateway.

95／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In the event that new hardware is introduced to a network, it is imperative that

:h
the host determine whether or not the protocol address to which it has been
assigned is unique within the network, so as to prevent duplicate address

e s
conflicts. An ARP request is generated as a means of determining whether the

c
protocol address is unique, by setting the destination address in the ARP
r
ou
request to be equal to the host’s own IP address.

s
The ARP request is flooded throughout the network to all link layer

Re
destinations by setting the destination MAC as broadcast, to ensure all end
stations and gateways receive the flooded frame. All destinations will process

i n g
the frame, and should any destination discover that the destination IP address
within the ARP request match the address of a receiving end station or

n
gateway, an ARP reply will be generated and returned to the host that
r
a
generated the ARP request.

Le Through this method the originating host is able to identify duplication of the IP
address within the network, and flag an IP address conflict so to request that a
e
or
unique address be assigned. This means of generating a request based on
the hosts own IP address defines the basic principles of gratuitous ARP.

96／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. The host is required to initially determine whether it is already aware of a

:h
link layer forwarding address within its own ARP cache (MAC address
table). If an entry is discovered the end system is capable of creating the

e s
frame for forwarding without the assistance of the address resolution

c
protocol. If an entry cannot be found however, the ARP process will initiate,
r
ou
and an ARP request will be broadcasted on the local network.

s
2. Gratuitous ARP messages are commonly generated at the point in which

Re
an IP address is configured or changed for a device connected to the
network, and at any time that a device is physically connected to the

i n g
network. In both cases the gratuitous ARP process must ensure that the
IP address that is used remains unique.

r n
e a
e L
or
M

97／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

98／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

99／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

100／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

101／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
TCP is a connection-oriented, end-to-end protocol that exists as part of the

:h
transport layer of the TCP/IP protocol stack, in order to support applications
that span over multi-network environments. The transmission control protocol

e s
provides a means of reliable inter-process communication between pairs of

c
processes in host computers that are attached to distinct but interconnected
r
ou
computer communication networks. TCP relies on lower layer protocols to
provide the reachability between process supporting hosts, over which a

es
reliable connection service is established between pairs of processes. The

R
connection-oriented behavior of TCP involves prior exchanges between the
source and destination, through which a connection is established before

n g
transport layer segments are communicated.
i
r n
e a
e L
or
M

102／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
As a means for allowing for many processes within a single host to use TCP

:h
communication facilities simultaneously, TCP provides a set of logical ports
within each host. The port value together with the network layer address is

e s
referred to as a socket, for which a pair of sockets provide a unique identifier

c
for each connection, in particular where a socket is used simultaneously in
r
ou
multiple connections. That is to say, a process may need to distinguish among
several communication streams between itself and another process (or

es
processes), for which each process may have a number of ports through

R
which it communicates with the port or ports of other processes.

i n g
Certain processes may own ports and these processes may initiate
connections on the ports that they own. These ports are understood as IANA

n
assigned system ports or well-known ports and exist in the port value range of
r
a
0 – 1023. A range of IANA assigned user or registered ports also exist in the

Le range of 1024 – 49151, with dynamic ports, also known as private or

ephemeral ports in the range of 49152 – 65535, which are not restricted to any

e
or
specific application. Hosts will generally be assigned a user port value for
which a socket is generated to a given application.

M Common examples of TCP based applications for which well-known port

numbers have been assigned include FTP, HTTP, TELNET, and SMTP, which
often will work alongside other well-known mail protocols such as POP3 (port
110) and IMAP4 (port 143).

103／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The TCP header allows TCP based applications to establish connection-

:h
oriented data streams that are delivered reliability, and to which flow control is
applied. A source port number is generated where a host intends to establish

e s
a connection with a TCP based application, for which the destination port will

c
relate to a well-known/registered port to which a well-known/registered
r
ou
application is associated.

s
Code bits represent functions in TCP, and include an urgent bit (URG) used

Re
together the urgent pointer field for user directed urgent data notifications,
acknowledgment of received octets in association with the acknowledgement

i n g
field (ACK), the push function for data forwarding (PSH), connection reset
operations (RST), synchronization of sequence numbers (SYN) and indication

n
that no more data is to be received from the sender (FIN). Additional code bits
r
a
were introduced in the form of ECN-Echo (ECE) and Congestion Window

Le Reduced (CWR) flags, as a means of supporting congestion notification for

delay sensitive TCP applications.

e
or
The explicit congestion notification (ECN) nonce sum (NS) was introduced as
a follow-up alteration to eliminate the potential abuse of ECN where devices

M along the transmission path may remove ECN congestion marks. The Options
field contains parameters that may be included as part of the TCP header,
often used during the initial connection establishment, as in the case of the
maximum segment size (MSS) value that may be used to define the size of
the segment that the receiver should use. TCP header size must be a sum of
32 bits, and where this is not the case, padding of 0 values will be performed.

104／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
When two processes wish to communicate, each TCP must first establish a

:h
connection (initialize the synchronization of communication on each side).
When communication is complete, the connection is terminated or closed to

e s
free the resources for other uses. Since connections must be established

c
between unreliable hosts and over the unreliable Internet domain, a
r
ou
handshake mechanism with clock-based sequence numbers is used to avoid
erroneous initialization of connections.

es
A connection progresses through a series of states during establishment. The

R
LISTEN state represents a TCP waiting for a connection request from any

i n g
remote TCP and port. SYN-SENT occurs after sending a connection request
and before a matching request is received. The SYN-RECEIVED state occurs

n
while waiting for a confirming connection request acknowledgment, after
r
a
having both received and sent a connection request. The ESTABLISHED state

Le occurs following the handshake at which time an open connection is created,

and data received can be delivered to the user.

e
or
The TCP three-way handshake mechanism begins with an initial sequence
number being generated by the initiating TCP as part of the synchronization

M (SYN) process. The initial TCP segment is then set with the SYN code bit, and
transmitted to the intended IP destination TCP to achieve a SYN-SENT state.
As part of the acknowledgement process, the peering TCP will generate an
initial sequence number of its own to synchronize the TCP flow in the other
direction. This peering TCP will transmit this sequence number, as well as an
acknowledgement number that equals the received sequence number
incremented by one, together with set SYN and ACK code bits in the TCP
header to achieve a SYN-RECEIVED state.

105／392
 The final step of the connection handshake involves the initial TCP acknowledging the
sequence number of the peering TCP by setting the acknowledgement number to equal the
received sequence number plus one, together with the ACK bit in the TCP header, allowing an
ESTABLISHED state to be reached.

e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
s :h
r ce
s ou
Re
i n g
r n
e a
e L
or
M

106／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Since the TCP transmission is sent as a data stream, every octet can be

:h
sequenced, and therefore each octet can be acknowledged. The
acknowledgement number is used to achieve this by responding to the sender

e s
as confirmation of receipt of data, thus providing data transport reliability. The

c
acknowledgement process however is cumulative, meaning that a string of
r
ou
octets can be acknowledged by a single acknowledgement by reporting to the
source the sequence number that immediately follows the sequence number

es
that was successfully received.

R
In the example a number of bytes (octets) are transmitted together before TCP

i n g
acknowledgement is given. Should an octet fail to be transmitted to the
destination, the sequence of octets transmitted will only be acknowledged to

n
the point at which the loss occurred. The resulting acknowledgement will
r
a
reflect the octet that was not received in order to reinitiate transmission from

Le the point in the data stream at which the octet was lost.
The ability to cumulate multiple octets together before an acknowledgement
e
or
enables TCP to operate much more efficiently, however a balance is
necessary to ensure that the number of octets sent before an

M acknowledgement is required is not too extreme, for if an octet fails to be

received, the entire stream of octets from the point of the loss must be
retransmitted.

107／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The TCP window field provides a means of flow control that governs the

:h
amount of data sent by the sender. This is achieved by returning a "window"
with every TCP segment for which the ACK field is set, indicating a range of

e s
acceptable sequence numbers beyond the last segment successfully

c
received. The window indicates the permitted number of octets that the sender
r
ou
may transmit before receiving further permission.

s
In the example, TCP transmission from host A to server A contains the current

Re
window size for host A. The window size for server A is determined as part of
the handshake, which based on the transmission can be assumed as 2048.

i n g
Once data equivalent to the window size has been received, an
acknowledgement will be returned, relative to the number of bytes received,

n
plus one. Following this, host A will proceed to transmit the next batch of data.
r
e aA TCP window size of 0 will effectively deny processing of segments, with
exception to segments where the ACK, RST and URG code bits are set for

e L incoming segments. Where a window size of 0 exists, the sender must still

or
periodically check the window size status of receiving TCP to ensure any
change in the window size is effectively reported, the period for retransmission

M is generally two minutes. When a sender sends periodic segments, the

receiving TCP must still acknowledge with a sequence number announcement
of the current window size of 0.

108／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
As part of the TCP connection termination process, a number of states are

:h
defined through which TCP will transition. These states include FIN-WAIT-1
that represents waiting for a connection termination (FIN) request from the

e s
remote TCP, or an acknowledgment of a connection termination request that

c
was previously sent. The FIN-WAIT-2 represents waiting for a connection
r
ou
termination request from the remote TCP following which will generally
transition to a TIME-WAIT state. A CLOSE-WAIT state indicates waiting for a

es
locally defined connection termination request, typically when a server’s

R
application is in the process of closing.

i n g
The LAST-ACK state represents waiting for an acknowledgment of the
connection termination request previously sent to the remote TCP (which

n
includes an acknowledgment of its connection termination request). Finally, a
r
a
TIME-WAIT state occurs and waits for enough time to pass to ensure that the

Le remote TCP received the acknowledgment of its connection termination

request. This period is managed by the Max Segment Lifetime (MSL) timer

e
or
that defines a waiting period of 2 minutes. Following a wait period equal to two
times the MSL, the TCP connection is considered closed/terminated.

109／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The User Datagram Protocol, or UDP, represents an alternative to TCP and

:h
applied where TCP is found to act as an inefficient transport mechanism,
primarily in the case of highly delay sensitive traffic. Where TCP is considered

e s
a segment, the UDP is recognized as a datagram form of Protocol Data Unit

c
(PDU), for which a datagram can be understood to be a self-contained,
r
ou
independent entity of data carrying sufficient information to be routed from the
source to the destination end system without reliance on earlier exchanges

es
between this source and destination end systems and the transporting

R
network, as defined in RFC 1594. In effect this means that UDP traffic does
not require the establishment of a connection prior to the sending of data.

i n g
The simplified structure and operation of UDP makes it ideal for application

n
programs to send messages to other programs, with a minimum of protocol
r
a
mechanism such in the case of acknowledgements and windowing for

Le example, as found in TCP segments. In balance however, UDP does not

guarantee delivery of data transmission, nor protection from datagram

e
or
duplication.

110／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The UDP header provides a minimalistic approach to the transport layer,

:h
implementing only a basic construct to help identify the destination port to
which the UDP based traffic is destined, as well as a length field and a

e s
checksum value that ensures the integrity of the UDP header. In addition the

c
minimal overhead acts as an ideal means for enabling more data to be carried
r
ou
per packet, favoring real time traffic such as voice and video communications
where TCP provides a 20 byte overhead and mechanisms that influence

es
delays, such as in the case of acknowledgements, however the lack of such

R
fields means that datagram delivery is not guaranteed.

i n g
r n
e a
e L
or
M

111／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Since UDP datagram transmission is not sent as a data stream, transmission

:h
of data is susceptible to datagram duplication. In addition, the lack of
sequence numbers within UDP means that delivery of data transmission over

e s
various paths is likely to be received at the destination in an incorrect, non-
sequenced order.
r c
ou
Where stream data is transported over UDP such as in the case of voice and

s
video applications, additional protocol mechanisms may be applied to

Re
enhance the capability of UDP, as in the case of the real time transport
protocol (RTP) which helps to support the inability of UDP by providing a

i n g
sequencing mechanism using timestamps to maintain the order of such
audio/video data streams, effectively supporting partial connection oriented

n
behavior over a connectionless transport protocol.
r
e a
e L
or
M

112／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The general UDP forwarding behavior is highly beneficial to delay sensitive

:h
traffic such as voice and video. It should be understood that where a
connection-oriented transport protocol is concerned, lost data would require

e s
replication following a delay period, during which time an acknowledgement by

c
the sender is expected. Should the acknowledgement not be received, the
r
ou
data shall be retransmitted.

s
For delay sensitive data streams, this would result in incomprehensible audio

Re
and video transmissions due to both delay and duplication, as a result of
retransmission from the point where acknowledgements are generated. In

i n g
such cases, minimal loss of the data stream is preferable over retransmission,
and as such UDP is selected as the transport mechanism, in support of delay

n
sensitive traffic.
r
e a
e L
or
M

113／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. The acknowledgement field in the TCP header confirms receipt of the

:h
segment received by the TCP process at the destination. The sequence
number in the TCP header of the received IP datagram is taken and

e s
incremented by 1. This value becomes the acknowledgement number in

c
the returned TCP header and is used to confirm receipt of all data, before
r
ou
being forwarded along with the ACK code bit set to 1, to the original
sender.

es
2. The three-way handshake involves SYN and ACK code bits in order to

R
establish and confirm the connection between the two end systems,

i n g
between which transmission of datagrams is to occur.

r n
e a
e L
or
M

114／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

115／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

116／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

117／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

118／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Data forwarding can be collectively defined as either local or remote for which

:h
the forwarding process relies on the application of the protocol stack in order
to achieve end-to-end transmission. End systems may be part of the same

e s
network, or located in different networks, however the general forwarding

c
principle to enable transmission between hosts follows a clear set of protocols
r
ou
that have been introduced as part of the unit. How these protocols work
together shall be reinforced, as well as building the relationship between the

es
upper layer TCP/IP protocols and the lower link layer based Ethernet protocol
standards.
R
i n g
r n
e a
e L
or
M

119／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
An end system that intends to forward data to a given destination must initially

:h
determine whether or not it is possible to reach the intended destination. In
order to achieve this, the end system must go through a process of path

e s
discovery. An end system should be understood to be capable of supporting

c
operation at all layers since its primary function is as a host to applications. In
r
ou
relation to this, it must also be capable of supporting lower layer operations
such as routing and link layer forwarding (switching) in order to be capable of

es
upper/application layer data forwarding. The end system therefore contains a

R
table that represents network layer reachability to the network for which the
upper layer data is destined.

i n g
End systems will commonly be aware of the network to which they reside, but

n
may be without a forwarding path in cases where remote network discovery
r
a
has not been achieved. In the example given, host A is in possession of a path

Le to the destined network through the ‘any network’ address that was briefly
introduced as part of the IP Addressing section. The forwarding table identifies

e
or
that traffic should be forwarded to the gateway as a next-hop via the interface
associated with the logical address of 10.1.1.1.

120／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Following discovery of a feasible route towards the intended destination

:h
network, a physical next-hop must also be discovered to facilitate frame
forwarding. The TCP/IP protocol suite is responsible for determining this

e s
before packet encapsulation can proceed. The initial step involves determining

c
whether a physical path exists to the next-hop identified as part of the path
r
ou
discovery process.

s
This requires that the ARP cache table be consulted to identify whether an

Re
association between the intended next-hop and the physical path is known.
From the example it can be seen that an entry to the next-hop gateway

i n g
address is present in the ARP cache table. Where an entry cannot be found,
the Address Resolution Protocol (ARP) must be initiated to perform the

n
discovery and resolve the physical path.
r
e a
e L
or
M

121／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
When both the logical and physical path forwarding discovery is complete, it is

:h
possible for encapsulation of data to be performed for successful transmission
over IP/Ethernet based networks. Upper layer processes in terms of

e s
encryption and compression may be performed following which transport layer

c
encapsulation will occur, identifying the source and destination ports via which
r
ou
upper layer data should be forwarded.

s
In the case of TCP, sequence and acknowledgement fields will be populated,

Re
code bits set as necessary with the ACK bit commonly applied. The window
field will be populated with the current supported window size, to which the

i n g
host will notify of the maximum data buffer that can be supported before data
is acknowledged.

r n
Values representing the TCP fields are included as part of the checksum,

e awhich is calculated using a ones compliment calculation process, to ensure

TCP segment integrity is maintained once the TCP header is received and

e L processed at the ultimate destination. In the case of basic TCP code

or
operations, upper layer data may not always be carried in the segment, as in
the case of connection synchronization, and acknowledgements to received

M data.

122／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Following transport layer encapsulation, it is generally required that

:h
instructions be provided, detailing how transmission over one or more
networks is to be achieved. This involves listing the IP source as well as the

e s
ultimate destination for which the packet is intended. IP packets are generally

c
limited to a size of 1500 bytes by Ethernet, inclusive of the network and
r
ou
transport layer headers as well as any upper layer data. Initial packet size will
be determined by Ethernet as the maximum transmission unit, or MTU to

es
which packets will conform, therefore fragmentation will not occur at the
source.
R
i n g
In the case that the MTU changes along the forwarding path, only then will
fragmentation will be performed. The Time to Live field will be populated with a

n
set value depending on the system, in ARG3 series routers, this is set with an
r
a
initial value of 255. The protocol field is populated based on the protocol

Le encapsulated prior to IP. In this case the protocol in question is TCP for which
the IP header will populate the protocol field with a value of 0x06 as instruction

e
or
for next header processing. Source and destination IP addressing will reflect
the originating source and the ultimate destination.

123／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
Link layer encapsulation relies on IEEE 802.3 Ethernet standards for physical

:h
transmission of upper layer data over Ethernet networks. Encapsulation at the
lower layers is performed by initially determining the frame type that is used.

e s
Where the upper layer protocol is represented by a type value greater than

r c
1536 (0x0600) as is the case with IP (0x0800), the Ethernet II frame type is

ou
adopted. The type field of the Ethernet II frame header is populated with the

s
type value of 0x0800 to reflect that the next protocol to be processed following

Re
frame processing will be IP. The destination MAC address determines the next
physical hop, which in this case represents the network gateway.

i n g
r n
e a
e L
or
M

124／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
As part of the link layer operation, it is imperative to ensure that the

:h
transmission medium is clear of signals in shared collision domain. The host
will first listen for any traffic on the network as part of CSMA/CD and should

e s
the line remain clear, will prepare to transmit the data. It is necessary for the

c
receiving physical interface to be made aware of the incoming frame, so as to
r
ou
avoid loss of initial bit values that would render initial frames as incomplete.
Frames are therefore preceded by a 64 bit value indicating to the link layer

es
destination of the frame’s imminent arrival.

R
The initial 56 bits represent an alternating 1, 0 pattern is called the preamble,

i n g
and is followed immediately by an octet understood as the Start of Frame
Delimiter (SFD). The final two bits of the SFD deviate from an alternating

n
pattern to a 1,1 bit combination that notifies that the bits that follow represent
r
a
the first bit values of the destination MAC address and therefore the start of

Le the frame header.

e
or
M

125／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
As a frame is received by the link layer destination, it must go through a

:h
number of checks to determine its integrity as well as validity. If the frame was
transmitted over a shared Ethernet network, other end stations may also

e s
receive an instance of the frame transmitted, however since the frame

c
destination MAC address is different from the MAC address of the end station,
r
ou
the frame will be discarded.

s
Frames received at the intended destination will perform error checking by

Re
calculating the ones compliment value based on the current frame fields and
compare this against the value in the Frame Check Sequence (FCS) field. If

i n g
the values do not match, the frame will be discarded. Receiving intermediate
and end systems that receive valid frames will need to determine whether the

n
frame is intended for their physical interface by comparing the destination
r
a
MAC address with the MAC address of the interface (or device in some

Le cases).
If there is a match, the frame is processed and the type field is used to
e
or
determine the next header to be processed. Once the next header is
determined, the frame header and trailer are discarded.

126／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The packet is received by the network layer, and in particular IP, at which

:h
point the IP header is processed. A checksum value exists at each layer of the
protocol stack to maintain the integrity at all layers for all protocols. The

e s
destination IP is used to determine whether the packet has reached its

c
ultimate destination. The gateway however determines that this is not the case
r
ou
since the destination IP and the IP belonging to the gateway do not match.

s
The gateway must therefore determine the course of action to take with

Re
regards to routing the packet to an alternate interface, and forward the packet
towards the network for which it is intended. The gateway must firstly however

i n g
ensure that the TTL value has not reached 0, and that the size of the packet
does not exceed the maximum transmission unit value for the gateway. In the

n
event that the packet is larger than the MTU value of the gateway,
r
a
fragmentation will generally commence.

Le Once a packet’s destination has been located in the forwarding table of the
gateway, the packet will be encapsulated in a new frame header consisting of
e
or
new source and destination MAC addresses for the link layer segment, over
which the resulting frame is to be forwarded, before being once again

M transmitted to the next physical hop. Where the next physical hop is not
known, ARP will again be used to resolve the MAC address.

127／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Frames received at the ultimate destination will initially determine whether the

:h
frame has arrived at the intended location. The example shows two servers on
a shared Ethernet network over which both receive a copy of the frame.

e s
The frame is ultimately discarded by server B since the destination MAC value

r c
and the interface MAC address of server B do not match. Server A however

ou
successfully receives the frame and learns that the MAC fields are the same,

s
the integrity of the frame based on the FCS can also be understood to be

Re
correct. The frame will use the type field to identify 0x0800 as the next header,
following which the frame header and trailer are discarded and the packet is

i n g
received by IP.

r n
e a
e L
or
M

128／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
Upon reaching the ultimate destination, the IP packet header must facilitate a

:h
number of processes. The first includes validating the integrity of the packet
header through the checksum field, again applying a ones compliment value

e s
comparison based on a sum of the IP header fields. Where correct, the IP

c
header will be used to determine whether the destination IP matches the IP
r
ou
address of the current end station, which in this case is true.

s
If any fragmentation occurred during transmission between the source and the

Re
destination, the packet must be reassembled at this point. The identification
field will collect the fragments belonging to a single data source together, the

i n g
offset will determine the order and the flags field will specify when the
reassembly should commence, since all fragments must be received firstly

n
and a fragment with a flag of 0 will be recognized as the last fragment to be
r
a
received.

Le A timer will then proceed during which time the reassembly must be
completed, should reassembly fail in this time period, all fragments will be
e
or
discarded. The protocol field will be used to identify the next header for
processing and the packet header will be discarded. It should be noted that

M the next header may not always be a transport layer header, a clear example
of where this can be understood is in the case of ICMP, which is understood to
also be a network layer protocol with a protocol field value of 0x01.

129／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In the case where a packet header is discarded, the resulting segment or

:h
datagram is passed to the transport layer for application-to-application based
processing. The header information is received in this case by TCP (0x06).

e s
In the example it can be understood that a TCP connection has already been

r c
established and the segment represents an acknowledgement for the

ou
transmission of HTTP traffic from the HTTP server to the acknowledging host.

s
The host is represented by the port 1027 as a means to distinguish between

Re
multiple HTTP connections that may exist between the same source host and
destination server. In receiving this acknowledgement, the HTTP server will

host.
i n g
continue to forward to the host within the boundaries of the window size of the

r n
e a
e L
or
M

130／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. Prior to the encapsulation and forwarding of data, a source must have

:h
knowledge of the IP destination or an equivalent forwarding address such
as a default address to which data can be forwarded. Additionally it is

e s
necessary that the forwarding address be associated with a physical next-

c
hop to which the data can be forwarded within the local network.
r
ou
2. Any frame that is received by a gateway or end system (host) to which it is

s
not intended, is subsequently dropped, following inspection of the

Re
destination MAC address in the frame header.
3. The delivery of data relies on the destination port number in the TCP and

i n g
UDP headers to identify the application to which the data is intended.
Following analysis of this value by the TCP or UDP protocol, the data is

r n
forwarded.

e a4. The source port of the TCP header for the HTTP traffic distinguishes

e L between the different application sessions that are active. Return HTTP
traffic from the HTTP server is able to identify each individual web browser

or
session based on this source port number. For example, the source port
of two separate requests for HTTP traffic originating from IP source

M 10.1.1.1 may originate from source ports 1028 and 1035, however the
destination port in both cases remains as port 80, the HTTP server.

131／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

132／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

133／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

134／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

135／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The Ethernet network until now has been understood to be a collection of

:h
devices communicating over shared media such as 10Base2, through which
hosts are able to communicate with neighboring hosts or end systems. It has

e s
been determined that the Ethernet network is a contentious network, meaning

c
that hosts must compete for media access which becomes increasingly limited
r
ou
as more and more devices are connected over this shared media; which
causes additional limitations in scalability and the increasing potential for
collisions.
es
R
As a result, the need for collision detection in the form of CSMA/CD is ever

i n g
present in such shared Ethernet networks. Following the adoption of switched
media such as that of 100BaseT, data transmission and reception became

n
isolated within channels (wire pairs), enabling the potential for collisions to
r
a
occur to be eliminated. This medium as a form of non-shared Ethernet

Le provides only a means for point-to-point communication, however used

together with other devices such as hubs, a shared Ethernet network is once

e
or
again possible, along with the potential for collisions.
The switch was introduced as part of the evolution of the bridge, and is

M capable of breaking down the shared collision domain into multiple collision
domains. The collision domains operate as a collection of point-to-point links
for which the threat of collisions is removed and link-layer traffic is isolated, to
allow higher transmission rates that optimize traffic flow within the Ethernet
network.

136／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
A broadcast domain is capable of being comprised of a single, or multiple

:h
collision domains, and any broadcast transmission is contained within the
boundary of a broadcast domain. The edge of a broadcast domain’s boundary

e s
is typically defined by a gateway that acts as the medium, via which other

c
networks are reachable, and will restrict the forwarding of any broadcast traffic
r
ou
beyond the interface on which the broadcast is received.

s
Routers are synonymous with the term gateway for which the two are often

Re
used interchangeably. A single IP network can generally be understood to
make up a broadcast domain, which refers to the scope of a link-layer

i n g
segment. Routers are generally responsible for routing Internet datagrams (IP
packets) to a given destination based on the knowledge of a forwarding

n
address for the destination network, found within an internally managed
r
a
forwarding table.

Le
e
or
M

137／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The Versatile Routing Platform (VRP) represents the foundation of many of

:h
Huawei products including routers and switches. Its design has been through
many evolutions to enable continuous improvement of data management and

e s
forwarding. The architectural design has resulted in ever enhanced modularity

c
that allows for greater overall performance. The configuration, management
r
ou
and monitoring of devices using VRP is based on a standardized and
hierarchical command line system for which a familiarity should be developed

es
to support navigation and operation of Huawei products managed using VRP
software.
R
i n g
r n
e a
e L
or
M

138／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
A familiarity with the versions of VRP network operating system (NOS) aids in

:h
ensuring that the version currently being used is up to date and supports
certain features that may be required in an enterprise network. The general

e s
trend for most Huawei devices is to operate using VRP version 5.x currently,

c
where x may vary depending on the product and VRP release. VRP version 8
r
ou
is a recent revision of VRP built with a highly refined architecture for the next
generation of technologies and constructed around the need for greater

es
efficiency, but is not present in all Huawei products.

R
i n g
r n
e a
e L
or
M

139／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
AR series enterprise routers (AR) include the AR150, AR200, AR1200,

:h
AR2200, and AR3200. They are the next-generation of Huawei products, and
provide routing, switching, wireless, voice, and security functionality. The AR

e s
series are positioned between the enterprise network and a public network,

c
functioning as an ingress and egress gateway for data transmitted between
r
ou
the two networks. Deployment of various network services over the AR series
routers reduces operation & maintenance (O&M) costs as well as costs

es
associated with establishing an enterprise network. AR series routers of

R
different specifications can be used as gateways based on the user capacity of
an enterprise.

i n g
The Sx7 Series Ethernet Switch provides data transport functionality, and has

n
been developed by Huawei to meet the requirements for reliable access and
r
a
high-quality transmission of multiple services on the enterprise network. This

Le series of switch is positioned for access or aggregation layer operation in the

enterprise network, and provides a large switching capacity, high port density,

e
or
and cost-effective packet forwarding capabilities.
Management of the ARG3 series routers and Sx7 series of switch can be

M achieved through establishing a connection to the console interface, and in the

case of the AR2200, a connection is also possible to be established via a Mini
USB interface.

140／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
A console cable is used to debug or maintain a locally established device such

:h
as a router or switch, and will interface with the console port of such devices.
The console interface of the S5700 series switch and the AR2200 router is an

e s
RJ-45 type connection, while the interface to which a host connection is made,

c
represents an RS-232 form of serial connector. Often such serial connectors
r
ou
are no longer present on newer devices that can be used for establishing
connectivity, such as laptop computers, and therefore an RS-232 to USB

es
conversion is performed. For most desktop devices however, an RS-232

R
based console connection can be established to a COM port on the host
device.

i n g
r n
e a
e L
or
M

141／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
Console establishment is set up through one of a number of available terminal

:h
emulation programs. Windows users often apply the HyperTerminal
application as shown in the example to interface with the VRP operating

e s
system. Following specification of the COM port that is to be used to establish

c
the connection, port settings must be defined.
r
ou
The example defines the port settings that should be applied, for which the

s
restore default button will automatically reassign should any change have

Re
been made to these settings. Once the OK button is pressed, a session will be
established with the VRP of the device. If the device is operating using factory

i n g
default settings, the user will be prompted for a password, which will be
assigned as the default login password for future connection attempts.

r n
e a
e L
or
M

142／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The Huawei AR2200 router, additionally supports the means for terminal

:h
connectivity via a USB connection. A type B mini USB interface exists on the
front panel of the AR2200 series router through which hosts are able to

e s
establish a USB based connection as a serial alternative to that of RS-232.

r c
s ou
Re
i n g
r n
e a
e L
or
M

143／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
A slight variation in the setup process requires that the mini USB firstly

:h
establish drivers to allow USB functionality. The mini USB driver can be
obtained by visiting http://support.huawei.com/enterprise, and under the path

e s
Support > Software > Enterprise Networking > Router > Access Router > AR

c
> AR2200, choose the relevant VRP version & patch path option, and
r
ou
download the file labeled AR&SRG_MiniUSB_driver.zip. It should be noted
that the mini USB driver supports only Windows XP, Windows Vista, and

es
Windows 7 operating systems.

R
When upgrading the device software or installing a patch, the MD5 hash value

i n g
can be checked to confirm software validity. In order to prevent the software
from being modified or replaced, you are advised to perform this operation.

r n
Installing requires the user to firstly double-click the driver installation file on

e athe PC and click Next. Secondly select I accept the terms in the license
agreement and click Next. Click the Change button to change the driver

e L directory if required, and click Next. Click Install and decompress the driver.

or
When the system finishes decompressing the driver, click Finish.
Users should then find the DISK1 folder in the specified driver directory, and

M double-click the file setup.exe. Following the opening of a second installation

window click Next. Users should again select I accept the terms in the license
agreement and click Next to install the driver. Once complete, click Finish to
finish installing the driver. Right-click My Computer, and choose Manage >
Device Manager > Ports(COM&LPT). The system should display the
TUSB3410 Device indicating the driver that has been installed.

144／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
As with the RS-232 console connection, the Mini USB serial connection

:h
requires establishment to terminal emulation software to enable interaction
with the VRP command line.

e s
Use the terminal emulation software to log in to the device through the mini

r c
USB port, (for which the Windows HyperTerminal is used as an example). On

ou
the host PC, start the HyperTerminal application, for which the location may

s
vary for each version of Windows, and create a connection by providing a

Re
suitable terminal connection name and click OK. Select the relevant
connection (COM) port and then set the communication parameters for the

i n g
serial port of the PC. These parameters should match the default values that
are set when pressing the Restore Defaults button.

r n
After pressing Enter, the console information is displayed requesting a login

e apassword. Enter a relevant password and confirmation password, and the

system will save the password.

e L
or
M

145／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. Any broadcast that is generated by an end system within a local network

:h
will be forwarded to all destinations. Once a frame is broadcast to a router
or device acting as a gateway for the network, the frame will be analyzed

e s
and should it be determined that the destination is for a locally defined

c
host other than the gateway, the frame will be dropped. This as such
r
ou
defines the boundary of any broadcast domain.

s
2. VRP version 5 is supported by a large number of current Huawei products,

e
while high end products may often be supported by VRP version 8.

R
i n g
r n
e a
e L
or
M

146／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

147／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

148／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

149／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

150／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The startup/boot process is the initial phase of operation for any administrator

:h
or engineer accessing Huawei based products operating with VRP. The boot
screen informs of the system startup operation procedures as well as the

e s
version of the VRP image that is that currently implemented on the device,

c
along with the storage location from where it is loaded. Following the initial
r
ou
startup procedure, an option for auto-configuration of the initial system settings
prompts for a response, for which the administrator can choose whether to

es
follow the configuration steps, or manually configure the basic system

R
parameters. The auto-configuration process can be terminated by selecting
the yes option at the given prompt.

i n g
r n
e a
e L
or
M

151／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The hierarchical command structure of VRP defines a number of command

:h
views that govern the commands for which users are able to perform
operations. The command line interface has multiple command views, of

e s
which common views have been introduced in the example. Each command is

c
registered to run in one or more command views, and such commands can
r
ou
run only after entering the appropriate command view. The initial command
view of VRP is the User View, which operates as an observation command

es
view for observing parameter statuses and general statistical information. For

R
application of changes to system parameters, users must enter the System
View. A number of sub command levels can also be found, in the form of the

n g
interface and protocol views for example, where sub system level tasks can be
i
n
performed.

a r
The command line views can be determined based on the parenthesis, and

Le information contained within these parenthesis. The presence of chevrons

identifies that the user is currently in the User View, whereas square brackets

e
or
show that a transition to the System View has occurred.

152／392
 e n
/
m
e.i co
aw
hu
g .
ni n
ar
// le
p :
t t
The example demonstrates a selection of common system defined shortcut

:h
keys that are widely used to simplify the navigation process within the VRP
command line interface. Additional commands are as follows:

e s
CTRL+B moves the cursor back one character.

r c
CTRL+D deletes the character where the cursor is located.

ou
CTRL+E moves the cursor to the end of the current line.

s
Re
CTRL+F moves the cursor forward one character.
CTRL+H deletes the character on the left side of the cursor.

i n g
CTRL+N displays the next command in the historical command buffer.

n
CTRL+P displays the previous command in the historical command buffer.

a r
CTRL+W deletes the word on the left side of the cursor.

Le CTRL+X deletes all the characters on the left side of the cursor.

e CTRL+Y deletes all the characters on the right side of the cursor.

or ESC+B moves the cursor one word back.

M ESC+D deletes the word on the right side of the cursor.

ESC+F moves the cursor forward one word.

153／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Additional key functions can be used to perform similar operations, the

:h
backspace operation has the same behavior as using CTRL+H to delete a
character to the left of the cursor. The left (←) and right (→) cursor keys can

e s
be used to perform the same operation as the CTRL+B and CTRL+F shortcut

c
key functions. The down cursor key (↓) functions the same as Ctrl+N, and the
r
ou
up cursor key (↑) acts as an alternative to the CTRL+P operation.

s
Additionally, the command line functions support a means of auto completion

Re
where a command word is unique. The example demonstrates how the
command word interface can be auto completed by partial completion of the

i n g
word to such a point that the command is unique, followed by the tab key
which will provide auto completion of the command word. Where the

n
command word is not unique, the tab function will cycle through the possible
r
a
completion options each time the tab key is pressed.

Le
e
or
M

154／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
There are two forms of help feature that can be found within the VRP, these

:h
come in the form of partial help and complete help functions. In entering a
character string followed directly by a question mark (?), VRP will implement

e s
the partial help function to display all commands that begin with this character

c
string. An example of this is demonstrated. In the case of the full help feature,
r
ou
a question mark (?) can be placed on the command line at any view to display
all possible command names, along with descriptions for all commands

es
pertaining to that view. Additionally the full help feature supports entry of a

R
command followed by a question mark (?) that is separated by a space. All
keywords associated with this command, as well as simple descriptions, are

n g
then displayed.
i
r n
e a
e L
or
M

155／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
For the majority of industries, it is likely that multiple devices will exist, each of

:h
which needs to be managed. As such, one of the first important tasks of
device commissioning involves setting device names to uniquely identify each

e s
device in the network. The system name parameter on AR2200 series router

c
is configured as Huawei by default, for the S5720 series of switch the default
r
ou
system name is HUAWEI. The implementation of the system name takes
effect immediately after configuration is complete.

es
R
i n g
r n
e a
e L
or
M

156／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The system clock reflects the system timestamp, and is able to be configured

:h
to comply with the rules of any given region. The system clock must be
correctly set to ensure synchronization with other devices and is calculated

e s
using the formula: Coordinated Universal Time (UTC) + Time zone offset +

c
Daylight saving time offset. The clock datetime command is used to set the
r
ou
system clock following the HH:MM:SS YYYY-MM-DD formula. It should be
noted however that if the time zone has not been configured or is set to 0, the

es
date and time set are considered to be UTC, therefore it is recommended that

R
the clock timezone be set firstly before configuring the system time and date.

i n g
The setting of the local timezone is achieved using the clock timezone
command and is implemented based on the time-zone-name { add | minus }

n
offset formula, where the add value indicates that the time of time-zone-name
r
a
is equal to the UTC time plus the time offset and minus indicates the time of

Le time-zone-name is equal to the UTC time minus the time offset.

Certain regions require that the daylight saving time be implemented to
e
or
maintain clock synchronization with any change in the clock timezone during
specific periods of the year. VRP is able to support daylight saving features for

M both fixed dates and dates which are determined based on a set of
predetermined rules. For example, daylight saving in the United Kingom
occurs on the last Sunday of March and the last Sunday of October, therefore
rules can be applied to ensure that changes occur based on such fluctuating
dates.

157／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The header command provides a means for displaying notifications during the

:h
connection to a device. The login header indicates a header that is displayed
when the terminal connection is activated, and the user is being authenticated

e s
by the device. The shell header indicates a header that is displayed when the

c
session is set up, after the user logs in to the device. The header information
r
ou
can be applied either as a text string or retrieved from a specified file. Where a
text string is used, a start and end character must be defined as a marker to

es
identify the information string, where in the example the “character defines the

R
information string. The string represents a value in the range of 1 to 2000
characters, including spaces. The information based header command follows

n g
the format of header { login | shell } information text where information
i
n
represents the information string, including start and end markers.

a r
In the case of a file based header, the format header { login | shell } file file-

Le name is applied, where file-name represents the directory and file from which
the information string can be retrieved.

e
or
M

158／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The system structures access to command functions hierarchically to protect

:h
system security. The system administrator sets user access levels that grant
specific users access to specific command levels. The command level of a

e s
user is a value ranging from 0 to 3, whilst the user access level is a value

c
ranging from 0 to 15. Level 0 defines a visit level for which access to
r
ou
commands that run network diagnostic tools, (such as ping and traceroute), as
well as commands such as telnet client connections, and select display
commands.
es
R
The Monitoring level is defined at a user level of 1 for which command levels 0

i n g
and 1 can be applied, allowing for the majority of display commands to be
used, with exception to display commands showing the current and saved

n
configuration. A user level of 2 represents the Configuration level for which
r
a
command levels up to 2 can be defined, enabling access to commands that

Le configure network services provided directly to users, including routing and

network layer commands. The final level is the Management level which

e
or
represents a user level of 3 through to 15 and a command level of up to 3,
enabling access to commands that control basic system operations and
provide support for services.
M These commands include file system, FTP, TFTP, configuration file switching,
power supply control, backup board control, user management, level setting,
system internal parameter setting, and debugging commands for fault
diagnosis. The given example demonstrates how a command privilege can be
changed, where in this case, the save command found under the user view
requires a command level of 3 before the command can be used.

159／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Each user interface is represented by a user interface view or command line

:h
view provided by the system. The command line view is used to configure and
manage all the physical and logical interfaces in asynchronous mode. Users

e s
wishing to interface with a device will be required to specify certain

c
parameters in order to allow a user interface to become accessible. Two
r
ou
common forms of user interface implemented are the console interface (CON)
and the virtual teletype terminal (VTY) interface.

es
The console port is an asynchronous serial port provided by the main control

R
board of the device, and uses a relative number of 0. VTY is a logical terminal

i n g
line that allows a connection to be set up when a device uses telnet services
to connect to a terminal for local or remote access to a device. A maximum of

n
15 users can use the VTY logical user interface to log in to the device by
r
a
extending the range from 0 – 4 achieved by applying the user-interface

Le maximum-vty 15 command. If the set maximum number of login users is 0, no

users are allowed to log in to the router through telnet or SSH. The display

e
or
user-interface command can be used to display relevant information regarding
the user interface.

160／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
For both the console and VTY terminal interfaces, certain attributes can be

:h
applied to modify the behavior as a means of extending features and
improving security. A user allows a connection to remain idle for a given

e s
period of time presents a security risk to the system. The system will wait for a

c
timeout period before automatically terminating the connection. This idle
r
ou
timeout period on the user interface is set to 10 minutes by default.

s
Where it may be necessary to increase or reduce the number of lines

Re
displayed on the screen of a terminal when using the display command for
example, the screen-length command can be applied. This by default is set to

i n g
24 however is capable of being increased to a maximum of 512 lines. A
screen-length of 0 however is not recommended since no output will be

n
displayed.
r
e aFor each command that is used, a record is stored in the history command
buffer which can be retrieved through navigation using the (↑) or CTRL+P and

e L the (↓) or Ctrl+N key functions. The number of recorded commands in the

or
history command buffer can be increased using the history-command max-
size command to define up to 256 stored commands. The number of

M commands stored by default is 10.

161／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
Access to user terminal interfaces provides a clear point of entry for

:h
unauthorized users to access a device and implement configuration changes.
As such the capability to restrict access and limit what actions can be

e s
performed is necessary as a means of device security. The configuration of

c
user privilege and authentication are two means by which terminal security
r
ou
can be improved. User privilege allows a user level to be defined which
restricts the capability of the user to a specific command range. The user level

es
can be any value in the range of 0 – 15, where values represent a visit level

R
(0), monitoring level (1), configuration level (2), and management level (3)
respectfully.

i n g
Authentication restricts a user capability to access a terminal interface by

n
requesting the user be authenticated using a password or a combination of
r
a
username and password before access via the user interface is granted. In the

Le case of VTY connections, all users must be authenticated before access is

possible. For all user interfaces, three possible authentication modes exist, in

e
or
the form of AAA, password authentication and non-authentication. AAA
provides user authentication with high security for which a user name and
password must be entered for login. Password authentication requires that
M only the login password is needed therefore a single password can be applied
to all users. The use of non-authentication removes any authentication applied
to a user interface. It should be noted that the console interface by default
uses the non-authentication mode.
It is generally recommended that for each user that is granted telnet access,
the user be identified through usernames and passwords to allow for
distinction of individual users. Each user should also be granted privilege

162／392
 levels, based on each users role and responsibility.

e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s :h
r ce
s ou
Re
i n g
r n
e a
e L
or
M

163／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
In order to run IP services on an interface, an IP address must be configured

:h
for the interface. Generally, an interface needs only the primary IP address. In
special cases, it is possible for a secondary IP address to be configured for

e s
the interface. For example, when an interface of a router such as the AR2200

c
connects to a physical network, and hosts on this physical network belong to
r
ou
two network segments.

s
In order to allow the AR2200 to communicate with all the hosts on the physical

Re
network, configure a primary IP address and a secondary IP address for the
interface. The interface has only one primary IP address. If a new primary IP

i n g
address is configured on an interface that already has a primary IP address,
the new IP address overrides the original one. The IP address can be

n
configured for an interface using the command ip address <ip-address > {
r
a
mask | mask-length } where mask represents the 32 bit subnet mask e.g.

Le 255.255.255.0, and mask-length represents the alternative mask-length value

e.g. 24, both of which can be used interchangeably.

e
or
The loopback interface represents a logical interface that is applied to
represent a network or IP host address, and is often used as a form of

M management interface in support of a number of protocols through which

communication is made to the IP address of the loopback interface, as
opposed to the IP address of the physical interface on which data is being
received.

164／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t
1. The console interface is capable of supporting only a single user at any
t
:h
given time; this is represented by the console 0 user interface view.

s
2. The loopback interface represents a logical interface that is not present in

r ce
a router until it is created. Once created, the loopback interface is
considered up. On ARG3 devices, the loopback interfaces can however

ou
be shut down.

es
R
i n g
r n
e a
e L
or
M

165／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

166／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

167／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

168／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

169／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The file system manages files and directories on the storage devices. It can

:h
create, delete, modify, or rename a file or directory, or display the contents of
a file.

e s
The file system has two functions: managing storage devices and managing

r c
the files that are stored on those devices. A number of directories are defined

ou
within which files are stored in a logical hierarchy. These files and directories

s
can be managed through a number of functions which allow the changing or

Re
displaying of directories, displaying files within such directories or sub-
directories, and the creation or deletion of directories.

i n g
Common examples of file system commands for general navigation include
the cd command used to change the current directory, pwd to view the

r n
current directory and dir to display the contents of a directory as shown in the

e aexample. Access to the file system is achieved from the User View.

e L
or
M

170／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Making changes to the existing file system directories generally relates to the

:h
capability to create and delete existing directories within the file system. Two
common commands that are used in this case. The mkdir directory command

e s
is used to create a folder in a specified directory on a designated storage

c
device, where directory refers to the name given to the directory and for which
r
ou
the directory name can be a string of 1 to 64 characters. In order to delete a
folder within the file system, the rmdir directory command is used, with

es
directory again referring to the name of the directory. It should be noted that a

R
directory can only be deleted if there are no files contained within that
directory.

i n g
r n
e a
e L
or
M

171／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Making changes to the files within a file system includes copying, moving,

:h
renaming, compressing, deleting, undeleting, deleting files in the recycle bin,
running files in batch and configuring prompt modes. Creating a duplicate of

e s
an existing file can be done using the copy source-filename destination-

c
filename command, where if the destination-filename is the same as that of an
r
ou
existing file (source-filename), the system will display a message indicating
that the existing file will be replaced. A target file name cannot be the same as

es
that of a startup file, otherwise the system displays a message indicating that

R
the operation is invalid and that the file is a startup file.

i n g
The move source-filename destination-filename command can be used to
move files to another directory. After the move command has been

n
successfully executed, the original file is cut and moved to the defined
r
a
destination file. It should be noted however that the move command can only

Le move files in the same storage device.

e
or
M

172／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
For the removal of files within a file system, the delete function can be applied

:h
using the command delete [ /unreserved ] [ /force ] { filename | device-name }.
Generally files that are deleted are directed to a recycle bin from where files

e s
can recovered using the undelete { filename | device-name } command,

c
however should the /unreserved command be used, the file will be
r
ou
permanently deleted. The system will generally display a message asking for
confirmation of file deletion, however if the /force parameter is included, no

es
prompt will be given. The filename parameter refers to the file which is to be

R
deleted, while the device-name parameter defines the storage location.

i n g
Where a file is directed to the recycle bin, it is not permanently deleted and
can be easily recovered. In order to ensure that such files in the recycle bin

n
are deleted permanently, the reset recycle-bin [ filename ]command can be
r
a
applied, where the filename parameter can be used to define a specific file for

Le permanent deletion.

e
or
M

173／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
When powered on, the device retrieves configuration files from a default save

:h
path to initialize itself, which is then stored within the RAM of the device. If
configuration files do not exist in the default save path, the router uses default
initialization parameters.
e s
r c
The current-configuration file indicates the configurations in effect on the

ou
device when it is actually running. When the configuration is saved, the current

s
configuration is stored in a saved-configuration file within the storage location

Re
of the device. If the device loaded the current-configuration file based on
default initialization parameters, a saved-configuration file will not exist in the

i n g
storage location of the default save path, but will be generated once the
current configuration is saved.

r n
e a
e L
or
M

174／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Using the display current-configuration command, device parameters that take

:h
effect can be queried. If default values of certain parameters are being used,
these parameters are not displayed. The current-configuration command

e s
includes a number of parameters that allow for filtering of the command list

c
during the used of the display function. The display current-configuration |
r
ou
begin {regular-expression} is an example of how the current-configuration can
be used to display active parameters that begin with a specific keyword or

es
expression. An alternative to this command is the display current-configuration

R
| include {regular-expression} which allows parameters that include a specific
keyword or expression within the current-configuration file.

i n g
The display saved-configuration [ last | time ] shows the output of the stored

n
configuration file used at startup to generate the current-configuration. Where
r
a
the last parameter is used it displays the configuration file used in the current

Le startup. The configuration file is displayed only when it is configured for the
current startup. The time parameter will display the time when the

e
or
configuration was last saved.

175／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Using the save [configuration-file] command will save the current configuration

:h
information to a default storage path. The configuration-file parameter allows
the current configuration information to be saved to a specified file. Running

e s
the save command with the configuration-file parameter does not affect the

c
current startup configuration file of the system. When configuration-file is the
r
ou
same as the configuration file stored in the default storage path of the system,
the function of this command is the same as that of the save command.

es
The example demonstrates the use of the save command to save the current-

R
configuration, which by default will be stored to the default vrpcfg.zip file in the

i n g
default storage location of the device.

r n
e a
e L
or
M

176／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The currently used save configuration file can be discovered through the use

:h
of the display startup command. In addition the display startup command can
be used to query the name of the current system software file, name of the

e s
next system software file, name of the backup system software file, names of

c
the four currently used (if used) system software files, and names of the next
r
ou
four system software files. The four system software files are the
aforementioned configuration file, voice file, patch file, and license file.

es
R
i n g
r n
e a
e L
or
M

177／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Following discovery of the startup saved-configuration file, it may be

:h
necessary to define a new configuration file to be loaded at the next startup. If
a specific configuration file is not specified, the default configuration file will be
loaded at the next startup.
e s
r c
The filename extension of the configuration file must be .cfg or .zip, and the

ou
file must be stored in the root directory of a storage device. When the router is

s
powered on, it reads the configuration file from the flash memory by default to

Re
initialize. The data in this configuration file is the initial configuration. If no
configuration file is saved in the flash memory, the router uses default

i n g
parameters to initiate.
Through the use of the startup saved-configuration [configuration-file] where

r n
the configuration-file parameter is the configuration file to be used at startup, it

e ais possible to define a new configuration file to initialize at the next system
startup.

e L
or
M

178／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
When the compare configuration [configuration-file] [current-line-number save-

:h
line-number] command is used, the system performs a line by line comparison
of the saved configuration with the current configuration starting from the first

e s
line. If the current-line-number save-line-number parameters are specified, the

c
system skips the non-relevant configuration before the compared lines and
r
ou
continues to find differences between the configuration files.

s
The system will then proceed to output the configuration differences between

Re
the saved configuration and the current configuration files. The comparison
output information is restricted to 150 characters by default. If the comparison

i n g
requires less than 150 characters, all variations until the end of two files are
displayed.

r n
e a
e L
or
M

179／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The reset saved-configuration command is used in order to delete a device

:h
startup configuration file from the storage device. When performed, the system
compares the configuration files used in the current startup and the next

e s
startup when deleting the configuration file from the router.

r c
If the two configuration files are the same, they are deleted at the same time

ou
after this command is executed. The default configuration file is used when the

s
router is started next time. If the two configuration files are different, the

executed.
Re
configuration file used in the current startup is deleted after this command is

i n g
If no configuration file is configured for the device current startup, the system
displays a message indicating that the configuration file does not exist after

r n
this command is executed. Once the reset saved-configuration command is

e aused, a prompt will be given to confirm the action, for which the user is
expected to confirm, as shown in the example.

e L
or
M

180／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The storage devices are product dependant, and include flash memory, SD

:h
cards, or USB flash drives. The AR2200E router for example has a built-in
flash memory and a built-in SD card (in slot sd1). The router provides two

e s
reserved USB slots (usb0 and usb1) and an SD card slot (sd0). For the S5700

c
it includes a built-in flash memory with a capacity that varies dependant on the
r
ou
model, with 64MB supported in the S5700C-HI, S5700-LI, S5700S-LI and
S5710-EI models, and 32 MB for all others. The details regarding the Huawei

es
product storage devices can be detailed by using the display version

R
command as shown.

i n g
r n
e a
e L
or
M

181／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Formatting a storage device is likely to result in the loss of all files on the

:h
storage device, and the files cannot be restored, therefore extra care should
be taken when performing any format command and should be avoided unless

e s
absolutely necessary. The format [storage-device] command is used along

c
with the storage-device parameter to define the storage location which is
r
ou
required to be formatted.

es
R
i n g
r n
e a
e L
or
M

182／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
When the terminal device displays that the system has failed, the fixdisk

:h
command can be used to attempt to fix the abnormal file system in the storage
device, however it does not provide any guarantee as to whether the file

e s
system can be restored successfully. Since the command is used to rectify

c
problems, if no problem has occurred in the system it is not recommended that
r
ou
this command be run. It should also be noted that this command does not
rectify device-level problems.

es
R
i n g
r n
e a
e L
or
M

183／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. The file system attribute d represents that the entry is a directory in the file

:h
system. It should be noted that this directory can only be deleted once any
files contained within the directory have been deleted. The remaining rwx

e s
values refer to whether the directory (or file) can be read, written to, and/or
executed.
r c
ou
2. A configuration may be saved under a separate name from the default

s
vrpcfg.zip file name and stored within the storage device of the router or

Re
switch. If this file is required to be used as the active configuration file in
the system, the command startup saved-configuration <configuration-file-

i n g
name> should be used where the configuration-file-name refers to the file
name and file extension.

r n
e a
e L
or
M

184／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

185／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

186／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

187／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

188／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The VRP platform is constantly updated to maintain alignment with changes in

:h
technology and support new advancements to the hardware. The VRP image
is generally defined by a VRP version and a product version number. Huawei

e s
ARG3 and Sx7 series products generally align with VRP version 5 to which

c
different product versions are associated.
r
ou
As the product version increases, so do the features that are supported by the

s
version. The product version format includes a product code Vxxx , Rxxx

Re
denotes a major version release and Cxx a minor version release. If a service
pack is used to patch the VRP product version, an SPC value may also be

i n g
included in the VRP product version number. Typical examples of the VRP
version upgrades for the AR2200E include:

r n
Version 5.90 (AR2200 V200R001C00)

e aVersion 5.110 (AR2200 V200R002C00)

e L Version 5.160 (AR2200 V200R007C00)

or
M

189／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
File transfer refers to the means by which files are sent to or retrieved from a

:h
remote server or storage location. Within the IP network this application can
be implemented for a wide range of purposes. As part of effective practice, it is

e s
common for important files be duplicated and backed up within a remote

c
storage location to prevent any loss that would affect critical systems
r
ou
operations. This includes files such as the VRP image of products which
(should the existing image suffer loss through use of the format command or

es
other forms of error), can be retrieved remotely and used to recover system

R
operations. Similar principles apply for important configuration files and
maintaining records of activity within devices stored in log files, which may be

n g
stored long term within the remote server.
i
r n
e a
e L
or
M

190／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
FTP is a standard application protocol based on the TCP/IP protocol suite and

:h
used to transfer files between local clients and remote servers. FTP uses two
TCP connections to copy a file from one system to another. The TCP

e s
connections are usually established in client-server mode, one for control (the

c
server port number is 21) and the other for data transmission (the sever port
r
ou
number is 20). FTP as a file transfer protocol is used to control connections by
issuing commands from the client (RTA) to the server and transmits replies

es
from the server to the client, minimizing the transmission delay. In terms of

R
data transmission, FTP transmits data between the client and server,
maximizing the throughput.

i n g
Trivial File Transfer Protocol (TFTP) is a simple file transfer protocol over

n
which a router can function as a TFTP client to access files on a TFTP server.
r
a
Unlike FTP, TFTP has no complex interactive access interface and

Le authentication control. Implementation of TFTP is based on the User

Datagram Protocol (UDP). The client initiates the TFTP transfer. To download

e
or
files, the client sends a read request packet to the TFTP server, receives
packets from the server, and returns an acknowledgement to the server. To
upload files, the client sends a write request packet to the TFTP server, sends
M packets to the server, and receives acknowledgement from the server.

191／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The example demonstrates how connection between an FTP server and client

:h
is established in order to retrieve a VRP image that can be used as part of the
system upgrade process. Prior to any transfer of data, it is necessary to

e s
establish the underlying connectivity over which files can be transferred. This

c
begins by providing suitable IP addressing for the client and the server. Where
r
ou
the devices are directly connected, interfaces can be applied that belong to the
same network. Where devices belong to networks located over a large

es
geographic area, devices must establish relevant IP addressing within their

R
given networks and be able to discover a relevant network path over IP via
which client/server connectivity can be established.

i n g
r n
e a
e L
or
M

192／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
A user must determine for any system upgrade as to whether there is

:h
adequate storage space in which to store the file that is to be retrieved. The
file system commands can be used to determine the current status of the file

e s
system, including which files are currently present within the file storage

c
location of the device and also the amount of space currently available. Where
r
ou
the storage space is not adequate for file transfer, certain files can be deleted
or uploaded to the FTP server in the event that they may still be required for
future use.
es
R
The example demonstrates the use of the delete file system command to

i n g
remove the existing image file. It should be noted that the system image, while
deleted will not impact the current operation of the device as long as the

n
device remains operational, therefore the device should not be powered off or
r
a
restarted before a new VRP image file is restored within the storage location

Le of the device, and set to be used during the next system startup.

e
or
M

193／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The retrieving of files from an FTP server requires that a connection be

:h
established firstly before any file transfer can take place. Within the client
device, the ftp service is initiated using the ftp <ip address> where the IP

e s
address relates to the address of the FTP server to which the client wishes to

c
connect. FTP connections will be established using TCP, and requires
r
ou
authentication in the form of a username and password which is defined by
the FTP server. Once authentication has been successfully achieved, the

es
client will have established access to the FTP server and will be able to use a

R
variety of commands to view existing files stored within the local current
directory of the server.

i n g
Prior to file transmission, the user may be required to set the file type for which

n
two formats exist, ASCII and Binary. ASCII mode is used for text, in which
r
a
data is converted from the sender's character representation to "8-bit ASCII"

Le before transmission, and then to the receiver's character representation.

Binary mode on the other hand requires that the sender send each file byte for

e
or
byte. This mode is often used to transfer image files and program files, and
should be applied when sending or retrieving any VRP image file. In the
example, the get vrp.cc command has been issued in order to retrieve the new
M VRP image located within the remote server.

194／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In the event that the client wishes to retrieve a VRP image from a TFTP

:h
server, a connection to the server need not first be established. Instead the
client must define the path to the server within the command line, along with

e s
the operation that is to be performed. It should also be noted that the

c
AR2200E & S5720 models serve as the TFTP client only and transfer files
r
ou
only in binary format. As can be seen from the example, the get command is
applied for retrieval of the VRP image file from the TFTP server following the

es
defining of the destination address of the TFTP server.

R
i n g
r n
e a
e L
or
M

195／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The transfer of the VRP image file to the client once successfully achieved,

:h
requires that the image be enabled as the startup system software during the
next system startup process. In order to change the system software version,

e s
the startup system-software command must be run and include the system

c
software file to be used in the next startup. A system software file must use .cc
r
ou
as the file name extension, and the system software file used in the next
startup cannot be that used in the current startup.

es
Additionally, the storage directory of a system software file must be the root

R
directory, otherwise the file will fail to run. The display startup command

i n g
should be used to verify that the change to the startup system software has
been performed successfully. The output for the startup system software

n
should show the existing VRP image, while the next startup system software
r
a
should display the transferred VRP image that is now present within the root

Le directory of the device.

e
or
M

196／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Confirmation of the startup system software allows for the safe initiation of the

:h
system software during the next system boot. In order to apply the changes
and allow for the new system software to take effect, the device must be

e s
restarted. The reboot command can be used in order to initiate the system

c
restart. During the reboot process, a prompt will be displayed requesting
r
ou
confirmation regarding whether the configuration file for the next system
startup be saved.

es
In some cases, the saved-configuration file may be erased by the user in order

R
to allow for a fresh configuration to be implemented. Should this have

i n g
occurred, the user is expected define a response of ‘no’ at the ‘Continue?’
prompt. If the user chooses ‘yes’ at this point, the current-configuration will be

n
rewritten to the saved-configuration file and applied once again during the next
r
a
startup. If the user is unaware of the changes for which the save prompt is

Le providing a warning, it is recommended that the user select ‘no’ or ‘n’ and
perform a comparison of the saved and current configuration to verify the

e
or
changes. For the reboot prompt, a response of ‘yes’ or ‘y’ is required to
complete the reboot process.

197／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
1. A client device must have the capability to reach the FTP server over IP,

:h
requiring an IP address be configured on the interface via which the FTP
server can be reached. This will allow a path to be validated to the FTP

e s
server at the network layer if one exists.

r c
2. The user can run the configuration command display startup to validate

ou
that current startup system software (VRP) is active, identified by the .cc

s
extension.

Re
i n g
r n
e a
e L
or
M

198／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

199／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

200／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

201／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

202／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
As the enterprise network expands, multiple users need to be established as

:h
part of a multi-access network. The evolution of network technologies has
seen a shift away from shared local networks, to networks which support

e s
multiple collision domains and support the use of 100BaseT forms of media

c
that isolated the transmission and reception of data over separate wire pairs,
r
ou
thus eliminating the potential for collisions to occur and allowing higher full
duplex transmission rates. The establishment of a switch brings the capability

es
for increased port density to enable the connection of a greater number of end

R
system devices within a single local area network. Each end system or host
within a local area network is required to be connected as part of the same IP

n g
network in order for communication to be facilitated at the network layer. The
i
n
IP address however is only relevant to the host systems since switch devices

a r
operate within the scope of the link layer and therefore rely on MAC

e
addressing for frame forwarding.

e L
or
M

203／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
As a link layer device, each switch relies on a MAC based table that provides

:h
association between a destination MAC address and the port interface via
which a frame should be forwarded. This is commonly referred to as the MAC
address table.
e s
r c
The initiation of a switch begins with the switch having no knowledge of end

ou
systems and how frames received from end systems should be forwarded. It

s
is necessary that the switch build entries within the MAC address table to

Re
determine the path that each frame received should take in order to reach a
given destination, so as to limit broadcast traffic within the local network.

i n g
These path entries are populated in the MAC address table as a result of
frames received from end systems. In the example, Host A has forwarded a

n
frame to Switch A, which currently has no entries within its MAC address table.
r
e a
e L
or
M

204／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The frame that is forwarded from Host A contains a broadcast MAC address

:h
entry in the destination address field of the frame header. The source address
field contains the MAC address of the peering device, in this case Host A. This

e s
source MAC address is used by the switch in order to populate the MAC

c
address table, by associating the MAC entry in the source address field with
r
ou
the switch port interface upon which the frame was received. The example
demonstrates how the MAC address is associated with the port interface to

es
allow any returning traffic to this MAC destination to be forwarded directly via

R
the associated interface.

i n g
r n
e a
e L
or
M

205／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The general behavior of an ARP request involves the frame being flooded to

:h
all intended destinations primarily due to the MAC broadcast (FF-FF-FF-FF-
FF-FF) that represents the current destination. The switch is therefore

e s
responsible for forwarding this frame out of every port interface with exception

c
to the port interface on which the frame was received, in an attempt to locate
r
ou
the intended IP destination as listed within the ARP header for which an ARP
reply can be generated. As demonstrated in the example, individual frames

es
are flooded from the switch via port interfaces G0/0/2 and G0/0/3 towards

R
hosts B and host C respectively.

i n g
r n
e a
e L
or
M

206／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
As a result of the ARP request header, the receiving host is able to determine

:h
that the ARP header is intended for the IP destination of 10.1.1.3, along with
the local source address (MAC) from which the frame originated, and use this

e s
information to generate a unicast reply. The information regarding Host A is

c
associated with the IP address of 10.1.1.3 and stored within the MAC address
r
ou
table of Host C. In doing so, the generation of broadcast traffic is minimized,
thereby reducing the number of interrupts to local destinations as well as

es
reduction of the number of frames propagating the local network.

R
Once the frame is received from Host C by Switch A, the switch will populate

i n g
the MAC address table with the source MAC address of the frame received,
and associate it with the port interface on which the frame was received. The

n
switch then uses the MAC address table to perform a lookup, in order to
r
a
discover the forwarding interface, based on the destination MAC address of

Le the frame. In this case the MAC address of the frame refers to Host A, for
which an entry now exists via interface G0/0/1, allowing the frame to be

e
or
forwarded to the known destination.

207／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Early Ethernet systems operated based on a 10Mbps half-duplex mode and

:h
applied mechanisms such as CSMA/CD to ensure system stability. The
transition to a twisted pair medium gave rise to the emergence of full-duplex

e s
Ethernet, which greatly improved Ethernet performance and meant two forms

c
of duplex could be negotiated. The auto-negotiation technology allows newer
r
ou
Ethernet systems to be compatible with earlier Ethernet systems.

s
In auto-negotiation mode, interfaces on both ends of a link negotiate their

Re
operating parameters, including the duplex mode, rate, and flow control. If the
negotiation succeeds, the two interfaces work with the same operating

i n g
parameters. In some cases however it is necessary to manually define the
negotiation parameters, such as where Gigabit Ethernet interfaces that are

n
working in auto-negotiation mode are connected via a 100 Mbps network
r
a
cable. In such cases, negotiation between the interfaces will fail.

Le Due to different product models, HUAWEI switches may not support the
change port duplex mode, see the product manual.
e
or
M

208／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
In the event that the configuration parameters for negotiation are changed

:h
from using auto negotiation, the defined parameters should be checked using
the display interface <interface> command to verify that the negotiated

e s
parameters allow for the link layer interface negotiation to be successful. This

c
is verified by the line protocol current state being displayed as UP. The
r
ou
displayed information reflects the current parameter settings for an interface.

es
R
i n g
r n
e a
e L
or
M

209／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. When a host or other end system is connected to a switch port interface, a

:h
gratuitous ARP is generated that is designed to ensure that IP addresses
remain unique within a network segment. The gratuitous ARP message

e s
however also provides the switch with information regarding the MAC

c
address of the host, which is then included in the MAC address table and
r
ou
associated with the port interface on which the host is connected.

s
If the physical connection of a host connected to a switch port interface is

Re
removed, the switch will discover the physical link is down and remove the
MAC entry from the MAC address table. Once the medium is connected to

i n g
another port interface, the port will detect that the physical link is active
and a gratuitous ARP will be generated by the host, allowing the switch to

r n discover and populate the MAC address table with the MAC address of

a
the connected host.

Le
e
or
M

210／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

211／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

212／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

213／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

214／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
Enterprise growth results in the commissioning of multiple switches in order to

:h
support the interconnectivity of end systems and services required for daily
operations. The interconnection of multiple switches however brings additional

e s
challenges that need to be addressed. Switches may be established as single

c
point-to-point links via which end systems are able to forward frames to
r
ou
destinations located via other switches within the broadcast domain. The
failure however of any point-to-point switch link results in the immediate

es
isolation of the downstream switch and all end systems to which the link is

R
connected. In order to resolve this issue, redundancy is highly recommended
within any switching network.

i n g
Redundant links are therefore generally used on an Ethernet switching

n
network to provide link backup and enhance network reliability. The use of
r
a
redundant links, however, may produce loops that cause the communication

Le quality to drastically deteriorate, and major interruptions to the communication

service to occur.

e
or
M

215／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
One of the initial effects of redundant switching loops comes in the form of

:h
broadcast storms. This occurs when an end system attempts to discover a
destination for which neither itself nor the switches along the switching path

e s
are aware of. A broadcast is therefore generated by the end system which is

c
flooded by the receiving switch.
r
ou
The flooding effect means that the frame is forwarded via all interfaces with

s
exception to the interface on which the frame was received. In the example,

Re
Host A generates a frame, which is received by Switch B which is
subsequently forwarded out of all other interfaces. An instance of the frame is

i n g
received by the connected switches A and C, which in turn flood the frame out
of all other interfaces. The continued flooding effect results in both Switch A

n
and Switch C flooding instances of the frame from one switch to the other,
r
a
which in turn is flooded back to Switch B, and thus the cycle continues. In

Le addition, the repeated flooding effect results in multiple instances of the frame
being received by end stations, effectively causing interrupts and extreme

e
or
switch performance degradation.

216／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Switches must maintain records of the path via which a destination is

:h
reachable. This is identified through association of the source MAC address of
a frame with the interface on which the frame was received. Only one instance

e s
of a MAC address can be stored within the MAC address table of a switch,

c
and where a second instance of the MAC address is received, the more recent
r
ou
information takes precedence.

s
In the example, Switch B updates the MAC address table with the MAC

Re
address of Host A and associates this source with interface G0/0/3, the port
interface on which the frame was received. As frames are uncontrollably

i n g
flooded within the switching network, a frame is again received with the same
source MAC address as Host A, however this time the frame is received on

n
interface G0/0/2. Switch B must therefore assume that the host that was
r
a
originally reachable via interface G0/0/3 is now reachable via G0/0/2, and will

Le update the MAC address table accordingly. The result of this process leads to
MAC instability and continues to occur endlessly between both the switch port

e
or
interfaces connecting to Switch A and Switch C since frames are flooded in
both directions as part of the broadcast storm effect.

217／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The challenge for the switching network lies in the ability to maintain switching

:h
redundancy to avoid isolation of end systems in the event of switch system or
link failure, and the capability to avoid the damaging effects of switching loops

e s
within a switching topology which implements redundancy. The resulting

c
solution for many years has been to implement the spanning tree protocol
r
ou
(STP) in order to prevent the effects of switching loops. Spanning tree works
on the principle that redundant links be logically disabled to provide a loop free

es
topology, whilst being able to dynamically enable secondary links in the event

R
that a failure along the primary switching path occurs, thereby fulfilling the
requirement for network redundancy within a loop free topology. The switching

n g
devices running STP discover loops on the network by exchanging information
i
n
with one another, and block certain interfaces to cut off loops. STP has

a r
continued to be an important protocol for the LAN for over 20 years.

Le
e
or
M

218／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The removal of any potential for loops serves as the primary goal of spanning

:h
tree for which an inverted tree type architecture is formed. At the base of this
logical tree is the root bridge/switch. The root bridge represents the logical

e s
center but not necessarily the physical center of the STP-capable network.

c
The designated root bridge is capable of changing dynamically with the
r
ou
network topology, as in the event where the existing root bridge fails to
continue to operate as the root bridge. Non-root bridges are considered to be

es
downstream from the root bridge and communication to non-root bridges flows

R
from the root bridge towards all non-root bridges. Only a single root bridge can
exist in a converged STP-capable network at any one time.

i n g
r n
e a
e L
or
M

219／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Discovery of the root bridge for an STP network is a primary task performed in

:h
order to form the spanning tree. The STP protocol operates on the basis of
election, through which the role of all switches is determined. A bridge ID is

e s
defined as the means by which the root bridge is discovered. This comprises

c
of two parts, the first being a 16 bit bridge priority and the second, a 48 bit
r
ou
MAC address.

s
The device that is said to contain the highest priority (smallest bridge ID) is

Re
elected as the root bridge for the network. The bridge ID comparison takes
into account initially the bridge priority, and where this priority value is unable

i n g
to uniquely identify a root bridge, the MAC address is used as a tie breaker.
The bridge ID can be manipulated through alteration to the bridge priority as a

n
means of enabling a given switch to be elected as the root bridge, often in
r
a
support of an optimized network design.

Le
e
or
M

220／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The spanning tree topology relies on the communication of specific

:h
information to determine the role and status of each switch in the network. A
Bridge Protocol Data Unit (BPDU) facilitates communication within a spanning

e s
tree network. Two forms of BPDU are used within STP. A Configuration BPDU

c
is initially created by the root and propagated downstream to ensure all non-
r
ou
root bridges remain aware of the status of the spanning tree topology and
importantly, the root bridge. The TCN BPDU is a second form of BPDU, which

es
propagates information in the upstream direction towards the root and shall be

R
introduced in more detail as part of the topology change process.

i n g
Bridge Protocol Data Units are not directly forwarded by switches, instead the
information that is carried within a BPDU is often used to generate a switches

n
own BPDU for transmission. A Configuration BPDU carries a number of
r
a
parameters that are used by a bridge to determine primarily the presence of a

Le root bridge and ensure that the root bridge remains the bridge with the highest
priority. Each LAN segment is considered to have a designated switch that is

e
or
responsible for the propagation of BPDU downstream to non-designated
switches.

M The Bridge ID field is used to determine the current designated switch from
which BPDU are expected to be received. The BPDU is generated and
forwarded by the root bridge based on a Hello timer, which is set to 2 seconds
by default. As BPDU are received by downstream switches, a new BPDU is
generated with locally defined parameters and forwarded to all non-designated
switches for the LAN segment.

221／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Another feature of the BPDU is the propagation of two parameters relating to

:h
path cost. The root path cost (RPC) is used to measure the cost of the path to
the root bridge in order to determine the spanning tree shortest path, and

e s
thereby generate a loop free topology. When the bridge is the root bridge, the
root path cost is 0.
r c
ou
The path cost (PC) is a value associated with the root port, which is the port

s
on a downstream switch that connects to the LAN segment, on which a

Re
designated switch or root bridge resides. This value is used to generate the
root path cost for the switch, by adding the path cost to the RPC value that is

i n g
received from the designated switch in a LAN segment, to define a new root
path cost value. This new root path cost value is carried in the BPDU of the

n
designated switch and is used to represent the path cost to the root.
r
e a
e L
or
M

222／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Huawei Sx7 series switches support a number of alternative path cost

:h
standards that can be implemented based on enterprise requirements, such
as where a multi-vendor switching network may exist. The Huawei Sx7 series

e s
of switches use the 802.1t path cost standard by default, providing a stronger

c
metric accuracy for path cost calculation.
r
s ou
Re
i n g
r n
e a
e L
or
M

223／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
A converged spanning tree network defines that each interface be assigned a

:h
specific port role. Port roles are used to define the behavior of port interfaces
that participate within an active spanning tree topology. For the spanning tree

e s
protocol, three port roles of designated, root and alternate are defined.

r c
The designated port is associated with a root bridge or a designated bridge of

ou
a LAN segment and defines the downstream path via which Configuration

s
BPDU are forwarded. The root bridge is responsible for the generation of

Re
configuration BPDU to all downstream switches, and thus root bridge port
interfaces always adopt the designated port role.

i n g
The root port identifies the port that offers the lowest cost path to the root,
based on the root path cost. The example demonstrates the case where two

r n
possible paths exist back to the root, however only the port that offers the

e alowest root path cost is assigned as the root port. Where two or more ports
offer equal root path costs, the decision of which port interface will be the root

e L port is determined by comparing the bridge ID in the configuration BPDU that

or
is received on each port.
Any port that is not assigned a designated or root port role is considered an

M alternate port, and is able to receive BPDU from the designated switch for the
LAN segment for the purpose of monitoring the status of the redundant link,
but will not process the received BPDU. The IEEE 802.1D-1990 standard for
STP originally defined this port role as backup, however this was amended to
become the alternate port role within the IEEE 802.1D-1998 standards
revision.

224／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The port ID represents a final means for determining port roles alongside the

:h
bridge ID and root path cost mechanism. In scenarios where two or more ports
offer a root path cost back to the root that is equal and for which the upstream

e s
switch is considered to have a bridge ID that is equal, primarily due to the

c
upstream switch being the same switch for both paths, the port ID must be
r
ou
applied to determine the port roles.

s
The port ID is tied to each port and comprises of a port priority and a port

Re
number that associates with the port interface. The port priority is a value in
the range of 0 to 240, assigned in increments of 16, and represented by a

i n g
value of 128 by default. Where both port interfaces offer an equal port priority
value, the unique port number is used to determine the port roles. The highest

n
port identifier (the lowest port number) represents the port assigned as the
r
a
root port, with the remaining port defaulting to an alternate port role.

Le
e
or
M

225／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The root bridge is responsible for the generation of configuration BPDU based

:h
on a BPDU interval that is defined by a Hello timer. This Hello timer by default
represents a period of 2 seconds. A converged spanning tree network must

e s
ensure that in the event of a failure within the network, which switches within

c
the STP enabled network are made aware of the failure. A Max Age timer is
r
ou
associated with each BDPU and represents life span of a BPDU from the point
of conception by the root bridge, and ultimately controls the validity period of a

es
BDPU before it is considered obsolete. This MAX Age timer by default

R
represents a period of 20 seconds.

i n g
Once a configuration BPDU is received from the root bridge, the downstream
switch is considered to take approximately 1 second to generate a new BPDU,

n
and propagate the generated BPDU downstream. In order to compensate for
r
a
this time, a message age (MSG Age) value is applied to each BPDU to

Le represent the offset between the MAX Age and the propagation delay, and for
each switch this message age value is incremented by 1.

e
or
As BPDU are propagated from the root bridge to the downstream switches the
MAX Age timer is refreshed. The MAX Age timer counts down and expires

M when the MAX Age value exceeds the value of the message age, to ensure
that the lifetime of a BPDU is limited to the MAX Age, as defined by the root
bridge. In the event that a BPDU is not received before the MAX Age timer
expires, the switch will consider the BPDU information currently held as
obsolete and assume an STP network failure has occurred.

226／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The spanning tree convergence process is an automated procedure that

:h
initiates at the point of switch startup. All switches at startup assume the role
of root bridge within the switching network. The default behavior of a root

e s
bridge is to assign a designated port role to all port interfaces to enable the

c
forwarding of BPDU via all connected port interfaces. As BPDU are received
r
ou
by peering switches, the bridge ID will be compared to determine whether a
better candidate for the role of root bridge exists. In the event that the received

es
BPDU contains an inferior bridge ID with respect to the root ID, the receiving

R
switch will continue to advertise its own configuration BPDU to the neighboring
switch.

i n g
Where the BDPU is superior, the switch will acknowledge the presence of a

n
better candidate for the role of root bridge, by ceasing to propagate BPDU in
r
a
the direction from which the superior BPDU was received. The switch will also

Le amend the root ID field of its BPDU to advertise the bridge ID of the root
bridge candidate as the current new root bridge.

e
or
M

227／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
An elected root bridge, once established will generate configuration BPDU to

:h
all other non-root switches. The BPDU will carry a root path cost that will
inform downstream switches of the cost to the root, to allow for the shortest

e s
path to be determined. The root path cost carried in the BPDU that is

c
generated by the root bridge always has a value of 0. The receiving
r
ou
downstream switches will then add this cost to the path cost of the port
interfaces on which the BPDU was received, and from which a switch is able

es
to identify the root port.

R
In the case where equal root path costs exist on two or more LAN segments to

i n g
the same upstream switch, the port ID is used to discover the port roles.
Where an equal root path cost exists between two switches as in the given

n
example, the bridge ID is used to determine which switch represents the
r
a
designated switch for the LAN segment. Where the switch port is neither a

Le root port nor designated port, the port role is assigned as alternate.

e
or
M

228／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
As part of the root bridge and port role establishment, each switch will

:h
progress through a number of port state transitions. Any port that is
administratively disabled will be considered to be in the disabled state.

e s
Enabling of a port in the disabled state will see a state transition to the
blocking state ①.
r c
ou
Any port considered to be in a blocking state is unable to forward any user

s
traffic, but is capable of receiving BPDU frames. Any BPDU received on a port

Re
interface in the blocking state will not be used to populate the MAC address
table of the switch, but instead to determine whether a transition to the

n g
listening state is necessary. The listening state enables communication of
BPDU information, following negotiation of the port role in STP ② , but
i
n
maintains restriction on the populating of the MAC address table with neighbor
r
a
information.

Le A transition to the blocking state from the listening or other states ③ may
occur in the event that the port is changed to an alternate port role. The
e
or
transition between listening to learning and learning to forwarding states ④ is
greatly dependant on the forward delay timer, which exists to ensure that any

M propagation of BDPU information to all switches in the spanning tree topology

is achievable before the state transition occurs.
The learning state maintains the restriction of user traffic forwarding to ensure
prevention of any switching loops however allows for the population of the
MAC address table throughout the spanning tree topology to ensure a stable
switching network. Following a forward delay period, the forwarding state is
reached. The disabled state is applicable at any time during the state
transition period through manual intervention (i.e. the shutdown command) ⑤.

229／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Events that cause a change in the established spanning tree topology may

:h
occur in a variety of ways, for which the spanning tree protocol must react to
quickly re-establish a stable and loop free topology. The failure of the root

e s
bridge is a primary example of where re-convergence is necessary. Non-root

c
switches rely on the intermittent pulse of BPDU from the root bridge to
r
ou
maintain their individual roles as non-root switches in the STP topology. In the
event that the root bridge fails, the downstream switches will fail to receive a

es
BPDU from the root bridge and as such will also cease to propagate any

R
BPDU downstream. The MAX Age timer is typically reset to the set value (20
seconds by default) following the receipt of each BPDU downstream.

i n g
With the loss of any BPDU however, the MAX Age timer begins to count down

n
the lifetime for the current BPDU information of each non-root switch, based
r
a
on the (MAX Age – MSG Age) formula. At the point at which the MSG Age

Le value is greater than the MAX Age timer value, the BPDU information received
from the root becomes invalid, and the non-root switches begin to assume the

e
or
role of root bridge. Configuration BPDU are again forwarded out of all active
interfaces in a bid to discover a new root bridge. The failure of the root bridge
invokes a recovery duration of approximately 50 seconds due to the Max Age
M + 2x Forward Delay convergence period.

230／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In the case of an indirect link failure, a switch loses connection with the root

:h
bridge due to a failure of the port or media, or due possibly to manual
disabling of the interface acting as the root port. The switch itself will become

e s
immediately aware of the failure, and since it only receives BPDU from the

c
root in one direction, will assume immediate loss of the root bridge, and assert
r
ou
its position as the new root bridge.

s
From the example, switch B begins to forward BPDU to switch C to notify of

Re
the position of switch B as the new root bridge, however switch C continues to
receive BPDU from the original root bridge and therefore ignores any BPDU

i n g
from switch B. The alternate port will begin to age its state through the MAX
Age timer, since the interface no longer receives BPDU containing the root ID

n
of the root bridge.
r
e aFollowing the expiry of the MAX Age timer, switch C will change the port role
of the alternate port to that of a designated port and proceed to forward BPDU

e L from the root towards switch B, which will cause the switch to concede its

or
assertion as the root bridge and converge its port interface to the role of root
port. This represents a partial topology failure however due to the need to wait

M for a period equivalent to MAX Age + 2x forward delay, full recovery of the
STP topology requires approximately 50 seconds.

231／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
A final scenario involving spanning tree convergence recovery occurs where

:h
multiple LAN segments are connected between two switch devices for which
one is currently the active link while the other provides an alternate path to the

e s
root. Should an event occur that causes the switch that is receiving the BPDU

c
to detect a loss of connection on its root port, such as in the event that a root
r
ou
port failure occurs, or a link failure occurs, for which the downstream switch is
made immediately aware, the switch can instantly transition the alternate port.

es
This will begin the transition through the listening, learning and forwarding

R
states and achieve recovery within a 2x forward delay period. In the event of

i n g
any failure, where the link that provides a better path is reactivated, the
spanning tree topology must again re-converge in order to apply the optimal

n
spanning tree topology.
r
e a
e L
or
M

232／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
In a converged spanning tree network, switches maintain filter databases, or

:h
MAC address tables to manage the propagation of frames through the
spanning tree topology. The entries that provide an association between a

e s
MAC destination and the forwarding port interface are stored for a finite period

c
of 300 seconds (5 minutes) by default. A change in the spanning tree topology
r
ou
however means that any existing MAC address table entries are likely to
become invalid due to the alteration in the switching path, and therefore must
be renewed.
es
R
The example demonstrates an existing spanning tree topology for which

i n g
switch B has entries that allow Host A to be reached via interface Gigabit
Ethernet 0/0/3 and Host B via interface Gigabit Ethernet 0/0/2. A failure is

n
simulated on switch C for which the current root port has become inactive.
r
a
This failure causes a recalculation of the spanning tree topology to begin and

Le predictably the activation of the redundant link between switch C and switch B.
Following the re-convergence however, it is found that frames from Host A to
e
or
Host B are failing to reach their destination. Since the MAC address table
entries have yet to expire based on the 300 second rule, frames reaching

M switch B that are destined for Host B continue to be forwarded via port
interface Gigabit Ethernet 0/0/2, and effectively become black holed as frames
are forwarded towards the inactive port interface of switch C.

233／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
An additional mechanism must be introduced to handle the MAC entries

:h
timeout period issue that results in invalid path entries being maintained
following spanning tree convergence. The process implemented is referred to

e s
as the Topology Change Notification (TCN) process, and introduces a new

c
form of BPDU to the spanning tree protocol operation.
r
ou
This new BPDU is referred to as the TCN BPDU and is distinguished from the

s
original STP configuration BPDU through the setting of the BPDU type value

Re
to 128 (0x80). The function of the TCN BPDU is to inform the upstream root
bridge of any change in the current topology, thereby allowing the root to send

i n g
a notification within the configuration BPDU to all downstream switches, to
reduce the timeout period for MAC address table entries to the equivalent of

n
the forward delay timer, or 15 seconds by default.
r
e aThe flags field of the configuration BPDU contains two fields for Topology
Change (TC) and Topology Change Acknowledgement (TCA). Upon receiving

e L a TCN BPDU, the root bridge will generate a BPDU with both the TC and TCA

or
bits set, to respectively notify of the topology change and to inform the
downstream switches that the root bridge has received the TCN BPDU, and

M therefore transmission of the TCN BPDU should cease.

The TCA bit shall remain active for a period equal to the Hello timer (2
seconds), following which configuration BPDU generated by the root bridge
will maintain only the TC bit for a duration of (MAX Age + forward delay), or 35
seconds by default.

234／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The effect of the TCN BPDU on the topology change process ensures that the

:h
root bridge is notified of any failure within the spanning tree topology, for which
the root bridge is able to generate the necessary flags to flush the current

e s
MAC address table entries in each of the switches. The example

c
demonstrates the results of the topology change process and the impact on
r
ou
the MAC address table. The entries pertaining to switch B have been flushed,
and new updated entries have been discovered for which it is determined that

es
Host B is now reachable via port interface Gigabit Ethernet 0/0/1.

R
i n g
r n
e a
e L
or
M

235／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Huawei Sx7 series switches to which the S5700 series model belongs, is

:h
capable of supporting three forms of spanning tree protocol. Using the stp
mode command, a user is able to define the mode of STP that should be

e s
applied to an individual switch. The default STP mode for Sx7 series switches

c
is MSTP, and therefore must be reconfigured before STP can be used.
r
s ou
Re
i n g
r n
e a
e L
or
M

236／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
As part of good switch design practice, it is recommended that the root bridge

:h
be manually defined. The positioning of the root bridge ensures that the
optimal path flow of traffic within the enterprise network can be achieved

e s
through configuration of the bridge priority value for the spanning tree protocol.

c
The stp priority [priority] command can be used to define the priority value,
r
ou
where priority refers to an integer value between 0 and 61440, assigned in
increments of 4096. This allows for a total of 16 increments, with a default

es
value of 32768. It is also possible to assign the root bridge for the spanning

R
tree through the stp root primary command.

i n g
r n
e a
e L
or
M

237／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
It has been understood that Huawei Sx7 series of switches support three

:h
forms of path cost standard in order to provide compatibility where required,
however defaults to support the 802.1t path cost standard. The path cost

e s
standard can be adjusted for a given switch using the stp pathcost-standard

c
{dot1d-1998 | dot1t | legacy } command, where dot1d-1998, dot1t and legacy
r
ou
refer to the path cost standards described earlier in this section.

s
In addition, the path cost of each interface can also be assigned manually to

Re
support a means of detailed manipulation of the stp path cost. This method of
path cost manipulation should be used with great care however as the path

i n g
cost standards are designed to implement the optimal spanning tree topology
for a given switching network and manipulation of the stp cost may result in

n
the formation of a sub-optimal spanning tree topology.
r
e aThe command stp cost [cost] is used, for which the cost value should follow
the range defined by the path cost standard. If a Huawei legacy standard is

e L used, the path cost ranges from 1 to 200000. If the IEEE 802.1D standard is

or
used, the path cost ranges from 1 to 65535. If the IEEE 802.1t standard is
used, the path cost ranges from 1 to 200000000.

238／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
If the root switch on a network is incorrectly configured or attacked, it may

:h
receive a BPDU with a higher priority and thus the root switch becomes a non-
root switch, which causes a change of the network topology. As a result, traffic

e s
may be switched from high-speed links to low-speed links, causing network
congestion.
r c
ou
To address this problem, the switch provides the root protection function. The

s
root protection function protects the role of the root switch by retaining the role

Re
of the designated port. When the port receives a BPDU with a higher priority,
the port stops forwarding packets and turns to the listening state, but it still

i n g
retains a designated port role. If the port does not receive any BPDU with a
higher priority for a certain period, the port status is restored from the listening

n
state.
r
e aThe configured root protection is valid only when the port is the designated
port and the port maintains the role. If a port is configured as an edge port, or

e L if a command known as loop protection is enabled on the port, root protection

or
cannot be enabled on the port.

239／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Using the display stp command, the current STP configuration can be

:h
determined. A number of timers exist for managing the spanning tree
convergence, including the hello timer, max age timer, and forward delay, for

e s
which the values displayed represent the default timer settings, and are

c
recommended to be maintained.
r
ou
The current bridge ID can be identified for a given switch through the CIST

s
Bridge configuration, comprised of the bridge ID and MAC address of the

Re
switch. Statistics provide information regarding whether the switch has
experienced topology changes, primarily through the TC or TCN received

i n g
value along with the last occurrence as shown in the time since last TC entry.

r n
e a
e L
or
M

240／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
For individual interfaces on a switch it is possible to display this information via

:h
the display stp command to list all interfaces, or using the display stp interface
<interface> command to define a specific interface. The state of the interface

e s
follows MSTP port states and therefore will display as either Discarding,

c
Learning or Forwarding. Other valid information such as the port role and cost
r
ou
for the port are also displayed, along with any protection mechanisms applied.

es
R
i n g
r n
e a
e L
or
M

241／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. Following the failure of the root bridge for a spanning tree network, the

:h
next best candidate will be elected as the root bridge. In the event that the
original root bridge becomes active once again in the network, the process

e s
of election for the position of root bridge will occur once again. This

c
effectively causes network downtime in the switching network as
r
ou
convergence proceeds.

s
2. The Root Path Cost is the cost associated with the path back to the root

Re
bridge, whereas the Path Cost refers to the cost value defined for an
interface on a switch, which is added to the Root Path Cost, to define the

i n g
Root Path Cost for the downstream switch.

r n
e a
e L
or
M

242／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

243／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

244／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

245／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

246／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
STP ensures a loop-free network but has a slow network topology

:h
convergence speed, leading to service deterioration. If the network topology
changes frequently, the connections on the STP capable network are

e s
frequently torn down, causing regular service interruption.

r c
RSTP employs a proposal and agreement process which allows for immediate

ou
negotiation of links to take place, effectively removing the time taken for

s
convergence based timers to expire before spanning tree convergence can

Re
occur. The proposal and agreement process tends to follow a cascading effect
from the point of the root bridge through the switching network, as each

i n g
downstream switch begins to learn of the true root bridge and the path via
which the root bridge can be reached.

r n
e a
e L
or
M

247／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Switches operating in RSTP mode implement two separate port roles for

:h
redundancy. The alternate port represents a redundant path to the root bridge
in the event that the current path to the root bridge fails. The backup port role

e s
represents a backup for the path for the LAN segment in the direction leading

c
away from the root bridge. It can be understood that a backup port represents
r
ou
a method for providing redundancy to the designated port role in a similar way
that an alternate port provides a method of redundancy to the root port.

es
The backup port role is capable of existing where a switch has two or more

R
connections to a shared media device such as that of a hub, or where a single

i n g
point-to-point link is used to generate a physical loopback connection between
ports on the same switch. In both instances however the principle of a backup

n
port existing where two or more ports on a single switch connect to a single
r
a
LAN segment still applies.

Le
e
or
M

248／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In RSTP, a designated port on the network edge is called an edge port. An

:h
edge port directly connects to a terminal and does not connect to any other
switching devices. An edge port does not receive configuration BPDU, so it

e s
does not participate in the RSTP calculation.

r c
It can directly change from the Disabled state to the Forwarding state without

ou
any delay, just like an STP-incapable port. If an edge port receives bogus

s
configuration BPDU from attackers, it is deprived of the edge port attributes

Re
and becomes a common STP port. The STP calculation is implemented again,
causing network flapping.

i n g
r n
e a
e L
or
M

249／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
RSTP introduces a change in port states that are simplified from five to three

:h
types. These port types are based on whether a port forwards user traffic and
learns MAC addresses. If a port neither forwards user traffic nor learns MAC

e s
addresses, the port is in the Discarding state. The port is considered to be in a

c
learning state where a port does not forward user traffic but learns MAC
r
ou
addresses. Finally where a port forwards user traffic and learns MAC
addresses, the port is said to be in the Forwarding state.

es
R
i n g
r n
e a
e L
or
M

250／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The BPDU format employed in STP is also applied to RSTP with variance in

:h
some of the general parameters. In order to distinguish STP configuration
BPDU from Rapid Spanning Tree BPDU, thus known as RST BPDU, the

e s
BPDU type is defined. STP defines a configuration BPDU type of 0 (0x00) and

c
a Topology Change Notification BPDU (TCN BPDU) of 128 (0x80), RST
r
ou
BPDU are identified by the BPDU type value 2 (0x02). Within the flags field of
the RST BPDU, additional parameter designations are assigned to the BPDU
fields.
es
R
The flags field within STP implemented only the use of the Topology Change

i n g
(TC) and Acknowledgement (TCA) parameters as part of the Topology
Change process while other fields were reserved. The RST BPDU has

n
adopted these fields to support new parameters. These include flags
r
a
indicating the proposal and agreement process employed by RSTP for rapid

Le convergence, the defining of the port role, and the port state.

e
or
M

251／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In STP, after the topology becomes stable, the root bridge sends configuration

:h
BPDU at an interval set by the Hello timer. A non-root bridge does not send
configuration BPDU until it receives configuration BPDU sent from the

e s
upstream device. This renders the STP calculation complicated and time-

c
consuming. In RSTP, after the topology becomes stable, a non-root bridge
r
ou
sends configuration BPDU at Hello intervals, regardless of whether it has
received the configuration BPDU sent from the root bridge; such operations

es
are implemented on each device independently.

R
i n g
r n
e a
e L
or
M

252／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The convergence of RSTP follows some of the basic principles of STP in

:h
determining initially that all switches upon initialization assert the role of root
bridge, and as such assign each port interface with a designated port role. The

e s
port state however is set to a discarding state until such time as the peering

c
switches are able to confirm the state of the link.
r
s ou
Re
i n g
r n
e a
e L
or
M

253／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
Each switch proclaiming to be the root bridge will negotiate the port states for

:h
a given LAN segment by generating an RST BPDU with the proposal bit set in
the flags field. When a port receives an RST BPDU from the upstream

e s
designated bridge, the port compares the received RST BPDU with its own

c
RST BPDU. If its own RST BPDU is superior to the received one, the port
r
ou
discards the received RST BPDU and immediately responds to the peering
device with its own RST BPDU that includes a set proposal bit.

es
R
i n g
r n
e a
e L
or
M

254／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Since timers do not play a role in much of the RSTP topology convergence

:h
process as found with STP, it is important that the potential for switching loops
during port role negotiation be restricted. This is managed by the

e s
implementation of a synchronization process that determines that following the

c
receipt of a superior BPDU containing the proposal bit, the receiving switch
r
ou
must set all downstream designated ports to discarding as part of the sync
process.

es
Where the downstream port is an alternate port or an edge port however, the

R
status of the port role remains unchanged. The example demonstrates the

i n g
temporary transition of the designated port on the downstream LAN segment
to a discarding state, and therefore blocking any frame forwarding during the

n
upstream proposal and agreement process.
r
e a
e L
or
M

255／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The confirmed transition of the downstream designated port to a discarding

:h
state allows for an RST BPDU to be sent in response to the proposal sent by
the upstream switch. During this stage the port role of the interface has been

e s
determined to be the root port and therefore the agreement flag and port role

c
of root are set in the flags field of the RST BPDU that is returned in response
r
ou
to the proposal.

es
R
i n g
r n
e a
e L
or
M

256／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
During the final stage of the proposal and agreement process, the RST BPDU

:h
containing the agreement bit is received by the upstream switch, allowing the
designated port to transition immediately from a discarding state to forwarding

e s
state. Following this, the downstream LAN segment(s) will begin to negotiate

c
the port roles of the interfaces using the same proposal and agreement
r
ou
process.

es
R
i n g
r n
e a
e L
or
M

257／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In STP, a device has to wait a Max Age period before determining a

:h
negotiation failure. In RSTP, if a port does not receive configuration BPDUs
sent from the upstream device for three consecutive Hello intervals, the

e s
communication between the local device and its peer fails, causing the

c
proposal and agreement process to be initialized in order to discover the port
r
ou
roles for the LAN segment.

es
R
i n g
r n
e a
e L
or
M

258／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Topology changes affect RSTP similarly to the way STP is affected, however

:h
there are some minor differences between the two. In the example, a failure of
the link has occurred on switch C. Switch A and switch C will detect the link

e s
failure immediately and flush the address entries for ports connected to that

c
link. An RST BPDU will begin to negotiate the port states as part of the
r
ou
proposal and agreement process, following which a Topology Change
notification will occur, together with the forwarding of the RST BPDU

es
containing the agreement.

R
This RST BPDU will have both the Agreement bit and also the TC bit set to 1,

i n g
to inform upstream switches of the need to flush their MAC entries on all port
interfaces except the port interface on which the RST BPDU containing the set

n
TC bit was received.
r
e aThe TC bit will be set in the periodically sent RST BPDU, and forwarded
upstream for a period equivalent to Hello Time+1 second, during which all

e L relevant interfaces will be flushed and shall proceed to re-populate MAC

or
entries based on the new RSTP topology. The red (darker) ‘x’ in the example
highlights which interfaces will be flushed as a result of the topology change.

259／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The implementation of STP within an RSTP based switching topology is

:h
possible, however is not recommended since any limitation pertaining to STP
becomes apparent within the communication range of the STP enabled

e s
switch. A port involved in the negotiation process for establishing its role within

c
STP must wait for a period of up to 50 seconds before convergence can be
r
ou
completed, as such the benefits of RSTP are lost.

es
R
i n g
r n
e a
e L
or
M

260／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The configuration of the spanning tree mode of Sx7 switches requires that the

:h
stp mode command be used to set the mode to RSTP. In doing so the Sx7
series switch will generate RST BPDU in relation to RSTP, as opposed to

e s
other spanning tree implementations. This command is configured from the

c
system-view and should be applied to all switches participating in the rapid
r
ou
spanning tree topology.

es
R
i n g
r n
e a
e L
or
M

261／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The display stp command will provide relative information regarding RSTP

:h
configuration as many of the parameters follow the principle STP architecture.
The mode information will determine as to whether a switch is currently
operating using RSTP.
e s
r c
s ou
Re
i n g
r n
e a
e L
or
M

262／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
An edge interface defines a port that does not participate in the spanning tree

:h
topology. These interfaces are used by end systems to connect to the
switching network for the purpose of forwarding frames. Since such end

e s
systems do not require to negotiate port interface status, it is preferable that

c
the port be transitioned directly to a forwarding state to allow frames to be
r
ou
forwarded over this interface immediately.

s
The stp edged-port enable command is used to switch a port to become an

Re
edge port, as all ports are considered non-edge ports on a switch by default. In
order to disable the edge port the stp edged-port disable command is used.

i n g
These commands apply only to a single port interface on a given switch. It is
important to note that the edge port behavior is associated with RSTP as

n
defined in the IEEE 802.1D-2004 standards documentation, however due to
r
a
the VRP specific application of the underlying RSTP state machine to STP

Le (which also results in the RSTP port states being present in STP), it is also
possible to apply the RSTP edge port settings to STP within Huawei Sx7

e
or
series products.

263／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
In the event that multiple ports on a switch are to be configured as edge ports,

:h
the stp edged-port default command is applied which enforces that all port
interfaces on a switch become edge ports. It is important to run the stp edged-

e s
port disable command on the ports that need to participate in STP calculation

c
between devices, so as to avoid any possible loops that may be caused as a
r
ou
result of STP topology calculations.

es
R
i n g
r n
e a
e L
or
M

264／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The port that is directly connected to a user terminal such as a PC or a file

:h
server, is understood to be configured as an edge port to ensure fast transition
of the port status. Usually, no BPDU are sent to edge ports, however if the

e s
switch is attacked by pseudo BPDU, the switch sets edge ports as non-edge

c
ports. After these edge ports receive a BPDU the spanning tree topology is
r
ou
recalculated, and as a result network flapping occurs.

s
To defend against pseudo BPDU attacks, RSTP provides BPDU protection.

Re
After BPDU protection is enabled, the switch shuts down the edge port that
receives BPDU and informs any active network management station (NMS).

i n g
The edge ports that are shut down by the switch can be manually started only
by the network administrator. The stp bpdu-protection command should be

n
used to enable BPDU protection and is configured globally within the system-
r
a
view.

Le
e
or
M

265／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The switch maintains the status of the root port and blocked ports by

:h
continually receiving BPDU from the upstream switch. If the root switch cannot
receive BPDU from the upstream switch due to link congestion or

e s
unidirectional link failure, the switch re-selects a root port. The previous root

c
port then becomes a designated port and the blocked ports change to the
r
ou
forwarding state. As a result, loops may occur on the network.

s
The switch provides loop protection to prevent network loops. After the loop

Re
protection function is enabled, the root port is blocked if it cannot receive
BPDU from the upstream switch. The blocked port remains in the blocked

i n g
state and does not forward packets. This prevents loops on the network. If an
interface is configured as an edge interface or root protection is enabled on

n
the interface, loop protection cannot be enabled on the interface. The stp loop-
r
a
protection command should be applied to enable this feature in the interface-

Le view.

e
or
M

266／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Validation of the RSTP configuration for a given interface is attained through

:h
the display stp interface <interface> command. The associated information will
identify the port state of the interface as either Discarding, Learning or

e s
Forwarding. Relevant information for the port interface including the port

c
priority, port cost, the port status as an edge port or supporting point-to-point
r
ou
etc, are defined.

es
R
i n g
r n
e a
e L
or
M

267／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
1. The sync is a stage in the convergence process that involves the blocking

:h
of designated ports while RST BPDU are transmitted containing proposal
and agreement messages to converge the switch segment. The process

e s
is designed to ensure that all interfaces are in agreement as to their port

c
roles in order to ensure that no switching loops will occur once the
r
ou
designated port to any downstream switch is unblocked.

es
R
i n g
r n
e a
e L
or
M

268／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

269／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

270／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

271／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

272／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
An enterprise network generally can be understood as an instance of an

:h
autonomous system. As defined within RFC 1030, an autonomous system or
AS, as it is also commonly known, is a connected group of one or more IP

e s
prefixes run by one or more network operators which has a SINGLE and

c
CLEARLY DEFINED routing policy.
r
ou
The concept of autonomous systems originally considered the existence of a

s
single routing protocol, however as networks have evolved, it is possible to

Re
support multiple routing protocols that interoperate through the injection of
routes from one protocol to another. A routing policy can be understood to be

i n g
a set of rules that determine how traffic is managed within an autonomous
system, to which a single, or multiple operator(s) must adhere to.

r n
e a
e L
or
M

273／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The principles surrounding switching have dealt mainly with the forwarding of

:h
traffic within the scope of a local area network and the gateway, which has
until now defined the boundary of the broadcast domain. Routers are the

e s
primary form of network layer device used to define the gateway of each local

c
area network and enable IP network segmentation. Routers generally function
r
ou
as a means for routing packets from one local network to the next, relying on
IP addressing to define the IP network to which packets are destined.

es
R
i n g
r n
e a
e L
or
M

274／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The router is responsible for determining the forwarding path via which

:h
packets are to be sent the route to a given destination. It is the responsibility of
each router to make decisions as to how the data is forwarded. Where a router

e s
has multiple paths to a given destination, route decisions based on

c
calculations are made to determine the best next hop to the intended
r
ou
destination. The decisions governing the route that should be taken can vary
depending on the routing protocol in use, ultimately relying on metrics of each

es
protocol to make decisions in relation to varying factors such as bandwidth
and hop count.
R
i n g
r n
e a
e L
or
M

275／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Routers forward packets based on routing tables and a forwarding information

:h
base (FIB), and maintain at least one routing table and one FIB. Routers
select routes based on routing tables and forward packets based on the FIB. A

e s
router uses a local routing table to store protocol routes and preferred routes.

c
The router then sends the preferred routes to the FIB to guide packet
r
ou
forwarding. The router selects routes according to the priorities of protocols
and costs stored in the routing table. A routing table contains key data for each
IP packet.
es
R
The destination & mask are used in combination to identify the destination IP

i n g
address or the destination network segment where the destination host or
router resides. The protocol (Proto) field, indicates the protocol through which

n
routes are learned. The preference (Pre) specifies the preference value that is
r
a
associated with the protocol, and is used to decide which protocol is applied to

Le the routing table where two protocols offer similar routes. The router selects
the route with the highest preference (the smallest value) as the optimal route.

e
or
A cost value represents the metric that is used to distinguish when multiple
routes to the same destination have the same preference, the route with the

M lowest cost is selected as the optimal route. A next-hop value indicates the IP
address of the next network layer device or gateway that an IP packet passes
through. In the example given a next-hop of 127.0.0.1 refers to the local
interface of the device as being the next-hop. Finally the interface parameter
indicates the outgoing interface through which an IP packet is forwarded.

276／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In order to allow packets to reach their intended destination, routers must

:h
make specific decisions regarding the routes that are learned and which of
those routes are applied. A router is likely to learn about the path to a given

e s
network destination via routing information that is advertised from neighboring

c
routers, alternatively it is possible for the statically applied routes to be
r
ou
manually implemented through administrator intervention.

s
Each entry in the FIB table contains the physical or logical interface through

Re
which a packet is sent in order to reach the next router. An entry also indicates
whether the packet can be sent directly to a destination host in a directly

i n g
connected network. The router performs an "AND" operation on the
destination address in the packet and the network mask of each entry in the

n
FIB table.
r
e aThe router then compares the result of the "AND" operation with the entries in
the FIB table to find a match. The router chooses the optimal route to forward

e L packets according to the best or "longest" match. In the example, two entries

or
to the network 10.1.1.0 exist with a next-hop of 20.1.1.2. Forwarding to the
destination of 10.1.1.1 will result in the longest match principle being applied,

M for which the network address 10.1.1.0/30 provides the longest match.

277／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
A routing table may contain the routes originating from multiple protocols to a

:h
given destination. Not all routing protocols are considered equal, and where
the longest match for multiple routes of differing routing protocols to the same

e s
destination are equal, a decision must be made regarding which routing

c
protocol (including static routes) will take precedence.
r
ou
Only one routing protocol at any one time determines the optimal route to a

s
destination. To select the optimal route, each routing protocol (including the

Re
static route) is configured with a preference (the smaller the value, the higher
the preference). When multiple routing information sources coexist, the route

i n g
with the highest preference is selected as the optimal route and added to the
local routing table.

r n
In the example, two protocols are defined that provide a means of discovery of

e athe 10.1.1.0 network via two different paths. The path defined by the RIP
protocol appears to provide a more direct route to the intended destination,

e L however due to the preference value, the route defined by the OSPF protocol

or
is preferred and therefore installed in the routing table as the preferred route.
A summary of the default preference values of some common routing

M mechanisms are provided to give an understanding of the default preference

order.

278／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Where the route is unable to be distinguished by either a longest match value

:h
or preference, the cost metric is taken as the decision maker in identifying the
route that should be installed in the routing table. Cost represents the length of

e s
a path to a destination network.

r c
Each segment provides a cost metric value along a path that is combined to

ou
identify the cost of the route. Another common factor is network bandwidth, on

s
which the cost mechanism is sometimes based. A link with a higher speed

Re
(capacity) represents a lower cost value, allowing preference of one path over
another to be made, whilst links of equal speed are given a balanced cost for

i n g
efficient load balancing purposes. A lower metric always takes precedence
and therefore the metric of 50 as shown in the example, defines the optimal

n
route to the given destination for which an entry can be found in the routing
r
a
table.

Le
e
or
M

279／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The capability of a router to forward an IP packet to a given destination

:h
requires that certain forwarding information be known. Any router wishing to
forward an IP packet must firstly be aware of a valid destination address to

e s
which the packet is to be forwarded, this means that an entry must exist in the

c
routing table that the router is able to consult. This entry must also identify the
r
ou
interface via which IP packets must be transmitted and the next-hop along the
path, to which the packet is expected to be received before consultation for the

es
next forwarding decision is performed.

R
i n g
r n
e a
e L
or
M

280／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. Routing decisions are made initially based on the longest match value,

:h
regardless of the preference value assigned for routes to the same
network. If the longest match value for two routes to the same destination

e s
is equal, the preference shall be used, where the preference is also equal,

c
the metric shall be used. In cases where the metric value is also the same,
r
ou
protocols will commonly apply a form of load balancing of data over the
equal cost links.

es
2. The preference is typically used to denote the reliability of a route over

R
routes that may be considered less reliable. Vendors of routing equipment

i n g
may however assign different preference values for protocols that are
supported within each vendors own product. The preference values of

r n
some common routing protocols supported by Huawei routing devices can

a
be found within this section.

Le
e
or
M

281／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

282／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

283／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

284／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

285／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
A static route is a special route that is manually configured by a network

:h
administrator. The disadvantage of static routes is that they cannot adapt to
the change in a network automatically, so network changes require manual

e s
reconfiguration. Static routes are fit for networks with comparatively simple

c
structures. It is not advisable to configure and maintain static routes for a
r
ou
network with a complex structure. Static routes do however reduce the effect
of bandwidth and CPU resource consumption that occurs when other

es
protocols are implemented.

R
i n g
r n
e a
e L
or
M

286／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Static routes can be applied to networks that use both serial and Ethernet

:h
based media, however in each situation the conditions of applying the static
route vary in which either the outbound interface or the next-hop IP address
must be defined.
e s
r c
The serial medium represents a form of point-to-point (P2P) interface for

ou
which the outbound interface must be configured. For a P2P interface, the

s
next-hop address is specified after the outbound interface is specified. That is,

Re
the address of the remote interface (interface on the peer device) connected to
this interface is the next-hop address.

i n g
For example, the protocol used to encapsulate over the serial medium is the
Point-to-Point protocol (PPP). The remote IP address is obtained following

r n
PPP negotiation, therefore it is necessary to specify only the outbound

e ainterface. The example also defines a form of point-to-point Ethernet

connection, however Ethernet represents a broadcast technology in nature

e L and therefore the principles of point-to-point technology do not apply.

or
M

287／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
In the case of broadcast interfaces such as Ethernet, the next-hop must be

:h
defined. Where the Ethernet interface is specified as the outbound interface,
multiple next hops are likely to exist and the system will not be able to decide

e s
which next-hop is to be used. In determining the next-hop, a router is able to

c
identify the local connection over which the packet should be received.
r
ou
In the example, packets intended for the destination of 192.168.2.0/24 should

s
be forwarded to the next-hop of 10.0.123.2 to ensure delivery. Alternatively

Re
reaching the destination of 192.168.3.0 requires that the next-hop of
10.0.123.3 be defined.

i n g
r n
e a
e L
or
M

288／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The configuration of the static route is achieved using the ip route-static ip-

:h
address { mask | mask-length } interface-type interface-number [ nexthop-
address ] where the ip-address refers to the network or host destination

e s
address. The mask field can be defined as either a mask value or based on

c
the prefix number. In the case of a broadcast medium such as Ethernet, the
r
ou
next-hop address is used. Where a serial medium is used, the interface-type
and interface-number are assigned (e.g. serial 1/0/0) to the command to

es
define the outgoing interface.

R
i n g
r n
e a
e L
or
M

289／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Where equal cost paths exist between the source and destination networks,

:h
load balancing can be implemented to allow traffic to be carried over both links.
In order to achieve this using static routes, both routes must meet the

e s
parameters for an equal longest match, preference and metric value. The

c
configuration of multiple static routes, one for each next-hop or outbound
r
ou
interface in the case of serial medium is required.

s
The example demonstrates how two ip route-static commands are

Re
implemented, each defining the same IP destination address and mask, but
alternate next-hop locations. This ensures that the longest match (/24) is equal,

i n g
and naturally so is the preference value, since both routes are static routes
that carry a default preference of 60. The cost of both paths is also equal

n
allowing load balancing to occur.
r
e a
e L
or
M

290／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The routing table can be queried to verify the results by running the display ip

:h
routing-table command after the static routes are configured. The static route
is displayed in the routing table, and results show two entries to the same

e s
destination, with matching preference and metric values. The different next-

c
hop addresses and variation in the outbound interface identifies the two paths
r
ou
that are taken, and confirms that load balancing has been achieved.

es
R
i n g
r n
e a
e L
or
M

291／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The application of static routes allows for a number of ways that routes can be

:h
manipulated to achieve routing requirements. It is possible for the preference
of a static route to be changed for the purpose of enabling the preference of

e s
one static route over another, or where used with other protocols, to ensure

c
the static route is either preferred or preference is given to the alternative
r
ou
routing protocol.

s
The default preference value of a static route is 60, therefore by adjusting this

Re
preference value, a given static route can be treated with unequal preference
over any other route, including other static routes. In the example given, two

i n g
static routes exist over two physical LAN segments, while normally both static
routes would be considered equal, the second route has been given a lesser

n
preference (higher value) causing it to be removed from the routing table. The
r
a
principle of a floating static route means that the route with a lesser preference

Le will be applied to the routing table, should the primary route ever fail.

e
or
M

292／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In using the display ip routing-table command, it is possible for the results of

:h
the change to the preference value that results in the floating static route, to be
observed. Normally two equal cost routes would be displayed in the routing

e s
table defining the same destination, however having alternative next-hop

c
values and outbound interfaces. In this case however, only one instance can
r
ou
be seen, containing the default static route preference value of 60. Since the
second static route now has a preference value of 100, it is not immediately

es
included in the routing table since it is no longer considered an optimal route.

R
i n g
r n
e a
e L
or
M

293／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In the event that the primary static route should fail as a result of physical link

:h
failure or through the disabling of an interface, the static route will no longer be
able to provide a route to the intended destination and therefore will be

e s
removed from the routing table. The floating static route is likely to become the

c
next best option for reaching the intended destination, and will be added to the
r
ou
routing table to allow packets to be transmitted over a second alternative path
to the intended destination, allowing continuity in light of any failure.

es
When the physical connection for the original route is restored, the original

R
static route also will take over from the current floating static route, for which

i n g
the route will be restored in the routing table causing the floating static route to
once again await application.

r n
e a
e L
or
M

294／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The default static route is a special form of static route that is applied to

:h
networks in which the destination address is unknown, in order to allow a
forwarding path to be made available. This provides an effective means of

e s
routing traffic for an unknown destination to a router or gateway that may have

c
knowledge of the forwarding path within an enterprise network.
r
ou
The default route relies on the “any network” address of 0.0.0.0 to match any

s
network to which a match could not be found in the routing table, and provides

Re
a default forwarding path to which packets for all unknown network
destinations should be routed. In the example, a default static route has been

i n g
implemented on RTA, identifying that should packets for a network that is
unknown be received, such packets should be forwarded to the destination

n
10.0.12.2.
r
e aIn terms of routing table decision making, as a static route, the default route
maintains a preference of 60 by default, however operates as a last resort in

e L terms of the longest match rule in the route matching process.

or
M

295／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The configuration of the static route once configured will appear within the

:h
routing table of the router. The display ip routing-table command is used to
view this detail. As a result, all routes in the example where not associated

e s
with any other routes in the routing table will be forwarded to the next-hop

c
destination of 10.0.12.2 via the interface Gigabit Ethernet 0/0/0.
r
s ou
Re
i n g
r n
e a
e L
or
M

296／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. A floating static route can be implemented by adjusting the preference

:h
value of a static route where two static routes support load balancing.

e s
2. A default static route can be implemented in the routing table by specifying
the ‘any network’ address of 0.0.0.0 as the destination address along with

r c
a next-hop address of the interface to which packets captured by this

ou
default static route are to be forwarded.

es
R
i n g
r n
e a
e L
or
M

297／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

298／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

299／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

300／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

301／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The routing information protocol or RIP as it is commonly known, represents

:h
one of the more simple forms of routing protocol that are applied to enterprise
networks. RIP operates as an interior gateway protocol (IGP) based on the

e s
principles of the Bellman-Ford algorithm which operates on the basis of

c
distance vector, defining the path that traffic should take in relation to the
r
ou
optimal distance that is measured using a fixed metric value.

s
The RIP protocol contains a minimal number of parameters and requires

Re
limited bandwidth, configuration and management time, making it ideal for
smaller networks. RIP however was not designed with the capability to handle

i n g
subnets, support interaction with other routing protocols, and provided no
means of authentication, since its creation predated the period that these

n
principles were introduced.
r
e a
e L
or
M

302／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
Routers that are RIP enabled participate in the advertisement of routing

:h
information to neighboring routers. Route advertisements are generated that
contain information regarding the networks that are known by the sending

e s
router, and the distance to reach those networks. RIP enabled routers

c
advertise to each other, but when they advertise, they only carry the best
r
ou
routing information in their route advertisements.

es
R
i n g
r n
e a
e L
or
M

303／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Each router advertisement contains a number of routes, each associated with

:h
a given metric. The metric is used to determine the distance between a router
and the destination with which the route advertisement is associated. In RIP

e s
the metric is associated with a hop count mechanism where each hop

c
between routers represents a fixed hop count, typically of one. This metric
r
ou
does not take into account any other factors such as the bandwidth for each
link or any delay that may be imposed to the link. In the example, router RTB

es
learns of a network via two different interfaces, each providing a hop metric

R
through which, the best route to the destination can be discovered.

i n g
r n
e a
e L
or
M

304／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
As each router processes a route advertisement, the metric value is

:h
incremented before forwarding the advertisement to the neighboring router.
Where routes become inaccessible however there is a potential for

e s
occurrences that results in the hop count becoming infinite.

r c
In order to resolve the problem with infinite route metrics, a value that would

ou
represent infinity was defined that allowed the number of possible hops to be

s
restricted to a limit of 15 hops. This metric assumes a network size that is

Re
deemed suitable to accommodate the size of networks for which the RIP
routing protocol is suited, and also beyond the scale that it is expected any

i n g
network of this type is expected to reach.
A hop count of 16 would assume the route to be unreachable and cause the

r n
network status for the given network to be changed accordingly. Routing loops

e acan occur through a router sending packets to itself, between peering routers
or as a result of traffic flow between multiple routers.

e L
or
M

305／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The example demonstrates how a loop can potentially form where RIP is the

:h
routing protocol. A network (10.0.0.0/8) has been learned through the sending
of route advertisements from RTA to RTC, for which RTC will have updated its

e s
routing table with the network and the metric of 1, in order to reach the
destination.
r c
ou
In the event of failure of the connection between router RTA and the network

s
to which it is directly connected, the router will immediately detect loss of the

Re
route and consider the route unreachable. Since RTC is possessing
knowledge of the network, a route advertisement is forwarded containing

i n g
information regarding network 10.0.0.0/8. Upon reception of this, RTA will
learn of a new route entry for 10.0.0.0/8 with a metric of 2. Since RTC

n
originally learned the route from RTA, any change will need to be updated in
r
a
RTC also, with a route advertisement being sent to RTC with a metric of 3.

Le This will repeat for an infinite period of time. A metric of 16 allows a cap to be
placed on infinity, thereby allowing any route reaching a hop count of 16 to be

e
or
deemed unreachable.

306／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Mechanisms have been implemented as part of the RIP routing protocol to

:h
address the routing loop issues that occur when routes become inaccessible.
One of these mechanisms is known as split horizon and operates on the

e s
principle that a route that is learned on an interface, cannot be advertised back

c
over that same interface. This means that network 10.0.0.0/8 advertised to
r
ou
router RTC cannot be advertised back to RTA over the same interface,
however will be advertised to neighbors connected via all other interfaces.

es
R
i n g
r n
e a
e L
or
M

307／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The implementation of the poison reverse mechanism allows the speed at

:h
which erroneous routes are timed out to be increased to almost instantly as a
result of allowing routes to be returned to the originating router, containing a

e s
metric of 16, to effectively time-out any consideration for a better route where

c
the route becomes invalid.
r
ou
In the example, RTA advertises a metric of 1 for the network to RTC, while

s
RTC advertises the same network back to RTA to ensure that if 10.0.0.0/8

Re
network fails, RTA will not discover a better path to this network via any other
router. This involves however an increase in the size of the RIP routing

i n g
message, since routes containing the network information received now must
also carry the network update, deeming the route unreachable, back to the

n
neighboring router from which the advertisement originated. In Huawei
r
a
AR2200 series routers, split horizon and poisoned reverse cannot be applied

Le at the same time, if both are configured, only poisoned reverse will be
enabled.

e
or
M

308／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The default behavior of RIP involves updates of the routing table being sent

:h
periodically to neighbors as a route advertisement, which by default is set to
occur approximately every 30 seconds. Where links fail however, it also

e s
requires that this period be allowed to expire before informing the neighboring
routers of the failure.
r c
ou
Triggered updates occur when the local routing information changes and the

s
local router immediately notifies its neighbors of the changes in routing

Re
information, by sending the triggered update packet. Triggered updates
shorten the network convergence time. When the local routing information

i n g
changes, the local router immediately notifies its neighbors of the changes in
routing information, rather than wait for a periodic update.

r n
e a
e L
or
M

309／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
RIP is a UDP-based protocol. Each router that uses RIP uses a routing

:h
process that involves all communications directed at another router being sent
to port 520, including all routing update messages. RIP generally transmits

e s
routing update messages as broadcast messages, destined for the broadcast

c
address of 255.255.255.255, referring to all networks. Each router however
r
ou
will generate its own broadcast of routing updates following every update
period.

es
The command and version fields are used once per packet, with the command

R
field detailing whether the packet is a request or response message, for which

i n g
all update messages are considered response messages. The version refers
to the version of RIP, which in this case is version 1. The remaining fields are

n
used to support the network advertisements for which up to 25 route entries
r
a
can be advertised in a single RIP update message.

Le The address family identifier lists the protocol type that is being supported by
RIP, which in this example is IP. The remaining fields are used to carry the IP
e
or
network address and the hop metric that contains a value between 1 and 15
(inclusive) and specifies the current metric for the destination; or the value 16

M (infinity), which indicates that the destination is not reachable.

310／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The introduction of a new version of RIP, known as RIP version 2, does not

:h
change RIP as such but rather provides extensions to the current RIP protocol
to allow for a number of ambiguities to be resolved. The format of the RIP

e s
datagram applies the same principles of the original RIP protocol with the

c
same command parameters. The version field highlights the extended fields
r
ou
are part of version 2.

s
The address family identifier continues to refer to the protocol being supported

Re
and also may be used in support of authentication information as explained
shortly. The route tag is another feature that is introduced to resolve limitations

i n g
that exist with support for interaction between autonomous systems in RIP, the
details of which however fall outside of the scope of this course. Additional

n
parameter extensions have been made part of the route entry including the
r
a
Subnet Mask field which contains the subnet mask that is applied to the IP

Le address, to define the network or sub-network portion of the address.

The Next Hop field now allows for the immediate next hop IP address, to
e
or
which packets destined for the destination address specified in a route entry,
should be forwarded. In order to reduce the unnecessary load of hosts that are

M not listening for RIP version 2 packets, an IP multicast address is used to

facilitate periodic broadcasts, for which the IP multicast address used is
224.0.0.9.

311／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t
Authentication represents a means by which malicious packets can be filtered,
t
:h
by ensuring that all packets received can be verified as originating from a valid
peer through the use of a key value. This key value originally represents a

e s
plaintext password string that can be configured for each interface, as
recognized by the authentication type of 2. The authentication configured

r c
between peers must match before RIP messages can be successfully

ou
processed. For authentication processing, if the router is not configured to
authenticate RIP version 2 messages, then RIP version 1 and unauthenticated

es
RIP version 2 messages will be accepted; authenticated RIP version 2

R
messages shall be discarded.

n g
If the router is configured to authenticate RIP version 2 messages, then RIP
version 1 messages and RIP version 2 messages which pass authentication
i
n
testing shall be accepted; unauthenticated and failed authentication RIP

a r
version 2 messages shall be discarded.

Le RIP version 2 originally supported only simple plaintext authentication that

provided only minimal security since the authentication string could easily be

e
captured. With the increased need for security for RIP, cryptographic

or
authentication was introduced, initially with the support for a keyed-MD5
authentication (RFC 2082) and further enhancement through the support of

M HMAC-SHA-1 authentication, introduced as of RFC 4822. While Huawei

AR2200 series routers are capable of supporting all forms of authentication
mentioned, the example given demonstrates the original authentication for
simplicity.

312／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
If a network has multiple redundant links, a maximum number of equal-cost

:h
routes can be configured to implement load balancing. In this manner, network
resources are more fully utilized, situations where some links are overloaded

e s
while others are idle can be avoided, and long delays in packet transmissions

c
can be prevented. The default and maximum number of equal cost routes
r
ou
supported by RIP is 8 at any one time.

es
R
i n g
r n
e a
e L
or
M

313／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
It is required for all routers supporting the RIP routing process to first enable

:h
the process on each router. The rip [process-id] command is used to enable
this, with the process-id identifying a specific process ID to which the router is

e s
associated. If the process ID is not configured, the process will default to a

c
process ID of 1.Where variation in the process ID exists, the local router will
r
ou
create separate RIP routing table entries for each process that is defined.

s
The version 2 command enables the RIP version 2 extension to RIP allowing

Re
for additional capability for subnets, authentication, inter-autonomous system
communication etc. The network <network-address> command specifies the

i n g
network address for which RIP is enabled, and must be the address of the
natural network segment.

r n
e a
e L
or
M

314／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
RIP is also capable of supporting manipulation of RIP metrics to control the

:h
flow of traffic within a RIP routing domain. One means to achieve this is to
adjust the metric associated with the route entry when received by a router.

e s
When an interface receives a route, RIP adds the additional metric of the

c
interface to the route, and then installs the route into the routing table, thereby
r
ou
increasing the metric of an interface which also increases the metric of the RIP
route received by the interface.

es
The rip metricin <metric value> command allows for manipulation of the

R
metric, where the metric value refers to the metric that is to be applied. It

i n g
should also be noted that for the rip metricin command the metric value is
added to the metric value currently associated with the route. In the example,

n
the route entry for network 10.0.0.0/8 contains a metric of 1, and is
r
a
manipulated upon arrival at the interface of RTC, resulting in the metric value

Le of 3 being associated with the route.

e
or
M

315／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The rip metricout command allows for the metric to be manipulated for the

:h
route when a RIP route is advertised. Increasing the metric of an interface also
increases the metric of the RIP route sent on the interface but does not affect

e s
the metric of the route in the routing table of the router to which the rip

c
metricout command is applied.
r
ou
In its most basic form the rip metricout command defines the value that must

s
be adopted by the forwarded route entry, but is also capable of supporting

Re
filtering mechanisms to selectively determine to which routes the metric
should be applied. The general behavior of RIP is to increment the metric by

i n g
one before forwarding the route entry to the next hop. If the rip metricout
command is configured, only the metric value referenced in the command is

n
applied.
r
e a
e L
or
M

316／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The configuration of both split horizon and poisoned reverse are performed on

:h
a per interface basis, with the rip split-horizon command being enabled by
default (with exception to NBMA networks) in order to avoid many of the

e s
routing loop issues that have been covered within this section. The

c
implementation of both split horizon and poisoned reverse is not permitted on
r
ou
the AR2200 series router, therefore where poisoned reverse is configured on
the interface using the rip poison-reverse command, split horizon will be
disabled.
es
R
i n g
r n
e a
e L
or
M

317／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The configuration of the routing information protocol on a per interface basis

:h
can be verified through the display rip <process_id> interface <interface>
verbose command. The associated RIP parameters can be found in the

e s
displayed output, including the RIP version applied along with other

c
parameters such as whether poison-reverse and split-horizon have been
r
ou
applied to the interface. Where the display command references that both the
poison-reverse and split-horizon as both enabled, only the poison-reverse

es
command will take effect.

R
i n g
r n
e a
e L
or
M

318／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The rip output command is applied to the interface of a router participating in

:h
RIP routing and allows RIP to forward update messages out from the
interface. Where the undo rip output command is applied to an interface, the

e s
RIP update message will cease to be forwarded out from a given interface. Its

c
application is valid in circumstances where an enterprise network wishes to
r
ou
not share its internal routes via an interface that connects to an external
network in order to protect the network, often applying a default route to this

es
interface instead for any routes which wish to reach external networks.

R
i n g
r n
e a
e L
or
M

319／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t
The undo rip input command allows an interface to reject all RIP update
t
:h
messages and prevent RIP information from being added to the routing table
for a given interface. This may be applied in situations where the flow of traffic

e s
may require to be controlled via certain interfaces only, or prevent RIP from

c
being received by the router completely. As such any RIP update messages
r
ou
sent to the interface will be discarded immediately. The rip input command can
be used to re-enable an interface to resume receipt of RIP updates.

es
R
i n g
r n
e a
e L
or
M

320／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The display rip <process_id> interface <interface> verbose command can also

:h
be used to confirm the implementation of restrictions to the interface. Where
the interface has been configured with the undo rip input, the capability to

e s
receive RIP routes will be considered disabled as highlighted under the Input
parameter.
r c
s ou
Re
i n g
r n
e a
e L
or
M

321／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The silent interface allows for RIP route updates to be received and used to

:h
update the routing table of the router, but will not allow an interface to
participate in RIP. In comparison, the silent-interface command has a higher

e s
precedence than both rip input & rip output commands. Where the silent-

c
interface all command is applied, the command takes the highest priority,
r
ou
meaning no single interface can be activated. The silent-interface command
must be applied per interface to allow for a combination of active and silent
interfaces.
es
R
A common application of the silent interface is for non-broadcast multi access

i n g
networks. Routers may be required to receive RIP update messages but wish
not to broadcast/multicast its own updates, requiring instead that a relationship

n
with the peering router be made through the use of the peer <ip address>
r
a
command.

Le
e
or
M

322／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The display rip command provides a more comprehensive router based output

:h
for which global parameters can be verified along with certain interface based
parameters. The implementation of the silent-interface command on a given

e s
interface for example can be observed through this command.

r c
s ou
Re
i n g
r n
e a
e L
or
M

323／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. The metric is incremented prior to the forwarding of the route

:h
advertisement from the outbound interface.

e s
2. The advertisement of RIP routes is achieved through the configuration of
the network command. For each network that is to be advertised by a

r c
router, a network command should be configured.

s ou
Re
i n g
r n
e a
e L
or
M

324／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

325／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

326／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

327／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

328／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
Open Shortest Path First or OSPF is regarded as a link state protocol that is

:h
capable of quickly detecting topological changes within the autonomous
system and establish loop free routes in a short period of time, with minimum

e s
additional communication overhead for negotiating topology changes between

c
peering routers. OSPF also deals with scalability issues that occur when
r
ou
communication between an expanding number of routers becomes so
extreme that it begins to lead to instability within the autonomous system. This

es
is managed through the use of areas that limits the scope of router

R
communication to an isolated group within the autonomous system allowing
small, medium and even large networks to be supported by OSPF. The

n g
protocol is also able to work over other protocols such as MPLS, a label
i
n
switching protocol, to provide network scalability even over geographically

a r
disperse locations. In terms of optimal path discovery, OSPF provides rich

e
route metrics that provides more accuracy than route metrics applied to

e L protocols such as RIP to ensure that routes are optimized, based on not only
distance but also link speed.

or
M

329／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The convergence of OSPF requires that each and every router actively

:h
running the OSPF protocol have knowledge of the state of all interfaces and
adjacencies (relationship between the routers that they are connected to), in

e s
order to establish the best path to every network. This is initially formed

c
through the flooding of Link State Advertisements (LSA) which are units of
r
ou
data that contain information such as known networks and link states for each
interface within a routing domain. Each router will use the LSA received to

es
build a link state database (LSDB) that provides the foundation for establishing

R
the shortest path tree to each network, the routes from which are ultimately
incorporated into the IP routing table.

i n g
r n
e a
e L
or
M

330／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The router ID is a 32-bit value assigned to each router running the OSPF

:h
protocol. This value uniquely identifies the router within an Autonomous
System. The router ID can be assigned manually, or it can be taken from a

e s
configured address. If a logical (loopback) interface has been configured, the

c
router ID will be based upon the IP address of the highest configured logical
r
ou
interface, should multiple logical interfaces exist.

s
If no logical interfaces have been configured, the router will use the highest IP

Re
address configured on a physical interface. Any router running OSPF can be
restarted using the graceful restart feature to renew the router ID should a new

i n g
router ID be configured. It is recommended that the router ID be configured
manually to avoid unexpected changes to the router ID in the event of

n
interface address changes.
r
e a
e L
or
M

331／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t
OSPF supports various network types, and in each case will apply a different
t
:h
behavior in terms of how neighbor relationships are formed and how
communication is facilitated. Ethernet represents a form of broadcast network

e s
that involves multiple routers connected to the same network segment. One of

c
the primary issues faced regards how communication occurs between the
r
ou
neighboring routers in order to minimize OSPF routing overhead. If an
Ethernet network is established, the broadcast network type will be applied
s
automatically in OSPF.
e
R
i n g
r n
e a
e L
or
M

332／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
Where two routers are established in a point-to-point topology, the applied

:h
network type will vary depending on the medium and link layer technology
applied. As mentioned, the use of an Ethernet medium will result in the

e s
broadcast network type for OSPF being assigned automatically. Where the

c
physical medium is serial, the network type is considered point-to-point.
r
ou
Common forms of protocols that operate over serial media at the link layer
include Point-to-Point Protocol (PPP) and High-level Data Link Control
(HDLC).
es
R
i n g
r n
e a
e L
or
M

333／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
OSPF may operate over multi access networks that do not support broadcasts.

:h
Such networks include Frame Relay and ATM that commonly operate using
hub and spoke type topologies, which rely on the use of virtual circuits in order

e s
for communication be to achieved. OSPF may specify two types of networks

c
that can be applied to links connected to such environments. The Non-
r
ou
Broadcast Multi Access (NBMA) network type emulates a broadcast network
and therefore requires each peering interface be part of the same network

es
segment. Unlike a broadcast network, the NBMA forwards OSPF packets as a

R
unicast, thereby requiring multiple instances of the same packet be generated
for each destination.

i n g
Point-to-Multipoint may also be applied as the network type for each interface,

n
in which case a point-to-point type behavior is applied. This means that each
r
a
peering must be associated with different network segments. Designated

Le Routers are associated with broadcast networks, and therefore are

implemented by NBMA networks. Most importantly is the positioning of a DR

e
or
which must be assigned on the hub node of the hub and spoke architecture to
ensure all nodes can communicate with the DR.

334／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In order to address and optimize the communication of OSPF over broadcast

:h
networks, OSPF implements a Designated Router (DR) that acts as a central
point of communication for all other routers associated with a broadcast

e s
network on at least one interface. In a theoretical broadcast network that does

c
not apply a DR, it can be understood that the communication follows an n(n-
r
ou
1)/2 formula, where n represents the number of router interfaces participating
in OSPF. In the example given, this would refer to 6 adjacencies between all

es
routers. When the DR is applied, all routers establish a relationship with the

R
DR to which is responsible for acting as a central point of communication for
all neighboring routers in a broadcast network.

i n g
A Backup Designated Router (BDR) is a router that is elected to take over

n
from the DR should it fail. As such it is necessary that the BDR establish a link
r
a
state database as that of the DR to ensure synchronization. This means that

Le all neighboring routers must also communicate with the BDR in a broadcast
network. With the application of the DR and BDR, the number of associations

e
or
is reduced from 6 to 5 since RTA and RTB need only communicate with the
DR and BDR. This may appear to have a minimal effect however where this is
applied to a network containing for example 10 routers, i.e. (10*9)/2 the
M resulting communication efficiency becomes apparent.

335／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
OSPF creates adjacencies between neighboring routers for the purpose of

:h
exchanging routing information. Not every two neighboring routers will become
adjacent, particularly where one of the two routers establishing an adjacency

e s
is considered to not be the DR or BDR. These routers are known as DROther

c
and only acknowledge the presence of the DROther but do not establish full
r
ou
communication; this state is known as the neighbor state. DROther routers do
however form full adjacency with both DR and BDR routers to allow

es
synchronization of the link state database of the DR and BDR routers with

R
each of the DROther routers. This synchronization is achieved by establishing
an adjacent state with each DROther.

i n g
An adjacency is bound to the network that the two routers have in common. If

n
two routers have multiple networks in common, they may have multiple
r
a
adjacencies between them.

Le
e
or
M

336／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Each router participating in OSPF will transition through a number of link

:h
states to achieve either a neighbor state or an adjacent state. All routers begin
in the down state upon initialization and go through a neighbor discovery

e s
process, which involves firstly making a routers presence known within the

c
OSPF network via a Hello packet. In performing this action the router will
r
ou
transition to an init state.

s
Once the router receives a response in the form of a Hello packet containing

Re
the router ID of the router receiving the response, a 2-way state will be
achieved and a neighbor relationship formed. In the case of NBMA networks,

i n g
an attempt state is achieved when communication with the neighbor has
become inactive and an attempt is being made to re-establish communication

n
through periodic sending of Hello packets. Routers that do not achieve an
r
a
adjacent relationship will remain in a neighbor state with a 2-way state of

Le communication.
Routers such as DR and BDR will build an adjacent neighbor state with all
e
or
other neighboring routers, and therefore must exchange link state information
in order to establish a complete link state database. This requires that peering

M routers that establish an adjacency first negotiate for exchange of link state
information (ExStart) before proceeding to exchange summary information
regarding the networks they are aware of. Neighbors may identify routes they
are either not aware of or do not have up to date information for, and therefore
request additional details for these routes as part of the loading state. A fully
synchronized relationship between neighbors is determined by the full state at
which time both peering routers can be considered adjacent.

337／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Neighbor discovery is achieved through the use of Hello packets that are

:h
generated at intervals based on a Hello timer, which by default is every 10
seconds for broadcast and point-to-point network types; whereas for NBMA

e s
and Point-to-Multipoint network types the hello interval is 30 seconds. The

c
hello packet contains this interval period, along with a router priority field that
r
ou
allows neighbors to determine the neighbor with the highest router ID for
identification of the DR and BDR in broadcast and NBMA networks.

es
A period specifying how long a hello packet is valid before the neighbor is

R
considered lost must also be defined, and this is carried as the router dead

i n g
interval within the hello packet. This dead interval is set by default to be four
times the hello interval, thus being 40 seconds for broadcast and point-to-point

n
networks, and 120 seconds for NBMA and Point-to-Multipoint networks.
r
a
Additionally, the router ID of both the DR and BDR are carried, where

Le applicable, based on the network for which the hello packet is generated.

e
or
M

338／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Following neighbor discovery, the DR election may occur depending on the

:h
network type of the network segment. Broadcast and NMBA networks will
perform DR election. The election of the DR relies on a priority that is

e s
assigned for each interface that participates in the DR election process. This

c
priority value is set as 1 by default and a higher priority represents a better DR
r
ou
candidate.

s
If a priority of 0 is set, the router interface will no longer participate in the

Re
election to become the DR or BDR. It may be that where point-to-point
connections (using Ethernet as the physical medium) are set to support a

i n g
broadcast network type, unnecessary DR election will occur, which generates
excessive protocol traffic. It therefore is recommended that the network type

n
be configured as a point-to-point network type.
r
e a
e L
or
M

339／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
In order to make improve the efficiency of transition to a new Designated

:h
Router, a Backup Designated Router is assigned for each broadcast and
NBMA network. The Backup Designated Router is also adjacent to all routers

e s
on the network, and becomes the Designated Router when the previous

c
Designated Router fails. If there were no Backup Designated Router present,
r
ou
new adjacencies would have to be formed between the new Designated
Router and all other routers attached to the network.

es
Part of the adjacency forming process involves the synchronizing of link-state

R
databases, which can potentially take quite a long time. During this time, the

i n g
network would not be available for the transit of data. The Backup Designated
Router obviates the need to form these adjacencies, since they already exist.

n
This means the period of disruption in transit traffic lasts only as long as it
r
a
takes to flood the new LSAs (which announce the new Designated Router).

Le The Backup Designated Router is also elected by the Hello packet. Each Hello
packet has a field that specifies the Backup Designated Router for the network.

e
or
M

340／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
In a link-state routing algorithm, it is very important for all routers' link-state

:h
databases to stay synchronized. OSPF simplifies this by requiring only
adjacent routers remain synchronized. The synchronization process begins as

e s
soon as the routers attempt to bring up the adjacency. Each router describes

c
its database by sending a sequence of Database Description packets to its
r
ou
neighbor. Each Database Description packet describes a set of LSAs
belonging to the router's database.

es
When the neighbor sees an LSA that is more recent than its own database

R
copy, it makes a note that this newer LSA should be requested. This sending

i n g
and receiving of Database Description packets is called the "Database
Exchange Process". During this process, the two routers form a master/slave

n
relationship. Each Database Description packet has a sequence number.
r
a
Database Description packets sent by the master are acknowledged by the

Le slave through echoing of the sequence number.

e
or
M

341／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
During and after the Database Exchange Process, each router has a list of

:h
those LSAs for which the neighbor has more up-to-date instances. The Link
State Request packet is used to request the pieces of the neighbor's database

e s
that are more up-to-date. Multiple Link State Request packets may need to be
used.
r c
ou
Link State Update packets implement the flooding of LSAs. Each Link State

s
Update packet carries a collection of LSAs one hop further from their origin.

Re
Several LSAs may be included in a single packet. On broadcast networks, the
Link State Update packets are multicast. The destination IP address specified

i n g
for the Link State Update Packet depends on the state of the interface. If the
interface state is DR or Backup, the address AllSPFRouters (224.0.0.5) should

n
be used. Otherwise, the address AllDRouters (224.0.0.6) should be used. On
r
a
non-broadcast networks, separate Link State Update packets must be sent, as

Le unicast, to each adjacent neighbor (i.e. those in a state of Exchange or

greater). The destination IP addresses for these packets are the neighbors' IP

e
or
addresses.
When the Database Description Process has completed and all Link State

M Requests have been satisfied, the databases are deemed synchronized and
the routers are marked fully adjacent. At this time the adjacency is fully
functional and is advertised in the two routers' router-LSAs.

342／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t
OSPF calculates the cost of an interface based on bandwidth of the interface.
t
:h
The calculation formula is: cost of the interface=reference value of
bandwidth/bandwidth. The reference value of bandwidth is configurable for

e s
which the default is 100 Mbps. With the formula 100000000/Bandwidth, this
gives a cost metric of 1562 for a 64 kbit/s Serial port, 48 for an E1 (2.048

r c
Mbit/s) interface and a cost of 1 for Ethernet (100 Mbit/s) or higher.

ou
To be able to distinguish between higher speed interfaces it is imperative that

es
the cost metric be adjusted to match the speeds currently supported. The
bandwidth-reference commands allows the metric to be altered by changing

R
the reference value of the bandwidth in the cost formula. The higher the value,

n g
the more accurate the metric. Where speeds of 10Gb are being supported, it
is recommended that the bandwidth-reference value be increased to ‘10000’
i
n
or 1010/bandwidth to provide metrics of 1, 10 and 100 for 10Gb, 1Gb and

a r
100Mb bandwidth links respectively.

Le Alternatively the cost can be manually configured by using the ospf cost
command to define a cost value for a given interface. The cost value ranges

e
from 1 to 65535 with a default cost value of 1.

or
M

343／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t
A router that has achieved a full state is considered to have received all link
t
:h
state advertisements (LSA) and synchronized its link state database (LSDB)
with that of the adjacent neighbors. The link state information collected in the

e s
link state database is then used to calculate the shortest path to each network.
Each router only relies on the information in the LSDB in order to

r c
independently calculate the shortest path to each destination, as opposed to

ou
relying on select route information from peers which is deemed to be the best
route to a destination. The calculation of the shortest path tree however means

es
that each router must utilize additional resources to achieve this operation.

R
i n g
r n
e a
e L
or
M

344／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Smaller networks may involve a select number of routers which operate as

:h
part of the OSPF domain. These routers are considered to be part of an area
which is represented by an identical link state database for all routers within

e s
the domain. As a single area, OSPF can be assigned any area number,

c
however for the sake of future design implementation it is recommended that
r
ou
this area be assigned as area 0.

es
R
i n g
r n
e a
e L
or
M

345／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The need to forward link state advertisements and subsequent calculation of

:h
the shortest path based on the link state database becomes increasingly
complex as more and more routers become a part of the OSPF domain. As

e s
such, OSPF is capable of supporting a hierarchical structure to limit the size of

c
the link state database, and the number of calculations that must be performed
r
ou
when determining the shortest path to a given network.

s
The implementation of multiple areas allows an OSPF domain to

Re
compartmentalize the calculation process based on a link state database that
is only identical for each area, but provides the information to reach all

i n g
destinations within the OSPF domain. Certain routers known as area border
routers (ABR) operate between areas and contain multiple link state

n
databases for each area that the ABR is connected to. Area 0 must be
r
a
configured where multi-area OSPF exists, and for which all traffic sent

Le between areas is generally required to traverse area 0, in order to ensure

routing loops do not occur.

e
or
M

346／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Establishing of OSPF within an AS domain requires that each router that is to

:h
participate in OSPF first enable the OSPF process. This is achieved using the
ospf [process id] command, where the process ID can be assigned and

e s
represents the process with which the router is associated. If routers are

c
assigned different process ID numbers, separate link state databases will be
r
ou
created based on each individual process ID. Where no process ID is
assigned, the default process ID of 1 will be used. The router ID can also be

es
assigned using the command ospf [process id] [router-id <router-id>], where

R
<router-id> refers to the ID that is to be assigned to the router, bearing in mind
that a higher ID value represents the DR in broadcast and NBMA networks.

i n g
The parenthesis information reflects the ospf process and level at which ospf

n
parameters can be configured, including the area to which each link (or
r
a
interface) is associated. Networks that are to be advertised into a given area

Le are determined through the use of the network command. The mask is
represented as a wildcard mask for which a bit value of 0 represents the bits

e
or
that are fixed (e.g. network id) and where the bit values in the mask represent
a value of 1, the address can represent any value.

347／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Configuration of the neighbor relationship between OSPF peers is verified

:h
through the display ospf peer command. The attributes associated with the
peer connection are listed to provide a clear explanation of the configuration.

e s
Important attributes include the area in which the peer association is

c
established, the state of the peer establishment, the master/slave association
r
ou
for adjacency negotiation in order to reach the full state, and also the DR and
BDR assignments which highlights that the link is associated with a broadcast
network type.
es
R
i n g
r n
e a
e L
or
M

348／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
OSPF is capable of supporting authentication to ensure that routes are

:h
protected from malicious actions that may result from manipulation or damage
to the existing OSPF topology and routes. OSPF allows for the use of simple

e s
authentication as well as cryptographic authentication, which provides

c
enhanced protection against potential attacks.
r
ou
Authentication is assigned on a per interface basis with the command for

s
simple authentication of ospf authentication-mode { simple [ [ plain ] <plain-

Re
text> | cipher <cipher-text >] | null } where plain applies a clear-text password,
cipher a cipher-text password to hide the original contents, and null to indicate

i n g
a null authentication.
Cryptographic authentication is applied using the ospf authentication-mode {

r n
md5 | hmac-md5 } [ key-id { plain <plain-text >| [ cipher ] <cipher-text >} ]

e acommand. MD5 represents a cryptographic algorithm for securing

authentication over the link, with its configuration demonstrated within the

e L given example. The key identifies a unique authentication key ID of the cipher

or
authentication of the interface. The key ID must be consistent with that of the
peer.

349／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Where authentication is applied, it is possible to implement debugging on the

:h
terminal to view the authentication process. Since the debugging may involve
many events, the debugging ospf packet command should be used to specify

e s
that debugging should only be performed for OSPF specific packets. As a

c
result the authentication process can be viewed to validate that the
r
ou
authentication configuration has been successfully implemented.

es
R
i n g
r n
e a
e L
or
M

350／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
It is often necessary to control the flow of routing information and limit the

:h
range for which such routing protocols can extend. This is particularly the case
where connecting with external networks from whom knowledge of internal

e s
routes is to be protected. In order to achieve this, the silent interface command

c
can be applied as a means to restrict all OSPF communication via the
r
ou
interface on which the command is implemented.

s
After an OSPF interface is set to be in the silent state, the interface can still

Re
advertise its direct routes. Hello packets on the interface, however, will be
blocked and no neighbor relationship can be established on the interface. The

i n g
command silent-interface [interface-type interface-number] can be used to
define a specific interface that is to restrict OSPF operation, or alternatively

n
the command silent-interface all can be used to ensure that all interfaces
r
a
under a specific process be restricted from participating in OSPF.

Le
e
or
M

351／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The implementation of the silent interface on a per interface basis means that

:h
the specific interface should be observed to validate the successful application
of the silent interface command. Through the display ospf <process_id>

e s
interface <interface> command, where the interface represents the interface to

c
which the silent interface command has been applied, it is possible to validate
r
ou
the implementation of the silent interface.

es
R
i n g
r n
e a
e L
or
M

352／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. The dead interval is a timer value that is used to determine whether the

:h
propagation of OSPF Hello packets has ceased. This value is equivalent
to four times the Hello interval, or 40 seconds by default on broadcast

e s
networks. In the event that the dead interval counts down to zero, the

c
OSPF neighbor relationship will terminate.
r
ou
2. The DR and BDR use the multicast address 224.0.0.6 to listen for link

s
state updates when the OSPF network type is defined as broadcast.

Re
i n g
r n
e a
e L
or
M

353／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

354／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

355／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

356／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

357／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Enterprise networks are often comprised of multiple end systems that require

:h
IP address assignment in order to connect with the network segment to which
the end system is attached. For small networks, a minimal number of end

e s
systems attached to the network allows for simple management of the

c
addressing for all end systems.
r
ou
For medium and large-scale networks however, it becomes increasingly

s
difficult to manually configure IP addresses with increased probability of

Re
duplication of addressing, as well as misconfiguration due to human error, and
therefore the necessity to implement a centralized management solution over

i n g
the entire network becomes ever more prominent. The Dynamic Host
Configuration Protocol (DHCP) is implemented as a management solution to

n
allow dynamic allocation of addresses for existing fixed and temporary end
r
a
systems accessing the network domain.

Le In cases it is also possible that there may be more hosts than available IP
addresses on a network. Some hosts cannot be allocated a fixed IP address
e
or
and need to dynamically obtain IP addresses using the DHCP server. Only a
few hosts on a network require fixed IP addresses.

358／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
DHCP supports three mechanisms for IP address allocation. The method of

:h
automatic allocation involves DHCP assigning a permanent IP address to a
client. The use of dynamic allocation employs DHCP to assign an IP address

e s
to a client for a limited period of time or at least until the client explicitly

c
relinquishes the IP address.
r
ou
The third mechanism is referred to as manual allocation, for which a client's IP

s
address is assigned by the network administrator, and DHCP is used only to

Re
handle the assignment of the manually defined address to the client. Dynamic
allocation is the only one of the three mechanisms that allows automatic reuse

i n g
of an address that is no longer needed by the client to which it was assigned.
Thus, dynamic allocation is particularly useful for assigning an address to a

n
client that will be connected to the network only temporarily, or for sharing a
r
a
limited pool of IP addresses among a group of clients that do not need

Le permanent IP addresses.
Dynamic allocation may also be a good choice for assigning an IP address to
e
or
a new client being permanently connected to a network, where IP addresses
are sufficiently scarce that addresses are able to be reclaimed when old

M clients are retired. Manual allocation allows DHCP to be used to eliminate the
error-prone process of manually configuring hosts with IP addresses in
environments where it may be more desirable to meticulously manage IP
address assignment.

359／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
A DHCP server and a DHCP client communicate with each other by exchanging a
range of message types. Initial communication relies on the transmission of a DHCP

:h
Discover message. This is broadcast by a DHCP client to locate a DHCP server when

s
the client attempts to connect to a network for the first time. A DHCP Offer message is

configuration information.
r ce
then sent by a DHCP server to respond to a DHCP Discover message and carries

ou
A DHCP Request message is sent after a DHCP client is initialized, in which it
broadcasts a DHCP Request message to respond to the DHCP Offer message sent by

es
a DHCP server. A request message is also sent after a DHCP client is restarted, at
which time it broadcasts a DHCP Request message to confirm the configuration, such

R
as the assigned IP address. A DHCP Request message is also sent after a DHCP

g
client obtains an IP address, in order to extend the IP address lease.

n i n
A DHCP ACK message is sent by a DHCP server to acknowledge the DHCP Request
message from a DHCP client. After receiving a DHCP ACK message, the DHCP client

a r
obtains the configuration parameters, including the IP address. Not all cases however
will result in the IP address being assigned to a client. The DHCP NAK message is

Le sent by a DHCP server to in order reject the DHCP Request message from a DHCP
client when the IP address assigned to the DHCP client expires, or in the case that the

e DHCP client moves to another network.

or
A DHCP Decline message is sent by a DHCP client, to notify the DHCP server that the
assigned IP address conflicts with another IP address. The DHCP client will then apply

M to the DHCP server for another IP address.

A DHCP Release message is sent by a DHCP client to release its IP address. After
receiving a DHCP Release message, the DHCP server assigns this IP address to
another DHCP client.
A final message type is the DHCP Inform message, and is sent by a DHCP client to
obtain other network configuration information such as the gateway address and DNS
server address after the DHCP client has obtained an IP address.

360／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The AR2200 and S5700 series devices can both operate as a DHCP server to

:h
assign IP addresses to online users. Address pools are used in order to define
the addresses that should be allocated to end systems. There are two general

e s
forms of address pools which can be used to allocate addresses, the global

c
address pool and the interface address pool.
r
ou
The use of an interface address pool enables only end systems connected to

s
the same network segment as the interface to be allocated IP addresses from

Re
this pool. The global address pool once configured allows all end systems
associated with the server to obtain IP addresses from this address pool, and

i n g
is implemented using the dhcp select global command to identify the global
address pool. In the case of the interface address pool, the dhcp select

n
interface command identifies the interface and network segment to which the
r
a
interface address pool is associated.

Le The interface address pool takes precedence over the global address pool. If
an address pool is configured on an interface, the clients connected to the
e
or
interface obtain IP addresses from the interface address pool even if a global
address pool is configured. On the S5700 switch, only logical VLANIF

M interfaces can be configured with interface address pools.

361／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The acquisition of an IP address and other configuration information requires

:h
that the client make contact with a DHCP server and retrieve through request
the addressing information to become part of the IP domain. This process

e s
begins with the IP discovery process in which the DHCP client searches for a

c
DHCP server. The DHCP client broadcasts a DHCP Discover message and
r
ou
DHCP servers respond to the Discover message.

s
The discovery of one or multiple DHCP servers results in each DHCP server

Re
offering an IP address to the DHCP client. After receiving the DHCP Discover
message, each DHCP server selects an unassigned IP address from the IP

i n g
address pool, and sends a DHCP Offer message with the assigned IP address
and other configuration information to the client.

r n
If multiple DHCP servers send DHCP Offer messages to the client, the client

e aaccepts the first DHCP Offer message received. The client then broadcasts a
DHCP Request message with the selected IP address. After receiving the

e L DHCP Request message, the DHCP server that offers the IP address sends a

or
DHCP ACK message to the DHCP client. The DHCP ACK message contains
the offered IP address and other configuration information.

M Upon receiving the DHCP ACK message, the DHCP client broadcasts
gratuitous ARP packets to detect whether any host is using the IP address
allocated by the DHCP sever. If no response is received within a specified
time, the DHCP client uses this IP address. If a host is using this IP address,
the DHCP client sends the DHCP Decline packet to the DHCP server,
reporting that the IP address cannot be used, following which the DHCP client
applies for another IP address.

362／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
After obtaining an IP address, the DHCP client enters the binding state. Three

:h
timers are set on the DHCP client to control lease update, lease rebinding,
and lease expiration. When assigning an IP address to a DHCP client, a

e s
DHCP server specifies values for the timers.

r c
If the DHCP server does not set the values for the timers, the DHCP client

ou
uses the default values. The default values define that when 50% of the lease

s
period remains, the release renewal process should begin, for which a DHCP

Re
client is expected to renew its IP address lease. The DHCP client
automatically sends a DHCP Request message to the DHCP server that has

i n g
allocated an IP address to the DHCP client.
If the IP address is valid, the DHCP server replies with a DHCP ACK message

r n
to entitle the DHCP client a new lease, and then the client re-enters the

e abinding state. If the DHCP client receives a DHCP NAK message from the
DHCP server, it enters the initializing state.

e L
or
M

363／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
After the DHCP client sends a DHCP Request message to extend the lease,

:h
the DHCP client remains in an updating state and waits for a response. If the
DHCP client does not receive a DHCP Reply message from the DHCP server

e s
after the DHCP server rebinding timer expires which by default occurs when

c
12.5% of the lease period remains, the DHCP client assumes that the original
r
ou
DHCP server is unavailable and starts to broadcast a DHCP Request
message, for which any DHCP server on the network can reply with a DHCP

es
ACK or NAK message.

R
If the received message is a DHCP ACK message, the DHCP client returns to

i n g
the binding state and resets the lease renewal timer and server binding timer.
If all of the received messages are DHCP NAK messages, the DHCP client

n
goes back to the initializing state. At this time, the DHCP client must stop
r
a
using this IP address immediately and request a new IP address.

Le
e
or
M

364／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The lease timer is the final timer in the expiration process, and if the DHCP

:h
client does not receive a response before the lease expiration timer expires,
the DHCP client must stop using the current IP address immediately and

e s
return to the initializing state. The DHCP client then sends a DHCP

c
DISCOVER message to apply for a new IP address, thus restarting the DHCP
r
ou
cycle.

es
R
i n g
r n
e a
e L
or
M

365／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t
There are two forms of pool configuration that are supported in DHCP, these
t
:h
include defining a global pool or an interface based pool. The dhcp select
interface command is used to associate an interface with the interface address

e s
pool in order to provide configuration information to connected hosts. The

c
example demonstrates how interface Gigabit Ethernet 0/0/0 has been
r
ou
assigned as part of an interface address pool.

es
R
i n g
r n
e a
e L
or
M

366／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Each DHCP server will define one or multiple pools which may be associated

:h
globally or with a given interface. For determining the pool attributes
associated with an interface, the display ip pool interface <interface>

e s
command is used. The DHCP pool will contain information including the lease

c
period for each IP address that is leased, as well as the pool range that is
r
ou
supported. In the event that other attributes are supported for DHCP related
propagation to clients such as with the IP gateway, subnet mask, and DNS

es
server, these will also be displayed.

R
i n g
r n
e a
e L
or
M

367／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
The example demonstrates the DHCP configuration for a global address pool

:h
that is assigned to the network 10.2.2.0. The dhcp enable command is the
prerequisite for configuring DHCP-related functions, and takes effect only after

e s
the dhcp enable command is run. A DHCP server requires the ip pool

c
command be configured in the system view to create an IP address pool and
r
ou
set IP address pool parameters, including a gateway address, the IP address
lease period etc. The configured DHCP server can then assign IP addresses

es
in the IP address pool to clients.

R
A DHCP server and its client may reside on different network segments. To

i n g
enable the client to communicate with the DHCP server, the gateway-list
command is used to specify an egress gateway address for the global address

n
pool of the DHCP server. The DHCP server can then assign both an IP
r
a
address and the specified egress gateway address to the client. The address

Le is configured in dotted decimal notation for which a maximum of eight gateway

addresses, separated by spaces, can be configured.

e
or
M

368／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The information regarding a pool can be also observed through the used of the

:h
display ip pool command. This command will provide an overview of the
general configuration parameters supported by a configured pool, including

e s
the gateway and subnet mask for the pool, as well general statistics that allow

c
an administrator to monitor the current pool usage, to determine the number of
r
ou
addresses allocated, along with other usage statistics.

es
R
i n g
r n
e a
e L
or
M

369／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
1. IP addresses that are used for server allocation such as any local DNS

:h
servers in order to avoid address conflicts.

e s
2. The default lease period for DHCP assigned IP addresses is set at a
period equal to one day.

r c
s ou
Re
i n g
r n
e a
e L
or
M

370／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

371／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

372／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

373／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

374／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The implementation of an FTP server within the enterprise network allows for

:h
effective backup and retrieval of important system and user files, which may
be used to maintain the daily operation of an enterprise network. Typical

e s
examples of how an FTP server may be applied include the backing up and

c
retrieval of VRP image and configuration files. This may also include the
r
ou
retrieval of log files from the FTP server to monitor the FTP activity that has
occurred.

es
R
i n g
r n
e a
e L
or
M

375／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The transfer of FTP files relies on two TCP connections. The first of these is a

:h
control connection which is set up between the FTP client and the FTP server.
The server enables common port 21 and then waits for a connection request

e s
from the client. The client then sends a request for setting up a connection to

c
the server. A control connection always waits for communication between the
r
ou
client and the server, transmits related commands from the client to the
server, as well as responses from the server to the client.

es
The server uses TCP port 20 for data connections. Generally, the server can

R
either open or close a data connection actively. For files sent from the client to

i n g
the server in the form of streams, however, only the client can close a data
connection. FTP transfers each file in streams, using an End of File (EOF)

n
indicator to identify the end of a file. A new data connection is therefore
r
a
required for each file or directory list to be transferred. When a file is being

Le transferred between the client and the server, it indicates that a data
connection is set up.

e
or
M

376／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t t
There are two FTP transmission modes which are supported by Huawei,

:h
these are ASCII mode and binary mode. ASCII mode is used for text, in which
data is converted from the sender's character representation to "8-bit ASCII"

e s
before transmission. Put simply, ASCII characters are used to separate

c
carriage returns from line feeds. In binary mode the sender sends each file
r
ou
byte for byte. This mode is often used to transfer image files and program files
for which characters can be transferred without format converting.

es
R
i n g
r n
e a
e L
or
M

377／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Implementing the FTP service is achievable on both the AR2200 series router

:h
and S5700 series switch, for which the service can be enabled through the ftp
server enable command. After the FTP server function is enabled, users can

e s
manage files in FTP mode. The set default ftp-directory command sets the

c
default working directory for FTP users. Where no default FTP working
r
ou
directory is set, the user will be unable to log into the router, and will instead
be prompted with a message notifying that the user has no authority to access

es
any working directory.

R
i n g
r n
e a
e L
or
M

378／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Access to the FTP service can be achieved by assigning individual user login

:h
to manage access on a per user basis. AAA is used to configure local
authentication and authorization. Once the AAA view is entered, the local user

e s
can be created, by defining a user account and password. The account is

c
capable of associating with a variety of services, which are specified using the
r
ou
service-type command, to allow for the ftp service type to be supported by
AAA.

es
If the ftp directory of the user should vary from the default directory, the ftp-

R
directory command can be used to specify the directory for the user. If the

i n g
number of active connections possible with a local user account is to be
limited, the access-limit command can be applied. This can range from 1 to

n
800, or unlimited where an access limit is not applied.
r
e aThe configuration of an idle timeout helps to prevent unauthorized access in
the event that a session window is left idle for a period of time by a user. The

e L idle timeout command is defined in terms of minutes and seconds, with an idle

or
timeout of 0 0 representing that no timeout period is applied. Finally the
privilege level defines the authorized level of the user in terms of the

M commands that can be applied during ftp session establishment. This can be
set for any level from 0 through to 15, with a greater value indicating a higher
level of the user.

379／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Following configuration of the FTP service on the FTP server, it is possible for

:h
users to establish a connection between the client and the server. Using the
ftp command on the client will establish a session through which the AAA

e s
authentication will be used to validate the user using AAA password

c
authentication. If correctly authenticated, the client will be able to configure as
r
ou
well as send/retrieve files to and from the FTP server.

es
R
i n g
r n
e a
e L
or
M

380／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. In order for the control connection and data connection of the FTP service

:h
to be established successfully, TCP ports 20 and 21 must be enabled.

e s
2. When a user is considered to have no authority to access any working
directory, a default FTP directory needs to be defined. This is done by

r c
using the command set default ftp-directory <directory location>, where

ou
the directory name may be, for example, the system flash.

es
R
i n g
r n
e a
e L
or
M

381／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

382／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

383／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

384／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

385／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
The Telecommunication Network Protocol (Telnet) enables a terminal to log in

:h
remotely to any device which is capable of operating as a telnet server, and
provides an interactive operational interface via which the user can perform

e s
operations, in the same manner as is achieved locally via a console

c
connection. Remote hosts need not be connected directly to a hardware
r
ou
terminal, allowing instead for users to take advantage of the ubiquitous
capabilities of IP in order to remotely manage devices from almost any

es
location in the world.

R
i n g
r n
e a
e L
or
M

386／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
Telnet operates on a client/server model principle for which a telnet TCP

:h
connection is established between a user port and the server telnet port,
which by default is assigned as port 23. The server listens on this well-known

e s
port for such connections. A TCP connection is full duplex and identified by

c
the source and destination ports. The server can engage in many
r
ou
simultaneous connections involving its well-known port and user ports that are
assigned from a non well-known port range.

es
The telnet terminal drivers interpret the keystrokes of users and translates

R
these to a universal character standard, based on a network virtual terminal

i n g
(NVT) which operates as a form of virtual intermediary between systems,
following which the transmission via the TCP/IP connection to the server is

n
performed. The server decodes the NVT characters and passes the decoded
r
a
characters to a pseudo terminal driver which exists to allow the operating

Le system to receive the decoded characters.

e
or
M

387／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
//le
p :
t
Access to the telnet service commonly involves authentication of the user
t
:h
before access is granted. There are three main modes that are defined for
telnet authentication.

e s
r c
s ou
Re
i n g
rn
e a
e L
or
M

388／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t
Establishment to a device operating as a telnet server commonly uses a
t
:h
general password authentication scheme which is used for all users
connecting to the user vty interface. Once IP connectivity is established

e s
through the implementation of a suitable addressing scheme, the

c
authentication-mode password command set is implemented for the vty range,
r
ou
along with the password to be used.

es
R
i n g
r n
e a
e L
or
M

389／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t
Following configuration of the remote device that is to operate as a telnet
t
:h
server, the client is able to establish a telnet connection through the telnet
command, and receive the prompt for authentication. The authentication

e s
password should match the password implemented on the telnet server as

c
part of the prior password authentication configuration. The user will be then
r
ou
able to establish a remote connection via telnet to the remote device operating
as a telnet server and emulate the command interface on the local telnet
client.
es
R
i n g
r n
e a
e L
or
M

390／392
 e n
/
m
e .i co
aw
hu
g .
ni n
ar
// le
p :
t t
1. If a user is unable to establish a telnet connection, the user should verify

:h
the device supporting the telnet service is reachable. If the device can be
reached, the password should be verified. If the password is considered to

e s
be correct, the number of users currently accessing the device via telnet

c
should be checked. If it is necessary to extend the number of users
r
ou
accessing the device through telnet, the user-interface maximum-vty <0-
15> command should be used, where 0-15 denotes the number of

es
supported users.

R
i n g
r n
e a
e L
or
M

391／392
 e n
/
m
e.i co
aw
hu
g.
ni n
ar
//le
p :
t t
s:h
r ce
sou
Re
i n g
rn
e a
e L
or
M

392／392