Effects of TSI/TSA (or Wavelength Conversion) on Ring Loading E E 681 - Module 8 W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003.

Slides:



Advertisements
Similar presentations
Airline Schedule Optimization (Fleet Assignment I)
Advertisements

Ye shanshan Friday, May 11, /20.  Problem  Literature Review  Mathematical Model  Conclusion  My idea 参考文献: Gupta, S., and Dutta, K., Modeling.
BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
B Multi-Layer Network Design II Dr. Greg Bernstein Grotto Networking
1 Department of Business Administration SPRING Management Science by Asst. Prof. Sami Fethi © 2007 Pearson Education.
دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC کنترل پيش بين-دکتر توحيدخواه.
Experimental Design, Response Surface Analysis, and Optimization
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
Lecture: 4 WDM Networks Design & Operation
Example 6.1 Capital Budgeting Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Tatham Company is considering seven.
E E Module 17 W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 ATM VP-based (or MPLS path) Restoration with Controlled Over-
W.D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Mesh-restorable Network Design (2) E E Module 13.
Introduction to rings: ring types, ring sizing and ring loading W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 E E Module.
Quantitative Comparison of End-to-End Availability of Service Paths in Ring and Mesh- Restorable Networks Matthieu Clouqueur, Wayne D. Grover
Understand p-Cycles, Enhanced Rings, and Oriented Cycle Covers Wayne D. Grover TRLabs and University of Alberta TRLabs and University of Alberta Edmonton,
BROADNETS 2004 San José, California, USA October 25-29, 2004 p-Cycle Network Design with Hop Limits and Circumference Limits Adil Kodian, Anthony Sack,
Optimization for Network Planning Includes slide materials developed by Wayne D. Grover, John Doucette, Dave Morley © Wayne D. Grover 2002, 2003 E E 681.
E E Module 18 M.H. Clouqueur and W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Analysis of Path Availability in Span-Restorable.
High-Availability Network Architectures (HAVANA): High-Availability Network Architectures (HAVANA): Comparative Study of Fully Pre-Cross- Connected Protection.
Routing algorithms, all distinct routes, ksp, max-flow, and network flow LPs W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 E.
E E Module 10 © Wayne D. Grover 2002, Introductory Briefing on RingBuilder™ Research prototype ring-network design system developed
Advances in Optical Network Design with p-Cycles: Joint optimization and pre-selection of candidate p-cycles (work in progress) Wayne D. Grover, John Doucette.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.
By Saparila Worokinasih
Computational Stochastic Optimization: Bridging communities October 25, 2012 Warren Powell CASTLE Laboratory Princeton University
Copyright © Wayne D. Grover 2000 EE 681 Fall 2000 Lecture 15 Mesh-restorable Network Design (2) W. D. Grover, October 26, 2000 copyright © Wayne D. Grover.
MIT ICAT ICATMIT M I T I n t e r n a t i o n a l C e n t e r f o r A i r T r a n s p o r t a t i o n Virtual Hubs: A Case Study Michelle Karow
Trust-Aware Optimal Crowdsourcing With Budget Constraint Xiangyang Liu 1, He He 2, and John S. Baras 1 1 Institute for Systems Research and Department.
Minimum Cost Flows. 2 The Minimum Cost Flow Problem u ij = capacity of arc (i,j). c ij = unit cost of shipping flow from node i to node j on (i,j). x.
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.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
Logical Topology Design
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Chapter 3 Algorithms Complexity Analysis Search and Flow Decomposition Algorithms.
MAIN RESULT: Depending on path loss and the scaling of area relative to number of nodes, a novel hybrid scheme is required to achieve capacity, where multihop.
1 P-Cycles. 2 What’s a p-Cycle? A preconfigured cycle formed out of the spare capacities in the network –A p-cycle uses one unit of spare capacity on.
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
1 Inventory Control with Time-Varying Demand. 2  Week 1Introduction to Production Planning and Inventory Control  Week 2Inventory Control – Deterministic.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Log Truck Scheduling Problem
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.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
EMIS 8373: Integer Programming Column Generation updated 12 April 2005.
Management Science 461 Lecture 3 – Covering Models September 23, 2008.
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.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.
Management Science 461 Lecture 4b – P-median problems September 30, 2008.
Presented by Tae-Seok Kim
For Products and Services
Solver & Optimization Problems
Parallel Programming Patterns
John Doucette and Wayne D. Grover
Globecom 2003 December 1-5, San Francisco, California
Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Nov. 7, 2000
1.206J/16.77J/ESD.215J Airline Schedule Planning
The University of Adelaide, School of Computer Science
Addressing uncertainty in a transshipment problem
TRLabs & University of Alberta © Wayne D. Grover 2002, 2003, 2004
Span-restorable Mesh Network Design
Design of Networks based on multiple rings
Introduction to Survivable Rings
REVIEW FOR EXAM 1 Chapters 3, 4, 5 & 6.
Breakout Sessions MIS5001 – Sept 12, 2018.
Presentation transcript:

Effects of TSI/TSA (or Wavelength Conversion) on Ring Loading E E Module 8 W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003

