Exploiting Forcer Structure to Serve Uncertain Demands and Minimize Redundancy of p-Cycle Networks Gangxiang Shen & Wayne D. Grover TRLabs and University.

Slides:



Advertisements
Similar presentations
An Efficient Strategy for Wavelength Conversion in WDM p-Cycle Networks Dominic A. Schupke, Matthias C. Scheffel Wayne.
Advertisements

The “Forcer” Concept & Forcer-Clipping Ring-Mesh Hybrid Networks E E Module 14 W.D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002,
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
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.
Benefits of p-Cycles in a Mixed Protection and Restoration Approach DRCN Benefits of p-Cycles in a Mixed Protection and Restoration Approach François.
Capacity Design Studies of Span-Restorable Mesh Transport Networks With Shared-Risk Link Group (SRLG) Effects John Doucette, Wayne D. Grover
P-Cycle Network Design: from Fewest in Number to Smallest in Size Diane P. OnguetouWayne D. Grover Diane P. Onguetou and Wayne D. Grover TRLabs and ECE,
Quantitative Comparison of End-to-End Availability of Service Paths in Ring and Mesh- Restorable Networks Matthieu Clouqueur, Wayne D. Grover
Mesh Restorable Networks with Complete Dual Failure Restorability and with Selectvely Enhanced Dual-Failure Restorability Properties Matthieu Clouqueur,
Understand p-Cycles, Enhanced Rings, and Oriented Cycle Covers Wayne D. Grover TRLabs and University of Alberta TRLabs and University of Alberta Edmonton,
P-Cycles, Ring-Mesh Hybrids and “Ring-Mining:” Options for New and Evolving Optical Networks Wayne D. Grover TRLabs and University of.
Placement of Integration Points in Multi-hop Community Networks Ranveer Chandra (Cornell University) Lili Qiu, Kamal Jain and Mohammad Mahdian (Microsoft.
BROADNETS 2004 San José, California, USA October 25-29, 2004 p-Cycle Network Design with Hop Limits and Circumference Limits Adil Kodian, Anthony Sack,
Capacity Comparison of Mesh Network Restoration and Protection Schemes Under Varying Graph Connectivity John Doucette Wayne D. Grover TRLabs and University.
Factors Affecting the Efficiency of Demand-wise Shared Protection Brian Forst, Wayne D. Grover Contact: Electrical and.
C O R P O R A T E T E C H N O L O G Y Strategies for Enhanced Dual Failure Restorability with Static or Reconfigurable p-Cycle Networks International Conference.
TRLabs Confidential SmartBoard Presentation May 29 May 29 th 2003, SmartBoard Presentation NFOEC-2003Sep 11, 2003 Ring Mining to p-Cycles as a Target Architecture.
Chapter 7 Network Flow Models.
PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.
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.
Mesh Restorable Networks with Multiple Quality of Protection Classes Wayne D. Grover, Matthieu Clouqueur TRLabs and.
High-Availability Network Architectures (HAVANA): High-Availability Network Architectures (HAVANA): Comparative Study of Fully Pre-Cross- Connected Protection.
1 Intrusion Monitoring of Link-State Routing Protocols Akshay Aggarwal Poornima Balasubramanyam Karl Levitt Computer Security Laboratory Department of.
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.
OFC 2004, Los Angeles, CA Restorable Mesh Network Design under Demand Uncertainty: Toward “Future Proofed” Transport Investments Dion Leung, Wayne Grover.
Capacity Requirements for Network Recovery from Node Failure with Dynamic Path Restoration Gangxiang Shen and Wayne D. Grover TRLabs and University of.
W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Graph theory and routing (initial background) E E Lecture 4.
Comparison of MSTP and (G)ELS Benchmarking Carrier Ethernet Technologies Workshop Session AI.1: Scientific and Technical Results Krakow, Poland April 30,
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
E E Module 10 © Wayne D. Grover 2002, Introductory Briefing on RingBuilder™ Research prototype ring-network design system developed
Algorithmic Approaches for Efficient Enumeration of Candidate p-Cycles and Capacitated p-Cycle Network Design John Doucette 1,2, Donna He 3, Wayne D. Grover.
University of Alberta ECE Department Network Systems Gangxiang Shen, Wayne D. Grover Extending the p-Cycle Concept to Path-Segment Protection Gangxiang.
Finding Protection Cycles in DWDM Networks 2002 IEEE ICC on Volume 5, 28 April-2 May Page(s): Reporter: Jyun-Yong Du.
E E Module 16 Path-oriented Survivable Mesh Networks W.D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003.
© Rui Wang Cycle-Oriented Distributed Preconfiguration Ring-like Speed with Mesh-like Capacity for Self-planning Network Restoration 1 Sep Rui Wang.
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.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
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.
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
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 : ,
E E 681 Fall Lecture 23 Course Wrap-up & Challenges for Future Optical Networking Matthieu Clouqueur TR Labs & University of Alberta.
Cut Saturation for p-cycle Design Khalid Al-Snaie Electronics Dept., College of Technology Riyadh, Saudi Arabia Dale R. Thompson* Department of Computer.
1 - CS7701 – Fall 2004 Review of: Detecting Network Intrusions via Sampling: A Game Theoretic Approach Paper by: – Murali Kodialam (Bell Labs) – T.V. Lakshman.
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.
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.
On Optimal Geographic Routing in Wireless Networks with Holes and Non-Uniform Traffic Sundar Subramanian, Sanjay Shakkottai and Piyush Gupta INFOCOM 2007.
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.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
A study of provision of protecting capability after link failure in WDM networks 在 WDM 網路下以 FIPP 保護環連續供給保護能力之研究 作 者 : 丁德榮 (Der-Rong Din) 賴薪吉 (Hsin-Chi.
Cycle-Oriented Distributed Preconfiguration: Ring-like Speed with Mesh-like Capacity for Self-planning Network Restoration Wayne D.Grover, Demetrios Stamatelakis.
A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,
BroadNets 2004, October 25-29, San Jose
John Doucette and Wayne D. Grover
Globecom 2003 December 1-5, San Francisco, California
Presented by: Wayne D. Grover, (co-author with Diane Prisca Onguetou)
Network Survivability
CS223 Advanced Data Structures and Algorithms
Graph theory and routing: Background for Network Design
L12. Network optimization
Design of Networks based on multiple rings
Introduction to Survivable Rings
ECE 780 A2 Traffic Engineering and Network Design Fall Term 2008
Shortest path problem and its application to optical network
Presentation transcript:

Exploiting Forcer Structure to Serve Uncertain Demands and Minimize Redundancy of p-Cycle Networks Gangxiang Shen & Wayne D. Grover TRLabs and University of Alberta TRLabs and University of Alberta Edmonton, AB, Canada web site for related research group: web site for related research group: OptiComm 2003, October 13-17, Dallas, Texas

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 2 Outline Conventional survivable network design What is a forcer and what is the meaning of a forcer in a p-cycle network? Exploitation of forcer structure for a p-cycle network Experiments and results Conclusion

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 3 Conventional Survivable Network Design Node index Demand matrix Network topology Network with working capacity 5 w= Network with protection capacity 5 s= Survivable network design methods, e.g., span restoration, path restoration, p-cycle, SBPP, flow p-cycle, path-segment restoration… Here span restoration method was employed ? Who forces this span to require 5-unit spare capacity?

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 4 What is a Forcer? “A forcer is any span for which an increase in network total spare capacity is required (to retain restorability) if the span’s working capacity is increased.” Have a look at the previous example again Network with working capacity 5 w= Network with protection capacity 5 s= Network forcers 5 forcers non-forcers

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 5 Forcer in p-Cycle Networks Straddling span On-cycle span p-cycle Forcer span A p-cycle with 3-unit spare capacity 6 0 w= “A forcer is any span for which an increase in p-cycle spare capacity (corresponding to total network spare capacity) is required (to retain restorability) if the span’s working capacity is increased.” A p-cycle with 3-unit spare capacity 6 3 w= p-cycle protected envelope

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 6 Forcing Chain in p-Cycle Networks Span working capacity p-cycle protected envelope Protected working capacity envelope Span working capacity Span protection capacity How should we deal with this gap? p-cycle 3 p-cycle 1 p-cycle 2 p-cycle 4 p-cycle N p-cycle spare capacity

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 7 How to Exploit the Gaps? Forcer Filling: adding working capacity to non-forcers to make them forcers; the added capacity can be used to serve future uncertain demands. … the basic idea of this paper Protected working capacity envelope Span working capacity Protected working capacity envelope Span working capacity after forcer filling Extra protected span working capacity for future uncertain demands Just use it! No need to pay for anything for protection !

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 8 Forcer Maximized Design and its Relation to Conventional Design Regular design Working demand pattern Network topology Minimize required spare capacity for restorability Forcer maximized design Span spare capacity budget Maximize extra servable protected working channels Network topology Total network spare capacity budget

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 9 Three ILP Models Common ground of the three models --Objective: Maximize total servable protected working channels --Conditions: 1. Ensure the restorability of working capacity 2. Ensure spare capacity shall be within budgets Forcer analyzer (FA) model Maximize extra servable working channels, but disallowing to touch the existing working channels Forcer maximization-1 (FM-1) Maximize servable working channels given span spare capacity budgets, but allowing to change the existing working channels Forcer maximization-2 (FM-2) Maximize servable working channels given total network spare capacity budgets, but allowing to change the existing working channels

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 10 Test Methods and Network Topologies 1.Two metrics: hop-based and physical distance-based 2.Dijkstra’s shortest path algorithm is used to find the route for a working path 3.Demand matrixes are randomly generated within the range [1-20] for each node pair NSFNET ARPA-2 SmallNet COST239

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 11 Test Methods and Network Topologies (cont’) Level-3 network

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 12 Results of the FA Model for p-Cycle Networks Percentages of extra working channels that can be served in p-cycle networks without any increase in span spare capacity budget

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 13 Redundancy Comparison between Various Survivable Schemes 1: Conventional design 2: Forcer analyzer (FA) 3: Forcer maximization-1 (FM-1) 4: Forcer Maximization-2 (FM-2)

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 14 Concluding Discussion A simple but efficient forcer analyzer is developed Two forcer maximization design models are proposed Experiments show that there is a rich “protected working capacity bank” under the forcer structure formed in the conventional survivable network design The direct use of protected capacity in the “bank” to serve future uncertain demands ……”Just use it! No need to pay any extra spare capacity for protection! (Its already protected)” Neighbouring concept to this study is to use “protected working capacity envelope (PWCE)” to serve dynamic protected demands for efficiency and simplicity Thanks!

Gangxiang Shen and Wayne D. Grover OptiComm ‘03 Dallas 15 How to Deal with the Gaps? --Clipping and Filling Forcer Clipping: clipping forcers to make non-forcers become forcers as well and to improve network spare capacity efficiency Protected working capacity envelope Span working capacity Protected working capacity envelope Remaining span working capacity Clipped span working capacity Ring covering