Effect of Maintaining Wavelength Continuity on Minimizing Network Coding Resources in Optical Long-haul Networks Ramanathan S Thinniyam.

Slides:



Advertisements
Similar presentations
Optimization Problems in Optical Networks. Wavelength Division Multiplexing (WDM) Directed: Symmetric: Undirected: Optic Fiber.
Advertisements

Non-dominated Sorting Genetic Algorithm (NSGA-II)
MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.
Novembro 2003 Tabu search heuristic for partition coloring1/29 XXXV SBPO XXXV SBPO Natal, 4-7 de novembro de 2003 A Tabu Search Heuristic for Partition.
Optimization Problems in Optical Networks. Wavelength Division Multiplexing (WDM) Directed: Symmetric: Optic Fiber.
Optical Networks BM-UC Davis122 Part III Wide-Area (Wavelength-Routed) Optical Networks – 1.Virtual Topology Design 2.Wavelength Conversion 3.Control and.
CSC 778 Fall 2007 Routing & Wavelength Assignment Vinod Damle Hardik Thakker.
1 Routing and Wavelength Assignment in Wavelength Routing Networks.
CWI PNA2, Reading Seminar, Presented by Yoni Nazarathy EURANDOM and the Dept. of Mechanical Engineering, TU/e Eindhoven September 17, 2009 An Assortment.
Lecture: 4 WDM Networks Design & Operation
Wavelength Assignment in Optical Network Design Team 6: Lisa Zhang (Mentor) Brendan Farrell, Yi Huang, Mark Iwen, Ting Wang, Jintong Zheng Progress Report.
Approximating the Traffic Grooming Problem Mordo Shalom Tel Hai Academic College & Technion.
Department of Computer Science, University of Maryland, College Park, USA TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
1 Autonomous Controller Design for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Choong K. Oh and Gregory J. Barlow U.S. Naval Research.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Single Sink Edge Installation Kunal Talwar UC Berkeley.
Dynamic Hypercube Topology Stefan Schmid URAW 2005 Upper Rhine Algorithms Workshop University of Tübingen, Germany.
PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.
1 Autonomous Controller Design for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow North Carolina State University.
The Pareto fitness genetic algorithm: Test function study Wei-Ming Chen
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
The Shortest Path Problem
A New Algorithm for Solving Many-objective Optimization Problem Md. Shihabul Islam ( ) and Bashiul Alam Sabab ( ) Department of Computer Science.
Multiobjective Optimization Athens 2005 Department of Architecture and Technology Universidad Politécnica de Madrid Santiago González Tortosa Department.
Optimal Arrangement of Ceiling Cameras for Home Service Robots Using Genetic Algorithms Stefanos Nikolaidis*, ** and Tamio Arai** *R&D Division, Square.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
Task Alloc. In Dist. Embed. Systems Murat Semerci A.Yasin Çitkaya CMPE 511 COMPUTER ARCHITECTURE.
Distributed Asynchronous Bellman-Ford Algorithm
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
Rateless Codes with Optimum Intermediate Performance Ali Talari and Nazanin Rahnavard Oklahoma State University, USA IEEE GLOBECOM 2009 & IEEE TRANSACTIONS.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
Masoud Asadzadeh, Bryan A. Tolson, A. J. MacLean. Dept. of Civil & Environmental Engineering, University of Waterloo Hydrologic model calibration aims.
I.V. Bazarov, Multivariate Optimization of High Brightness DC Gun Photoinjector, UCLA Workshop, 8-10 November CHESS / LEPP ERL DC Gun Injector.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Optimization of the ESRF upgrade lattice lifetime and dynamic aperture using genetic algorithms Nicola Carmignani 11/03/2015.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
ValuePick : Towards a Value-Oriented Dual-Goal Recommender System Leman Akoglu Christos Faloutsos OEDM in conjunction with ICDM 2010 Sydney, Australia.
Logical Topology Design
On Survivable Routing of Mesh Topologies in IP-over-WDM Networks Maciej Kurant, Patrick Thiran EPFL, Switzerland Infocom 2005, March 13-17, Miami.
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
ON THE INTERMEDIATE SYMBOL RECOVERY RATE OF RATELESS CODES Ali Talari, and Nazanin Rahnavard IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 60, NO. 5, MAY 2012.
2/29/20121 Optimizing LCLS2 taper profile with genetic algorithms: preliminary results X. Huang, J. Wu, T. Raubenhaimer, Y. Jiao, S. Spampinati, A. Mandlekar,
Evolving Multimodal Networks for Multitask Games
A multi-objective synthesis of optimal control system by the network operator method 1 A.I. Diveev Institution of Russian Academy of Sciences Dorodnicyn.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Multiobjective Optimization for Locating Multiple Optimal Solutions of Nonlinear Equation Systems and Multimodal Optimization Problems Yong Wang School.
Distributed Rateless Codes with UEP Property Ali Talari, Nazanin Rahnavard 2010 IEEE ISIT(International Symposium on Information Theory) & IEEE TRANSACTIONS.
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Multiobjective Optimization  Particularities of multiobjective optimization  Multiobjective.
ENGM 631 Minimum Spanning Tree. Prototype Example Seervada Park Trams route smallest total distance Phone lines minimum spanning tree Tram limitations.
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
HIGH LEVEL SYNTHESIS WITH AREA CONSTRAINTS FOR FPGA DESIGNS: AN EVOLUTIONARY APPROACH Tesi di Laurea di: Christian Pilato Matr.n Relatore: Prof.
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
1 ParadisEO-MOEO for a Bi-objective Flow-Shop Scheduling Problem May 2007 E.-G. Talbi and the ParadisEO team
Introduction to Multiple-multicast Routing Chu-Fu Wang.
Evolutionary Computation: Advanced Algorithms and Operators
Alan P. Reynolds*, David W. Corne and Michael J. Chantler
BroadNets 2004, October 25-29, San Jose
Isabella Cerutti, Andrea Fumagalli, Sonal Sheth
Lecture 13 review Explain how distance vector algorithm works.
Evolving Multimodal Networks for Multitask Games
4th Homework Problem In this homework problem, we wish to exercise the tearing and relaxation methods by means of a slightly larger problem than that presented.
Heuristic Optimization Methods Pareto Multiobjective Optimization
Eren AKÇA HAVELSAN A.S., Ankara, Turkey
Analysis & Design of Algorithms (CSCE 321)
Cooperative technique to optimize total allocation time in heterogeneous domains in an Optical Access Network NTT Access Network Service Systems.
The University of Adelaide, School of Computer Science
Chen-Yu Lee, Jia-Fong Yeh, and Tsung-Che Chiang
Solving the Minimum Labeling Spanning Tree Problem
RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm BISCuit EDA Seminar
Presentation transcript:

