Paolo Monti Next Generation Optical Network (NEGONET) Gruop Royal Institute of Technology (KTH), Sweden Broadnets 2010 – Athens, Greece Efficient Use of.

Slides:



Advertisements
Similar presentations
HANDBOOK ON GREEN INFORMATION AND COMMUNICATION SYSTEMS
Advertisements

QoS Strategy in DiffServ aware MPLS environment Teerapat Sanguankotchakorn, D.Eng. Telecommunications Program, School of Advanced Technologies Asian Institute.
CSC 778 Fall 2007 Routing & Wavelength Assignment Vinod Damle Hardik Thakker.
Page th IETF – Vancouver, December 2007 PCEP Requirements and Extensions for the support of Wavelength Switched Optical Networks (WSON) Young
1 Routing and Wavelength Assignment in Wavelength Routing Networks.
Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Presented by: Brian V.
Lecture: 4 WDM Networks Design & Operation
A Waveband Switching Architecture and Algorithm for Dynamic Traffic IEEE Communications Letters, Vol.7, No.8, August 2003 Xiaojun Cao, Vishal Anand, Chunming.
Research on Wavelength Switched Optical Networks for the Next 10 years ICT Session 1 of PhD Academy Xin WANG TANAKA Lab. Waseda University Oct. 05, 2011.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
Lecture: 8 Physical Layer Impairments in Optical Networks Ajmal Muhammad, Robert Forchheimer Information Coding Group ISY Department.
AGH University of Science and Technology NOBEL WP2 Meeting, Berlin May QoS/GoS Routing in Optical Networks.
Filippos BALASIS TANAKA LAB Catching Up With The Global Bandwidth Demand: 2023 And Beyond.
Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.
11/7/2000EE228A Lecture1 Problem We need more bandwidth –Data traffic doubles every 4 (up to 12) months –More users connect to the Internet … –And stay.
Physical Layer Impairment Aware Wavelength Routing Algorithms Vasilis Anagnostopoulos 1, Christina (T.) Politi 1,2, Chris Matrakidis 1,2, Alexandros Stavdas.
PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.
COMMUNICATION SYSTEMS, NETWORKS AND DIGITAL SIGNAL PROCESSING July, Performance Estimation of Bursty Wavelength Division Multiplexing Networks.
Sponsored by BellSouth, Cisco, UC Micro Program Design and Development of an MPLambdaS Simulator Jian Wang, Biswanath Mukherjee, S, J, Ben Yoo University.
On-Demand Media Streaming Over the Internet Mohamed M. Hefeeda, Bharat K. Bhargava Presented by Sam Distributed Computing Systems, FTDCS Proceedings.
Kick-off meeting 3 October 2012 Patras. Research Team B Communication Networks Laboratory (CNL), Computer Engineering & Informatics Department (CEID),
The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing National Yunlin University of Science & Technology.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.
A Combined Effort of OptiCal & LUMOS NETWORKS EE 290Q Lukas Chrostowski, Carlos Mateus, Fan Mo, Lixia Zhou.
Application of All-Optical Signal Regeneration Technology to Next-Generation Network (NGN) Mikio Yagi, Shiro Ryu (1), and Shoichiro Asano (2) 1: Laboratories,
A Dynamically Adaptive Hybrid Algorithm for Scheduling Lightpaths in Lambda-Grids Neena R. Kaushik and Silvia M. Figueira Santa Clara University Presented.
CSC 336 Data Communications and Networking Lecture 7d: Interconnecting LAN Dr. Cheer-Sun Yang Spring 2001.
Helsinki 19 May 2006 Fine Protection of Data-Paths in Multi-Layer Networks Based on the GMPLS paradigm G.Oriolo, Università Tor Vergata, Roma joint work.
1 PHYSICAL IMPAIRMENTS Maruthy Mentireddi Raghu Kalyan Anna.
Impairment-Aware Routing and Wavelength Assignment (IA-RWA)
1 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.
COST 804 Participant presentation Paweł Wiatr, Ph.D. Candidate Advisors: prof. Lena Wosinska, Paolo Monti Royal Institute of Technology (KTH) Palma Mallorca,
Waveband switching. WBS –In GMPLS networks, underlying network nodes need to support multiple switching granularities –Therefore, ordinary wavelength-switching.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Algorithms for Allocating Wavelength Converters in All-Optical Networks Authors: Goaxi Xiao and Yiu-Wing Leung Presented by: Douglas L. Potts CEG 790 Summer.
Wavelength Assignment in Waveband Switching Networks with Wavelength Conversion Xiaojun Cao; Chunming Qiao; Anand, V. Jikai LI GLOBECOM '04. IEEE Volume.
1 Optical Burst Switching (OBS). 2 Optical Internet IP runs over an all-optical WDM layer –OXCs interconnected by fiber links –IP routers attached to.
SMUCSE 8344 Protection & Restoration of Optical Networks.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.
Examination Committee: Dr. Poompat Saengudomlert (Chairperson) Assoc. Prof. Tapio Erke Dr. R.M.A.P. Rajatheva 1 Telecommunications FoS Asian Institute.
TECHNION – Israel Institute of Technology Department of Electrical Engineering The Computer Network Laboratory Crankback Prediction in ATM According to.
CSC Survivability Anuj Dewangan Parinda Gandhi.
Enhanced Protection using Shared Segment Backups in a Multiservice GMPLS-based Networks Anna Urra, Eusebi Calle, Jose L Marzo Institute of Informatics.
Impact of OXC Failures on Network Reliability Zsolt Pándi a, Andrea Fumagalli a, Marco Tacca a, Lena Wosinska b a OpNeAR Lab., Erik Jonsson Shool of EECS,
Survivable Traffic Grooming with Differentiated End-to-End Availability Guarantees in WDM Mesh Networks Proceedings of the 13th IEEE Workshop on Local.
10/6/2003Kevin Su Traffic Grooming for Survivable WDM Networks – Shared Protection Kevin Su University of Texas at San Antonio.
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
Ahmed Musa, John Medrano, Virgillio Gonzalez, Cecil Thomas University of Texas at El Paso Circuit Establishment in a Hybrid Optical-CDMA and WDM All- Optical.
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
(Slide set by Norvald Stol/Steinar Bjørnstad
1 Simple provisioning, complex consolidation – An approach to improve the efficiency of provisioning oriented optical networks Tamás Kárász Budapest University.
An integrated survey in Optical Networks: Concepts, Components and Problems Delivered by Erna Sri Sugesti, Ir., MSc. 1 May 2013 Ali Norouzi †, A.Halim.
11/02/2001 Workshop on Optical Networking 1 Design Method of Logical Topologies in WDM Network with Quality of Protection Junichi Katou Dept. of Informatics.
1 Dynamic RWA Connection requests arrive sequentially. Setup a lightpath when a connection request arrives and teardown the lightpath when a connection.
Page th IETF – Dublin, Ireland, July 2008 Performance Evaluation of PCE Architectures for Wavelength Switched Optical Networks Editors: Greg
Survivability in IP over WDM networks YINGHUA YE and SUDHIR DIXIT Nokia Research Center, Burlington, Massachusetts.
Improving OBS Efficiency Li, Shuo, Meiqian Wang. Eric W. M. Wong, Moshe Zukerman City University of Hong Kong 1.
Data Link Layer Architecture for Wireless Sensor Networks Charlie Zhong September 28, 2001.
Networking Benefits of Advanced DSP Techniques
Isabella Cerutti, Andrea Fumagalli, Sonal Sheth
Distributed Control Plane
ISP and Egress Path Selection for Multihomed Networks
Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.
Design & development of impairment-aware routing and wavelength assignment algorithms for Future Internet Mohammad Shoyaib Student ID: Image.
SURVIVABILITY IN IP-OVER-WDM NETWORKS (2)
Chapter 10 RWA 2019/5/9.
Eusebi Calle, Jose L Marzo, Anna Urra. L. Fabrega
Presentation transcript:

Paolo Monti Next Generation Optical Network (NEGONET) Gruop Royal Institute of Technology (KTH), Sweden Broadnets 2010 – Athens, Greece Efficient Use of Network and Control Resources in Impairment-Aware All Optical Networks

NEGONET Acknoledgements  Amornrat Jirattigalachote  Gabriel Junyent  Kostas Katrinis  Salvatore Spadaro  Anna Tzanakaki  Luis Velasco  Lena Wosinska Broadnets 20102

NEGONET Outline  Transparent optical networks  Lightpath provisioning considering optical impairments and different QoS levels  Impairment constraint based routing with service differentiation (ICBR-Diff)  ICBR routing in a distributed scenario (set-up time, GMPLS extensions)  Impairment-aware probabilistic provisioning method  Performance assessment  Conclusions Broadnets 20103

NEGONET Optical transparency  Lightpaths routed from source to destination entirely in the optical domain  Pros  Cost reduction (less O/E/O conversion)  High bit rate, less energy consumption and protocol transparency  Cons  Physical medium not ideal (i.e., optical physical impariments)  Optical signal degradation  Less signal regeneration opportunities Broadnets 20104

NEGONET Outline  Transparent optical networks  Lightpath provisioning considering optical impairments and different QoS levels  Impairment constraint based routing with service differentiation (ICBR-Diff)  ICBR routing in a distributed scenario (set-up time, GMPLS extensions)  Impairment-aware probabilistic provisioning method  Performance assessment  Conclusions Broadnets 20105

NEGONET Traditional ICBR  RWA algorithm considers resource availability and physical layer parameters  Q-penalty used as routing parameter  link cost in the routing algorithm  the path with lowest level of impairments  Q-factor evaluation  Amplified Spontaneous Emission Noise (ASE)  Cross-Phase Modulation (XPM)  Four-Wave Mixing (FWM)  Optical Filtering  Self-Phase Modulation / Group Velocity Dispersion  Path quality measured in terms of Bit Error Rate (BER)  BER calculated through quality factor Q and compared against predefined threshold (e.g., BER thresh = ) Broadnets 20106

NEGONET Different QoS requirements Broadnets  Next-Generation Internet will need to support a variety of services  High definition television (HDTV)  Audio Video On Demand (AVOD)  Peer-to-peer (P2P) applications  Traditional ICBR schemes  Select the path with minimum BER (Impairment-Aware Best-Path IABP)  Single signal quality requirement  Issue: no QoS differentiation and unnecessary blocking of requests

NEGONET  Impairment Constraint Based Routing with service differentiation  Different service classes with different signal quality requirements  Class-1: require high signal quality  Class-2: tolerate lower signal quality  Etc.  Assign to each connection resources that are good enough to satisfy the BER requirements of a class  Path selection mechanism  ICBR-Diff selects the path with maximum acceptable BER from a set of candidate paths Broadnets 20108

NEGONET  Class-1: BER <  Class-2: BER < BER of 5 feasible routes = [10 -8, , , , ] Class-1 request ICBR-Diff IABP Broadnets 2010 Path selection example 9

NEGONET Class-2 request ICBR-Diff IABP No service differentiation! Best path above the threshold: Allocates better resources than necessary Path selection example 10  Class-1: BER <  Class-2: BER < Broadnets 2010 BER of 5 feasible routes = [10 -8, , , , ]

NEGONET Broadnets Initialization phase collect: -Network topology information - Physical parameters Connection request Assign link cost: Q-penalty k-shortest path algorithm Path selection: check BER according to the request’s class Assign wavelength: First Fit Route found Route not found Block! BER lower than threshold BER higher than threshold Block!

NEGONET  Poisson arrival of connection requests and exponentially distributed service time  Bandwidth of connection request: one wavelength unit  No wavelength conversion  Derivation of BER assumes all wavelengths on a fiber occupied (worst case analysis)  Two classes of connection requests  Class-1: requiring BER <  Class-2: requiring BER <  Two cases for traffic mix of Class-1 and Class-2 requests  Class-1 -- Class-2 = 30%--70%  Class-1 -- Class-2 = 50%--50%  Pan European Cost 239 network topology (11 nodes 26 bi- fibers, 16 wavelength per fiber) Broadnets

NEGONET Results: total blocking Broadnets Lightpaths with acceptable BER with respect to the signal quality requirement of each specific service class High quality links are kept for demanding services Efficient utilization of network resources Lower blocking probability A. Jirattigalachote, P. Monti, L. Wosinska, K. Katrinis, A. Tzanakaki, “ICBR-Diff: an Impairment Constraint Based Routing Strategy with Quality of Signal Differentiation,” Journal of Networks, Special Issue on All-Optically Routed Networks, 2010.

NEGONET  Performance of ICBR-Diff when protection is required  Optical physical impairments considered also while computing the protection path  Path protection with link (single) failure assumption  Dedicated path protection scheme  Shared path protection scheme 14Broadnets 2010

NEGONET Survivable ICBR-Diff k-shortest path algorithm Path selection: check BER according to the request’s class Assign wavelength: First Fit Initialization phase collect: -Network topology information - Physical parameters Connection request Assign link cost: Q-penalty Route found Route not found Block! BER lower than threshold BER higher than threshold Block! Primary Path Provisioning Phase 1 Protection Path Provisioning Phase 1 Exclude the links used in primary path Assign link cost: -Dedicated path: routing scheme -Shared path: (i) Already shared wavelength: zero (ii) Free wavelength: routing scheme 15Broadnets 2010

NEGONET Dedicated path protection 16Broadnets 2010 A.Jirattigalachote, L. Wosinska, P. Monti, K. Katrinis, and A. Tzanakaki, “Impairment Constraint Based Routing (ICBR) with Service Differentiation in Survivable WDM Networks”, in Proc. of ECOC, 2009.

NEGONET Shared path protection 17 Provides a lightpath that has acceptable BER performance with respect to the signal quality requirement of each service class request More efficient resource utilization Avoid unnecessary blocking Broadnets 2010 A.Jirattigalachote, L. Wosinska, P. Monti, K. Katrinis, and A. Tzanakaki, “Impairment Constraint Based Routing (ICBR) with Service Differentiation in Survivable WDM Networks”, in Proc. of ECOC, 2009.

NEGONET Outline  Transparent optical networks  Lightpath provisioning considering optical impairments and different QoS levels  Impairment constraint based routing with service differentiation (ICBR-Diff)  ICBR routing in a distributed scenario (set-up time, GMPLS extensions)  Impairment-aware probabilistic provisioning method  Performance assessment  Conclusions Broadnets

NEGONET Physical layer impairments  Physical layer impairments classified into:  Affect each of the wavelengths individually  e.g., Attenuation, ASE noise, CD, PMD, SPM  Cause interference between wavelengths  e.g., XPM, FWM  With interference between wavelength, lightpaths already established are also affected  Distributed provisioning protocol has to account for this effect while deciding on whether to route a lightpath or not Broadnets

NEGONET Impairments estimation in a distributed scenario  Current state of the network: impairments computed and checked at each provisioning  Current information, need to extend the GMPLS protocol set  Set-up times are long for on-line Q-factor computation  Worst case scenario: impairments fixed penalties for each link assuming that all wavelength are used  Short lightpath set-up time (the Q-factor can be pre-computed beforehand for each link)  No need for GMPLS protocol extensions  Blocking probability (might) unnecessarily high  A probabilistic approach: a prediction on the maximum number of used wavelengths in every link in the network 20Broadnets 2010

NEGONET Probabilistic Model 10%  G(N, E, W) optical network graph  δ: the average nodal degree  H : the average hop length of a lightpath. H~((|N|-2)/(δ-1)) 1/2  C: the average number of established lightpaths for a given offered load  λ: the average number of used wavelengths in a link, λ=C·H/|E|  Cumulative distribution of maximum number of used wavelengths in every link Load (E) Max wav. ( λ l ) Load (E) Max wav. ( λ l ) P(Y>λ l ) λlλl λlλl λlλl Low LoadMedium LoadHigh Load 21Broadnets 2010

NEGONET ASE, XPM and FWM noise variance  Search order which spreads the used wavelengths as much as possible  Minimal total variance and better lightpath Q-factor value  Q-factor estimation is based on the impairments over the central wavelength (worst case) σ 2 ASE + σ 2 XPM + σ 2 FWM Used Wavelengths ( λ i ) Link: 540km 22 Wavelength # Search order Broadnets 2010

NEGONET Blocking Probability (Pb)  Simulations with 16 node EON COST266 reference network) every link with 16 wavelengths  Q threshold = 7.4  BER ≈ Load (Erlangs) Pb (%) Broadnets 2010 L. Velasco, A. Jirattigalachote, P. Monti, L. Wosinska, S. Spadaro, G. Junyent, “Probabilistic-Based Approach for Fast Impairments-Aware RWA in All-Optical Networks,” in Proc of OFC, 2010.

NEGONET Impairments Availability  With Ia-CS and Ia-WC each established lightpath with BER better than or equal to the threshold  The constraint relaxed with Ia- PC approach  Unavailability: ratio between lightpath experience BER>threshold and the total time the lightpath is established in the network Load (Erlang) Ia Unavailability 24Broadnets 2010 L. Velasco, A. Jirattigalachote, P. Monti, L. Wosinska, S. Spadaro, G. Junyent, “Probabilistic-Based Approach for Fast Impairments-Aware RWA in All-Optical Networks,” in Proc of OFC, 2010.

NEGONET Conclusions  ICBR routing with QoS levels  ICBR-Diff approach where path with maximum acceptable BER (good enough) is selected (both primary and secondary)  Significant blocking probability improvement against conventional ICBR  ICBR routing in a distributed scenario  ICBR-PC approach with a contained set-up time and with no extensions for GMPLS protocol  Blocking probability comparable with exact ICBR approaches with acceptable level of unavailability Broadnets

Thank you!! contact: