Survivable Traffic Grooming with Differentiated End-to-End Availability Guarantees in WDM Mesh Networks Proceedings of the 13th IEEE Workshop on Local.

Slides:

Advertisements

Similar presentations

1 On the Management Issues over Lambda Networks 2005 / 08 / 23 Te-Lung Liu Associate Researcher NCHC, Taiwan.

Advertisements

ITU-T Workshop on Security Seoul (Korea), May 2002 Telecommunication network reliability Dr. Chidung LAC.

Optical networks: Basics of WDM

Optical Networks BM-UC Davis122 Part III Wide-Area (Wavelength-Routed) Optical Networks – 1.Virtual Topology Design 2.Wavelength Conversion 3.Control and.

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.

1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.

Apoorv Nayak Prathyusha Dasari Traffic Grooming. Agenda  Improved approaches for cost effective traffic grooming in WDM ring networks  Motivation 

Traffic Grooming in WDM Ring Networks Presented by: Eshcar Hilel.

1 Wide-Sense Nonblocking Multicast in a Class of Regular Optical Networks From: C. Zhou and Y. Yang, IEEE Transactions on communications, vol. 50, No.

Optic fiber Electronic switch the fiber serves as a transmission medium Optical networks - 1 st generation 1. Optical networks – basic notions.

9/22/2003Kevin Su Traffic Grooming in WDM Networks Kevin Su University of Texas at San Antonio.

Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.

Jan 13, 2006Lahore University of Management Sciences1 Protection Routing in an MPLS Network using Bandwidth Sharing with Primary Paths Zartash Afzal Uzmi.

Performance Analysis of Wavelength-Routed Optical Networks with Connection Request Retrials Fei Xue+, S. J. Ben Yoo+, Hiroyuki Yokoyama*, and Yukio Horiuchi*

PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.

Multi-path Routing -Sridevi Bellary. Introduction Multipath routing is an alternative to single shortest path routing to distribute and alleviate congestion.

2015/6/291 Fault Management in IP- Over-WDM Networks: WDM Protection Versus IP Restoration Adviser: Ho-Ting Wu Presenter: Ze-Yang Guo.

1 Chapter 10 Introduction to Metropolitan Area Networks and Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.

1 Chapter 10 Introduction to Metropolitan Area Networks and Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.

Control and Traffic Management Paper: Banerjee et al.: ” Generalized multiprotocol label switching: an overview of signaling enhancements and recovery.

1 Introduction to Optical Networks. 2 Telecommunications Network Architecture.

The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing National Yunlin University of Science & Technology.

Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks Murali Kodialam and T. V. Lakshman Bell Laboratories Lucent Technologies IEEE INFOCOM.

Survivable Logical Topology Design in WDM Optical Ring Networks Hwajung Lee, Hongsik Choi, Suresh Subramaniam, and Hyeong-Ah Choi* The George Washington.

A Dynamically Adaptive Hybrid Algorithm for Scheduling Lightpaths in Lambda-Grids Neena R. Kaushik and Silvia M. Figueira Santa Clara University Presented.

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 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.

TTM1 – 2013: Core networks and Optical Circuit Switching (OCS)

Waveband switching. WBS –In GMPLS networks, underlying network nodes need to support multiple switching granularities –Therefore, ordinary wavelength-switching.

Data Communications & Computer Networks, Second Edition1 Chapter 10 Introduction to Metropolitan Area Networks and Wide Area Networks.

November 18, Traffic Grooming in Optical WDM Networks Presented by : Md. Shamsul Wazed University of Windsor.

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.

Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.

Load Balancing in Protection Switching of Optical Networks Hongkyu Jeong, Gyu-Myoung Lee Information and Communications Univ. (ICU) Student ID : ,

Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.

Lightpath Restoration in WDM Optical Networks A Survey in IEEE Network Magazine Nov/Dec 2000.

1 Traffic Engineering in Multi-Granularity, Heterogeneous, WDM Optical Mesh Networks Through Dynamic Traffic Grooming Keyao Zhu, Hongyue Zhu, and Biswanath.

On Survivable Routing of Mesh Topologies in IP-over-WDM Networks Maciej Kurant, Patrick Thiran EPFL, Switzerland Infocom 2005, March 13-17, Miami.

Multi-layered Optical Network Security

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.

CSC Survivability Anuj Dewangan Parinda Gandhi.

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,

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.

1 Why Optical Layer Protection? Optical layer provides lightpath services to its client layers (e.g., SONET, IP, ATM) Protection mechanisms exist in the.

Traffic grooming in WDM Networks Dynamic Traffic Grooming in WDM Mesh Networks Using a Novel Graph Model by Hongyue Zhu, Hui Zang, Keyao Zhu, and Biswanath.

1 Simple provisioning, complex consolidation – An approach to improve the efficiency of provisioning oriented optical networks Tamás Kárász Budapest University.

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.

Tunable QoS-Aware Network Survivability Presenter : Yen Fen Kao Advisor : Yeong Sung Lin 2013 Proceedings IEEE INFOCOM.

A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.

