Ethernet Principles Complementary Information

Internal
Huawei Certified Network Associate

( HCNA)
Complementary Information
Ethernet Principles
www.huawei.com
HUAWEI TECHNOLOGIES CO., LTD. All rights reserved

Background of OSI RM
 The fast development of network technology and the prosperity of the
market of network devices cause following problems
 Network became more and more complicated
 Communications became more and more difficult
 ……
HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page1

Functions of the Seven Layers
Provide communications
7 Application layer
between applications
6 Presentation layer Deal with data format problems
5 Session layer Establish, maintain and manage sessions
Transport layer Establish, maintain and

4
manage end to end connection
3 Network layer Addressing and routing
2 Data link layer Provide link medium access

and link management
1 Physical layer Bit flow transmission

OSI RM and TCP/IP Protocol Stack
Application layer
Presentation layer Application layer
Session layer
Transport layer Transport layer
Network layer Network layer
Data link layer Data link layer
Physical layer Physical layer
OSI RM TCP/IP Protocol Stack

TCP/IP Protocol Stack
 Protocols of Each layer and Commonly-Used Equipment
Application layer HTTP, Telnet, FTP

TFTP, Ping
Transport
TCP/UDP
layer
ICMP Layer 3
Network layer IP Switch,Router
ARP/RARP
Data link layer Ethernet, 802.3, PPP Layer 2 Switch
Physical layer Interfaces, wires HUB

Data Encapsulation
Host A PDU
upper layer
Application layer
data
upper layer Transport layer Segment
TCP header
data
upper layer
IP header Network layer
data Packet
upper layer Router
LLC header FCS
data
Data link layer Frame
upper layer
MAC header FCS
data Switch
Physical layer Bit
0101110101001000010
HUB

Data De-encapsulation
Host B
Application layer upper layer data
Transport layer upper layer data
TCP + upper layer data

Network layer
IP + TCP + upper layer data
Data link layer

LLC header + IP+TCP + upper layer data
Physical layer 01011101010010000100101101011010

End to End Transport Process
G E F Host B
Host A A B
C D
Application layer Application layer
Transport layer Router B ……….. Router E Transport layer

Network layer Switch A Switch F Network layer
Network layer Network layer
Data link layer Data link layer Data link layer Data link layer Data link layer Data link layer
Physical layer Physical layer Physical layer Physical layer Physical layer Physical layer

Layered Architecture of Data Features
The SDH transmission is identical with the TCP/IP communication in basic elements.
Hence, the SDH transmission and TCP/IP communication can be combined into
one communication model.
Application Application
Layer PDU on the application layer Layer
Transmission Transmission
PDU on the transmission layer
Layer Layer
Network Layer Network Layer
PDU on the network layer
Data Link Layer PDU on the data link layer Data Link Layer
SDH Layer SDH frames SDH Layer
Each layer defines its own protocol and these protocols, independent to some extent,
associate with each other. The Ethernet technology is the technology on the data link layer of
the TPC/IP protocol.
HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page 8

Emergence of Data Communication Network
SOHO
Intranet
Server
IP Hotel Mobile
network

Emergence of Data Communication Network
(Cont.)
 Element of Data Communication
Network
 End Equipment
 Interface equipment between users
and communication network
 Transfers System
 Channel used to transfer electric
signal
 Including wire,wireless,fiber etc
 Switching Equipment
 Routing choice
 Switch control
Evolution of Network
WAN
Intra-network
interconnectio
n
1980’s –
Host
Network based
Connections
1970’s – 1980’s
Host
Simple Connections
1960’s – 1970’s Low speed lines
Host Network

Classification of Network
 Based on the covered geographic scope, networks are
classified into
 LAN (Local Area Network)
 MAN (Metropolitan Area Network)
 WAN (Wide Area Network)
LAN
LAN
LAN
LAN
LAN
WAN WAN

LAN Characteristics
Definition ETH0:10.110.0.2 ETH2:10.110.

54/24 2.254/24
 A LAN is formed by
interconnected communication ETH1:10.110.1.254/24
devices in a small area
Characteristics
 Short distance
 Low delay
 High bandwidth
 Reliable transmission
10.110.0.113/24 10.110.1.88/24 10.110.2.200/24

G:10.110.0.254 G:10.110.1.254 G:10.110.2.254

LAN Characteristics
Definition headquarters
 A WAN covers a larger geographic scope
A WAN connects LANs that are far from
each other
Types Internet
 FR : Frame Relay
 DDN: Digital Data Network
 X.25 Public Packet Switched Network
branches
 ISDN: Integrated Services Digital Network
 ATM: Asynchronous Transfer Mode
HUAWEI TECHNOLOGIES CO., LTD. All rights reserved
Page14
Typical Structure of IP Network
Internet backbone Telecom Services backbone
network
Backbone network PE
NGN
Core layer 3G
IP private leased line
IDC
MAN ASBR
Convergence layer
MPLS VPN
PE
Access layer
BA BA BA AR/P BA AR/P BA AR/P BA AR/PE
S S S E S E S E S
Dark Fiber
Access network IP DSLAM L2 MSTP Home
RTU Gateway
Twisted-pair Ethernet
Personal user Enterprise private

IAD PC STB
IAD PC STB leased line user

Protocol and Standard
Standardization Abbr. Function
Organization
International ISO ISO stipulates standards for large-scale
Organization for networks and brings forward the OSI
Standardization model
Institute of Electrical and IEEE IEEE defines standards for network
Electronics Engineers hardware
Electronic Industries EIA / EIA/TIA define the standards for
Association/Telecomm TIA network cables and cabling
Industries Association
International Telecomm ITU ITU define the standard for the telecom
Union network working as the WAN
Internet Engineering IETF IETF is responsible for researching and
Task Force establishing technical specifications
related to the Internet

Composing of Internet
LAN
LAN
LAN
LAN
LAN
WAN WAN
 The Internet is a large network formed by networks and

devices. Based on the covered geographic scope,
networks are classified into LAN, WAN, and MAN.

Definition of LAN
 Definition: The gathering of computers, printers, modem or

other devices that connected together with cables within a
short distance (usually several miles).
 Features: Short distance, low delay, high rate and reliability.
 Standard: describes the protocols，defines the performance

set.

Designing objects of LAN
 Designing objects of LAN：
 Applied in short distance

 Allowing to access high-rate medium at the same time
 Controlling access rights through local management
 providing all-time local service
 Connecting adjacent devices

Common devices in LAN
HUB
Switch
Router
ATM Switch

Common devices in LAN

Contents
1. LAN Introduction
2. Ethernet Principles
3. Ethernet Port Technology
4. EoS Introduction
5. VLAN Basics and Port Attributes
6. QoS Introduction and Application

Ethernet History
 The Ethernet was invented in 1972. In 1979, Xerox, Intel and

DEC released the Ethernet specifications of the DIX version.
And in 1983, IEEE 802.3 standard was released.
 At the early stage, the Ethernet was based on the coaxial

cable. By the end of 1980s, the Ethernet, which is based on
the twisted pair, finished the standardization work.

Ethernet Principle - CSMA/CD
 CS: Carrier Sense
 If the medium is idle, the transmission will be made; If the

medium is busy, the channel will be monitored till it is idle
and the transmission will be made at once.
 MA: Multiple Access
 The data could be received by all devices in the same

network.
 CD: Collision Detection
 If collision is detected during the transmission, a short and

small jamming signal will be sent and wait for a random
time, the transmission will be tried again.

Frame Length and Transmission Distance
 Minimum Frame
 64 Bytes
 Maximum Frame
 1518 Bytes
 Maximum Transmission Distance
 The maximum transmission distance is determined by

factors such as line quality and signal attenuation

Ethernet MAC Address
 MAC address is a globally unique 48-bit address
7 0 7 0 7 0 7 0 7 0 7 0
00000000 11100000 11111100 xxxxxxxx xxxxxxxx xxxxxxxx
 Represented by a 12 digit hexadecimal number
00 E0 FC xxxxxxxx xxxxxxxx xxxxxxxx
Organizationally Unique Assigned by each

Identifier (OUI) organization

Ethernet MAC Address (Cont.)
 Broadcast MAC address: FF-FF-FF-FF-FF-FF
 If the 8th bit is set to 1, it represents a multicast address
7 0 7 0 7 0 7 0 7 0 7 0
00000001 00000000 01011110 xxxxxxxx xxxxxxxx xxxxxxxx
Multicast Bit=1

Ethernet Addressing
 Unicast - Addressed to an individual
 Broadcast - Addressed to everyone
 Multicast - Addressed to a group

Ethernet Frame Structure
 Common frame types:
 Ethernet II – Type field >1500

 IEEE 802.3 – Length Field <=1500
Application Data
Destination Source Type or

Preamble SFD
Address Address Length Data/Pad FCS
7 1 6 6 2 46-1500 4
Bytes Bytes Bytes Bytes Bytes Bytes Bytes
Frame size 64 - 1518 Bytes

Categories of Ethernet
 Standard Ethernet (10Mbps)
 Fast Ethernet (100Mbps)
 Gigabit Ethernet (1000Mbps)
 10 Gigabit Ethernet (10000Mbps)

Standard Ethernet
100Mbps MAC
 802.3 – 10BASE-X
 Four PHY versions
10BASE-F
10BASE-2
10BASE-5
10BASE-T
 Three media types
 802.3 – 1BASE-5
 802.3 – 10Broad-36
Twisted
Fiber
Coax

