Generic Framing Procedure (GFP) for NG-SONET/SDH: An Overview

Enrique Hernandez-Valencia
Lucent Technologies IEEE Seminars
July 11, 2002

Outline
What is GFP? Problem Statement GFP Value Proposition GFP Model
- Frame Structure - Procedures

GFP Performance Applications:

Hybrid SONET/DATA NEs

Summary
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 2

Generic Framing Procedure - GFP

A generic mechanism to adapt multiple client traffic types as either: a physical link (Layer 1) client a logical data link (Layer 2) client

into a bit synchronous or octet-synchronous transmission channel

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 3

Outline
What is GFP?

Problem Statement
GFP Value Proposition GFP Model
- Frame Structure - Procedures

GFP Performance Applications:

Hybrid SONET/DATA NEs

Summary
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 4

The Problem: Public Multi-Service Transport

Voice Data (IP, IPX, MPLS, etc.) SANs Video

Fibre Channel*

Private Lines

Ethernet* ESCON* RPR

How to support multiple traffic types over the existing transport network infrastructure?
Applications MACs Circuits Networking Transport Channels
Enrique Hernandez-Valencia; July 2002, 2002

SONET/SDH SONET/SDH OTN OTN Fiber or WDM Fiber or WDM

* May also run directly on fiber

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 5

DVB ASI*

FICON*

The Solutions: A Fragmented Solution Space

Voice Data (IP, IPX, MPLS, etc.) SANs Video

Fibre Channel*

Private Lines Application Services MAC Services Circuit Services Networking Services Transport Services Transport Channels ATM FR

Ethernet* ESCON*
X.86

RPR

PPP
POS

HDLC SONET/SDH OTN Fiber or WDM

GFP

* May also run directly on fiber

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 6

DVB ASI*

FICON*

Example 1:
Ethernet over LAPS (ITU-T X.86)
LAPS Frame
Ethernet Frame
HDLC HDLC Address Control 1 Byte 1 Bytes 1 Bytes Flag LAPS SAPI 2 Bytes

Ethernet Frame
64-1500 Bytes

LAPS FCS
4 bytes

Flag 1 Byte

Ethernet on LAPS

LAPS over SONET/SDH (X.86)

Byte Stuffing needed!

0x7E => 0x7D5E 0x7D => 0x7D5D Excess traffic

Capacity

SONET/SDH SPE

Optimal min. bandwidth

Transport Capacity
Time

Ethernet in HDLC-like Framing

Non-deterministic transport overhead Byte stuffing interferes with QoS/bandwidth management Flag-based delineation computationally expensive as speed increases
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 7

Example 2:
Ethernet over ATM (IETF RFC 1483)
ATM/AAL5 Frame
Ethernet Frame LLC OUI PID 2 bytes
48 bytes 48 bytes 48 bytes

Ethernet Frame 64-65527 bytes

48 bytes 48 bytes
48 bytes 48 bytes 48 bytes

3 bytes 3 bytes
48 bytes

UU/CPI & FCS Length 0-47 bytes 4 bytes 4 bytes

48 bytes 48 bytes 48 bytes

Padding

Ethernet on AAL5

ATM over SONET/SDH (G.707)

Capacity

SONET/SDH SPE

Segmentation & re-assembly (SAR) needed!

SAR overhead

Optimal min. bandwidth

Transport Capacity
Time

Ethernet over ATM

Excellent QoS management capabilities Large transport overhead for small packets SAR expensive for simple connectivity services
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 8

Example 3:
Ethernet over GFP-F (ITU-T G.7041)
GFP Frame
Ethernet Frame

Core Header
4 Bytes

Payload Header
4 Bytes

Ethernet Frame
1500 Bytes

Ethernet on GFP

Ethernet on GFP

GFP over SONET/SDH (G.707/G.7041)

Capacity

SONET/SDH SPE

No Byte Stuffing or SAR needed!

No excess traffic

Optimal min. bandwidth

Transport Capacity
Time

Ethernet over GFP

Deterministic transport overhead No adaptation interference with QoS/bandwidth management Low complexity frame delineation that scales ups as speed increases
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 9

