Some research results for Agile All-Photonic Networks (AAPN) Gregor - - PowerPoint PPT Presentation

some research results for agile all photonic networks aapn
SMART_READER_LITE
LIVE PREVIEW

Some research results for Agile All-Photonic Networks (AAPN) Gregor - - PowerPoint PPT Presentation

Some research results for Agile All-Photonic Networks (AAPN) Gregor v. Bochmann School of I nformation Technology and Engineering (SI TE) University of Ottawa Canada http:/ / www.site.uottawa.ca/ ~ bochmann/ talks/ AAPN-results 4th Workshop


slide-1
SLIDE 1

AAPN research, 2006 1 Gregor v. Bochmann, University of Ottawa

4th Workshop on Optimization of Optical Networks - OON 2007 May 2-3, 2007 - Concordia University

Gregor v. Bochmann

School of I nformation Technology and Engineering (SI TE) University of Ottawa Canada

http:/ / www.site.uottawa.ca/ ~ bochmann/ talks/ AAPN-results

Some research results for Agile All-Photonic Networks (AAPN)

slide-2
SLIDE 2

AAPN research, 2006 2 Gregor v. Bochmann, University of Ottawa

Abstract

 Agile All-Photonic Networks (AAPN) is a Canadian research

network (funded by NSERC and 6 industrial partners) exploring the use of very fast photonic switching for building optical networks that allow the sharing (multiplexing) of a wavelength between different information flows. The aim is to bring photonic technology close to the end-user in the residential or office

  • environment. The talk gives an overview of the proposed
  • verlaid star network architecture and describes new

results on (a) bandwidth allocation algorithms, (b) the routing and protection of MPLS flows over an AAPN using the concept of OSPF areas, and (c) our evolving plans for building demonstration prototypes.

slide-3
SLIDE 3

AAPN research, 2006 3 Gregor v. Bochmann, University of Ottawa

Overview

 Overview of the AAPN project  Frame-by-frame bandwidth allocation  MPLS over AAPN  A demonstration prototype  Conclusions

slide-4
SLIDE 4

AAPN research, 2006 4 Gregor v. Bochmann, University of Ottawa

Different forms of “burst switching“

 Question: Can one do packet switching in the optical

domain (without oeo conversion)?

 At a switching speed of 1 μs, one could switch bursts of

10 μs length (typically containing many packets)

 Traditional packet switching involves packet buffering in

the switching nodes. Should one introduce optical buffers in the form of delay lines?

 The term “burst switching“ originally meant “no

buffering”: in case of conflict for an output port, one of the incoming bursts would be dropped.

 Note: Burst switching allows to share the large optical

bandwidth among several virtual connections.

slide-5
SLIDE 5

AAPN research, 2006 5 Gregor v. Bochmann, University of Ottawa

AAPN

An NSERC Research Netw ork

The Agile All-Photonic Netw ork

Project leader: David Plant, McGill University Theme 1: Netw ork architectures Gregor v. Bochmann, University of Ottaw a Theme 2: Device technologies for transmission and sw itching

slide-6
SLIDE 6

AAPN research, 2006 6 Gregor v. Bochmann, University of Ottawa

AAPN Professors (Theme 1 in red)

 McGill: Lawrence Chen, Mark Coats, Andrew Kirk, Lorne