Standard Ethernet Physical Layer Options
Transmission
Type Description
distance
10Base-5 Thick coax 500 m
10Base-2 Thin coax 180 m
10Base-T Twisted pair 100m
1Base-5 Twisted pair 500m
10Broad－36 Coax ( RG－59/U CATV ) 3600m
10Base-F Fiber 4000m

Fast Ethernet
 100BASE-X - 1995
100Mbps MAC
 Three media types
100BASE-FX
100BASE-TX
100BASE-T4
100BASE-T2
 802.3u - 1995 100BASE-TX
 100m Cat 5 (2 Pairs)

 4B5B Encoding
Cat 3 M
M
Cat 5 F

FE Physical Layer Options
Transmission
Type Description
distance
UTP cat 3, 5 unshield 4 pair

100BaseT4 100m
twisted pair
UTP cat5 unshield 2 pair

100BaseTX 100m
twisted pair
MMF (Multi-mode Fiber) 550m-2Km

100BaseFX
SMF (Single-mode Fiber) 2Km-15Km

Gigabit Ethernet
 1000BASE-X - 1998
1000Mbps MAC
1000BASE-CX
1000BASE-SX
1000BASE-LX
 Four media types
1000BASE-T MM SM
Cat 5 Coax
Fiber Fiber

GE Physical Layer Options
Transmission
Type Description
distance
UTP cat5 unshield 4 pair

1000BaseT 100 m
twisted pair
1000BaseCX Shielded Balance Copper 25 m
1000BaseSX MMF 50um, use 850nm SWL 550 m
1000BaseLX SMF 9um, use 1310nm LWL 10/40 Km
1000BaseZX SMF, 1310nm/1550nm LWL 80 Km

10 Gigabit Ethernet
 10G BASE-X - 2006 10Gbps MAC

 6 LAN PHY versions
10GBASE-LRM
10GBASE-LX4
10GBASE-SR
10GBASE-ER
10GBASE-LR
10GBASE-T
 3 WAN PHY versions
Cat 5 MM Fiber SM Fiber WDM

10GE Physical Layer Options
Transmission
Type Description
distance
10GBase-SR Serial 850 nm WAN mapping, MMF 65m
10GBase-LR Serial 1310 nm WAN mapping, SMF 10Km
10GBase-ER Serial 1550 nm WAN mapping, SMF 40Km
10GBase-SW Serial 850 nm WAN mapping, MMF 65m
10GBase-LW Serial 1310 nm WAN mapping, SMF 10Km
10GBase-EW Serial 1550 nm WAN mapping, SMF 40Km/80Km
10GBase-LX4 1310 nm WWDM LAN, MMF/SMF 300m/10Km

Application of Ethernet
Layer
Access Layer Convergence Layer Core Layer
Type
Connect with terminal

10M user and access layer — —
LAN Switch or HUB
For high-powered Connect access layer and

Interconnection between
100M work station and PC’s convergence layer or convergence
LAN Switch
access layer and core layer
High quality connection between

Connect convergence layer
1000M（GE） — access layer and convergence layer
and high-powered work
equipment.
station, interconnection
10GE — — between core router

Contents
1. LAN Introduction
2. Ethernet Principles
3. Ethernet Port Technology
4. EoS Introduction
5. VLAN Basics and Port Attributes
6. QoS Introduction and Application

Duplex Mode of Ethernet
 Ethernet duplex mode includes:
 Half-duplex
 Full-duplex
 Full-duplex allows full speed in each direction simultaneously, therefore
twice of the throughput
Transmit
Receive

Auto-Negotiation
 The basic mechanism of the auto-negotiation function is to encapsulate
the negotiation message into the link integration test pulse.
Fast link pulse

16ms
Every pulse includes 16 digital sequence
……
Fast link pulse includes a series of clock/digital
sequence comprised of link integration test pulse.

Auto-Negotiation (Cont.)
Half-Duplex Full-Duplex
10M Support Support
100M Support Support
1000M - Support
10G - Support
 If one device can not support auto-negotiation, another device that can
support auto-negotiation will work at the default work method.

Auto-Sensing
 Auto-sensing function allows both straight and crossover

cables to be used between two devices.
Straight or Crossover cables?
PC LAN Switch

Flow Control
 The function of flow control is to prevent frames from being lost

in case of congestion
 Under half duplex mode, the flow control is achieved by
backpressure technology
 Under full duplex mode, the flow control generally abides by
standard IEEE 802.3x

Flow Control (Cont.)
 The “Pause” frame allows flow control within Ethernet
DA Type
01-80-C2-
SA 0x8808 Data FCS
00-00-01
2 Bytes 2 Bytes 42 Bytes

00-01 00-00 to All zeros
(PAUSE) FF-FF
MAC Control MAC Control Reserved

opcode Parameters

Half-Duplex Flow Control
Pretend that there is

collision, then you will
not constantly transfer!
backpressure

Full-Duplex Flow Control
 IEEE802.3x standard defines a new method named PAUSE frame, to
realize the flow control in the full duplex environment.
 PAUSE frame uses a reserved multicast address which wouldn't be
repeated by bridge or switch
Stop PAUSE Congestion

Frame
Data Frame

Questions
 What’s characteristics of LAN ?
 What’s the difference between LAN and WAN ?
 What’s the functions of each layer of the OSI reference model

?
 What’s the relationship of each layer of the TCP/IP Protocol

Stack ?

Association of the Protocols on the Layers
The PDU encapsulation on each

layer contains the TYPE
information or port number
specific to each protocol. Pay
attention to this.

Association of Application Formats on the Layers
Data
IP Header + Payload
VLAN Header + Payload
MAC Header + Payload + FCS
MPLS Header + Payload
GFP Header + Payload
SDH Header Payload
The layered architecture helps extend the functions.
Many bytes in the SDH frame overhead bytes are reserved. For data communication, however,
the overhead bytes are added.

MSTP Key Technology
• Concatenation: The VCs of the same granularity form a larger container, virtual
concatenation group (VCG), to provide higher bandwidth.
• LCAS (Link Capacity Adjustment Scheme): be used to increase, decrease or change the
capacity of a container that is transported in an SDH/OTN network using Virtual
Concatenation. In addition, the scheme will automatically decrease the capacity if a
member experiences a failure in the network, and increase the capacity when the
network fault is repaired. The scheme is applicable to every member of the Virtual
Concatenation group.
• GFP (Generic Framing Procedure): GFP provides a generic mechanism to adapt traffic
from higher-layer client signals over a transport network．Ethernet signals are
outburst, non-fixed length and different with SDH frame which are strictly synchronous.
So we need proper protocol to realize frame mapping from Ethernet frame to SDH
frame. GFP is one of those protocols.

Overview of the Concatenation Technology
x1 x1
STM-256 AUG-256 AU-4-256c VC-4-256c C-4-256c
x4
x1
Contiguous Concatenation Services
x1
STM-64 AUG-64 AU-4-64c VC-4-64c C-4-64c
x4
x1
x1
STM-16 AUG-16 AU-4-16c VC-4-16c C-4-16c
x4
x1 x1
STM-4 AUG-4 AU-4-4c VC-4-4c C-4-4c
x4
x1 x1
STM-1 AUG-1 AU-4 VC-4 C-4
x3 x1
x3 TUG-3 TU-3 VC-3
x1 C-3
STM-0 AU-3 VC-3
x7 x7
x1
TUG-2 TU-2 VC-2 C-2
Pointer Processing x3
TU-12 VC-12 C-12
Multiplexing
x
Aligning 4
TU-11 VC-11 C-11
Mapping G.707/Y1322 Multiplexing Structure

Concatenation
What is the concatenation?
The process the summing the bandwidth of X containers( C-i )into larger container.This provides a
bandwidth X times bigger than C-i. It is well indicated for the transport of big payloads requiring a container
greater than VC-4 but it is also possibleto concatenate low capacity containers, such VC-11, VC-12 or VC-
12 .
Why do we need the concatenation ?

To transport services do not have a Cn ( container ) definite to accept them.
Types of Concatenation
Contiguous Concatenation VC-N - Xc
Virtual Concatenation VC-N-Xv

Contiguous Concatenation
N×270 Byte
N×261 Byte C
N×261 Byte
• Signals are transmitted in the same STM-N frame.

• Only one group of POH bytes are available.
• The support is required from the intermediate equipment during the transmission.

Virtual Concatenation
• Signals are transmitted in several VC-4/VC-3/VC-12 channels.

• Each VC-4/VVC-3/VC-12 has its own overhead.
• The support is required only from the source and sink nodes. The intermediate
equipment just transparently transmits these signals.

Basic Concepts
 Port
 External physical port of Ethernet unit, the common rates of

external port are 10M, FE, GE and 10GE;
 VC Trunk
 Virtual Container Trunk, VC Trunk is built by VC. It is the

internal port of Ethernet unit.

Structure of Ethernet Unit
Collecting alarm
and performance
event
Cross-connect unit
VC4
N×VC12/VC3/
GFP-F
FE
concatenation
VC4 Virtual
N×VC12/VC3/
FE
GE
VCTRUNK
Port
Note: Both of the external and internal ports can process Tag flag

Vctrunk and Virtual Concatenation
Relationship between virtual concatenation and
Vctrunk
Cross-
Connection
4×FE chip
PHY
Network Mapping Interface
RGGI
Optical Port Processor Transfer XCS
Chip
chip
Cross-
PHY
Connection
chip
Interface Card
8×FE(Electrical Port)
 VC Trunk is a transmission trunk composed of VC container

and it is realized by virtual concatenation technology which
combines several virtual concatenated VCs to a transmission
trunk.
Concatenation Technology
 Objectives
 Transmitting large-granularity services on SDH networks, and