Outline
What is GFP? Problem Statement

GFP Value Proposition

GFP Model
- Frame Structure - Procedures

GFP Performance Applications:

Hybrid SONET/DATA NEs

Summary
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 10

Why GFP?
Simple and scaleable
Proven technology at 1G, 2.5G and 10G Scalable beyond 40G

Supports both Layer 1 and Layer 2 traffic

Alternative transport mechanism to ATM (ITU-T I.341.1/IETF RFC 1483) Alternative transport mechanism to HDLC-framing (ISO-3309/IETF RFC 2615)

Standards based:
ITU-T G.7041(2001) & ANSI T1.105.02 (2002) Endorsed by IETF (RFC 2823) Endorsed by RPR WG (IEEE 802.17)

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 11

Sample Applications
Channel Types: Bit-Synchronous Channel:
Dark Fiber WDM

Client Types: Physical Coding (Layer 1):

Fibre Channel FICON ESCON Gigabit Ethernet Infiniband

DVB ASI

Octet-Synchronous Channel:
SONET (T1.105.02) SDH (ITU-T G.707) OTN (ITU-T G.709)

Data Links (Layer 2):

PPP/IP/MPLS Ethernet MAPOS RPR
IEEE Seminar 2002 GFP Overview; Page 12

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

Outline
What is GFP? Problem Statement GFP Value Proposition

GFP Model
- Frame Structure - Procedures

GFP Performance Applications:

Hybrid SONET/DATA NEs

Summary
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 13

Functional Model

Ethernet

MAPOS

ESCON

Frame Mapped

GFP Client Specific Aspects (Client Dependent) GFP Common Aspects (Client Independent)

Transparent Mapped

SONET/SDH Path

OTN ODUk Path

Enrique Hernandez-Valencia; July 2002, 2002

Other Client Signals

IEEE Seminar 2002 GFP Overview; Page 14

IP/PPP

Lucent Technologies

FICON

RPR

FC

Frame Types
GFP Frames

Client Frames

Control Frames

Client Data Frames

Client Management Frames

Client Traffic Management

Idle Frames

OA&M Frames
(under study)

Client Payload Transfer

Idle Time Fills

Link OA&M

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 15

Generic Frame Structure

Payload Length MSB PTI
Payload Type MSB

PFI UPI

EXI

Client Data Frames

Payload Length LSB Core HEC MSB

Payload Type LSB Type HEC MSB Type HEC LSB

Core Header

Core HEC LSB

CID

Payload Area

Payload Header Payload Information

Fixed Length N x [536,520] or Variable Length Packets

0-60 Bytes of Extension Headers (Optional)

Spare Extension HEC MSB Extension HEC LSB Linear Extension Header shown (others may apply)

Payload FCS MSB Payload FCS Payload FCS Payload FCS LSB

Byte Transmission Order

Bit Transmission Order

Payload FCS

Client Control Frames

0x00 0x00 0x00 0x00 (0xB6) (0xAB) (0x31) (0xE0)

Idle Frame (scrambled)

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 16

Basic GFP Frame Format

GFP Frame
Core Header Payload Area Payload FCS

PLI
16 bits

cHEC
16 bits

Payload Header
4 Bytes

Payload Area
4~65,535 bytes (framed PDU)

pFCS
32 bits

GFP Frame

GFP Frame

PLI cHEC Payload Area pFCS

Enrique Hernandez-Valencia; July 2002, 2002

:= Payload Length Indicator := Core Header CRC (ITU-T CRC-16) := Framed PDU (PPP, IP, Ethernet, etc.) := Optional Payload FCS (ITU-T CRC-32)
Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 17

Payload Header := Client PDU management

Frame Structure: Summary

All GFP OAM&P functions handled via the GFP Core Header Payload Header supports any payload specific adaptation functions
Client types (Ethernet, IP, MPLS, Fibre Channel, etc.) Client multiplexing (via Extension Headers) Client link management (via Client Management Frames)

Optional Payload FCS on a per frame basis Asynchronous rate adaptation via Idle Frames

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 18