Mason, David Plant (Theme #2 Lead), and Richard Vickers

 U. of Ottawa: Xiaoyi Bao, Gregor Bochmann (Theme #1

Lead), Trevor Hall, and Oliver Yang

 U. of Toronto: Stewart Aitchison and Ted Sargent  McMaster: Wei-Ping Huang  Queens: John Cartledge (Theme #3 Lead)  Note: Theme 2 deals with device technologies for

transmission and switching

For further information see: http://www.aapn.mcgill.ca/

slide-7
SLIDE 7

AAPN research, 2006 7 Gregor v. Bochmann, University of Ottawa

The AAPN research network

 Our vision: Connectivity “at the end of the

street” to a dynamically reconfigurable photonic network that supports high bandwidth telecommunication services.

 Technical approach:

 Simplified network architecture (overlaid stars)  Specific version of burst switching

 Fixed burst size, coordinated switching at core node for all input

ports (this requires precise synchronization between edge nodes and the core)

See for instance http://beethoven.site.uottawa.ca/dsrg/PublicDocuments/Publications/Hall05a.pdf

 Burst switching with reservation per flow (virtual connection),

either fixed or dynamically varying

See for instance http://beethoven.site.uottawa.ca/dsrg/PublicDocuments/Publications/Agus05a.pdf

slide-8
SLIDE 8

Future of Networking, Lausanne, 2005 8

Edge node with slotted transmission (e.g. 10 Gb/s capacity per wavelength) Opto-electronic interface Fast photonic core switch (one space switch per wavelength)

  • Provisions sub-

multiples of a wavelength

  • Large number of

edge nodes

Agile All-Photonic Network

Overlaid stars architecture

slide-9
SLIDE 9

AAPN research, 2006 9 Gregor v. Bochmann, University of Ottawa

Starting Assumptions

 Avoid difficult technologies such as

Wavelength conversion

Optical memory

Optical packet header recognition and replacement

 Current state of the art for data rates, channel spacing,

and optical bandwidth (e.g. 10 Gbps)

 Simplified topology based on overlaid stars  Large number of simple edge nodes (e.g. 1000)  Fixed transmission slot length (e.g. 10 sec)  No distinction between long-haul and metro networks  This requires

 Fast optical space switching (<1 sec)  Fast compensation of transmission impairments (<1 sec)

slide-10
SLIDE 10

AAPN research, 2006 10 Gregor v. Bochmann, University of Ottawa

AAPN Architecture

 Overlaid stars

Port sharing is required to allow a core node to support large numbers of edge nodes

A selector may therefore be used between edge and core nodes

A wavelength stack of bufferless transparent photonic switches is placed at the core nodes

a set of space switches, one switch for each wavelength

B 8 7 A 5 3 2 1 6

Core Node Edge Node

4

slide-11
SLIDE 11

AAPN research, 2006 11 Gregor v. Bochmann, University of Ottawa

Deployment aspects - Questions

 Long-haul or Metro ?

 connectivity “at the end of the street”; to a server farm  AANP as a backbone network ?

 High capacity (many wavelengths) or low capacity

(single or few wavelengths) ?

 Multiple core nodes ?

 For reliability  For load sharing

 Transmission infrastructure ?

 Using dedicated fibers  Using wavelength channels provided by ROADM network

slide-12
SLIDE 12

AAPN research, 2006 12 Gregor v. Bochmann, University of Ottawa

Overview

 Overview of the AAPN project  Frame-by-frame bandwidth allocation

(work by my PhD student Cheng Peng)

 MPLS over AAPN  A demonstration prototype  Conclusions

slide-13
SLIDE 13

AAPN research, 2006 13 Gregor v. Bochmann, University of Ottawa

Comparing Burst-Mode Schemes

 Long-haul AAPNs: long propagation delays

for signalling

 Two modes of slot transmission:

 With reservation (long signalling delay)  Without reservation, as proposed for “Burst Switching” (loss

probability due to collisions)

 Collaboration with Anna Agusti-Torra

(Barcelona)

 New method: Burst switching with retransmission (to avoid

losses)

 Comparison with TDM (see next slide)

 Method to avoid long signaling delays with

TDM

Allocate unused time slots; these free slots can be used without

slide-14
SLIDE 14

AAPN research, 2006 14 Gregor v. Bochmann, University of Ottawa

TDM vs. OBS

What kind of technologies should be employed in the AAPN, TDM or OBS?

The delay of OBS w/ retransmission (OBS-R) degrades sharply when the load is beyond 0.6 but is negligible at lower load.

The delay of TDM maintains better delay performance at the high load compared with OBS-R.

TDM shows a better performance than OBS-R especially at the high load.

OBS-R TDM

slide-15
SLIDE 15

AAPN research, 2006 15 Gregor v. Bochmann, University of Ottawa

Birkhoff - von Neumann Approach

 The BvN decomposition approach

calculates the timeslot schedules for a frame from the traffic demands between all node pairs.

 Two steps:

 Constructing a service matrix from a traffic matrix  Decomposing the service matrix into switch permutations.

(problem has O(N4.5) complexity)

 The main challenges of BvN

Decomposition are:

 How to construct a service matrix that closely reflects

the traffic demand for all source-destination pairs?

 How to find a heuristic decomposition algorithm with low

complexity that allows a practical implementation?

slide-16
SLIDE 16

AAPN research, 2006 16 Gregor v. Bochmann, University of Ottawa

Service matrix construction

 New algorithm:

Alternating Projections Method

Similarity Comparison

 Compared with Max-min

fairness method [7]

 The service matrices

  • btained with this

Alternating Projection method have very high measures of similarity to the original traffic matrix, with an average similarity greater than 95% for N>=32. 20 40 60 80 0.85 0.9 0.95 b) similarity of final service matrix N projection method,  = 0.5 projection method,  = 0.25 max-min fairness

slide-17
SLIDE 17

AAPN research, 2006 17 Gregor v. Bochmann, University of Ottawa

Service matrix construction: queuing delay

 Delay performance

 Long-haul scenario,

N=16, 1000km

 Tested under self-

similar traffic

 Compared with

 Max-min fairness

method [7]

 Simple rescaling

method [8]

 Conclusion:

performs better than the max-min fairness method or the simple rescaling method.

0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1000 2000 3000 4000 5000 6000 7000 8000

Offered Load Mean Queueing Delay (timeslot)

b) Alternating Projections Method Simple Rescaling Method Max-Min Fairness Method

