Analysis and simulation of Optical Networks Xin Liu.

Slides:



Advertisements
Similar presentations
1 IK1500 Communication Systems IK1330 Lecture 3: Networking Anders Västberg
Advertisements

A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
BY PAYEL BANDYOPADYAY WHAT AM I GOING TO DEAL ABOUT? WHAT IS AN AD-HOC NETWORK? That doesn't depend on any infrastructure (eg. Access points, routers)
Jaringan Komputer Lanjut Packet Switching Network.
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
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.
Module 3.4: Switching Circuit Switching Packet Switching K. Salah.
Color Aware Switch algorithm implementation The Computer Communication Lab (236340) Spring 2008.
Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.
Multiple constraints QoS Routing Given: - a (real time) connection request with specified QoS requirements (e.g., Bdw, Delay, Jitter, packet loss, path.
Path Protection in MPLS Networks Ashish Gupta Design and Evaluation of Fault Tolerance Algorithms with Performance Constraints.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
ECOM 4314 Data Communications Fall September, 2010.
Performance Analysis of Wavelength-Routed Optical Networks with Connection Request Retrials Fei Xue+, S. J. Ben Yoo+, Hiroyuki Yokoyama*, and Yukio Horiuchi*
FF-1 9/30/2003 UTD Practical Priority Contention Resolution for Slotted Optical Burst Switching Networks Farid Farahmand The University of Texas at Dallas.
PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
1 A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm Quan Sun and Horst Langendorfer Telecommunication Systems Journal, vol.11, p.47~58,
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Sponsored by BellSouth, Cisco, UC Micro Program Design and Development of an MPLambdaS Simulator Jian Wang, Biswanath Mukherjee, S, J, Ben Yoo University.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
1 Introduction to Optical Networks. 2 Telecommunications Network Architecture.
MODULE IV SWITCHED WAN.
Optical flow switching. Electro-optical bottleneck –Unlike individual wavelength switching (IWS) & synchronous optical packet switching (OPS), electronic.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks Murali Kodialam and T. V. Lakshman Bell Laboratories Lucent Technologies IEEE INFOCOM.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
FiWi Integrated Fiber-Wireless Access Networks
Review of Networking Concepts Part 1: Switching Networks
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
1 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.
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.
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.
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
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.
Salim Hariri HPDC Laboratory Enhanced General Switch Management Protocol Salim Hariri Department of Electrical and Computer.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
Computer Networks with Internet Technology William Stallings
TTM1: ”Burst, packet and hybrid switching in the optical core network” Steinar Bjørnstad et al.
Network-Coding Multicast Networks With QoS Guarantees Yuanzhe Xuan and Chin-Tau Lea, Senior Member, IEEE IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19,
1 Traffic Engineering in Multi-Granularity, Heterogeneous, WDM Optical Mesh Networks Through Dynamic Traffic Grooming Keyao Zhu, Hongyue Zhu, and Biswanath.
Logical Topology Design
IP Traffic Management In IP- OVER-WDM Networks:HOW? Javier Aracil, Daniel Morato, and Mikel Izal Universidad Publica de Navarra, Pamplona, Spain Presenter:Chen.
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.
1 Optical Packet Switching Techniques Walter Picco MS Thesis Defense December 2001 Fabio Neri, Marco Ajmone Marsan Telecommunication Networks Group
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
Lecture # 03 Switching Course Instructor: Engr. Sana Ziafat.
10/6/2003Kevin Su Traffic Grooming for Survivable WDM Networks – Shared Protection Kevin Su University of Texas at San Antonio.
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
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.
Interconnect Networks Basics. Generic parallel/distributed system architecture On-chip interconnects (manycore processor) Off-chip interconnects (clusters.
Ch 8. Switching. Switch  Devices that interconnected with each other  Connecting all nodes (like mesh network) is not cost-effective  Some topology.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 CH. 8: SWITCHING & DATAGRAM NETWORKS 7.1.
1 A quick tutorial on IP Router design Optics and Routing Seminar October 10 th, 2000 Nick McKeown
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
Data Communication Networks Lec 13 and 14. Network Core- Packet Switching.
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
Distributed Control Plane
SWITCHING Switched Network Circuit-Switched Network Datagram Networks
Data Communication Networks
The University of Adelaide, School of Computer Science
SURVIVABILITY IN IP-OVER-WDM NETWORKS (2)
CSE 550 Computer Network Design
Presentation transcript:

Analysis and simulation of Optical Networks Xin Liu

Outline Analytic Approach Probability: Expectation values, Variance Network Global Expectation Model Stochastic Process: Markov chain Packet Delay in OCS networks Simulation Discrete Event Simulation Model OCS and OBS extension on NS

Analytic Approach Methods: formal derivation, considered approximation, semi-empirical observation. Intent: To formulate analytic or closed form; To complement, not supplant more accurate, but computationally intensive tools based on numerical simulation.

Simulation Methods: To implement discrete event simulation model using generic languages; To extend known simulation platform. Intent: To be close to the real network.

Network Global Expectation Model Key idea: Use expectation values to describe required quantities of key network and network element resources. Significance: Provide approximate results for the preliminary evaluation and design of dynamic networks. Assumption: single-tier backbone networks, location-independent traffic demands.

Network Global Expectation Model the total network cost the number of network elements of type i the unit cost of network element of type i. Challenge:

Network Global Expectation Model Expectation value Example: L is the number of links and N is the number of nodes.

Primary Model Variables (Input) Network graph adjacent matrix Network traffic T : the total ingress/egress traffic D : the number of demands : demand matrix

Primary Model Variables Specify the difference between one-way and two-way links

Output Number of Demands Traffic Demand Bit-Rate Degree of Node

Output Number of Hops

Divide the network into 4 sectors centered on the selected node square root relation

Number of Hops The Moore bound results from the construction of a tree whose root is the parent of vertices and each subsequent vertex is itself the parent of vertices. Logarithmic relation

Number of Hops

Output Demands on Link Restoration Capacity Inverse dependency upon the degree of the nodes

Output Traffic on Link Number of Ports

Number of ports

Packet Delay in OCS Networks The paper first presents the queue length distribution and the packet delay distribution in a single logical buffer of the edge router, and then extends that discussion to a network of edge routers. To ensure computational tractability, the framework approximates the evolution of each buffer independently.

Model Formulation A circuit is a unidirectional lightpath connecting a pair of source-destination edge routers capable of transmitting C b/s uninterruptedly for a period of T seconds. Circuits are allocated to the logical buffers using a policy R based on the queue lengths at all logical buffers.

Model Formulation Consider J data streams, each associated with a source-destination pair of edge routers, Qos class, a route and wavelength assignment sequence from the source to the destination, and other external classifications. So there are J logical buffers.

Model Formulation Normalized lightpath arrival rates Normalized lightpath transmission rates K Circuit switching decision epoch n

Model Formulation The queue length in logical buffer j at epoch n The system state at epoch n A binary vector indicating which of the logical buffers are allocated circuits at state

Mathematical Model The process is a Markov chain. But each is not a Markov chain. Let be the probability that algorithm R allocates a circuit to buffer j with length i at epoch n.

Simulation Discrete Event Simulation Model. OCS and OBS extension on NS.

Discrete Event Simulation Model

Event handling Accept Execute RWA for connection requests; Modify the number of arriving requests, the number of successfully established working path; Modify the information of network resource. Create the next event according to assumed distribution and append it into event list. Service Over Release the resource of working channel which is not alive.

Basic Modules Phy-Topo : Generate physical topology, such as TORUS, NSFNet. Routing : Implement known routing algorithms, such as Dijkstra ’ s Algorithm, Floyd-based SPF, K-Shortest-With-Loop-Path. Graph Theory Algorithm : provide basic graph theory algorithms, such as MaxFlow, MinCost-Flow. Survival : provides protection and restoration schemes. Resource : Different policies, such as routing, wavelength assignment, control management, survivability schemes, will lead to different efficiency in resource usage. Wave-Assign : Combined with routing Module, it completes the RWA function in WDM networks. V-Topo : This module controls the virtual topology in IP layer. Traffic : It contains Poisson, Gaussian, Self-Similar traffic module. It is used to generate the random sequence of connection requests. Pseudo-Random Number : Generate random number in (0, 1) uniformly. DES : discrete event simulation module. Performance Metrics Statistic : In each DES process, track interested statistics variables. After simulation is over, prints out the values of performance metrics.

Basic Modules

OBS extension on NS OBS-ns (UMBC) Use centralized structure to assign resource; Add new classes for new types; Ignore the architecture of NS. OBS-extension Keep to the distributed architecture of NS; Add new component in existing composite classes for new features.

OBS-extension Task WDM link extension No multi-channel link model in NS; To add a multi-server queue in normal link model. Assembly Module in Ingress Nodes of OBS Networks Signaling, Qos and contention resolution

Normal Link Model head_The entry of a link queue_The queue reference of a link link_The reference of a link with delay and bandwidth property ttl_The reference of TTL management drophead_The reference of the head of the drop queue

WDM link extension WvAssign : Queue WaveClassifier : Classifier

Wavelength Classifier

WDM link extension #Create WDM link $ns duplex-link $n3 $n4 1Mb 20ms WvAssign 4 FirstFit 1

OBS extension Redirector Redirecting table and redirecting buffer. Similar to route table and cache in traditional router. Assembly Agent Set assembly scheme, parameters and signaling.

OBS extension

Assembly agent

Test

Reference Steven K. Korotky, “ Network Global Expectation Model: A Statistical Formalism for Quickly Quantifying Network Needs and Costs ”, Journal of Lightwave Technology Preprint, Zvi Rosberg, “ Packet Delay in Optical Circuit-Switched Networks ”, Zvi Rosberg, “ Analysis of OBS Networks with Limited Wavelength Conversion ”, Jean-Francois Labourdette, “ Fast Approximate Dimensioning and Performance Analysis of Mesh Optical Networks ”, Design of Reliable Communication Networks 2003, Damon J. Wischik, “ Mathematical Modeling of Optical Burst-Switched (OBS) Networks ”, 2004.