GFP Procedures
Frame Delineation Frame/Client Multiplexing Adaptation Modes Scrambling
Core Header Payload Area

Error Handling
Headers Payload

Client Management
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 19

Frame Delineation: GFP State Machine

Frame-by-Frame Core Header Correction Disabled 2nd cHEC match Frame-by-Frame Core Header Correction Enabled

Pre-Sync State
No 2nd cHEC match cHEC match

Sync State
Correctable Core Header Error

Non Correctable Core Header Error

Hunt State
No cHEC match Octet-by-Octet Core Header Correction Disabled

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 20

Frame Delineation An Example

Two consecutive cHEC field matches vs. computed CHEC Pointer-based (PLI field) offset to next incoming frame
Octet or Bit synchronous stream
cHEC cHEC Payload Area Payload Area cHEC Payload Area PLI PLI PLI

cHEC Fail Hunt State

PLI

cHEC

cHEC Fail

PLI

cHEC

cHEC Fail

PLI

cHEC

PLI

cHEC

CRC Valid

PLI Bytes
PLI cHEC

PLI Bytes
PLI cHEC

PLI Bytes

cHEC Match

cHEC Match

Hunt State
Enrique Hernandez-Valencia; July 2002, 2002

Pre-Sync State
Lucent Technologies

Sync State
IEEE Seminar 2002 GFP Overview; Page 21

Multiplexing
Frame Multiplexing via PTI field:
Client Data Frames have priority over Client Mgmt. Fames Client Management Frames have priority over Idle Frames

Client Multiplexing via Extension Headers:

Null Extension Header on dedicated transport channels per client Linear Extension Header (point-to-point configurations) Ring Extension Header (ring configuration)
Core Header
Payload Header
PTI
Payload Type MSB Payload Type LSB Type HEC MSB Type HEC LSB

PFI UPI CID Spare

EXI

Frame Muxing: PTI: Payload Type Id

Payload Area

0-60 Bytes of

Extension Headers
(Optional)

Client Muxing: EXI: Extension Hdr ID CID: Customer ID

IEEE Seminar 2002 GFP Overview; Page 22

Extension HEC MSB Extension HEC LSB

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies
Linear Extension Header shown (others may apply)

Adaptation Modes: Frame-Mapped GFP

1-to-1 mapping of L2 PDU to GFP payload UPI field indicates L2 PDU type Example: IEEE 802.3/Ethernet MAC frames
GFP- F Frame
Core Header Payload Area

PLI
2 Bytes

cHEC
2 Bytes

Payload Header
4 Bytes

Ethernet Frame
0 -65531 Bytes

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 23

Adaptation Modes: Transparent-Mapped GFP

N-to-1 mapping of L1 codewords to GFP payload Example: 8B/10B codewords
G F P -T F r a m e C o re Header PLI
2 B y te s

P a y lo a d Area P a y lo a d Header
4 Bytes

GFP FCS FCS

# N -1 #N (Optional 4 Bytes

cHEC
2 Bytes

#1

#2

8x64B/65B + 16 Superblocks

64B/65B Superblock

64B/65B 64B/65B

# #

1 2

1 |

CCL#1

CCI#1

( F la g b its c a r r i e d i n l a s t o c t e t o f t h e s u p e r - b lo c k )

CCL#n

CCI#n

6 4 B /6 5 B b l o c k (minus Flag bit)

6 4 B / 6 5 B # N- 1 64B/65B # N F1 | F2 | F8 CRC-16 MSB CRC-16 LSB

DCI#1

DCI#8-n

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 24

Scrambling: DC Balance & Payload Scrambler

Header (PLI Field + CHEC) XOR with the 32 bit value d 0xB6AB31E0 before transmission for DC balance. Payload scrambled with ATM-style self-synchronous scrambler
PLI cHEC Payload

0xB6AB31E0

43+1Scrambler x

D0

D1

...

D42

Transmission Channel
? ?????? ?? ? ?
Enrique Hernandez-Valencia; July 2002, 2002

? ? ??? ? ????

? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?? ? ? ? ? ? ? ?
IEEE Seminar 2002 GFP Overview; Page 25

