Вы находитесь на странице: 1из 45

T1X1.5 presentation T1X1.

5/2002-096

What is all this Concatenation


stuff anyway?
”Bandwidth efficiency"

Huub van Helvoort


Member of Technical Staff
Lucent Technologies
email: hhelvoort@lucent.com

Concatenation Tutorial © Lucent Technologies 2002


Contents

 Bandwidth growth
 Rate Comparison
 Virtual Concatenation
 Link Capacity Adjustment Scheme (LCAS)
 Application
 Standards

© 2002 Lucent Technologies Concatenation Tutorial

2
2
 Bandwidth growth
 Rate Comparison
 Virtual Concatenation
 Link Capacity Adjustment Scheme (LCAS)
 Application
 Standards

© 2002 Lucent Technologies Concatenation Tutorial

3
3
SDH mapping scheme
InitialMultiplexing
More
Contiguous
mapping
Concatenation
x1 x1
STM-256 AUG-256 AU-4-256c VC-4-256c C-4-256c

x4
x1 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
x1
x3 TUG-3 TU-3 VC-3
x3
x1 x7
C-3
STM-0 AU-3 VC-3
x7
x1
TUG-2 TU-2 VC-2 C-2
pointer processing x3

multiplexing TU-12 VC-12 C-12


x4
aligning
TU-11 VC-11 C-11
mapping

© 2002 Lucent Technologies Concatenation Tutorial

4
4
SDH mapping scheme
Contiguous Concatenation (i.e.VC-4-Xc)
• provides a payload area of X Container-4, see figure
• has one common set of POH, in the first column, used for the whole
VC-4-Xc (e.g. BIP-8 covers all 261 * X columns of a VC-4-Xc)
• columns #2 to #X are fixed stuff
VC-4-Xc
1 J1
B3
C2
G1
fixed
F2 C-4-Xc
stuff
H4
F3
K3
9 N1
125 s

1
X-1 X * 260

X * 261

© 2002 Lucent Technologies Concatenation Tutorial

5
5
SDH mapping scheme
Contiguous Concatenation
• a VC-4-Xc is transported in X contiguous AU-4 in the STM-N signal

• the first column of the VC-4-Xc is always located in the first AU-4

• the pointer of this first AU-4 indicates the position of the J1 byte of
the VC-4-Xc. The pointers of AU-4 #2 to #X are set to the
concatenation indication to indicate a contiguously concatenated
payload

• pointer justification is performed in common for the X concatenated


AU-4s and X * 3 stuffing bytes are used.

© 2002 Lucent Technologies Concatenation Tutorial

6
6
 Bandwidth growth

 Rate Comparison
 Virtual Concatenation
 Link Capacity Adjustment Scheme (LCAS)
 Application
 Standards

© 2002 Lucent Technologies Concatenation Tutorial

7
7
Rate Comparison
SDH container size/bit-rates vs. Data bit-rates

SDH - TDM Data


C-11 1.600 Mbit/s 10 Mbit/s Ethernet
C-12 2.176 Mbit/s 25 Mbit/s ATM
C-2 6.784 Mbit/s 100 Mbit/s Fast Ethernet
C-3 49.536 Mbit/s 200 Mbit/s ESCON
C-4 149.760 Mbit/s 400 Mbit/s
Fibre Channel
C-4-4c 599.040 Mbit/s 800 Mbit/s
C-4-16c 2.396 160 Mbit/s 1 Gbit/s Gigabit Ethernet
C-4-64c 9.584 640 Mbit/s 10 Gbit/s 10 Gb Ethernet
C-4-256c 38.338 560 Mbit/s

© 2002 Lucent Technologies Concatenation Tutorial

8
8
Rate Comparison
Transport efficiencies
Data SDH Efficiency
Ethernet 10 Mbit/s C-3 20%
ATM 25 Mbit/s C-3 50%
Fast Ethernet 100 Mbit/s C-4 67%
ESCON 200 Mbit/s C-4-4c 33%
400 Mbit/s C-4-4c 67%
Fibre Channel
800 Mbit/s C-4-16c 33%
Gigabit Ethernet 1 Gbit/s C-4-16c 42%
10 Gb Ethernet 10 Gbit/s C-4-64c 100%

the solution:

Virtual Concatenation
© 2002 Lucent Technologies Concatenation Tutorial