achieving bandwidth allocation as required
 Approaches
 Ethernet services are mapped into SDH services in two methods:

contiguous concatenation and virtual concatenation (VC-4-Xc/v).
 Contiguous concatenation provides easy implementation and efficient

transmission.
 Only one path is available from end to end, without service delay.
 The entire transport network needs to support contiguous

concatenation. Otherwise, services are unavailable.

Concatenation Technology (Cont.)
 Flexible applications of virtual concatenation
 The equipment at both the transmit end and receive end

need to support virtual concatenation.
 Services can be transmitted on multiple paths.
 The virtually concatenated services contain many
overheads. Thus, the transmission efficiency is low and the
services transmitted on different paths have delays.

Mechanism of the Contiguous Concatenation
X*9 X*261
STM-N
3 RSOH
1 N*AU-PTR J1
B3
MSOH C2
5
G1
Redun
F2 dancy C-4-Xc VC-4-Xc
Bytes
H4
F3
K3
N1
1 X-1 X*260
X=N
Frame structure in SDH contiguous concatenation

Mechanism of the Virtual Concatenation
1 C-4-Xc X X*260
J1
B3
J1 C2
B3 G1
C2 F2 VC-4-#X
G1 H4
VC-4-Xv
F2 VC-4-#1
F3
H4 K3
F3 N1 125us
K3
N1 125us
Frame structure in SDH virtual concatenation

Applications of the Concatenation
Technology
 Contiguous concatenation
 Interconnecting with data communications equipment

− The line board on the OptiX OSN equipment can directly
access and process VC-4-Xc services without
converting them.
− The OptiX 2500+ equipment cannot access and process
VC-4-Xc services. For this reason, it requires a
contiguous concatenation conversion board to convert
VC-4-Xc services into the VC-4-Xv services at the
network ingress.
 Virtual concatenation
 The EoS board used on Huawei OptiX equipment forms

VC-TRUNKs in virtual concatenation mode.
Virtual Concatenation
Virtual concatenation frame structure
 Virtual concatenation container is mapped to X independent VC-4

composed of VC-4-Xv. Every VC-4 includes its own normal POH but H4
byte in POH is used for sequence number and multiframe indicator.

H4 Byte
H4 BYTE Number
Bit 1 Bit 2 Bit 3 Bit 4 Bit 5 Bit 6 Bit 7 Bit 8
Multiframe Indicator
Multiframe Indicator MSB (B1-B4) 0 0 0 0 0
Multiframe Indicator LSB (B5-B8) 0 0 0 1 1
Reserved (“0000” ) 0 0 1 0 2
Reserved (“0000” ) 0 0 1 1 3
Reserved (“0000” ) 0 1 0 0 4
Reserved (“0000” ) 0 1 0 1 5
Reserved (“0000” ) 0 1 1 0 6
Reserved (“0000” ) 0 1 1 1 7
Reserved (“0000” ) 1 0 0 0 8
Reserved (“0000” ) 1 0 0 1 9
Reserved (“0000” ) 1 0 1 0 10
Reserved (“0000” ) 1 0 1 1 11
Reserved (“0000” ) 1 1 0 0 12
Reserved (“0000” ) 1 1 0 1 13
Sequence Indicator MSB (B1-B4) 1 1 1 0 14
Sequence Indicator LSB (B5-B8) 1 1 1 1 15
 16 consecutive H4 bytes used for VC4/VC3 virtual concatenation indicator.

 8 bits used for sequence indicator.
 12 bits used for multiframe indicator.
 K4 byte is used for VC12 virtual concatenation indicator.

SQ and MF
C-4-Xc VC-4-Xv
1 x
MF:0
P
MF:0
O P
H O MF:1
MultiFrame
P H
O MF:1
H
P
O
MF:15
P H
O
MF:15
P
H
O MF:0
P H
O MF:0
H
SQ:X-1
SQ:0
Sequence Indicator

Virtual Concatenation Sequence Indicator
Timeslot Local Number Timeslot Local Number
 Insert SQ (sequence indicator) information in every timeslot according

to the sequence of payload in transmitting side and it labels the
location of timeslot in virtual concatenation group.
 Realign the payload according to the SQ information in receiving side.
 Differential delay is permitted.

Virtual Concatenation Multiframe Indicator
 Every frame includes MFI (multiframe indicator) which labels the

number of the payload in transmitting side.
 Combine the same MFI frame to C-n-Xc in receiving side.

LCAS
Adjacent
Concatenation
• When a physical channel is
Demands for Concatenation
Virtual faulty, services are
access Technology
Concatenation interrupted.
bandwidth
• Bandwidth adjustment
increases.
affects services.
The virtual concatenation has a
higher bandwidth utilization.
Prevents service interruption

due to faulty physical links.
LCAS
Link Capacity Adjustment Scheme
Dynamically adjusts service
bandwidth without affecting
LCAS is implemented based existing services.
on the virtual concatenation
technology.

LCAS
 Link capacity adjustment scheme (LCAS)
 Function: dynamically increases or decreases the VC-

TRUNK members to adjust the bandwidth, without affecting
services.
LCAS LCAS
MST
P
Normal state: 4xVC-4

Failed state: 2xVC-4

The Function of LCAS
OptiX
OptiX MSTP
NE2
NE1
Normal
status
MSTP OptiX
OptiX
NE2
NE1
Part link faulty status
 LCAS ( link capacity adjustment scheme) should be used to increase, decrease or
change the capacity of a container that is transported in an SDH/OTN network using
Virtual Concatenation. In addition, the scheme will automatically decrease the
capacity if a member experiences a failure in the network, and increase the capacity
when the network fault is repaired. The scheme is applicable to every member of the
Virtual Concatenation group.

Functions and Working Principles of the
LCAS
 Basic functions
 Dynamically increasing or decreasing the bandwidth

 Providing service protection against failed members and
recovering failed members
 Providing an error tolerance mechanism to enhance the
robustness of the virtual concatenation function.

Functions and Working Principles of the
LCAS (Cont.)
 Working principles
 The source NE and sink NE operate a handshake protocol

to perform the operations such as adding or deleting the
service bandwidth, suppressing failed virtual concatenation
group members, and restoring failed virtual concatenation
group members.
 The control packet in the SDH overhead byte (H4 byte for
higher order virtual concatenation, or K4 byte for lower
order virtual concatenation) is transmitted to perform the
handshake operation between the source NE and sink NE.

LCAS Based on Virtual Concatenation
H4 byte Frame No.
Bit 1 Bit 2 Bit 3 Bit 4 Bit 5 Bit 6 Bit 7 Bit 8 MFI 1 MFI 2
MFI 1
Member Status MST 0 0 0 0 8
Member Status MST 0 0 0 1 9
RS-
0 0 0 0 0 1 0 10
ACK
Reserved ("0000") 0 0 1 1 11
n
Reserved ("0000") 0 1 0 0 12
Reserved ("0000") for SQI
0 1 0 1 13
extension
SQI MSB (b1-b4) 0 1 1 0 14
SQI LSB (b5-b8) 0 1 1 1 15
MFI 2 MSB (b1-b4) 1 0 0 0 0
MFI 2 LSB (b5-b8) 1 0 0 1 1
CTRL 1 0 1 0 2
0 0 0 GID 1 0 1 1 3
n+1
Reserved ("0000") 1 1 0 0 4
Reserved ("0000") 1 1 0 1 5
CRC-8 1 1 1 0 6
CRC-8 1 1 1 1 7

Exchange Information between Source and Sink
information of MFI_z
member n,VCG_a SQ_p
CTRL_p VCG_z
MST_a(n) GID_z member_p
RS-Ack_a CRC_y
MFI_a MST_z(p)
VCG_a SQ_n RS-Ack_z
member_n CTRL_n information sent in control packet x
GID_a of member_n in VCG_a
CRC_x
 Forward direction control message (Source to Sink)

 Multi Frame Indicator field (MFI)
 Sequence Indicator field (SQ)
 Control field (CTRL)：It provides the status of the individual member of the group.
 Group Identification bit (GID)：The GID bit of all members of the same VCG has the same value in
the frames with the same MFI.
 Return direction control message (Sink to Source)
 Member status field (MST)：It reports the member status from Sk to So with two states: OK or
FAIL.
 Re-Sequence Acknowledge bit (RS-Ack)：Any changes detected at the sink regarding the member
sequence numbers are accepted from the sink to the Source.
LCAS Control Field
 The control field is used to transfer information from So to Sk. It shall
be used to synchronize the Sk with the So and provides the status of
the individual member of the group.
To increase or decrease the

bandwidth depends on it.
 virtual concatenation group (VCG): a group of co-located member trail

termination functions that are connected to the same virtual
concatenation link.
LCAS Adding Members Time Sequence Diagram
Note 1 memn-1(EOS) mema(new) mema +1(new)
NMS LCAS Sk Sk Sk
Add cmnd
Note 2
Note 3 CTRL=ADD
CTRL=ADD connectivity
check
connectivity
Note 4 MST=OK check
Note 5
CTRL=NORM CTRL=EOS
Note 6 MST=OK
Note 7
CTRL=NORM CTRL=EOS
 The time sequence diagram above shows an example of adding two members after
the current last member. The example shows new member (a) responding with MST
= OK before new member (a + 1). This is arbitrary and the first member to respond
with MST = OK shall be allocated the SQ = n, then the next new member to respond
with MST = OK shall be allocated SQ = n + 1 etc. If for any reason a member being
added does not respond with MST = OK within the time-out period then the LCASC
shall report a fail for that member

