Dynamic control method of queuing delay with/without OEO conversion - - PowerPoint PPT Presentation

dynamic control method of queuing delay with without oeo
SMART_READER_LITE
LIVE PREVIEW

Dynamic control method of queuing delay with/without OEO conversion - - PowerPoint PPT Presentation

Dynamic control method of queuing delay with/without OEO conversion in a multi stage access network a multi-stage access network 2012 3 6 2012.3.6 Tatsuya Shimada Noriko Iiyama Hideaki Kimura Tatsuya Shimada, Noriko Iiyama, Hideaki Kimura


slide-1
SLIDE 1

Dynamic control method of queuing delay with/without OEO conversion in a multi stage access network a multi-stage access network

2012 3 6 2012.3.6 Tatsuya Shimada Noriko Iiyama Hideaki Kimura Tatsuya Shimada, Noriko Iiyama, Hideaki Kimura and Hisaya Hadama

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

NTT Access Network Service Systems Laboratories

slide-2
SLIDE 2

Outline 1 Background 2 Network configuration g 3 Dynamic control method of queuing delay 4 Characteristics and parameter setup 5 Summary

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n
slide-3
SLIDE 3

1 Background - - Future services - - Various services must be supported in future access network.

The future access network must support various aspects of QoS such as pp p Q bandwidth and delay performance that each service requires. TMS (Tiny bandwidth Mass Service), BCS (Broadband Consumer Service). HBS (Huge bandwidth Service) HBS (Huge bandwidth Service)

Mass TMS

New service dom ains ( Categories)

Number of networked terminals

BCS

RFID tags sensors actuators etc. di iti ti f

HBS

Interactive video com m unication ( Categories)

Ti

terminals

H Small

digitization of various events in the real world. com m unication, circulation of CGM, cloud- com puting,CDN etc. Huge data center, high quality com m unication with realistic sensation etc.

Tiny Communication bandwidth Huge

Current netw ork services ( VoI P, W eb, P2 P etc.)

Fig 1 Classification of network services in the future

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

( Ref) http://www.itu.int/ITU-T/focusgroups/fn/output.html#2nd

Fig.1 Classification of network services in the future

slide-4
SLIDE 4

Future network

ITU-T Y.3001 (2011/5) Future Networks : Objectives and Design Goals

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n
slide-5
SLIDE 5

Challenge

①The queuing buffer size must be designed according to peak rate.

O N U # 1 O L T P D # 1 B u f f e r # 1 W D M

  • P

O N R

  • u

n d R

  • b

i n A g g r e g a t i

  • n

O N U # 1 O L T P D # 1 B u f f e r # 1 W D M

  • P

O N R

  • u

n d R

  • b

i n A g g r e g a t i

  • n

g g p

O N U # 2 A g g r e g a t i

  • n

P D # 2 B u f f e r # 2 L D

… …

O N U # 2 A g g r e g a t i

  • n

P D # 2 B u f f e r # 2 L D

… …

O N U # N P D # N B u f f e r # N

… …

O N U # N P D # N B u f f e r # N

… …

② The procedure of reading out upstream signals at the queuing buffer becomes Traffic fluctuation

Huge

g q g exceedingly complex to support QoS metrics like latency.

g Tiny

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

Tiny Time

slide-6
SLIDE 6

Multi-stage access network

New access network with multi-access points and multi-service planes supporting quality (bandwidth, delay performance) of each service.

Service #N aggregation

drop Access Point#N (OLT#N) add Service #2 regenerate aggregation A P i t#2 regenerate drop add regenerate aggregation Access Point#2 (OLT#2) Service #1 Each user regenerate drop add Each user regenerate Access Point#1 (OLT#1)

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

Merit: low delay performance, avoiding traffic congestion …

