Optical burst switched networks

Jason R Jue

Vinod M.Vokkarane

OPTICAL NETWORKS SERIES

Thu Vien DHKTCN-TN

KNV 14000708

Optical Burst Switched Networks

OPTICAL NETWORKS SERIES

Series Editor

Biswanath Mukherjee, University o f California, Davis

OPTICAL BURST SWITCHED NETWORKS

JASON P. JU E

The University of Texas at Dallas

VINOD M. VOKKARANE

University of M assachu setts Dartmouth

Jason P. Jue

The University of Texas at Dallas

Dept, of Computer Science

P.O. Box 830688

Richardson, TX 75083-0688

Vinod M. Vokkarane

University of Massachusetts, Dartmouth

Dept, of Computer & Information Science

285 Old Westport Road

North Dartmouth, MA 02747-2300

Optical Burst Switched Networks

Library of Congress Cataloging-in-Publication Data

A C.I.P. Catalogue record for this book is available

from the Library of Congress.

ISBN 0-387-23756-9 e-ISBN 0-387-23760-7 Printed on acid-free paper.

© 2005 Springer Science+Busmess Media. Inc.

All rights reserved. This work may not be translated or copied in whole or in part without

the written permission of the publisher (Springer Science+Business Media. Inc., 233 Spring

Street, New York. NY 10013, USA), except for brief excerpts in connection with reviews or

scholarly analysis. Use in connection with any form of information storage and retrieval,

electronic adaptation, computer software, or by similar or dissimilar methodology now

know or hereafter developed is forbidden.

The use in this publication of trade names, trademarks, service marks and similar terms,

even if the are not identified as such, is not to be taken as an expression of opinion as to

whether or not they are subject to proprietary rights.

Printed in the United States of America.

9 8 7 6 5 4 3 2 1 SPIN 11054542

springeronline.com

To th e m em o ry o f m y

b roth er, J eff

— J a so n P. Ju e

To m y p aren ts

V in o d M . V okkarane

Contents

D edication v

List of Figures xi

List of Tables xv

Preface xvii

1. IN T R O D U C T IO N 1

1.1 O ptical C ircuit Switching 3

1.2 O ptical Packet Switching 4

1.3 O ptical B urst Switching 6

References 9

2. T EC H N O L O G Y AND A R C H ITEC TU R E 11

2.1 OBS Network A rchitecture 11

2.2 E nabling Technology 15

2.3 Physical-Layer Issues 18

References 21

3. BU R ST ASSEMBLY 23

3.1 T im er and Threshold Selection 24

3.2 Effect of B urst Assembly on Traffic C haracteristics 26

3.3 E valuation of Threshold-Based B urst Assembly Techniques 27

References 35

4. SIGNALING 37

4.1 Classification of Signaling Schemes 37

4.2 Just-E nough-T im e (JE T ) 42

viii

4.3 T ell-and-W ait (TAW ) 44

4.4 In term e d iate N ode In itia te d (IN I) S ignaling 45

4.5 A nalytical D elay M odel 50

4.6 N um erical R esults 53

R eferences 56

5. C O N T E N T IO N R E S O L U T IO N 57

5.1 O p tical B uffering 57

5.2 W avelength Conversion 59

5.3 D eflection R o uting 60

5.4 B u rst S egm entation 61

5.5 S egm entation w ith D eflection 66

5.6 C ontention R esolution an d QoS 76

R eferences 77

6. C H A N N EL SC H ED U LIN G 81

6.1 S egm entation-B ased C hannel Scheduling 86

6.2 OBS C ore N ode A rchitecture 88

6.3 S egm entation-B ased N on-P reem ptive S cheduling A lgorithm s

89

6.4 S egm entation-B ased N on-P reem ptive Scheduling A lgorithm s

w ith F D L s 94

6.5 N um erical R esults 98

R eferences 104

7. Q U A LITY O F SER V IC E 107

7.1 R elative QoS in OBS N etw orks 108

7.2 A bsolute QoS 122

References 130

8. O T H E R T O P IC S 133

8.1 L abeled OBS 133

8.2 M u lticastin g in OBS 135

8.3 P ro te ctio n for O ptical B urst-S w itched N etw orks 136

8.4 T C P over OBS 138

8.5 OBS T estbeds 14 1

R eferences 142

I

Contents

Index

ỉ

List o f Figures

1.1 Evolution of optical tran sp o rt m ethodologies. 1

1.2 A photonic packet-sw itch architecture. 4

1.3 T h e use of offset tim e in OBS. 6

1.4 C om parison of the different all-optical netw ork tech￾nologies. 7

2.1 OBS Network A rchitecture 12

2.2 OBS functional diagram . 13

2.3 Architecture of Core Router. 14

2.4 A rchitecture of Edge Router. 14

2.5 M EM S switch. 16

2.6 Sem iconductor optical am plifier (SOA) sw itch. 16

3.1 Effect of load on timer-based and threshold-based aggrega￾tion techniques. 25

3.2 NSF network with 14 nodes (distances in km). 29

3.3 The graphs for DP and SDP with single threshold and no

burst priority in the network, (a) Packet loss probabil￾ity versus load, (b) Packet loss probability versus varying