Lucent Technologies

Error Handling
Multi-bit Error Detection & Correction:
Core Header cHEC (ITU-T CRC-16): Payload Type Field tHEC (ITU-T CRC-16) GFP-T payload (Optimized CRC-16)
1-bit error correction 3-bit error correction

Multi-bit Error Detection:

Payload Extension Header eHEC (ITU-T CRC-16) Payload Information Field pFCS (ITU-T CRC-32)

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 26

Client Management
Client Signal Fail (CSF) indications sent periodically upon detection of a failure/degradation event Cleared by new Client Data Frame or CSF timeout
GFP Link

CSF

Loss of Signal (LOS) Loss of Signal (LOS) Loss of Client Character Sync (LCS) Loss of Client Character Sync (LCS) Loss of clock/frame Loss of clock/frame
Running disparity violations Running disparity violations

Client Signal Fail: LOS LCS

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 27

Outline
What is GFP? Problem Statement GFP Value Proposition GFP Model
- Frame Structure - Procedures

GFP Performance
Applications:
Hybrid SONET/DATA NEs

Summary
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 28

Performance: Synchronization Loss Events

Re-sync required whenever cHEC test fails Low synchronization loss probability for typical fiber BER Example: 40Bytes PDU at 40G. Loss event frequency decreases with increasing PDU size or decreasing BER

BER
10 10 10
-7

Prob [Sync Loss]

5x10 -12 5x10 -14 5x10 -16 5x10 -18
Lucent Technologies

Frequency
~ 48 min ~ 3.3 Days ~ 1 Year ~100 Years
IEEE Seminar 2002 GFP Overview; Page 29

-8

-9

10 -10
Enrique Hernandez-Valencia; July 2002, 2002

Performance: Missed Frame Delineation Events

Low probability of frame unavailability after LOF events Essentially insensitive to random errors for practical BERs
1.00E-02 1.00E-03 1.00E-04 1.00E-05 1.00E-06 1.00E-07 1.00E-08 1.00E-09 1.E+00 40

Probability of Next Frame Unavailability

64 128 1.E-02 256 384 512 1024 1.E-04 2048 3072 4096 1.E-06 8192 16384 32768 65535

1.E-08

Typical Ethernet Operational Range

BER

Frame Size
IEEE Seminar 2002 GFP Overview; Page 30

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

Performance: Mean Time To Frame

Datalink syncs after 2 consecutive cHEC matches Fast Mean Time to Frame (MTTF) delineation Largely insensitive to BER & line rate over the region of interest for (first order approximation)
2.00

MTTF (PDUs)

1.75

Typical Ethernet Operational Range

1.50
64 12 8 38 4 51 2 25 6 10 24 30 72 81 92 20 48 40 96 16 38 4 32 76 8 65 53 5

Enrique Hernandez-Valencia; July 2002, 2002

GFP Frame Size (Octets)

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 31

Outline
What is GFP? Problem Statement GFP Value Proposition GFP Model
- Frame Structure - Procedures - Performance

Applications:
Hybrid SONET/Data NEs
Summary
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 32

Hybrid Network Elements NG SONET/Data Systems

Three basic building blocks
GFP (ITU-T G.7041/ANSI T1.105.02) Virtual Concatenation (ITU-T G.707/ANSI T1.105.02) LCAS (ITU-T G.707/ANSI T1.105.02)

Native Interfaces:
FE GbE PPP/IP/MPLS Fibre Channel FICON ESCON
Enrique Hernandez-Valencia; July 2002, 2002

1 Repeater Repeater or Store & Forward Fabric

PHY

GFP GFP EncapAdaptation sulation

L C A S

2 3 X

STS-n s (Och-n s)

(G)MII

SPI-3/4

STS-n-Xv (OCh-n-Xv)
IEEE Seminar 2002 GFP Overview; Page 33

Lucent Technologies

Hybrid Network Elements Virtual Concatenation

Multiple SONET STS-Nc (VC-n grouped into single s s) STM-N-Xv Virtual Concatenation Group (VCG)
Component STS-Nc may be routed separately s Compensates differential network delays up to 32 ms