E E Module 9 © Wayne D. Grover 2002, With Time Slot Interchange (TSI) ADM nodes can shift demands around as needed to which ever might be free in the next span. Functionally, TSI in SONET ADMs is the same as Wavelength Conversion in an Optical wavelength ADM (“OADM”). Assuming this capability, all the “loading” formulation needs to consider is the line capacity constraint on each span. Therefore, TSI is an implicit technology assumption in the prior formulations. When TSI is not a capability of the ADMs, the ring is said to be operating in Time Slot Assignment (TSA) mode (or that it is optically “transparent”). The TSA mode ring -loading problem is more computationally complex because each channel (or wavelength) must be associated with a specific demand for its entire path through the ring. Representing Time-slot assignment in the formulations

E E Module 9 © Wayne D. Grover 2002, with TSI (or wavelength conversion) : d1d1 dkdk “colour clash” resolved by TSI (or wavelength conversion) (add / drop) without TSI / wavelength cconversion (i.e., TSA mode): initial assignments must avoid “colour clash” only add / drop allows re-use Representing Time-slot assignment in the formulations

E E Module 9 © Wayne D. Grover 2002, Inputs (“parameters”) Outputs (“variables”) BLSR Ring “Loading” in TSA mode

E E Module 9 © Wayne D. Grover 2002, maximize the number of unit demands served, over all timeslots in both directions. A timeslot t cannot be used more than once in either direction on each span. you can refuse any demand, or serve it entirely. Note: this formulation permits “demand (bundle) splitting” within the ring: - Why is this the case? BLSR Ring “Loading” in TSA mode decisions are binary

E E Module 9 © Wayne D. Grover 2002, Consider what has happened to the complexity: |R| * Cinequality constraints |D|equality constraints 3 |D| * C{0/1} variables |R| inequality constraints |D| equality constraints 2 |D|{0/1} variables BLSR Ring “Loading” in TSA mode Previously (TSI case) had:Now (TSA case) have:

E E Module 9 © Wayne D. Grover 2002, Research questions posed: 1. How important is TSA (or wavelength conversion) to maximizing the loading efficiency of BLSR or OPSR type rings? 2. What is the potential benefit of permitting demand bundle splitting in ring loading? Motivation: Wavelength conversion may be quite costly in optical ADMs.  What is the penalty for optical ring networking without interchange abilities?  RingBuilder development context…. Do we need to solve TSA sub-problems or will TSI be adequate ? Overview of a recent study G. D. Morley, W.D. Grover, "Effects of Channel Interchange and Directional Demand Splitting on the Loading Efficiency of SONET or DWDM Line-switched rings," Journal of Network and Systems Management (Plenum Press), Vol. 10, No. 4, 2002, pp

E E Module 9 © Wayne D. Grover 2002, Study Methodology: - Define 4 mathematical models for loading process: with / without TSI with / without permitting demand splitting - Model random instances of mesh-like, single-hub, dual-hub demand patterns - Treat size of demand pool for each trial case, relative to total ring bw-hops, as a parameter. - consider: and 48- channel rings of 5 spans, and 48- channel rings of 10 spans, - somewhat over 12,000 randomized trials (~ 3,000 each ring scenario) - solve each loading formulation for each ring x demand pattern trial case Overview of a recent study

E E Module 9 © Wayne D. Grover 2002, Quantitative Measures defined to characterize the issues of the study: - Loading efficiency: for the TSA case for the TSI case - Relative size of the available demand pool: “circumferential capacity of the ring” Q. What upper limit does |R|C represent? Overview of a recent study

E E Module 9 © Wayne D. Grover 2002, node, 48 channel ring, mesh demand, TSI 10 node, 48 channel ring, mesh demand, TSI same ring can vary in efficiency by factor of two even under optimal loading...efficiency is highly dependent on exact demand patterns splitting demand bundles into cw / ccw mixed flows can improve efficiency % on average, up to 33% in the 90th percentile cases ring with more spans are harder to load as efficiently or, conversely, require a larger demand pool to achieve high loadings. Selected Results

E E Module 9 © Wayne D. Grover 2002, A more surprising finding: Frequency of cases (merged split / non split data for random mesh, 10 node ring) In only 15 trials (out of 3372) did TSI increase achievable loading efficiency ! Overview of a recent study: Selected Results

E E Module 9 © Wayne D. Grover 2002, This seems counter-intuitive. What is the interpretation ? The optimal solver for the non TSI case is almost always able to find a set of loading choices and fixed timeslot assignments that serves as much demand as the TSI solutions. However both problems (TSI / TSA loading) are being solved “from the ground up”. That is, all postulated demands are assumed known and available at the single ring loading design time. Above may be accurate for entire network design / redesign contexts but an alternate situation is provisioning new demands that arise one-by-one, incrementally. TSI may be much more important in the latter context (we don’t know yet.) Related ongoing research problems: - optimal formulation or algorithm for continuous incremental loading ? - treatment of uncertainty in loading policy ? - how much would limited TSI improve incremental loading efficiency? Overview of recent “loading study”: