Presentation is loading. Please wait.

Presentation is loading. Please wait.

TCP over OBS Joint Work with F. Baccelli, D. Hong, G. Petit, F. Poppe Julien Reynier Article available at

Published byEleanore Riley Modified over 9 years ago

Similar presentations

Presentation on theme: "TCP over OBS Joint Work with F. Baccelli, D. Hong, G. Petit, F. Poppe Julien Reynier Article available at"— Presentation transcript:

1 TCP over OBS Joint Work with F. Baccelli, D. Hong, G. Petit, F. Poppe Julien Reynier Article available at http://www.eleves.ens.fr/home/jreynier/http://www.eleves.ens.fr/home/jreynier/

2 Capacity requirements of common services — 2 All rights reserved © 2002, Alcatel Overview > Introduction > Optical Burst Switching (OBS) : description > FDL > Optimization problem > The formula > Conclusion

3 Capacity requirements of common services — 3 All rights reserved © 2002, Alcatel Goal > Understand the interaction between TCP and physical layers for data transmission over OBS > OBS : Optical Burst Switching TCP layer IP layer OBS layer opticalelectrical

4 Capacity requirements of common services — 4 All rights reserved © 2002, Alcatel Overview > Introduction > Optical Burst Switching (OBS) : description > FDL > Optimization problem > The formula > Conclusion

5 Capacity requirements of common services — 5 All rights reserved © 2002, Alcatel Situation Optical Burst Switching : Optimize burst size Burstification of IP packets into Data Bursts (DBs) IP router OBS edge router OBS core router DWDM link Electronic processing of Burst Header Packets (BHPs) IP packets BHP Channel Group (CG) control (CCG) data (DCG)

6 Capacity requirements of common services — 6 All rights reserved © 2002, Alcatel Situation Optical Burst Switching IP router OBS Ingress edge router OBS core router DBs are routed in the optical domain IP packets DB Bursts disassembly

7 Capacity requirements of common services — 7 All rights reserved © 2002, Alcatel Specificity of OBS > At the ingress edge router, IP packets are assembled in lrager processing units, namely the Data Bursts (DBs). The loss of a single DB is the loss of many TCP-IP packets at the same time. > In the core routers, bursts wait in a queue implemented with optical fibers : the Fiber Delay Lines (FDLs). Bursts are not released as soon as the link becomes ready. – “Classical” queuing models do not work. Certain methods as Void Filling mitigate this effect. – The drawback is a complex architecture and a possible reordering of bursts, therefore of IP packets. Classical queue FDL length D

8 Capacity requirements of common services — 8 All rights reserved © 2002, Alcatel Overview > Introduction > Optical Burst Switching (OBS) : description > FDL > Optimization problem > The formula > Conclusion

9 Capacity requirements of common services — 9 All rights reserved © 2002, Alcatel FDL and a classical queue : > Without FDL : > With FDL : > The Void size is :

10 Capacity requirements of common services — 10 All rights reserved © 2002, Alcatel Voids TnTn T n+1 T n +kDT n+1 +k’D input : output : nn VnVn

11 Capacity requirements of common services — 11 All rights reserved © 2002, Alcatel Load factor for an FDL with infinite capacity

12 Capacity requirements of common services — 12 All rights reserved © 2002, Alcatel Example of an FDL workload Workload distribution of an FDL queue and for an M/M/1 queue with the same equivalent load D=0.1 hpkt  =7.8 1/hpkt =1 hpkt/s 1 hpkt=100 IP- packets  ’=95%

13 Capacity requirements of common services — 13 All rights reserved © 2002, Alcatel Loss rate due to buffer overflow with FDL b=1/  B=8D =1/b’ B:buffer D:delay line b:burst size b’:burst size + void size The loss rate at a “congestion epoch” is affine for a large range of values.

14 Capacity requirements of common services — 14 All rights reserved © 2002, Alcatel Overview > Introduction > Optical Burst Switching (OBS) : description > FDL > Optimization problem > The formula > Conclusion

15 Capacity requirements of common services — 15 All rights reserved © 2002, Alcatel Notation N sources TCP- controlled Link capacity C Queue size B RTT R Bottleneck router > N users share a bottleneck router with capacity C (Mb/s) with queue size B (byte), their RTT being R (ms).

16 Capacity requirements of common services — 16 All rights reserved © 2002, Alcatel Small bursts or large bursts ? > For large bursts Lower bandwidth waste due to guard bands – OBS needs time to reconfigure its switching array Lower processing time inside nodes > For small bursts Lower synchronization between sources due to TCP Lower burst formation time

17 Capacity requirements of common services — 17 All rights reserved © 2002, Alcatel Synchronization - AIMD > TCP is AIMD : Additive Increase, Multiplicative decrease > The proportion of sources that lose packets at that time is the synchronization X(t)X(t) t X ( t ) = throughput seen by a user T i = congestion epochs in the network TiTi T i-2 T2T2 TETE T1T1 TSTS Congestion avoidance: additive increase, multiplicative decrease T3T3 T i-1 T i-3 Slow startAdditiveIncreaseMultiplicativeDecrease

18 Capacity requirements of common services — 18 All rights reserved © 2002, Alcatel Overview > Introduction > Optical Burst Switching (OBS) : description > FDL > Optimization problem > The formula > Conclusion