9
9
 Bandwidth growth
 Rate Comparison

 Virtual Concatenation
 Link Capacity Adjustment Scheme (LCAS)
 Application
 Standards

© 2002 Lucent Technologies Concatenation Tutorial

10
10
Virtual Concatenation
Why:

• to transport contiguous concatenated signals in a network with


NEs that do not support VC-n-Xc

• to provide a better bandwidth granularity to transport the new


services with non-SDH bit rates

Prerequisites:

• no requirements on existing NEs that transit VC-ns part of a


Virtual Concatenation Group (VCG or VC-n-Xv)

• no strict routing constraints for operators by compensating the


differential delay caused by difference in optical path length
© 2002 Lucent Technologies Concatenation Tutorial

11
11
Virtual Concatenation
Mapping of C-n-Xc into X * VC-n: a VC-n-Xv
1 X X*m
1

C-n-Xc

125 s
9

1 m+1
1
1 m+1
1
overhead

VC-n-Xv
overhead

VC-n#X
9 125 s

VC-n#1
9 125 s

© 2002 Lucent Technologies Concatenation Tutorial

12
12
Virtual Concatenation
VC-n-Xc transport through a VC-n only network

X * VC-n = VC-n-Xv

1 C-n

2 C-n

C-n-Xc C-n-Xc/C-n-Xv C-n-Xv/C-n-Xc C-n-Xc

X C-n

© 2002 Lucent Technologies Concatenation Tutorial

13
13
Virtual Concatenation

Differential delay is caused by:


• geographically large ring with VC-ns from the same VC-n-Xv
routed around the ring in different directions, delay is mainly due
to fiber propagation (~5 s/km)

Ring
End-to-end traffic
is VC-n-Xv

Y VC-ns
(Y<X) (X-Y) VC-ns

© 2002 Lucent Technologies Concatenation Tutorial

14
14
Virtual Concatenation

• networks with diversely routed path protected VC-ns, delay is


mainly due to fiber propagation (~5 s/km)

Y VC-ns (X-Y) VC-ns


on working path on Protection path

Working path

Protection
path
Transport
network

End to end traffic: VC-n-Xv


© 2002 Lucent Technologies Concatenation Tutorial

15
15
Virtual Concatenation
Provides additional transport sizes:

container X in steps of up to
C-11-Xc 1 - 63 1.6 Mbit/s 100.8 Mbit/s
C-12-Xc 1 - 63 2.0 Mbit/s 137.1 Mbit/s
C-3-Xc 1 - 256 49 Mbit/s 12.7 Gbit/s
C-4-Xc 1 - 256 150 Mbit/s 38.3 Gbit/s

© 2002 Lucent Technologies Concatenation Tutorial

16
16
Virtual Concatenation
Transport efficiencies

Data SDH Efficiency


Ethernet 10 Mbit/s C-12-5c 92%
ATM 25 Mbit/s C-12-12c 98%
C-12-46c 100%
Fast Ethernet 100 Mbit/s
C-3-2c 100%
ESCON 200 Mbit/s C-3-4c 100%
400 Mbit/s C-3-8c 100%
Fibre Channel
800 Mbit/s C-4-6c 89%
Gigabit Ethernet 1 Gbit/s C-4-7c 95%
10 Gb Ethernet 10 Gbit/s C-4-64c 100%

© 2002 Lucent Technologies Concatenation Tutorial

17
17
Virtual Concatenation
Operation:
• distribute the payload to be transported bytewise over the members
in the VCG

• provide byte alignment required for re-alignment after diverse


routing delay compensation

• use the alignment indicator of each member to determine the


experienced differential delay

© 2002 Lucent Technologies Concatenation Tutorial

18
18
Virtual Concatenation
Virtual Concatenation overhead:
from source (So) to sink (Sk):

• Multi Frame Indicator (MFI)


the MFI is used to determine at the Sk the differential delay
and re-align the received data to reconstruct the original

• Sequence Indicator (SQ)


at the So each VC-n in the VCG is assigned an unique identifier
to be used at the Sk for reconstruction of the original signal

© 2002 Lucent Technologies Concatenation Tutorial

19
19
Virtual Concatenation
Higher order overhead VC-4/3 POH H4
st nd
H4 Byte 1 multi- 2 multi-
frame frame
Bit 1 Bit 2 Bit 3 Bit 4 Bit 5 Bit 6 Bit 7 Bit 8 number number
st
1 multiframe indicator MFI1 (bits 1-4)