Network Operator provisions no. of channels (X) in VCG

Solves SONET/SDH & OTN bandwidth granularity problem

Completely transparent to intermediate NEs.

Only termination nodes need to support this feature

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 34

Hybrid Network Elements Virtual Concatenation - Example

Legacy Add/Drop Multiplexer Legacy Broadband X-Connect

Virtual Concatenation

Hybrid Network Element

Virtual Concatenation

VC-n-Xv or STS-n-Xv VCG

Public Network
VC-n-Xv or STS-n-Xv VCG

Hybrid Network Element

Enrique Hernandez-Valencia; July 2002, 2002

Lucent Technologies

IEEE Seminar 2002 GFP Overview; Page 35

Hybrid Network Elements Link Capacity Adjustment Scheme (LCAS)

Controls hitless addition/removal of STS-N (VC-n s s) to/from VCG under management control
In-service hitless bandwidth modification Address the dynamic management of bandwidth for data transport services over SONET/SDH

Manages automatic removal/addition of failed/repaired STS-N from/to VCG s Supports virtual channel protection through load sharing on STS-N s
Works best on point-to-point links

ITU-T Recommendation G.7042 / ANSI T1.105.02

Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 36

GFP, Virtual Concatenation & LCAS Transport Efficiency

Traffic Type
10Mbps Ethernet 100Mbit/s Fast Ethernet 200Mbit/s (ESCON)

SONET Contiguous
STS-1 (20%) STS-3c (67%) STS-6c (66%) STS-21c (85%) STS-24c (83%)

SDH Contiguous
VC-3 (20%) VC-4 (67%) VC-4-4c (33%) VC-4-16c (35%) VC-4-16c (42%)

Virtual
VT-1.5-7v (89%) STS-1-2v (100%) STS-1-4v (100%) STS-1-18v (95%) STS-1-21v (92%)
Lucent Technologies

Virtual
VC-12-5v (92%) VC-3-2v (100%) VC-12-46v (100%) VC-3-4v (100%) VC-4-2v (66%) VC-4-6v (95%) VC-4-7v (95%)
IEEE Seminar 2002 GFP Overview; Page 37

1Gbps Fibre Channel 1Gbit/s Ethernet

Enrique Hernandez-Valencia; July 2002, 2002

Outline
What is GFP? Problem Statement GFP Value Proposition GFP Model
- Frame Structure - Procedures

GFP Performance Applications:

Hybrid WDM/TDM/DATA NEs

Summary
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 38

Summary GFP Advantages

Versatility: Enables transport services for either Layer 1 or
Layer payloads:
PPP, IP, MPLS, Ethernet, HDLC & MAPOS at Layer 2 Fibre Channel, FICON, ESCON, Infiniband, DVB ASI at Layer 1 Endorsed by multiple communities including IEEE RPR WG & IETF

Scalability: Demonstrate transport capabilities at rates from

10Mbps to 10Gbps (and soon beyond)

Simplicity: Eliminates need for ATM and HDLC networking

for simple connectivity services resulting in more efficient, lower-risk component designs

Component availability: Broader user demand expected to

drive future applications, feature maturity, interface commonality and lower cost
Enrique Hernandez-Valencia; July 2002, 2002 Lucent Technologies IEEE Seminar 2002 GFP Overview; Page 39

GFP Characteristics and Benefits

Simple Header Error Control (HEC) based synchronization:
Generalizes ATM HEC synchronization (inexpensive table lookup) s Supports variable or fixed length packets (IP/Ethernet datagrams, block codes or ATM cells)

Simple pointer-based frame delineation:

Low processing complexity without payload expansion Low (deterministic) adaptation overhead High data link efficiency (scalable to 10Gbps and beyond) Amenable to strict/loose QoS support, particularly for real-time services

Flexible traffic adaptation modes:

Frame-Mapped GFP (GFP-F): Suitable for elastic applications Transparent-Mapped GFP (GFP-T): Suitable for in-elastic applications
Enrique Hernandez-Valencia; July 2002, 2002 IEEE Seminar 2002 GFP Overview; Page 40

Lucent Technologies