LCAS Removing Members Time Sequence Diagram
Note 1 mem4 mem5 mem6(EOS)
NMS LCAS Sk Sk Sk
Decrease cmnd
Note 2
Note 3
CTRL=IDLE CTRL=IDLE CTRL=EOS
SQ=4 SQ=5 SQ=3
Note 4
Note 5 MST=FAIL
RS-Ack inverted
MST=FAIL
RS-Ack inverted
 The example above shows two members being removed with a simultaneous IDLE
command from the LCASC (Source). Reassembly at the sink ceases to use the
“removed” members immediately upon receipt of the IDLE command. SQ should
be changed and the general rule for SQ adjustment is as follow:
 All unwanted members are re-allocated a SQ greater than the SQ of the
member sending the EOS control word.
 All remaining required members are re-allocated consecutive SQs below the
un-required members.

Removing Member due to Fault Time
Sequence Diagram
Note 1 memn-1 memn(EOS)

NMS LCAS Sk Sk
MST=FAIL
Note 2
Note 3
Note 4 CTRL=EOS CTRL=DNU

Fail status
 Decrease (DNU) due to fault single last member.
 Sk will immediately send MST=FAIL to So as soon as it detects

SD, SF or UNEQ alarm.
 Source sets CTRL = DNU on faulty member, and sets CTRL =
EOS on preceding member after it receive the information.

Adding Member due to Fault Repaired Time
Sequence Diagram
Note 1 mem2 mem3 mem4 mem5(EOS)

NMS LCAS Sk Sk Sk Sk
Note 2 MST=FAIL
Note 4
Note 3
Fail status CTRL=DNU
Note 5
Note 6 MST=OK
Note 7
CTRL=NORM
 When the failed member is repaired, Sk will immediately send

MST=OK to So. So will change the CTRL to NORM or EOS from DNU.
The sink will then use this member again to re-assemble the data.

Compatibility of LCAS
 LCAS transmitter and non-LCAS receiver

 An LCAS transmitter can inter-work with a non-LCAS receiver in non-
LCAS mode without any special consideration. The LCAS transmitter will
place the MFI and SQ as designated in ITU T Recs. G.707 and G.709.
The receiver will ignore all other bits, i.e. the LCAS overhead information.
 The member status returned from sink to source will always be MST=OK
 Non-LCAS transmitter and LCAS receiver
 An LCAS receiver expects a CTRL word that is not '0000' and a correct
CRC. A non-LCAS transmitter will transmit '0000' in the LCAS CTRL field
as well as the CRC field. Therefore when an LCAS receiver is
interworking with a non-LCAS transmitter and receives both CTRL word
and CRC equal to '0000', it shall:
 Ignore all information (except MFI and SQ);
 Use MFI and SQ defect detection as defined for virtual concatenation.

EoS Encapsulation Technology
HDLC ML-PPP LAPS GFP
Function Performing Being extensions to the Establishing byte synchronization Mapping data
communication PPP protocol, and oriented point-to-point links signals into SDH or
at the data link integrating the virtual OTN signals
layer concatenation function
Feature Providing a Binding multiple physical Optimizing the PPP-HDLC to Adopting error
mature links into a logical link to provide the features in IP Over control for framing.
technology increase the transmission SDH and Ethernet Over SDH Supporting frame
bandwidth. solutions, therefore improving mapping and
Solving the multi-path the encapsulation efficiency of transparent
transmission delay issues, large-granularity data packets. transmission.
and providing more flexible Being incapable of binding Working as a
networking modes multiple channels. As a result, standard
Low efficiency and virtual concatenation is required encapsulation
complex. to control the bandwidth. protocol.
Supported Multipoint-to- Point-to-point or

Point-to-point Point-to-point
link mode point ring

GFP
MPLS Header + Payload
GFP Header + Payload
SDH Header Payload
The generic framing procedure is used to load frames of variable length in the
synchronization transmission paths. The GFP is a generic procedure to
adapt the user information on a high layer into the transmission network.
The Ethernet signals always burst and are of variable length. This is totally
different from the SDH frames, which require strict synchronization. Hence,
a proper protocol is required for the frame mapping from the Ethernet to
the SDH. The GFP is such a protocol.

G.7041 GFP Encapsulation Protocol
 Generic framing protocol
(GFP)
Payload
Is a generic mapping
technology, which can map
MAC
length-variable payloads into
a transmission channel on
GFP
which bytes are
synchronized.
LCAS VCG
Complies with ITU-T
Recommendation G.7041.

GFP Encapsulation Protocol (Cont.)
 Features:
 Supports statistical multiplexing.

 Supports logical ring networks.
 Supports the in-band OAM function.
 Achieves low overhead but high
 encapsulation efficiency

GFP Encapsulated Frame Format
 GFP encapsulation type

GFP Core Header: 4
 GFP-F Frame-Mapped GFP
bytes
 GFP-T Transparent GFP
 GFP encapsulated frame format
 Core header
GFP Payload Area:
 Payload area 4 to 65535 bytes
GFP Encapsulated
Frame Format

GFP Encapsulated Frame Format (Cont.)
PLI 16 bits
PTI 16 bits
cHEC 16 bits
cHEC 16 bits
GFP Core Header: 4
bytes
Payload Header
Extension Header
4 to 64 bytes
0 to 60 bytes
GFP Payload Area:
4 to 65535 bytes
Payload
FCS 0/16/32 bits

EoS Applications of the GFP-F
Ethernet MAC Frame GFP Frame

Octets
2 PLI
2 cHEC
Octets 2 Type
7 Preamble 2 tHEC
1 Start of frame delimiter 0 - 60 GFP extension header
6 Destination address (DA)
6 Source address (SA)
2 Length/Type GFP
MAC client data payload
Pad
4 Frame check sequence (FCS)
Bit # 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7

Background
 If there are many hosts in a traditional Ethernet, the overall
performance of the network is degraded significantly owing to serious
conflict and broadcast flooding.
Layer 2 switching:
Conflict Domain
• A conflict domain is
confined to a single port.
• A broadcast domain is not
restricted.
• The security is enhanced.
HUB
Broadcast
Domain
Conflict domain
Conflict domain Conflict domain
HUB:
• Serious conflict
Switch
• Broadcast
Conflict domain
flooding Conflict domain Conflict domain
• No security

VLAN Basics
 Purpose of VLAN: Switch
 Enhance the
communication security
 Strengthen the network
robustness
 Broadcast Control
 VLAN division modes:
 Port based
 MAC address based VLAN:1 VLAN:2
 L3 protocol based

802.1Q VLAN Tag
Ethernet II Frame
DA SA Type Data FCS
DA SA QTag Type Data FCS
2-Bytes 3-bits 1-bit 12-bits
0x8100 Pri CFI VLAN ID
TPI TCI
Ethernet Frame with IEEE 802.I Q Tag

VLAN Based on MAC or Port
Switch Switch
Port 1 Port 10
Port 3
Port 7
MAC A MAC B MAC C MAC D PC A PC B PC C PC D
MAC VLAN Port VLAN

MAC A 5 Port 1 5
MAC B 10 Port 3 10
MAC C 5 Port 7 5
MAC D 10 Port 10 10

VLAN Based on Protocol or Subnet
Switch Switch
IPX IPv4 IPX IPv6 1.1.1.1/24 1.1.2.1/24 1.1.3.1/24 2.1.1.1/24
Protocol VLAN IP VLAN

IPX 5 1.1.1.1/24 5
IPv6 10 1.1.2.1/24 10
IPv4 2 1.1.3.1/24 2
………. 11 ………. 11

Advantage and Disadvantage of VLAN
 Advantage
 Improve the bandwidth utilization rate

 Enhance the communication security
 resolves the broadcast problem
 Disadvantage
 VLAN divides a physical network into several small logic
networks. The hosts in different VLANs cannot
communicate with each other.

Ethernet Port Type
Type Description
Only accept the frame with VLAN ID, normally connect with
Tag Aware
switches
UNI
Access Can not identify VLAN ID, normally connect with PC
Hybrid Identify the frame with or without VLAN ID
Identify and process the customer VLAN ID, considering the

C-Aware
outer VLAN ID in the Ethernet frame as C-VLAN.
Identify and process the server VLAN ID, considering the outer
S-Aware
VLAN ID in the Ethernet frame as S-VLAN.

Ethernet Port Interface
ports
Access
Tag Aware
Hybrid

Ethernet Port Processing UNI Interface
Data
Tag Flag Untag Flag
Port
Tag aware (In) Transport transparently Discard
Tag aware (Out) Transport transparently －
Access (In) Discard Add default VLAN
Access (Out) Release the tag flag －
Hybrid (In) Transparent transport Add default VLAN
If the VLAN ID is same as

default, release the tag flag,
Hybrid (Out) －
otherwise transport
transparently

Key Concepts About VLAN
•VLAN ID
The VLAN ID is carried by the Ethernet frame and identifies the VLAN for
the Ethernet frame.
• PVID
For a specific Ethernet port, the VLAN for it should be specified. The
Ethernet switching is performed in the same VLAN.
• VLAN filter table

For a specific Ethernet port, the VLANs allowed to pass the port should be
specified. These VLANs are specified in the VLAN filter table. If a specific
Ethernet port belongs to the VLAN, the Ethernet packets carrying the
VLAN ID are allowed to pass the Ethernet port.

Ethernet Port Processing UNI
Interface (Cont.)
 1. Access
 Port1 <－> VC trunk+ Default VLAN（VLAN= 1~4095）

 Port Attribute configuration: Port – Access, VC trunk – Tag aware
Access Tag aware

Receiving
Port1 VC trunk
DA SA XXX DA SA Vlan XXX
Transmitting
Ethernet Board
Default VLAN ID

Interface (Cont.)
 2. Tag aware
 Port1+VLAN1 <－> VC trunk+ VLAN1（VLAN= 1~4095）

 Port Attribute configuration: Port – Tag aware, VC trunk – Tag aware
Tag aware Tag aware

Receiving
Port1 VC trunk
DA SA Vlan1 XXX DA SA Vlan1 XXX
Transmitting
Ethernet Board

Interface (Cont.)
 3. Hybrid
 Port1+VLAN1 <－> VC trunk+ VLAN1

 Port1 <－> VC trunk+ Default VLAN（VLAN= 1~4095）
 Port Attribute configuration: Port – Hybrid, VC trunk – Tag aware
Hybrid Tag aware

Receiving
Port1 VC trunk
DA SA Vlan1 XXX DA SA Vlan1 XXX
Transmitting
Default VLAN ID
DA SA XXX DA SA Vlan XXX
Ethernet Board

Introduction to QinQ
 Before emergence of QinQ,many users of intranets and small

metropolitan area networks (MANs) encounter the following
problems
 The network is complex, and configuration and
maintenance is difficult.
 Many manufacturers' L3 switch does not support the multi-
protocol label switch (MPLS) function
 The boards that support the MPLS function are expensive.
The small-sized users cannot afford to buy them

Benefits of QinQ
 The QinQ technology brings about the following benefits
 Extends the VLAN ID resources

 The users and the operator can independently and flexibly
plan the VLAN resources
 The expenditure on equipment upgrade is reduced
 The QinQ technology provides a cheap and easy Layer 2
(L2) virtual private network (VPN) solution
 Extends the network service scale from the local area
network (LAN) to the wide area network (WAN)

Frame Format of QinQ
 QinQ is a VLAN Stacking technique(IEEE 802.1Q)
DA SA TPID (8100) VLAN Ethernet Data/PAD
6 6 2 2 N
VLAN Frame
Ethernet
DA SA TPID (8100) S-VLAN TPID (8100) C-VLAN
data/PAD
6 6 2 2 2 2 N
QinQ Frame

Application of QinQ
C-VLAN C-VLAN
100 100
NE1 S- C- NE2
Department A Department A
VLAN VLAN
30 100
Department B
S- PSN C- Department B
VLAN VLAN
31 100
Branch 1 Branch 2
UNI NNI QinQ Link
OptiX Hybrid MSTP NE

QinQ Basics
 QinQ technology is a VLAN stacking technology.
 C-VLAN
 S-VLAN
 Advantages of QinQ technology:
 Expands VLAN and alleviates VLAN resource insufficiency.

 Customer and service provider can arrange their VLAN ID.
independently, reducing the complexity in configuration
and maintenance.
 Extends LAN service to WAN, connecting the client network
to the carrier network and supporting transparent
transmission.

QinQ Implementation Process
 According to the service scenario, directional transmission of

data is implemented by adding, switching, and removing tags.
 C-VLAN: Identify data at the user side.
 S-VLAN: Identify data at the service provider side.
C-VLAN1 S-VLAN1 C-VLAN1

S-VLAN1 C-VLAN2
S-VLAN2 C-VLAN1
C-VLAN2 S-VLAN2 C-VLAN2
Service provider network
C-VLAN1
S1
Service provider network
S2
C-VLAN2

Questions
 What’s QinQ?
 What’s the benefits of QinQ?

Layer 2 Switching Model
Application Application
layer layer
Presentatio Presentatio
n layer n layer
Session The emergence of L2 Session
layer makes Ethernet evolve layer
into the switching mode.
Transport Transport
layer layer
Network Layer 2 switch Network
layer layer
Link layer Link layer Link layer Link layer
Physical Physical Physical Physical

layer layer layer layer

L2 LAN Switch – Work Mechanism
1234.ABCD.0001 1234.ABCD.0003
A C
PORT1 PORT3
PORT2 PORT4 D
B switch 1234.ABCD.0004
MAC ADD. Port

1234.ABCD.0002 MAC A 1
 Learning based on source MAC B 2

MAC C 3
MAC D 4

MAC Address Learning/Forwarding
DA SA DA SA
MAC 4 MAC1 MAC 1 MAC2
MAC 1 MAC 2
A P1 P2 B
P3 P4
Switch
MAC 3 MAC Address Forwarding Table MAC 4
C MAC 1 P1 D
MAC 2 P2
• PC-A sends a packet in which
• PC-B sends a packet in which
DA is MAC4 and SA is MAC1.
DA is MAC1 and SA is MAC2.
• The switch cannot find the
• The switch finds P1 that MAC1
corresponding port of MAC4 in
corresponds to in the MAC
the MAC address forwarding
address forwarding table and
table and broadcasts the packet
unicasts the packet to P1.
to each port.
• The switch learns P2 that MAC2
• The switch learns P1 that MAC1
corresponds to.
corresponds to.

Switching Modes
• The switch starts to forward a data frame upon receiving
the destination address.
Cut-Through • The delay is low.
• The switch does not check data frames for errors.
• The switch starts to forward a data frame upon receiving it

completely.
• The delay is high and is determined by the length of a data
Store-and-Forward frame.
• The switch checks data frames errors and discards incorrect
data frames.
• The switch starts to forward a data frame upon receiving

the first 64 bytes (the shortest frame length) of the data
Fragment-free frame.
• The fragment-free mode has the advantages of the cut-
through mode and the store-and-forward mode.

Three Switch Modes
 Cut-Through:
 Forward the frame immediately after it receive destination address

 Short time delay
 Switch doesn’t check the error
 Store-and-Forward:
 Switch forward the frame after it receive the whole frame

 Long time delay
 Switch check the error so no error frame will be forwarded
 Fragment-free:
 Switch forward the frame after it receive 64 bytes

 Integrate the advantage of the cut-through and store-and-forward
mode

VLAN-Tagged Layer 2 Switching
Receive: Check whether a data
frame contains a VLAN tag.
Layer 2 Switch  Yes: Hand the data frame to
the forwarding module
 No: Add a tag according to
Data the port and hand the data
Receive
Frame frame to the forwarding
module
• Destination MAC address of

Search/ a data frame
Route • VLAN ID
Send: Check whether the peer

device supports a VLAN tag.
• Yes: Send the data frame
directly. Data
Send
• No: Remove the tag and send Frame
the data frame.

Static Forwarding
 Static MAC address table
 Manually configure the correspondences between MAC

addresses and ports to obtain a MAC address forwarding
table.
 The MAC addresses in the MAC address forwarding table
will not be aged.
 Blacklist
 Forwarding is forbidden according to the destination

address of a packet.
 The packets whose destination address is in the blacklist
and that belong to the configured VLAN are discarded.

VB
 Various Bridge (VB)
 Transparent bridge
 Virtual bridge (VB-VLAN)
Port1 VCTRUNK1 Port1 VCTRUNK1

VCTRUNK2 VLAN 1 VCTRUNK2
VLAN 1
VCTRUNK3 VCTRUNK3
Port2 VLAN 2 Port2 VLAN 2
VLAN 3 VCTRUNK4 VCTRUNK4
…… VCTRUNK5 VCTRUNK5
Port3 VCTRUNK6 Port3 VLAN 3 VCTRUNK6
Transparent Bridge Virtual Bridge Logic port (LP)
Forwarding principle: VB-MAC mode Forwarding principle: VB-VLAN-MAC mode

VB (Cont.)
 Learning modes of a bridge:
 Shard VLAN Learning (SVL)

 Independence VLAN Learning (IVL)
Transparent bridge Virtual bridge

Type of Bridge
SVL + ingress filtering disabled IVL + ingress filtering enabled
The validity of the VLAN tag is

Ingress filtering The validity of the VLAN tag is checked.
not checked.
SVL mode: IVL mode:
MAC address
Learning/forwarding based on VB + Learning/forwarding based on VB + VLAN
learning mode MAC address +MAC address
Forwarding principle VB + Destination MAC address VB + VLAN + Destination MAC address
UNI port type Tag Aware/ Access Tag Aware /Access/ Hybrid
Forwarding ports defined in the

Broadcast All ports in a VB
VLAN filtering table
range

Thought
 The service data arriving at a port includes tagged data
and untagged data.
 Tagged data needs to be forwarded to the corresponding
VCTRUNK.
 Untagged data needs to be broadcast to all VCTRUNKs.
 Describe the configuration method.
VCTRUNK1
VCTRUNK2
Tag
Port VCTRUNK3
Untag
VCTRUNK4

L2 LAN Switch – Work Mechanism (Cont.)
 Forwarding Based on the Destination MAC
MAC D MAC A …… PORT PORT

1 2
PORT PORT
Switc MAC A MAC D ……
3 4
h
MAC Port
MAC A 1
MAC B 2
MAC C 3
MAC D 4

Contents
4. MPLS Technology
4.1 MPLS overview
4.2 Key Technologies in Implementing MPLS
4.3 Application of MPLS

Background of MPLS
 Traditional IP Forwarding
 Control plane and Forwarding plane are connectionless
 Each router adopts hop-by-hop forwarding,so the
efficiency is low
 It is hard to deploy Qos
 All the routers need to know all routes in the entire
network or default route
Forwarding to next hop Forwarding to next hop Forwarding to next hop
according to IP header according to IP header according to IP header
RTA RTB RTC