Sequence indicator LSB ( bits 5-8) 1 1 1 1 15 n-1


nd
2 multiframe indicator MFI2 MSB ( bits 1-4) 0 0 0 0 0
nd
2 multiframe indicator MFI2 LSB ( bits 5-8) 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
n
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 SQ MSB ( bits 1-4) 1 1 1 0 14
Sequence indicator SQ LSB ( bits 5-8) 1 1 1 1 15
nd
2 multiframe indicator MFI2 MSB ( bits 1-4) 0 0 0 0 0 n+1

© 2002 Lucent Technologies Concatenation Tutorial

20
20
Virtual Concatenation
Lower order overhead
B
itn
umb
er:
1 2 3 4 5 6 7 8
1 0 1
B
IP-2 R
EIR
FI S
ign
alL
abl R
e DI

V
C -2
/VC-1P
O HV5

Bit number:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

MFAS Extended Signal Label 0 R R R R R R R R R R R R

MFAS Multiframe alignment bits


0 Zero
R Reserved bit 1st stage: Frame Aligment in K4 bit 1

Bit number:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

Frame Indicator Sequence Indicator R R R R R R R R R R R R R R R R R R R R R

R Reserved bit
2nd stage: Virtual Concatenation control in K4 bit 2

© 2002 Lucent Technologies Concatenation Tutorial

21
21
Virtual Concatenation
Benefits:

• not restricted to the situation in which all the individual VC-ns are
contained within a single Multiplex Section

• operators get the ability to implement channels that are more


appropriate for the new router based applications by providing
bandwidth granularity, right sized capacity, efficient mapping,
traffic scalability and channelized high capacity SDH interfaces

• can use protection schemes inherited from SDH per VC-n

• is transparent to intermediate network Elements, therefore it can


be cost effectively deployed into an existing network without the
need to upgrade all NEs

© 2002 Lucent Technologies Concatenation Tutorial

22
22
Virtual Concatenation
Points for improvement:

• if one of the VC-n of a virtual concatenation group VC-n-Xv


fails, the whole VCG fails

• data transport can have a variable requirement for bandwidth


regarding the time of the day, or the day of the week

the solution:

LCAS
© 2002 Lucent Technologies Concatenation Tutorial

23
23
 Bandwidth growth
 Rate Comparison
 Virtual Concatenation

 Link Capacity Adjustment Scheme


(LCAS)
 Application
 Standards

© 2002 Lucent Technologies Concatenation Tutorial

24
24
LCAS
Features:
• located in the virtual concatenation source and sink adaptation
functions only
• provides a control mechanism to hitless increase or decrease the
capacity of a VCG link to meet the bandwidth needs of the application
• provides the capability of temporarily removing member links that
have experienced a failure

Prerequisites:

• LCAS assumes that in cases of capacity initiation, increase or


decrease, the construction or destruction of the end-to-end path of
each individual member is the responsibility of the Network and
Element Management Systems.
© 2002 Lucent Technologies Concatenation Tutorial

25
25
LCAS

Operation:
• use virtual concatenation operation for differential delay
compensation and de/re-construction of payload

• synchronization of changes in the capacity of the transmitter (So)


and the receiver (Sk) shall be achieved by a control packet

• each control packet describes the state of the link during the next
control packet

• changes are sent in advance, so that the receiver can switch to the
new configuration as soon as it arrives.

© 2002 Lucent Technologies Concatenation Tutorial

26
26
LCAS
Control packet content, LCAS overhead:
In the forward direction, So to Sk:
• Multi Frame Indicator (MFI)
• Sequence Indicator (SQ)
• Control (CTRL): IDLE - ADD - NORM - EOS - DNU - FIXED
• Group Identification (GID)

In the return direction, Sk to So:


• Member Status (MST)
• Re-Sequence Acknowledge (RS-Ack)
Note: MST and RS-Ack are identical in the control word of ALL members
of the same VCG

For both directions:


• Cyclic Redundancy Check (CRC) over the control packet

© 2002 Lucent Technologies Concatenation Tutorial

27
27
LCAS
Control packet content

MFI_z
information of member_n in 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
GID_a
CRC_x

information sent in control packet x of member_n in VCG_a

© 2002 Lucent Technologies Concatenation Tutorial

28
28
LCAS
State diagram of member(i)
in the Virtual Concatenated
So side group.
START
IDLE