19 Capacity requirements of common services — 19 All rights reserved © 2002, Alcatel AIMD framework The goodput is : The synchronization p(b,D) is : The AIMD framework models the impact of losses on the TCP- bandwidth. AIMD : “The AIMD model” : Infocom ‘02 by F. Baccelli et D. Hong

20 Capacity requirements of common services — 20 All rights reserved © 2002, Alcatel Formula  The study of FDL allows one to deduct the ratio of lost busts from the bandwidth.  This leads to a simple formula : For X=B/2 and Y=1/2

21 Capacity requirements of common services — 21 All rights reserved © 2002, Alcatel Overview > Introduction > Optical Burst Switching (OBS) : description > FDL > Optimization problem > The formula > Conclusion

22 Capacity requirements of common services — 22 All rights reserved © 2002, Alcatel Our results > Model FDL > Determine impact of burst size on aggregate TCP throughput the impact of FDL on synchronization of TCP sources the AIMD model allows one to find the bandwidth. > Determine the optimal burst size maximize the bandwidth. minimize the bandwidth waste due to OBS (Burst Header Packets, voids, guard bands).

23 Capacity requirements of common services — 23 All rights reserved © 2002, Alcatel Further research > A better representation of the increase of RTT due to burstification > Model Void Filling > Core routers with wavelength converters

24 www.alcatel.com

25 Capacity requirements of common services — 25 All rights reserved © 2002, Alcatel Backup slides

Download ppt "TCP over OBS Joint Work with F. Baccelli, D. Hong, G. Petit, F. Poppe Julien Reynier Article available at"

Similar presentations

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
QoS Strategy in DiffServ aware MPLS environment Teerapat Sanguankotchakorn, D.Eng. Telecommunications Program, School of Advanced Technologies Asian Institute.

QoS Strategy in DiffServ aware MPLS environment Teerapat Sanguankotchakorn, D.Eng. Telecommunications Program, School of Advanced Technologies Asian Institute.
Spring 2000CS 4611 Introduction Outline Statistical Multiplexing Inter-Process Communication Network Architecture Performance Metrics.

Spring 2000CS 4611 Introduction Outline Statistical Multiplexing Inter-Process Communication Network Architecture Performance Metrics.
Principles of Congestion Control Chapter 3.6 Computer Networking: A top-down approach.

Principles of Congestion Control Chapter 3.6 Computer Networking: A top-down approach.
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.

Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
CS640: Introduction to Computer Networks Mozafar Bag-Mohammadi Lecture 3 TCP Congestion Control.

CS640: Introduction to Computer Networks Mozafar Bag-Mohammadi Lecture 3 TCP Congestion Control.
15-441 Computer Networking Lecture 17 – TCP & Congestion Control Dejian Ye, Liu Xin.

Computer Networking Lecture 17 – TCP & Congestion Control Dejian Ye, Liu Xin.
Congestion Control: TCP & DC-TCP Swarun Kumar With Slides From: Prof. Katabi, Alizadeh et al.

Congestion Control: TCP & DC-TCP Swarun Kumar With Slides From: Prof. Katabi, Alizadeh et al.
A performance model for an asynchronous optical buffer W. Rogiest K. Laevens D. Fiems H. Bruneel SMACS Research Group Ghent University Performance 2005.

A performance model for an asynchronous optical buffer W. Rogiest K. Laevens D. Fiems H. Bruneel SMACS Research Group Ghent University Performance 2005.
TCP/IP Performance across Optical Packet-Switched (OPS) Networks Jingyi He ( Co-supervised by Dr. Gary Chan and Dr. Danny Tsang ) Apr. 25, 2002.

TCP/IP Performance across Optical Packet-Switched (OPS) Networks Jingyi He ( Co-supervised by Dr. Gary Chan and Dr. Danny Tsang ) Apr. 25, 2002.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.

XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Chapter 3 Transport Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 12.

Chapter 3 Transport Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 12.
Dynamic Internet Congestion with Bursts Stefan Schmid Roger Wattenhofer Distributed Computing Group, ETH Zurich 13th International Conference On High Performance.

Dynamic Internet Congestion with Bursts Stefan Schmid Roger Wattenhofer Distributed Computing Group, ETH Zurich 13th International Conference On High Performance.
High Performance All-Optical Networks with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University

High Performance All-Optical Networks with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University
Transport Layer3-1 Congestion Control. Transport Layer3-2 Principles of Congestion Control Congestion: r informally: “too many sources sending too much.

Transport Layer3-1 Congestion Control. Transport Layer3-2 Principles of Congestion Control Congestion: r informally: “too many sources sending too much.
Lecture 2 Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit.

Lecture 2 Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit.
1 Architectural Results in the Optical Router Project Da Chuang, Isaac Keslassy, Nick McKeown High Performance Networking Group

1 Architectural Results in the Optical Router Project Da Chuang, Isaac Keslassy, Nick McKeown High Performance Networking Group
FF-1 9/30/2003 UTD Practical Priority Contention Resolution for Slotted Optical Burst Switching Networks Farid Farahmand The University of Texas at Dallas.

FF-1 9/30/2003 UTD Practical Priority Contention Resolution for Slotted Optical Burst Switching Networks Farid Farahmand The University of Texas at Dallas.
1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.

1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.
Data Communication and Networks

Data Communication and Networks

Similar presentations

Ads by Google