Background of MPLS(Cont.)
Virtual Channel Connection
(VCC)
Virtual Path Connection (VPC)
UNI
UNI
NNI NNI
VC VP VC
switching switching switching
VPI = 1 VPI = 18 VPI = 26 VPI = 20

VCI = 1 VCI = 44 VCI = 44 VCI = 30
 ATM Switch Process
 Connetion-Oriented Forwarding Plane
 Using labels (namely, cells) of fixed length
 Maintaining a label table
Background of MPLS(Cont.)
+ =
Router ATM Switch MPLS Router
 Connetionless Control Plane

 Connetion-Oriented Forwarding Plane
MPLS: Multi-Protocol Label Switching

MPLS Basic Principle
 MPLS network structure
LER MPLS domain
IP
node that do LER LSR LSR
not run MPLS
LER
LSP
LSR
MPLS node that do
not run MPLS
LER
 LSR（Label Switch Router）
 LER（Label Edge Router）
 LSP（Label Switch Path）

MPLS Basic Principle(Cont.)
 MPLS Network Model

RTF RTG
IP IP IP
1024 Data 1029 Data 1039 Data
Header Header Header
RTA RTB RTC RTD
LSP
LER LER
Header
Header
LSR LSR
IP
IP
RTE
Data
Data
MPLS Domain
LSR
IP Network IP Network

Basic Concepts of MPLS
 MPLS: Multi-Protocol Label Switching
 Multi-Protocol
 Support various layer 3 protocols, such as IP, IPv6, IPX, SNA
 Label Switching
 Label the packet, forward packets by label switching instead
of IP forwarding

Basic Concepts of MPLS(Cont.)
 Structure of the MPLS packet header
 Position of the label in a packet
Frame
MPLS label IP Header Payload
Header
label Exp S TTL
0 19 22 23 31

 MPLS Label Nesting
Frame
Outer label Inner label IP Header Payload
Header
MPLS nesting domain
IP L1 IP L2 IP L3 L2 IP L4 L2 IP L2 IP IP
MPLS domain
L1 label

 FEC (Forwarding Equivalence Class)
 A set of data flows with the same attributes. These data flows are
processed in the same way by LSRs during transmission
 FECs can be identified by the address, service type, and QoS
 During IP forwarding according to the longest match algorithm,
packets with the same destination belong to an FEC

 LSR (Label Switching Router)
 Swaping labels and forwarding MPLS packets

 A fundamental element on an MPLS network
 LER (Label Edge Router)
 Resident on the edge of an MPLS domain

 Classifing the packets entering an MPLS domain by FECs and
pushing labels into FECs
 When packets leave the MPLS domain, the labels are popped out

 LSP （Label Switched Path）
 The path that an FEC passes through in the MPLS network is called
the LSP
 The LSP is a unidirectional path from the ingress to the egress
MPLS domain
Ingress Transit Transit Egress

IP Network IP Network
LER LSR LSR LER
LSP

MPLS Forwarding Process
 Label Operations
 Push
 Swap
 Pop
 PHP（Penultimate Hop Popping）
− OptiX Hybrid MSTP equipment does not support PHP

MPLS Forwarding Process(Cont.)
 Case: Establishing Static LSPs
300 200 100

Eth0 Eth0 Eth2 Eth1 Eth2 Eth0 Eth3
A B C D 3.3.3.3/32
(Ingress) (Transit 1) (Transit 2) (Egress)
Ingress Transit1 Transit2 Egress
FEC Out In Out In Out In
3.3.3.3/32 300 300 200 200 100 100

 Case
Push Swap Swap Pop 3.3.3.3/32

300 200 100
Eth0 Eth0 Eth2 Eth1 Eth2 Eth0 Eth3
Ingress Transit1 Transit2 Egress
IP Packet IP Packet
To:3.3.3.3 Label:300 Label:200 Label:100 To:3.3.3.3
IP Packet IP Packet IP Packet
To:3.3.3.3 To:3.3.3.3 To:3.3.3.3

 Processing MPLS TTL
 Uniform Mode
CE PE P PE CE
MPLS domain
MPLS
TTL254
IP TTL MPLS
254 TTL253
IP TTL IP IP TTL
255 TTL 252
254
 Processing MPLS TTL
 Pipe Mode
CE PE P PE CE
MPLS MPLS
TTL100 TTL 99
IP TTL IP TTL
254 254
IP TTL IP TTL
255 253

Label Distribution
 Static Distribution
 Static LSPs are configured by the administrator

 Principle
− The value of the outgoing label of the upstream node is
equal to the value of the incoming label of the
downstream node
 Dynamic Distribution
 Dynamic LSPs are set up automatically by the label

distribution protocol

MPLS Signaling
 The following label distribution protocols are applicable to an

MPLS network
 LDP：Label Distribution Protocol
 RSVP-TE：Resource Reservation Protocol-Traffic
Engineering
 MP-BGP：Multi-Protocol BGP
 OptiX Hybrid MSTP equipment does not support dynamic LSP

MPLS Application
VPNA VPNA
CE CE
PE P P PE
VPNB VPNB
CE CE
CE PE P P PE
CE
VPNA VPNA
CE MPLS Domain CE
VPNB VPNB

MPLS Application(Cont.)
 Layer 2 and Layer 3 VPN Services are offered from the edge of a
network
Layer 3 VPN Link Comprised of IP
Traffic Passed Over IP Backbone
VPNA VPNA
Site A MPLS Domain

Site A
P P
CE PEA PEB CE
Site A Site B
CE P P CE
VPNB VPNB
Layer 2 VPN which passes Ethernet, ATM,
Frame Relay, PPP,HDLC Traffic over IP
Backbone
 MPLS L2 and L3 VPN Comparison
MPLS Layer 3 VPNs MPLS Layer 2 VPNs
Networking topology discovery by Networking topology discovery by

protocol automatically protocol or manual configuration
SP involvement in routing CEs exchange routing information

directly
Provider Edge devices forward Provider Edge devices forward

customer packets based on Layer 3 customer packets based on Layer 2
information information.
PE stores private routing infor for each PE only stores CE host routing
VPN which causes higher memory cost information
Only carry IP Carry any Layer 3 protocols

 MPLS L2 VPN Solution

RTE Soft Swtich IPTV Server
BRAS ISP B
HIS ISP A
BTV Service
Service
RTD
RTC
RTA RTB VOIP

Service
Enterprise SWA SWB
Interconnectio
n DSLAM
Enterprise B Enterprise A Enterprise B

Enterprise A DSLAM
HG HG
PC STB VOIP PC STB VOIP

Questions
 What’s the disadvantages of traditional IP forwarding?
 What information is used in MPLS to forward data packets?
 What’s the conventional applications of MPLS?

Contents
5. PWE3 Technology
 5.1 PWE3 Overview
 5.2 Classification of PWE3
 5.3 Ethernet Service to PWE3
 5.4 TDM E1 Service to PWE3
 5.5 ATM Service to PWE3
 5.6 Application of PWE3

PWE3 Overview
 The PWE3 (Pseudo-Wire Emulation Edge to Edge)

technology can interconnect the traditional network and the
PSN to share the resources and expand the network.
VPN1
VPN1 CE1 CE3
Site2
Site1
MPLS
PE1 PE2
P
CE2 CE4
VPN2
Site1 VPN2
Site2

PWE3 Overview(Cont.)
 Functions of PW
 Encapsulate the emulated service from CEs

 Carry the encapsulated service to the transmit tunnel
 Set up PW at the tunnel end
 Perform PW-related QoS
 Manage signalling, timing and sequence at the PW edge
 Manage the status specified by the service and alarms

Basic Concepts of PWE3
 PWE3 (Pseudo-Wire Emulation Edge to Edge)
 PWE3 is a technology that bears Layer 2 services. PWE3

emulates the basic behaviors and characteristics of the
services such as Asynchronous Transfer Mode (ATM) ,
Frame Relay (FR) , Ethernet, low-speed Time Division
Multiplex (TDM) circuit, and Synchronous Optical Network
(SONET) or Synchronous Digital Hierarchy (SDH) in a
PSN

Basic Concepts of PWE3(Cont.)
 Network Reference Model of PWE3
PE1 P PE2
CE1 CE3
CE2 Forwarder Forwarder CE4

PSN
Tunnel Label
PW Label and control word AC MPLS Tunnel
Emulation service PW PW Signaling

Basic Concepts of PWE3(Cont.)
 Terms of PWE3
 AC（Attachment Circuit）
 Tunnels
 PW Signaling（Pseudo-Wire Signaling）
 PW（Pseudo Wire）
 CE（Custom Edge router ）
 PE（Provider Edge router）

Classification of PWE3
 By Implementation Scheme
 Static PW
− PWs specify the parameters through command rather
than negotiate parameters by using signaling
 Dynamic PW
− Dynamic PWs are PWs that are set up through
signaling
 By Networking
 Single-Hop PW
− Only one PW exists between U-PEs
 Multi-Hop PW
− multiple PWs exist between U-PEs
− PW requires to switch labels at the PW label level on
the S-PE CO., LTD.
HUAWEI TECHNOLOGIES All rights reserved Page158
Classification of PWE3(Cont.)
 Single-Hop PW
CE3 VPN1
VPN1 CE1 Site2
Site1
MPLS
PE1 PE2
P
CE4
CE2
VPN2
Site1 VPN2
Site2
Data
PW Label
Tunnel
Label
Classification of PWE3(Cont.)
 Multi-Hop PW
CE1 VPN1
VPN1 CE3
Site2
Site1
MPLS
U-PE1 U-PE2
S-PE P
CE2 CE4
VPN2
Site1 VPN2
Site2
Data
PW Label A
PW Label
B
Tunnel Label