process FIDLE MADD RFAIL ROK

ASSIGN
SEQ# > EOS
see note 1

FADD

ADD
NORM

RFAIL ROK MREMOVE


CEOS CNORM ROK RFAIL MREMOVE
see note 2 RENUMBER
SEQ# > EOS

FEOS FNORM
FEOS
Y N
LA ST? send to CNORM
member(i-1)
send to
CEOS
member(i-1)

Y N
FDNU LAST?
RENUMBER see note 3
SEQUENCE

DNU send to
CEOS member(i-1)

CEOS CNORM RFAIL ROK MREMOVE FIDLE

CEOS CNORM

Y N REMOVE
send to LAST?
member(i-1)
FEOS FNORM
ROK RFAIL
send to
CNORM member(i-1)
FIDLE

© 2002 Lucent Technologies Concatenation Tutorial

29
29
LCAS
Sk side
process OK

TSF FIDLE MREMOVE TSF FDNU FNORM FADD FEOS

ROK
RFAIL

FAIL

START

TSF TSF MREMOVE

If the sink detects a change in the


RFAIL sequence numbers or the size of
Y FIDLE?
the VCG the RRS_ACK bit is inverted.
N IDLE
ROK
MADD

© 2002 Lucent Technologies Concatenation Tutorial

30
30
LCAS
Higher order overhead
st nd
H4 byte 1 multi- 2
Bit1 Bit 2 Bit3 Bit 4 Bit 5 Bit 6 Bit 7 Bit 8 frame multi-
st
1 multiframe indicator MFI1 no. frame
MS nibble LS nibble (bits 1-4) no.
CRC-8 0 1 1 1 7
Member status MST 1 0 0 0 8
Member status MST 1 0 0 1 9
0 0 0 RS-Ack 1 0 1 0 10
Reserved (“0000”) 1 0 1 1 11 n
Reserved (“0000”) 1 1 0 0 12
Reserved (“0000”) 1 1 0 1 13
Sequence indicator SQ MSBs (bits 1-4) 1 1 1 0 14
Sequence indicator SQ LSBs (bits 5-8) 1 1 1 1 15
2nd multiframe indicator MFI2 MSBs (bits 1-4) 0 0 0 0 0
2nd multiframe indicator MFI2 LSBs (bits 5-8) 0 0 0 1 1
CTRL 0 0 1 0 2
0 0 0 GID 0 0 1 1 3
Reserved (“0000”) 0 1 0 0 4 n+1
Reserved (“0000”) 0 1 0 1 5
CRC-8 0 1 1 0 6
CRC-8 0 1 1 1 7
Member status MST 1 0 0 0 8

© 2002 Lucent Technologies Concatenation Tutorial

31
31
LCAS

B
Lower order overhead
itn
umb
er:
1 2 3 4 5 6 7 8
1 0 1
B
IP-2 R
EIR
FI S
ign
alLa
bel R
DI

V
C -2
/VC-1P
O HV5
Bit number:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

MFAS Extended Signal Label 0 R R R R R R R R R R R R

MFAS Multiframe alignment bits


0 Zero
R Reserved bit
1st stage: Frame Aligment in K4 bit 1

Bit number:
1 2 3 4 5 6 7 8
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
G A
Frame count Sequence indicator CTRL I R R R R c Member Status CRC-3
D k
R Reserved bit
2nd stage: Virtual Concatenation + LCAS control in K4 bit 2

© 2002 Lucent Technologies Concatenation Tutorial

32
32
LCAS Add two new members to the VCG

NMS memn-1 memn memn+1


So Sk Sk Sk
ADD (EOS SQ=4) OK IDLE IDLE

FAIL FAIL
ADD SQ=5 ADD SQ=6
OK
MST=OK
NORM SQ=4 ADD SQ=6 EOS SQ=5
RS-Ack
OK
MST=OK
EOS SQ=6 NORM SQ=5

RS-Ack

© 2002 Lucent Technologies Concatenation Tutorial

33
33
LCAS Remove one (last) member from the VCG

NMS memn-1 memn memn+1


So Sk Sk Sk
REMOVE (NORM SQ=3) OK (EOS SQ=4) OK IDLE

EOS SQ=3 IDLE SQ>3 FAIL

RS-Ack

MST=FAIL

REMOVE

IDLE

© 2002 Lucent Technologies Concatenation Tutorial

