2 1 SoftwareDescription Neu

Section 2 · Module 1 · Page 1

All Rights Reserved © Alcatel-Lucent 2008Issue 02

Do not delete this graphic elements in here:

All Rights Reserved © Alcatel-Lucent 2008

Module 1Software Description

Issue 02

Section 2Functional Description

Alcatel-Lucent GMRE+ASONOperation Rel.3.2

3FL35093AAAAZZZZZ Issue Ed02




Alcatel-Lucent GMRE+ASON · Operation Rel.3.2Functional Description · Software Description2 · 1 · 2

Blank Page

This page is left blank intentionally

First editionBelgard, Steffen2006-06-0101

RemarksAuthorDateEdition

Document History





Module Objectives

Upon completion of this module, you should be able to:

Study the different software layers

Learn about the control and software sub-system of 1678 MCC

Get to know the different GMRE processes

Understand the basic process inter-working of GMRE





Module Objectives [cont.]






Table of Contents

Switch to notes view! Page

1 Software Layers 71.1 FLC Software Layers 8

2 Processes 92.1 Overview 102.2 Interworking 112.3 Lambda Gate Adapter 122.4 Link Manager 132.5 Path Manager 142.6 Signaling Handler 152.7 Routing Handler 162.8 CORBA Communication 172.9 Process Dependency 18

3 Process Interworking 193.1 Path Setup 20

4 Summarize Test 214.1 Answer the questions 22

5 Fragmentation Avoidance 235.1 CSPF and OSPF 245.2 Fragmentation Costs 25





Table of Contents [cont.]

Switch to notes view!






1 Software Layers





1 Software Layers

1.1 FLC Software Layers

1678 MCC HardwareFLC (EM, D

CR)FLC PlatformCORE-xxx

FLC ApplicationSoftware ION

ION-zzz(optional)

Linux Kernel

FLC runtim

e environment

Support tools

FLC ApplicationSoftwareSKY-yyy

SSU, V

HM, CSS,

QIA,

PMMgr, MIB

GMRE Processes

FLC Platform:

Core, MENMON, RAWLOADER, MontaVista Linux

FLC Application Processes:

CSS Control System Server

SSU System Supervision Unit

PmMgr Performance Manager

VHM Virtual Hardware Manager

MIB Management Information Base

QIA Q-Interface Adapter

FLC Application Software ION

GMRE Generalized MPLS Routing Engine





2 Processes





FLC

2 Processes

2.1 Overview

DCR

Genesis

U-Boot

Linux(via NFS)

On Board LAN switch

DiskDCC

Server

EM

MENMON1

MENMON2

Linux(disk)

Matrix HO Copy B

SLC

Matrix HO Copy A

SLC

GMRE_MAGMRE_CNGMRE_PMGMRE_LGA

GMRE_LMGMRE_RHGMRE_SH_UNIGMRE_SH_NNI

GMRE is situated on the FLC of the 1678 MCC which contains two different controller:

EM:

The EM 04A (Embedded Module) comes with:

Bootloader (MENMON1, MENMON2).

A fully installed EM is running a Linux operating system installed on the hard disc.

Filessystem

DCR:The DCR (DCC Router) has the GENESIS equipped with:

Bootloader as fix part and the U-Boot as exchangeable part.

The Linux is loaded via NFS (Network File System) over a separated LAN connection from EM. Therefore the DCR needs a running Linux at the EM module.

GMRE_MA: Management Agent

GMRE_CN: Corba Network Management Interface

GMRE_PM: Path Management

GMRE_LGA: Lamda Gate Adapter (NE Adapter)

GMRE_PH: Policy Handler

GMRE_CPR: Control Plane Routing

GMRE_LM: Link Management

GMRE_RH: Route Handler

GMRE_SH: Signaling Handler for NNI and UNI





2 Processes

2.2 Interworking

Management Agent

CLI

GMRE Persistency

LGA

RM ASON

SH

MIB

LM

RH

PM

CN

LSP

Data/Transport Plane

Management Plane

Control Plane

GMRE process interworking:

The CLI commandos are translated by the Management Agent and forwarded to the right instance.

The CN allows the communication to the G.ASON Manager via CORBA

The Management Agent read and writes the configuration in the persistency. (No LSP)

Log files are written to disk since release 3.2

The Link Manager manages the links:

Dataplane: HO links with/without concateneation, LO, GBEthernet

Controlplane: DCC, OOB tunnels, GR, Alarms, Priorities and Preemption, LMP (Auto Discovery)

The Lambda Gate Adapter connects with the NE to synchronize the dataplane

The Path Manager is responsible for Label Switched Paths (LSP)

It has ist own persistency for the paths

The Route Handler routes the network via OSPF

Contains CSPF algorithm, routing tables

Responsible for E-NNI

The Signalling Handler implements RSVP to reserve and dereserve LSPs

GMRE_SH_UNI: Signalling to RSVP client routers

GMRE_SH_NNI: Signaling inside the network between GMRE instances





2 Processes

2.3 Lambda Gate Adapter

Management Agent

CLI

LGASH

MIB

LM

RH

PM

CN

LSP

GMRE Persistency

Network Element Adapter

Message Adapter

Manages Cross Connections

Gets Hardware Alarms

Implements Sub Network Connections in hardware





2 Processes

2.4 Link Manager

Management Agent

CLI

LGASH

MIB

LM

RH

PM

CN

LSP

GMRE Persistency

AutoDiscovery

Detects DataPlane

Manages Links

Data plane

VC3, VC4

Low Order

Gigabit Ethernet

Control plane

Data Communication Channels

Alarms

Priorities





2 Processes

2.5 Path Manager

Management Agent

CLI

LGASH

MIB

LM

RH

PM

CN

LSP

GMRE Persistency

Manages Label Switched Paths

Own persistency for Label Switched Paths





2 Processes

2.6 Signaling Handler

Management Agent

CLI

LGASH

MIB

LM

RH

PM

CN

LSP

GMRE Persistency

RSVP

Implementation of RSVP

Allocates and de-allocates routes

RSVP message handling





2 Processes

2.7 Routing Handler

Management Agent

CLI

LGASH

MIB

LM

RH

PM

CN

LSP

GMRE Persistency

OSPF

Implementation of OSPF

Includes Routing tables

Network Fragmentation Avoidence (see chapter 5)

E-NNI

Distributes configuration messages

Receives messages from neighbors





2 Processes

2.8 CORBA Communication

Management Agent

CLI

LGASH

MIB

LM

RH

PM

CN

LSP

GMRE Persistency

Implementation of CORBA

CORBA: Common Object Request Broker Architecture

Provides remote procedure calls between NM and NE

Translation of NM commands in NE commands

Feeds notification server with information





2 Processes

2.9 Process Dependency

On dieing of any GMRE processCLI displays a “Degraded“ state

On restarting a processAll other processes try a reconnect to the failing process

Exception PM and SH“Joined Twins“Should not live without otherOn failing inter process communication, the living process will suicideThe RSVP related Finite State Machines of PM and SH will only be maintained synchronized, if they both have the same starting time phase.





3 Process Interworking





3 Process Interworking

3.1 Path Setup

Management Agent

CLI

LGA

NMS

SH

MIB

LM

RH

PM

CN

LSP

GMRE Persistency

Path setup Requests arrive from

CLI

Corba

SH UNI

The request is send to the Path Manager

PM requests route calculation from RH

PM requests Label (TP) allocation from LM

PM sends downstream path setup signaling request to SH

PM sends cross connection creation request to NE via LGA

PM stores the path information in Persitency

For protection services, PM repeats steps 2 – 6 for the 2nd leg of SNCP or back-up paths again.





4 Summarize Test





4 Summarize Test

4.1 Answer the questions

What do these abbreviations mean?ION: LGA:FLC: LM:MA: RH:CN: SH:PM: MIB:

What will happen, if the SH is down?The whole system will reboot.All neighbor nodes will be alarmed.The Path Manager will be shut down.The LM recovers the data from the data plane.

Are all cross connections lost on a loss of the PM‘s persistency?Yes.No.





5 Fragmentation Avoidance






5.1 CSPF and OSPF

Routing Database

Routing Database after CSPF

route = NODE#TE-LINK/DATABEARER/LABEL, NODE#TE-LINK/DATABEARER/LABEL, ...

CSPF

OSPF

CSPF: Contrained Shortest Path First

OSPF: Open Shortest Path First

CSPF and OSPF are implemented in the RH.

OSPF transfer protocol is used with Traffic Engineering Extensions (OSPF-TE) to exchange all the necessary information about Te-Links for GMPLS (SDH/SONET in our case).

The routing information is stored locally in a database (in memory).

When there is a route calculation request, first CSPF is used to filter the database and then the shortest path is calculated (OSPF) from the resulting filtered database.

The constraints use to filter out the database with the CSPF algorithm are:

Traffic type: Vc3, Vc4, Vc4-4c, Vc-16c & Vc4-64c

Fragmentation costs (see next page)

Any exclude Te-Link or SRG constraints (for diversity)

Any include Te-Links constraints for re-using active route

Path Priority for pre-emption

The OSPF route calculation algorithm on the resulting filtered database finds :

The shortest path based on link costs only (not number of Hops or nodes)

If there are more than one possible path with the same link cost, then the fragmentation costs (see next page) is used to decide

If there are more than one possible path with the same link cost and fragmentation cost, then one is randomly picked.





What happens if there are two "shortest paths"?

Consider 2 STM-64 links with the following free resources

Network Fragmentation:Link A = 3, Link B = 0


5.2 Fragmentation Costs

34VC4-16c

01VC4-64c

1516VC4-4c

6364VC4

190192VC3

Link BLink ALSP Traffic

Further information on Fragmentation costs:

When filtering the routing database for the required Traffic type, the associated fragmentation cost attribute is added to the link.

Consider 2 STM-64 links with the following free resources

Link A (empty) Link B

Vc3 192 190

Vc4 64 63

Vc4-4c 16 15

Vc4-16c 4 3

Vc4-64c 1 0

Link B has already used up 2x Vc3 Labels

If a route is required for a Vc4 Label, the fragmentation cost of Link A is 3 while that of Link B is zero

Link A would 'destroy' 1x Vc4-4c + 1x Vc4-16c + 1x Vc4-64c

Link B would not destroy any more higher concatenation levels

Layer Software





End of ModuleSoftware Description

Documents

2 1 SoftwareDescription Neu