Effect of Maintaining Wavelength Continuity on Minimizing Network Coding Resources in Optical Long-haul Networks Ramanathan S Thinniyam

Approaches to Minimize Network Coding Resources 2-Stage approach 1. Minimize link cost (i.e. # of wavelengths) required to maintain given connection through Integer Programming to obtain subgraph. 2.Minimize coding cost (i.e. # of coded wavelengths) in subgraph obtained from stage 1 using a Genetic Algorithm(GA). Multi-Objective Evolutionary Approach(MOEA)- Obtain a Pareto front of tradeoffs between link cost and coding cost. Specifically, we use the NSGA –II algorithm * * K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II",IEEE Trans. Evol. Comput.,6(2):182–197(2002).

Wavelength Continuity Assume routing- dashed lines not routed, solid lines routed. In optical networks, O/E/O equipment can be used for both wavelength conversion as well to enable network coding. If case 2 uses O/E/O equipment at node 1 to maintain wavelength continuity, we can also code at this node if coding is allowed. 1 Case 1 1 Case 2

Simulation Results We perform experiments based on two different assumptions: 1.Hardware allowing wavelength conversion present at every node, cost of such conversion is zero (i.e. cost-free conversion). 2.O/E/O equipment present when conversion is needed (i.e. O/E/O based conversion). The cost of one or both coding and conversion at a node (or of a wavelength) is the same.

Results for O/E/O Based Continuity The fitness criterion is changed from number of coded wavelengths to number of wavelengths requiring O/E/O. # of wavelengths requiring O/E/O = # of solely converted wavelengths + # of coded wavelengths (coded wavelengths may or may not be converted). Results from 2 stage approach – never reduce O/E/O requirement to 0, – the number of O/E/O wavelengths on average is much higher than the number of coded wavelengths in cost-free conversion. – The cost of continuity is more O/E/O equipment

Fraction of nodes where O/E/O equipment is required is much larger than fraction of wavelengths, when optimizing using number of wavelengths as criterion. 2-Stage Approach Result 1- Average Network Coding Requirement

Conversion fraction=(Number of converted wavelengths)/(number of O/E/O wavelengths) Most problem instances show low conversion fraction < 1/3 2-Stage Approach Result 2 - Coding vs Conversion

2-Stage Approach Result 3 -Distribution of Number of O/E/O Wavelengths

2-Stage Approach Result 4a- Comparing Cost-free vs O/E/O

2-Stage Approach Result 4b - Comparing Cost-free vs O/E/O

2-Stage Approach Result 5- High Frequency Nodes ARPANET NSFNET NJLATA Nodes which were O/E/O nodes in the solution obtained in more than half the problem instances indicated in red.