QoS-specified Traffic Grooming Algorithm in WDM Mesh Networks Bing Xiang, Hongfang Yu, Sheng Wang, Lemin Li Communications, Circuits and Systems, 2004.

Optimal Design of Survivable Mesh Networks Based on Line Switched WDM Self-Healing Rings IEEE/ACM Transactions on Networking, Vol 11, NO.3, June,2003 Andrea.

An Optimization Model for Placement of Wavelength Converters to Minimize Blocking Probability in WDM Networks Authored by: SuixiangGao,XiaohuaJia Authored.

Survivability in IP over WDM networks YINGHUA YE and SUDHIR DIXIT Nokia Research Center, Burlington, Massachusetts.

A study of provision of protecting capability after link failure in WDM networks 在 WDM 網路下以 FIPP 保護環連續供給保護能力之研究作者 : 丁德榮 (Der-Rong Din) 賴薪吉 (Hsin-Chi.

Date of download: 6/21/2016 Copyright © 2016 SPIE. All rights reserved. Illustration for full link-disjoint protection algorithm (a) CERNET topology with.

-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.

Prof.Veeraraghavan Prof.Karri Haobo Wang:

Isabella Cerutti, Andrea Fumagalli, Sonal Sheth

Distributed Control Plane

Network Survivability

Optical Layer Protection Schemes

The University of Adelaide, School of Computer Science

SURVIVABILITY IN IP-OVER-WDM NETWORKS (2)

Presentation transcript:

Survivable Traffic Grooming with Differentiated End-to-End Availability Guarantees in WDM Mesh Networks Proceedings of the 13th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN Reporter : Chao-Yang Lee

Outline Introduction Availability Model Survivable Grooming Algorithms Numerical Results and Analysis Conclusions

Introduction WDM technology provides huge bandwidth in a fiber by allowing simultaneous transmission of traffic on multiple wavelengths in the fiber. Traffic grooming is an essential functionality to provision sub- wavelength connections in WDM optical MANs.

Introduction Traffic grooming is to aggregate low speed traffic connections onto high-speed wavelength channels in a resource-efficient way. To minimize the resources consumed when the connection requests to be satisfied are given or to maximize the network throughput when the resources are given.

Introduction Reliability is critical for optical networks because a single failure may affect a large volume of traffic. The reliability requirement is usually decided by the customer application.

Introduction Path protection is often used for connections with high reliability requirement. In WDM mesh grooming networks, the protection schemes can be applied either at lightpath granularity or connection granularity.

Availability Model A general equation to calculate the availability of a component is A=MTTF/(MTTF+MTTR) A is the availability. MTTF is the mean time to failure. MTTR is the mean time to repair the component.

Availability Model

The dedicated-PAL and Shared-PAL

Survivable Grooming Algorithms

Availability Model The dedicated-PAC and Shared-PAC

Availability Model

Survivable Grooming Algorithms All the three algorithms presented are based on a link bundled auxiliary graph (LBAG) model. Using the LBAG model, the algorithms can calculate the shortest path currently available in the network for a connection request.

Survivable Grooming Algorithms Link Bundled Auxiliary Graph (LBAG) model

Grooming with No Protection (GNP) algorithm Calculate the shortest path as the candidate path using the LBAG model. Calculate the availability of the candidate path. If it meets the availability requirement, then satisfy the request using the path; otherwise, block the request.

Grooming with Protection at Lightpath level (GPL) algorithm Calculate the shortest path as the candidate path using the LBAG model. If the candidate path does not contain new lightpath, calculate availability of the candidate path. If it meets the availability requirement, then satisfy the request using the path; other block the request.

Grooming with Protection at Lightpath level (GPL) algorithm If the candidate path contains new lightpaths, then use the LBAG model to calculate the shortest link-disjoint paths to serve as the backup paths. Calculate availability of the new lightpaths.

Grooming with Protection at Lightpath level (GPL) algorithm Calculate availability of the candidate paths. If it meets the availability requirement, then satisfy the request using the path; other block the request.

Grooming with Protection at Connection level (GPC) Step1. Calculate the shortest path which meets the availability requirement using the LBAG model. If successful, then satisfy the connection request using a single primary path without protection; otherwise, go to step 2.

Grooming with Protection at Connection level (GPC) Step 2. Calculate the shortest path and its shortest link-disjoint path as the primary path and backup path respectively. Calculate the overall availability of the path pair.

Grooming with Protection at Connection level (GPC) If this path pair meets the availability requirement, then satisfy the connection request using the path pair. Otherwise, block the request.

Numerical Results and Analysis The connection bandwidth requirement is distributed uniformly between 1 and 4. The bandwidth capacity of a lightpath is 16. Each node has 32 transceivers and each fiber link supports 16 wavelengths. Full wavelength conversion capability.

Numerical Results and Analysis

Numerical Results and Analysis - GPL

Numerical Results and Analysis - GPC

Conclusions From the availability model, it is obvious that applying protection at either lightpath level or connection level can increase the availability of a connection. The simulations demonstrate that shared protection is more resource- efficient than dedicated protection.

Conclusions The dedicated protection generates higher availability than shared protection. The dedicated protection is needed for connections with high availability. The GPC can provision connections in a more flexible way than GPL.