34
34
LCAS Remove two members (not last) from the VCG

NMS memn-1 memn memn+1


So Sk Sk Sk
REMOVE (NORM SQ=3) OK (NORM SQ=4) OK (EOS SQ=5) OK

IDLE SQ>3 IDLE SQ>3 FAIL EOS SQ=3


FAIL
MST=FAIL
MST=FAIL

RS-Ack

REMOVE

IDLE IDLE

© 2002 Lucent Technologies Concatenation Tutorial

35
35
LCAS Network failure: temporarily remove a (not last) member from the VCG
NMS memn-1 memn memn+1
So Sk Sk Sk
(NORM SQ=3) OK NORM SQ=4 OK (EOS SQ=5) OK
FAIL
MST=FAIL traffic hit

FAILED DNU SQ=4

decreased
capacity

OK
MST=OK

CLEAR NORM SQ=4

© 2002 Lucent Technologies Concatenation Tutorial

36
36
LCAS Network failure: temporarily remove last member from the VCG

NMS memn-1 memn memn+1


So Sk Sk Sk
(NORM SQ=3) OK EOS SQ=4 OK IDLE
FAIL
MST=FAIL traffic hit

FAILED EOS SQ=3 DNU SQ=4

decreased
capacity

OK
MST=OK

CLEAR NORM SQ=3 EOS SQ=4

© 2002 Lucent Technologies Concatenation Tutorial

37
37
 Bandwidth growth
 Rate Comparison
 Virtual Concatenation
 Link Capacity Adjustment Scheme (LCAS)

 Application
 Standards

© 2002 Lucent Technologies Concatenation Tutorial

38
38
Mapping Data

 most Data transport is packet based

 SDH, SONET and OTN provide fixed rate channels, with virtual
concatenation and LCAS to provide the best match

 to map the different types of Data into a fixed rate channel a


new mechanism is defined:
Generic Framing Procedure (GFP)
i.e. ITU-T recommendation G.7041/Y.1303

GFP is a generic mechanism to carry any packet signal (Ethernet, Fiber


channel, ESCON) over fixed rate channels VC-n, VC-n-Xc, VC-n-Xv and
LCAS providing flexible adjustment of a VC-n-Xv channel

© 2002 Lucent Technologies Concatenation Tutorial

39
39
Generic Framing Procedure

Ethernet IP/PPP Fibre FICON ESCON other client


Channel signals
GFP - Client Specific Aspects
(payload dependent)

GFP - Common Aspects


(payload independent)

SDH/SONET path other CBR path OTN path

© 2002 Lucent Technologies Concatenation Tutorial

40
40
Generic Framing Procedure
PLI
PLI
cHEC
Frame Mapped:
cHEC Client frames are mapped into GFP
payload header frames.

GFP payload
Transparent (8B/10B) Mapped:
4 - 65535 Client Individual characters of the client
PDU signal are mapped into fixed-length
GFP frames.
(FCS)
When no frames/characters are
GFP Frame
received, idle frames are inserted.
00
00
PLI: PDU Length Indicator
cHEC PDU: Protocol Data Unit
cHEC cHEC: core - Header Error Control
FCS: Frame Check Sequence (optional)
Idle Frame
© 2002 Lucent Technologies Concatenation Tutorial

41
41
 Bandwidth growth
 Rate Comparison
 Virtual Concatenation
 Link Capacity Adjustment Scheme (LCAS)
 Application

 Standards

© 2002 Lucent Technologies Concatenation Tutorial

42
42
Standards
ITU-T
 Concatenation G.707 (10/2000)
corr 1, corr 2*, add 1*
 Link Capacity Adjustment Scheme (LCAS) G.7042/Y.1305 (11/2001)*
 Generic Framing Procedure (GFP) G.7041/Y.1303 (11/2001)*
 Equipment G.783 (02/2001)*
 Equipment G.709 (02/2001)
 Equipment Management Function G.798 (11/2001)

© 2002 Lucent Technologies Concatenation Tutorial

43
43
Standards
ANSI

 Concatenation, contiguous, virtual T1.105*


+ LCAS (equipment Specific)
 generic LCAS, refers to ITU G.7042*
 generic GFP, refers to ITU G.7041*

ETSI
 Concatenation, contiguous, virtual EN 300 417-9-1

© 2002 Lucent Technologies Concatenation Tutorial

44
44
THANK YOU

Вам также может понравиться