slide-18
SLIDE 18

AAPN research, 2006 18 Gregor v. Bochmann, University of Ottawa

Heuristic decomposition algorithm

 New algorithm:

Quick BvN (QBvN)

 Long-haul scenario,

N=16, 1000km

 Tested under self-similar

traffic

 Compared with

 Benchmark: Exact

BvN

 Greedy Low Jitter

Decomposition (GLJD) [11]

Conclusions:

 excellent performance

(close to optimum)

 Low complexity O(NF) 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 10

2

10

3

10

4

Offered Load Mean Queueing Delay (timeslot)

b) QBvN EXACT GLJD

slide-19
SLIDE 19

AAPN research, 2006 19 Gregor v. Bochmann, University of Ottawa

Overview

 Overview of the AAPN project  Frame-by-frame bandwidth allocation  MPLS over AAPN

(work by my PhD student Peng He)

 A demonstration prototype  Conclusions

slide-20
SLIDE 20

AAPN research, 2006 20 Gregor v. Bochmann, University of Ottawa

IP/MPLS routing over an AAPN

Core node Edge node Edge node Edge node Edge node Edge node Edge node Core node . . . . . .

AAPN

router router router Edge node Edge node r

  • u

t e r router router

One OSPF Area

slide-21
SLIDE 21

AAPN research, 2006 21 Gregor v. Bochmann, University of Ottawa

Solving the scalability problem

Virtual Node #1

V i r t u a l N

  • d

e # 4 V i r t u a l N

  • d

e # 3

 Applying OSPF in a straightforward manner over

an AAPN:

 AAPN with N edge nodes corresponds to N x N links in

the routing table (1 000 000 links in case of 1000 edge nodes)

 Different approaches to introduce abstraction (we

speak about “virtual routers” )

slide-22
SLIDE 22

AAPN research, 2006 22 Gregor v. Bochmann, University of Ottawa

E4

E1 E3 E2 E6 E5

. . . Area #1 Area #0 Area #2

AAPN Architecture R2 R3 R1 R4 R5 R6 R8 R7

. . .

v-ABR v-ABR

Result: Optimal OSPF inter-area routes