ETH PWE3——Encapsulation Model
CE1 CE2 Ethernet

Ethernet
PE1 PE2
IP/MPLS
Eth Service Eth Service
Forwarder Forwarder physical

port
Outer MPLS Label Tunnel Header PW1
Inner MPLS Label PW Label
Control Word PW2
Eth Service
MPLS Tunnel Ethernet Service

ETH PWE3——Encapsulation Format
EX Tunnel Label 4 Bytes

Tunnel Label 0 TTL
P PW Label 4 Bytes
EX
PW Label 1 TTL Control Word 4 Bytes
P
0000 Reserved(12b) Sequence Number(16b)
Ethernet Payload
( Variable length )
 OptiX Hybrid MSTP equipment supports setting of Control Word (option)
1-65535 Bytes
 Control Word parameter may be set up manually in PE

ETH PWE3——Standard and Protocol
 IETF RFC 4448: Encapsulation Methods for Transport of

Ethernet over MPLS Networks

TDM PWE3——E1 Frame
 Unframed E1
 Using all the 31 time slots as a whole to transmit user data

 Framed E1
 Time slot 0 used for signaling and frame delimiters

 Time slot 1-31 can be used for transmit service data for
different users

TDM PWE3——Encapsulation Model
 OptiX Hybrid MSTP equipment supports TDM E1 PWE3
 CESoPSN：Structure-aware TDM circuit emulation service

over packet switched network
 SAToP：Structure-agnostic TDM over packet
− Defined in RFC 4553
Service Types :
UNI to UNI
UNI to NNI

TDM PWE3——Encapsulation Format
 SAToP Frame Format
Tunnel Label EXP 0 TTL
PW Label EXP 1 TTL
RTP Header(optional)
Time Stamp
SSRC Identifier
E1 Frame 1
E1 Frame 2

TDM PWE3——Encapsulation Format(Cont.)
 CESoPSN Frame Format