(OLT#1)

slide-7
SLIDE 7

(Reference) Elastic OLT technology Various distance without OEO

TMS BPS HBS (reference) Special Feature: “Towards Ultrahigh-speed High-capacity Networks”

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

(reference) Special Feature: Towards Ultrahigh-speed High-capacity Networks NTT Technical Journal, vol.7, no.5, May 2009.

slide-8
SLIDE 8

2 Network configuration -- upstream OLT --

【 Upstream OLT】 Checking header information

Header

information

Matched signals Buffer PD Control Drop Buffer FDL Plane#N SOA ONU Access Point

Corresponds to time E h d

OFF ON OFF ON

Corresponds to time

  • f checking header

Erase matched signals

If the signals match a service, the matched signals are sent to a drop buffer.

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

The control part turns the SOA bias OFF and erases the matched signal.

slide-9
SLIDE 9

2 Network configuration -- upstream OLT--

【 Upstream OLT】 Checking header information

Header

information

Buffer PD Control Drop Buffer FDL Plane#N SOA ONU Access Point

Corresponds to time

OFF ON OFF ON

Corresponds to time

  • f checking header

Regenerates NOT matched signals

ON

If the signals do not match a service, the unmatched signals are sent to the

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

next access point. The control part turns the SOA bias ON for regeneration.

slide-10
SLIDE 10

2 Network configuration -- downstream OLT --

【 Downstream OLT】

A downstream OLT needs a function for added signals

C t l Add Buffer Header NOT added signals No modulation Buffer PD Control FDL No modulation SOA Access Point ONU MOD EDFA Point

Corresponds to time

  • f checking header

Regenerates all signals

If no signals are present in the add buffer, all the signals are regenerated in

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

the SOA.

slide-11
SLIDE 11

2 Network configuration -- downstream OLT --

Add Buffer

【 Downstream OLT】

Control Add Buffer Header added signals buffer signals Buffer PD FDL EDFA added signals buffer signals SOA Access Point ONU MOD

Erase signals with data Erase signals with data rewrite technique Modulate buffer signals and added signals

If signals are present in the add buffer, the downstream signals are erased by SOA optical saturation using a data rewrite technique. Then the buffer signals

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

and added signals are modulated.

slide-12
SLIDE 12

(Reference) data rewrite technique

Erase signals with SOA

  • ptical saturation region
  • ptical saturation region

CW

  • S. Narikawa et al., “Gbit-class transmission using

SOA data rewriter for WDM-PON,” pp.399-408 IEICE TRANS COMMUN., vol.E91-B, No.2 Feb. 2008.

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n
slide-13
SLIDE 13

3 Dynamic control method of queuing delay

The system cannot control the number of OEO conversions because the transmission of downstream signals with or without OEO conversions depends transmission of downstream signals with or without OEO conversions depends

  • n the bandwidth of the added signals and the changes caused by the

fluctuation of this bandwidth. Therefore, the system cannot satisfy the delay performance requirements of each service performance requirements of each service.

Control Add Buffer

With OEO conversion

Buffer PD FDL EDFA SOA MOD EDFA

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

Without OEO conversion

slide-14
SLIDE 14

3 Dynamic control method of queuing delay

Token packet method

<Decision Criterion>

Checking part

frame length > the total number of token : without OEO conversion (O/O mode) frame length < the total number of token : with OEO conversion (O/E/O mode)

Controller Add Buffer Badd : bandwidth

  • f added signal

g p Buffer PD T: cycle R: the number of tokens Token0: initial value Lopt : frame length Total number of tokens SOA FDL EDFA subtracted tokens

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

SO Bopt : bandwidth of downstream signal

slide-15
SLIDE 15

3 Dynamic control method of queuing delay 【 Control#1】 Token criteria + status of collision

When the downstream signal d t llid ith dd d does not collides with added signal, the downstream signal can be transmitted in the O/O mode even if the total number of tokens is smaller than frame length. g

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n
slide-16
SLIDE 16

3 Dynamic control method of queuing delay 【 Control#2】 Only Token criteria

If th t t l b f t k If the total number of tokens is larger than frame length of the just received downstream signal, the added signal waits even if it arrived before the downstream signal. At the same time, the downstream signal can be transmitted in O/O mode. O/O mode.

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n
slide-17
SLIDE 17

4 Characteristics and parameter setup To investigate the characteristics of each token parameter (R, T, and Token0) and how to set up these parameters to achieve the ) p p required number of OEO conversions, we estimated the OEO conversion ratio, the ratio of the number of downstream signals sent under O/E/O mode to the total number of downstream signals.

<Simulation parameter> Transmission rate : 1 Gbit/s Optical packet bandwidth (Bopt) : 250Mbit/s, 500Mbit/s Added signal bandwidth (Badd) : 250Mbit/s, 500Mbit/s F l h L 64 1 18 b Frame length Lopt : 64-1518 bytes (Header length : 14 bytes , Data length : 46-1500bytes, frame check sequence : 4 bytes) M d l P i

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n

Model : Poisson process

slide-18
SLIDE 18

4 Characteristics and parameter setup

【 Control#1】 Token criteria + status of collision

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n
slide-19
SLIDE 19

4 Characteristics and parameter setup

【 Control#2】 Token criteria Bopt=500Mbit/s Badd=250,500Mbit/s Bopt=250Mbit/s Badd=250,500Mbit/s

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n
slide-20
SLIDE 20

4 Characteristics and parameter setup

The system can also control the number of OEO conversions by adjusting The system can also control the number of OEO conversions by adjusting Token0 and R.

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n
slide-21
SLIDE 21

4 Characteristics and parameter setup <Set up procedure> (1) Set the OEO conversion ratio (2) Check each bandwidth (2) Check each bandwidth (3) Set the number of tokens, R, the cycle given for the number of tokens T and the initial value of the number of tokens Token0 by tokens, T, and the initial value of the number of tokens, Token0, by looking up the database. // Repeat the abo e proced re at reg lar inter al // Repeat the above procedure at regular interval.

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n
slide-22
SLIDE 22

5 Summary

  • We proposed the dynamic control method of queuing delay

that uses a token bucket technique.

  • We clarified the relationships between the number of OEO

p conversions and the token parameters. Various QoS services can be supported in future !!

C

  • p

y r i g h t ( c ) 2 1 2N T T C

  • r

p

  • r

a t i

  • n