OSPF can support multiple routing areas with only local routing information

Finding optimal inter-area routes is an open research problem

This can be solved when the OSPF areas are interconnected by an AAPN: MPLS over AAPN Traffic Engineering Framework

slide-23
SLIDE 23

AAPN research, 2006 23 Gregor v. Bochmann, University of Ottawa

Multi-layer resilience of MPLS flows over AAPN

 Using our traffic engineering framework as a

starting point, we are working on multi-layer resilience of MPLS flows over AAPN, especially for inter-area (OSPF), intra-provider inter-AS and inter-domain network environments.

IP/MPLS Resilience

End-to-end inter-area Resilience . . .

R4

Area #1 Area #0 Area #2

AAPN Architecture

. . .

R1 R4 R3 R2 R5 R6 R7 R8 E1 E2 E3 E4 E5 E6

IP/MPLS Resilience

Edge

Resilience

Edge

Resilience

AAPN Optical Resilience

Edge-to-edge Resilience

Horizontal: Multi-area Vertical: Multi-layer

slide-24
SLIDE 24

AAPN research, 2006 24 Gregor v. Bochmann, University of Ottawa

Overview

 Overview of the AAPN project  Frame-by-frame bandwidth allocation  MPLS over AAPN  A demonstration prototype

(in collaboration with the whole Theme-1 team)

 Conclusions

slide-25
SLIDE 25

AAPN research, 2006 25 Gregor v. Bochmann, University of Ottawa

Building an AAPN Control Platform

 Realizes algorithms and protocols for controlling an

AAPN

 Easily adapting to the control interfaces of different core

switches

 Easily integrating various control algorithms and protocols

developed by different AAPN Theme-1 researchers

 Initial version may be running at slower speed (using standard

PCs with optical Ethernet cards)

 Control information is exchanged through normal data blocks

(no separate control channel)

M1 Core Co-located E1 M2 E2 E3 E4 E5 Control interfaces

slide-26
SLIDE 26

AAPN research, 2006 26 Gregor v. Bochmann, University of Ottawa

Node architecture

Transmission & synchr. layer

GECM

(generic signaling protocol) Burst buffering and transmission Burst reception and packetization Packet aggregation

SECM

(edge node functions specific to bandwidth allocation algorithm in core node)

Global AAPN layer IP traffic layer

Switch control interface

slide-27
SLIDE 27

AAPN research, 2006 27 Gregor v. Bochmann, University of Ottawa

Example timing diagram

a frame period

signalling

corresponding data transfer

corresponding frame period at core node

slide-28
SLIDE 28

AAPN research, 2006 28 Gregor v. Bochmann, University of Ottawa

  • using essentially the same

control software

 “Slow” prototype: PC edge nodes, optical

Gig-Ethernet, BigBangWidth optical core switch (slow)

 Completed January 2007

 “I ntermediate” prototype, FPGA-based

 Initial version for June 2007 – various extensions planned for

2007-2008

 4 FPGAs Altera Stratix GX Development boards (4 edge nodes) with

SFP Transceivers running at 1 Gbps

 2x2 optical core switch (Civcom) with nanaseconds switching speed

running with maximum of 5 000 slots per seconds (200 microseconds)

 PCs connected to FPGAs contain all controlling software, including

slot assembly from packets and buffering (Virtual Output Queues)

 “I ntegrated” prototype

 Uses components from Theme-2 researchers: core switch,

amplifiers, etc. - transmission speed of 10 Gbps

slide-29
SLIDE 29

AAPN research, 2006 29 Gregor v. Bochmann, University of Ottawa

Conclusions

The AAPN is a fascinating research project

Premise: very fast switching and simple network architecture (overlaid stars)

Theme-1 Outcomes:

Proposal for slotted burst switching with bandwidth reservation (TDM, various allocation schemes)

Internet-integration : AAPN as an OSPF area

Theme-2 Outcomes:

Various technologies for very fast switching, amplification, RRR, etc.

Demonstration prototypes