Tunnel Label EXP 0 TTL
PW Label EXP 1 TTL
RTP Header(optional)
Time Stamp
SSRC Identifier
Time Slot 1 Time Slot 2 Time Slot 3 Time Slot 4
Time Slot 5 Time Slot N (Frame 1#)
Time Slot 1 Time Slot 2 Time Slot 3 Time Slot 4
Time Slot 5 Time Slot N (Frame 2#...)

TDM PWE3——Key Technology
 Data Jitter Buffer
 Clock Recovery Schemes of TDM PWE3
 CES Alarm Transparent Transmission
 QoS of TDM PWE3

TDM PWE3——Standard and Protocol
 IETF RFC 3550: RTP: A Transport Protocol for Real-

Time Applications
 IETF RFC 4197: Requirements for Edge-to-Edge
Emulation of Time Division Multiplexed(TDM) Circuits
over Packet Switching Networks
 IETF RFC 4553: Structure-Agnostic Time Division
Multiplexing (TDM) over Packet(SAToP)
 IETF RFC 5086: Structure-Aware Time Division
Multiplexed (TDM) Circuit Emulation Service over Packet
Switched Network (CESoPSN)
 ITU-T G.704: Synchronous

ATM PWE3——Encapsulation Model
CE1 CE2
ATM
ATM
Network
Network
PE1 IP/MPLS PE2
ATM Service ATM Service
Forwarder Forwarder
Outer MPLS Label Tunnel Label

 Note
Inner MPLS Label PW Label
 MPLS PSN Tunnel identified by outer
Control MPLS label
Word
ATM
 PW identified by inner MPLS Service
label

ATM PWE3——Emulation Mode
 N-to-1 VCC
 Multiple VCCs are mapped to one PW

 1-to-1 VCC
 A VCC is mapped to one PW

 N-to-1 VPC
 Multiple VPCs are mapped to one PW

 1-to-1 VPC
 A VPC is mapped to one PW

ATM PWE3——Encapsulation Format
 ATM N-to-1 Cell Transport Mode

PSN Transport Header (Outer MPLS label)
PW Header (Inner MPLS label)
0000 Flags Re Length Sequence Number

s
VPI VCI PTI C
ATM Payload (48 bytes)
VPI VCI PTI C
ATM Payload (48 bytes)
…
ATM PWE3——Encapsulation Format(Cont.)
 ATM 1-to-1 Cell Transport
 ATM VCC encapsulation

0000 Resvd Sequence Number ( Optional) M V Re PT C

s I
ATM Cell Payload (48 Bytes)
M V R PTI C ATM Cell Payload (48 Bytes)

ATM PWE3——Encapsulation Format(Cont.)
 ATM 1-to-1 Cell Transport
 ATM VPC encapsulation

0000 Flags Sequence Number (Optional) M V Res PTI C
VCI
M V RE PTI C VCI
S
VCI

ATM PWE3——Key Technology
 Number of ATM Cells Encapsulated in PWE3 Packets
 Maximum Number of Concatenated Cells

 ATM Cell Concatenation Waiting Time
 QoS of ATM PWE3

ATM PWE3——Standard and Protocol
 IETF RFC 4717：Definitions of Textual Conventions and

Object-identities for ATM Management

Application——Ethernet Service Type
 E-Line Service
 Point-to-point service
 E-LAN Service
 Multipoint-to-multipoint service
 E-AGGR Service
 Multipoint-to-point converging service

Application——Ethernet Service
 E-Line Service
Tunnel Header
PW Header(Label=A)
Company
Company A Company (VID=5) A
A
PE1 PE2 A Company (VID=5)

A Company (VID=5) IP/MPLS
B Company (VID=5) B Company (VID=5)
Company Company
B B
Tunnel Header
PW Header(Label=B)
City 1 B Company (VID=5) City 2

Application——Ethernet Service(Cont.)
VLAN2: MAC 2-1

 E-LAN Service
VLAN2: MAC 1-1 VLAN3: MAC 2-2 Site 2
VLAN3: MAC 1-2
Site 1 PE2
PE1
PW1
Port1 Port1
MAC Address Table for PE1: IP/MPLS MAC Address Table for PE2:
DMAC VLAN Out port
DMAC VLAN Out port
MAC1-1 2 Port1
MAC1-2 3 Port1
PW2 PW3
MAC1-1 2 PW1
MAC1-2 3 PW1
MAC2-1 2 PW1
MAC2-1 2 Port1
MAC2-2 3 PW1
PE3 MAC2-2 3 Port1
MAC3-1 2 PW2
Port1 MAC3-1 2 PW3
MAC3-2 3 PW2
MAC3-2 3 PW3
MAC Address Table for PE3:

DMAC VLAN Out port
MAC1-1 2 PW2
MAC1-2 3 PW2 Site 3
MAC2-1 2 PW3
MAC2-2 3 PW3
MAC3-1 2 Port1 VLAN2: MAC 3-1
MAC3-2 3 Port1 VLAN3: MAC 3-2

Application——Ethernet Service(Cont.)
 E-AGGR Service
NodeB 1
FE1
NodeB 2 FE2 Port1 PW1

Port1 GE1
NE1
NodeB 3 FE1 Port1 PW2 Port2
NE3
RNC
FE2
NE2
NodeB 4
VLAN forwarding table for NE1 and NE2: VLAN forwarding table for NE3:
Parameter NE1 NE2 Parameter NNI for NE1 NNI for NE2
Source Port Type V-UNI V-UNI V-UNI V-UNI Source Port Type V-NNI V-NNI V-NNI V-NNI
Source Port FE1 FE2 FE1 FE2 Source Port Port1 Port1 Port2 Port2
Source VLAN 100 100 100 100 Source VLAN 1 2 3 4
Sink Port Type V-NNI V-NNI V-NNI V-NNI Sink Port Type V-UNI V-UNI V-UNI V-UNI
Sink Port Port1 Port1 Port1 Port1 Sink Port GE1 GE1 GE1 GE1
Sink VLAN 1 2 3 4 Sink VLAN 100 200 300 400

Application—— TDM E1 Service
E1 PE1
BTS1
PW
PE3 BSC
IP/MPLS
PW C STM-1
E1
PW
PE2
E1
BTS2

Application——ATM Service
 N-to-1 ATM Cell Transport
CE
CE ATM
ATM
Network
Network
PVP: VPI 1 PVP: VPI 1
CE PE IP/MPLS PE CE
ATM
ATM
PVP:VPI 2 Network
Network PVP:VPI 2
CE PVP: VPI 3
ATM PVP: VPI 3 ATM
Network Network
CE

Application——ATM Service(Cont.)
 1-to-1 ATM Cell Transport
CE1 PE1 IP/MPLS PE2 CE2

ATM ATM
Network Network
PVC: PVC:
VPI 1/ VCI 1 VPI 2/ VCI 2

Questions
 What’s PWE3？
 What’s the difference between CESoPSN mode and SAToP

mode？
 What are typical applications of PWE3？

QoS Introduction
 QoS: The ability of a communication network to ensure the

expected service quality in the aspects of bandwidth, delay,
delay jitter, and packet loss ratio.
 Objectives of QoS
 Manage the network resources

 Avoid network congestion
 Reduce packet loss ratio
 Flow control
 Provide private bandwidth to certain customer or service
 Support real-time service

Configure the CAR to
detect the network traffic
Configure the CoS to
QoS Application
At a network ingress,
and restrict the bandwidth
and burst size in the schedule the traffic to a
packet flows are classified priority queue on the
incoming direction of the
according to certain rules: outgoing port to
traffic.
• Complex flow implement the
classification CAR scheduling of the send
• Simple flow priority of the traffic.
classification Flow
Classificatio CoS Marking
n
Mark the packet
Forwardin priority
g according to the
service policy.
Classificatio Traffic Schedulin
n Shaping g
Configure traffic shaping No Traffic

on the egress port of
Shaping Send packets according to the
traffic to adjust the
outgoing bandwidth and priority.
burst size of the queue or • Strict priority (SP)
Queue
the traffic. • Weighted round robin (WRR)
scheduling
• Weighted fair queuing (WFQ)
• SP + WRR
• SP + WFQ

QoS Models
 Best Effort
 Forwarding all the traffic with best-effort, without

discrimination
 Integrated Service Model (IntServ Model)
 Reserve resources for each flow
 Maintain the forwarding status for each flow
 Differentiated Service Model (DiffServ Model)
 Classify and mark the flow
 Provide different services for different flows

Best-Effort Model
 Best-Effort is a single service model
 Using Best-Effort model can transfer any number of packets at any time
without getting previous approval
 There is no guarantee with respect to time delay and reliability
 It is implemented by first in and first out (FIFO) queue technology

IntServ Model
 Provide controllable end-to-end service
 Network units support QoS control mechanism
 The application applies to NM for specific QoS service
 Signaling protocol deploys in network according to QoS request
 RSVP is the most frequently used

DiffServ Model
 Differentiated service (DiffServ)
 The flows are classified and marked by the traffic classifier.

 Provide different services to different flows.
Perform PHB
according to
marking……
DS Domain
Set TCA according to

Set TCA according to SLA
Perform PHB
SLA Classify and mark
according to
Classify and mark traffic
marking
traffic Monitor traffic
Monitor traffic

Flow Classification
 Complex flow classification
 Source MAC address/destination MAC address

 Source IP address/destination IP address
 User group number, protocol type, TCP/UDP port number of an
application
 Simple flow classification
 Physical port/logical port of bridge

 VLAN/S-VLAN/S-VLAN+C-VLAN
 Packet priority

Traffic Policing
 On a port at the edge of a network, traffic control is implemented through
CAR.
 Use the token bucket principle to monitor network traffic and transmit
or discard packets according to the set rate.
CIR
CBS
srTCM
(Tc) EBS Algorithm
Classification (Te)
PIR CIR
trTCM Algorithm PBS CBS

(Tp) (Tc)
Classification

CAR: Committed Access Rate
Forward
Classification
Pass
Packets without traffic

policing
Packets with traffic Drop
policing

Token Bucket
 The token bucket is used to assess whether the traffic exceeds the
specified limit in order to take corresponding measures
 In simple assessment, two parameters are applied.
 CIR (Committed Information Rate)
 CBS (Committed Burst Size)
 In complex assessment, three parameters are applied.
 CIR (Committed Information Rate)
 CBS (Committed Burst Size)
 EBS(Excess Burst Size)

CoS
 The class of service (CoS) classifies packets and schedules

them to queues with different priorities on an egress.
 The QoS of the packets with high priorities is guaranteed.
 By default, the priority of data flows for which no CoS rules
are specified is low.
 CoSs
 Simple CoS – Schedule packets according to the

configured CoS.
 VLAN CoS – Schedule packets according to the VLAN
priority
 IP ToS CoS – Schedule packets according to the IPv4 ToS
value
HUAWEI DSCP CoS CO.,
TECHNOLOGIES – Schedule
LTD. Allpackets according Page195
rights reserved to the IPv6
Traffic Shaping
 Traffic shaping restricts the output traffic and the burst size of a network
so that service packets are sent out at an even rate.
CIR
Tc CBS
Buffer Queue (Tc)
Flow Classification

Traffic Shaping (Cont.)
 Comparison with CAR:
CAR Shaping
Algorithm trTCM algorithm srTCM algorithm
Egress of a network.
Ingress of a network.
Traffic shaping adjusts the
Application CAR restricts the bandwidth burst size of the service
Scenario and the burst size of the packet flow meter to ensure
traffic entering a network. that service packets are
transmitted at an even rate.
When a packet is unable to When a packet is unable to
Operation
be sent, it is discarded. be sent, it is buffered.

Congestion Management
 When a network congestion occurs, packets are put into different queues
according to their priority, and give different dispatch priorities, or
bandwidths etc. to different queues
 Algorithm
 SP(Strict-Priority Queue)
 WRR(Weighted Round Robin)
Flow
classificati
on
Egress flow

Queue Scheduling - SP
Queue
Incoming packet 7
Queue Outgoing packet
6 Queue
Queue Scheduling
5
…
Flow
Queue
Classification
0
Packet emergency increases from left to ri
 SP(Strict-Priority Queue) queue scheduling algorithm
 Packets in a queue with a higher priority are sent first.

 After all packets in a queue with a higher priority are sent, packets in a
queue with a lower priority will be sent.
− If packets exist in a queue with a higher priority all the time, the
packets in a queue with a lower priority will never be sent.

Queue Scheduling - WRR
Weight
Queue
Incoming packet 50
4
3
30
Queue
Queue
2 10 Scheduling
Queue
Flow 1 10
Classification
Packet emergency increases from left to right
 WRR(Weighted Round Robin) scheduling algorithm
 A weight is set for each queue.

 Packets are scheduled according to the queue weights.
− If a queue is empty, packets in the next queue are scheduled.

Queue Scheduling - SP+WRR
Weight
Queue Strict
Incoming packet 7
Queue
priority Outgoing packet
64
6 Queue
Queue
32 Scheduling
5
…
Flow
Queue
Classification 1
0
Packet emergency increases from left to
 SP+WRR scheduling algorithm
 One queue adopts the SP algorithm, which guarantees the QoS of key
services.
 The other queues adopt the WRR algorithm, which guarantees that all
other services are served.

Queue Scheduling - WFQ
Weight
Queue
Incoming packet 40
4
3
30
Queue
Queue
2 20 Scheduling
Queue
Flow 1 10
Classification
Packet emergency increases from left to righ
 WFQ(Weighted Fair Queue) scheduling algorithm
 A weight is set for each queue.

 The queues are fair scheduled according to the allocated weights.
− High-priority queues occupy a large bandwidth, while low-priority
queues occupy a small bandwidth.

Queue Scheduling - SP+WFQ
Weight
Queue
Incoming packet 4
Strict priority
3
4
Queue
Queue
2 2 Scheduling
Queue
Flow 1 1
Classification
Packet emergency increases from left to rig
 SP+WFQ scheduling algorithm
 One queue adopts the SP scheduling algorithm, which guarantees

that key services are first scheduled.
 Other queues adopt the WFQ algorithm.

Egress Port Scheduling
 The scheduling priority, probability, and bandwidth of packets

are guaranteed on the basis of traffic shaping and CoS.
 Available bandwidth at a port: Bandwidth that the system
allocates to a port.
 In the case of an Ethernet port, the available bandwidth at a
port is determined by the working mode of this port. For
example, if the working mode of a port is 1000M full-duplex,
the available bandwidth of the port is 1000 Mbit/s.
 In the case of a VCTRUNK port, the available bandwidth is
determined by the total bandwidth of the virtual
concatenation (VC) paths that are bound to the port virtual
concatenation group (VCG).

Egress Port Scheduling (Cont.)
 Scheduling principles:
 The egress scheduling function guarantees the committed

bandwidth (or CIR) for services that require traffic shaping
first, and then the committed bandwidth for services that do
not require traffic shaping.
 Among the services that require traffic shaping or the
services that do not require traffic shaping, the egress
scheduling function guarantees the bandwidth for the
services of a higher CoS priority first, and then the
bandwidth for the services of a lower CoS priority.


Ethernet Principles Complementary Information

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Ethernet Principles Complementary Information

Enviado por

Direitos autorais:

Formatos disponíveis

Internal

Huawei Certified Network Associate

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved

market of network devices cause following problems

 Network became more and more complicated

 Communications became more and more difficult

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page1

6 Presentation layer Deal with data format problems

5 Session layer Establish, maintain and manage sessions

Transport layer Establish, maintain and

2 Data link layer Provide link medium access

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page2

Presentation layer Application layer

Transport layer Transport layer

Network layer Network layer

Data link layer Data link layer

Physical layer Physical layer

OSI RM TCP/IP Protocol Stack

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page3

Application layer HTTP, Telnet, FTP

Data link layer Ethernet, 802.3, PPP Layer 2 Switch

Physical layer Interfaces, wires HUB

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page4

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page5

Application layer upper layer data

Transport layer upper layer data

TCP + upper layer data

Data link layer

Physical layer 01011101010010000100101101011010

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page6

Application layer Application layer

Transport layer Router B ……….. Router E Transport layer

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page7

SDH Layer SDH frames SDH Layer

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page 8

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page9

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page11

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page12

Definition ETH0:10.110.0.2 ETH2:10.110.

10.110.0.113/24 10.110.1.88/24 10.110.2.200/24

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page13

Personal user Enterprise private

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page15

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page16

 The Internet is a large network formed by networks and

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page17

 Definition: The gathering of computers, printers, modem or

 Standard: describes the protocols，defines the performance

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page18

 Designing objects of LAN：

 Applied in short distance

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page19

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page20

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page 21

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page24

 The Ethernet was invented in 1972. In 1979, Xerox, Intel and

 At the early stage, the Ethernet was based on the coaxial

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page25

 CS: Carrier Sense

 If the medium is idle, the transmission will be made; If the

 The data could be received by all devices in the same

 If collision is detected during the transmission, a short and

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page26

 The maximum transmission distance is determined by