threshold values. 31

3.4 The graphs for SDP with single threshold and two burst

priorities in the network. Packet loss probability versus load

for different threshold values. 32

3.5 The graphs for SDP with single threshold and two burst pri￾orities in the network. Packet loss probability versus thresh￾old for both classes of packets at a load of 0.5 Erlang. 33

3.6 The graphs for SDP with two thresholds and no burst pri￾ority in the network Packet loss probability versus varying

both threshold values for both priorities. 34

3.7 The graphs for SDP with two threshold and two burst pri￾orities in the network Packet loss probability versus varying

threshold values for both priorities. 35

4.1 Signaling Classification. 38

4.2 Reservation and Release Mechanisms in OBS. 41

4.3 Just-Enough-Tim e (JE T ) signaling technique. 43

4 .4 Com parison of (a) JE T and (b) JIT based signaling. 44

4.5 Tell-and-W ait (TAW) signaling technique. 46

4.6 Interm ediate Node Initiated (INI) Signaling Technique. 48

4 .7 14-node NSF backbone network topology (distance in km ). 53

4.8 (a) B urst loss probability versus load, and (b) Average end￾to-end delay versus load, when the initiating nodes are source,

first hop, second hop. third hop, and destination. 54

4.9 (a) B urst loss probability versus load, and (b) Average end￾to-end delay versus load, when the initiating nodes is source,

center hop, and destination in the same network to provide

differentiation through signaling. 55

5.1 Segm ents header details. 63

5.2 Selective segm ent dropping for two contending b u rsts. 63

5.3 T railer packet effective. 65

5.4 T railer packet ineffective. 65

5.5 Segm entation w ith deflection policy for two con￾tending bursts. 66

5.6 NSF network with 14 nodes (distances in km). 70

5.7 Packet loss probability versus load for N S F N E T at

low loads w ith ^ = 100 n s and Poisson bu rst arrivals. 71

5.8 Packet loss probability versus load for N S F N E T at

high loads w ith ^ = 100 /is and Poisson b u rst arrivals. 72

5.9 A verage num ber of hops versus load for N S F N E T

w ith ^ = 100 ^s and Poisson burst arrivals. 73

5.10 Average o u tp u t bu rst size versus load for N S F N E T

w ith ^ = 100 /is and Poisson bu rst arrivals. 73

5.11 Packet loss probability versus load at varying sw itch￾ing tim es for N SFN ET w ith ^ = 100/iS and Pois￾son bu rst arrivals. 74

i L ist o f Figures

I

5.12 Packet loss probability versus load for N SFN ET

w ith P areto burst arrivals.

5.13 Average num ber of hops versus load for N SFN ET

w ith P areto burst arrivals.

5.14 Average o u tp u t burst size versus load for N SFN ET

w ith P areto burst arrivals.

6.1 Initial data channel status (a) without void filling (b) with

void filling.

6.2 Channel assignment after using (a) non void filling algo￾rithm s (FFU C and LAUC), and (b) void filling algorithms

(FFU C-VF and LAUC-VF).

6.3 Block diagram of an OBS core node.

6.4 (a) Input-buffer FDL Architecture, and (b) O utput-buffer

FDL Architecture.

6.5 Initial d ata channel assignment using a) non-void filling and

b) void filling scheduling.

6.6 Illustration of non-preemptive (a) NP-MOC scheduling al￾gorithm , and (b) NP-MOC-VF scheduling algorithm.

6 .7 Illustration of (a) NP-DFMOC algorithm, and (b) NP-DFM OC￾VF algorithm.

6.8 Illustration of (a) NP-SFMOC algorithm, and (b) NP-SFM OC￾VF algorithm.

6.9 14-Node NSF Network.

6.10 (a) Packet loss probability versus load, and (b) average end￾to-end delay versus load for different scheduling algorithms

with 8 data channels on each link, for the NSF network.

6.11 (a) Packet loss probability versus load, and (b) average per￾hop FDL delay versus load for different scheduling algo￾rithm s with 8 data channels on each links and FDLs, for

the NSF network.

7.1 (a) Contention of a low-priority burst with a high-priority

burst, (b) Contention of a high-priority burst with a low￾priority burst, (c) Contention of equal priority bursts with

longer contending burst, (d) Contention of equal priority

bursts with shorter contending burst.

7.2 Packet loss probability versus load.

7.3 Average packet delay versus load.

7.4 Single class per burst.

7.5 Composite burst.

L ist of Figures xm

75

76

77

83

84

88

90

92

93

95

96

100

101

102

112

113

113

117

117

List of Figures

7.6 Packet loss probability versus load. 119

7.7 Average delay versus load. 119

7.8 (a) S tan d ard D ropping M echanism , and (b) E arly

D ropping M echanism. 124

7.9 Illu stratio n of (a) SW G, and (b) DW G schemes. 127

7.10 (a) Class 0 and (b) Class 1 loss probability versus

load for ED S, E D T and P ro p o rtio n al schemes. 128

7.11 Illu stratio n of the integrated schemes. 130

8.1 Sem iconductor optical am plifier (SOA) sw itch. 135

I