© Rui Wang Cycle-Oriented Distributed Preconfiguration Ring-like Speed with Mesh-like Capacity for Self-planning Network Restoration 1 Sep. 2009 Rui Wang.

Slides:

Advertisements

Similar presentations

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

Advertisements

Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.

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

LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.

W.D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Mesh-restorable Network Design (2) E E Module 13.

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.

Resolving a Question about Span Restoration: Do Loopbacks Involve a Capacity Penalty? Wayne D. Grover TRLabs and Dept. of Electrical and Computer Engineering,

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

Traffic Engineering With Traditional IP Routing Protocols

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

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,

Capacity Comparison of Mesh Network Restoration and Protection Schemes Under Varying Graph Connectivity John Doucette Wayne D. Grover TRLabs and University.

© Manasa Resilience of Flooding Protocol – A Case Study EECS 801 Graduate Reading © 2008–Manasa K Aug Manasa K Department of Electrical Engineering.

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.

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.

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

1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.

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

IP layer restoration and network planning based on virtual protection cycles 2000 IEEE Journal on Selected Areas in Communications Reporter: Jyun-Yong.

E E Module 13 © Wayne D. Grover 2002, p-Cycles Jens Myrup Pedersen Aalborg University © Wayne D. Grover 2002, 2003 E E Module 13 ( Version.

E E Module 20 W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Distributed Mesh Span Restoration.

A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.

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.

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.

Network Topologies.

International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

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.

M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol

1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.

Multicast Routing in Mobile Ad Hoc Networks (MANETs)

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.

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.

Streaming over Subscription Overlay Networks Department of Computer Science Iowa State University.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.

Live Streaming over Subscription Overlay Networks CS587x Lecture Department of Computer Science Iowa State University.

Biologically-inspired ring design in Telecommunications Tony White

Co-Grid: an Efficient Coverage Maintenance Protocol for Distributed Sensor Networks Guoliang Xing; Chenyang Lu; Robert Pless; Joseph A. O ’ Sullivan Department.

The Network Layer.

A Novel Multicast Routing Protocol for Mobile Ad Hoc Networks Zeyad M. Alfawaer, GuiWei Hua, and Noraziah Ahmed American Journal of Applied Sciences 4:

SIMPLE: Stable Increased Throughput Multi-hop Link Efficient Protocol For WBANs Qaisar Nadeem Department of Electrical Engineering Comsats Institute of.

Cut Saturation for p-cycle Design Khalid Al-Snaie Electronics Dept., College of Technology Riyadh, Saudi Arabia Dale R. Thompson* Department of Computer.

LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

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.

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.

SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.

November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.

An Adaptive Zone-based Storage Architecture for Wireless Sensor Networks Thang Nam Le, Dong Xuan and *Wei Yu Department of Computer Science and Engineering,

Heterogeneous Wireless Access in Large Mesh Networks Haiping Liu, Xin Liu, Chen-Nee Chuah, Prasant Mohapatra University of California, Davis IEEE MASS.

1 Protection in SONET Path layer protection scheme: operate on individual connections Line layer protection scheme: operate on the entire set of connections.

Parallelizing Functional Tests for Computer Systems Using Distributed Graph Exploration Alexey Demakov, Alexander Kamkin, and Alexander Sortov

Doc.: IEEE /2200r2 Submission July 2007 Sandesh Goel, Marvell et alSlide 1 Route Metric Proposal Date: Authors:

Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.

Cycle-Oriented Distributed Preconfiguration: Ring-like Speed with Mesh-like Capacity for Self-planning Network Restoration Wayne D.Grover, Demetrios Stamatelakis.

Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)

Route Metric Proposal Date: Authors: July 2007 Month Year

Self Healing and Dynamic Construction Framework:

Network Survivability

Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li University of Pittsburgh, Pittsburgh, PA Hui Ling.

TRLabs & University of Alberta

Backbone Traffic Engineering

Route Metric Proposal Date: Authors: July 2007 Month Year

Kyu-Han Kim and Kang G. Shin

Presentation transcript:

© Rui Wang Cycle-Oriented Distributed Preconfiguration Ring-like Speed with Mesh-like Capacity for Self-planning Network Restoration 1 Sep Rui Wang Department of Electrical Engineering & Computer Science Information Technology & Telecommunications Research Center ResiliNets Research Group The University of Kansas

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration2 Cycle-Oriented Distributed Preconfiguration Abstract Cycle-oriented preconfiguration of spare capacity is a new idea for designing and operating mesh-restorable networks. It aims to attain the capacity-efficiency of a mesh-restorable network, while approaching the speed of self-healing rings. Compare with self- healing rings, the method contributes more failure schemes to the restoration.

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration3 Cycle-Oriented Distributed Preconfiguration Outline The concept of Cycle Preconfiguration Optimal Design of p-cycle Restorable Networks Self-organization of the p-cycle state Conclusion

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration4 Cycle-Oriented Distributed Preconfiguration The concept of Cycle Preconfiguration The concept of Cycle Preconfiguration Optimal Design of p-cycle Restorable Networks Self-organization of the p-cycle state Conclusion

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration5 Cycle-Oriented Distributed Preconfiguration The concept of Cycle Preconfiguration Background -mesh-restorable network -self-healing rings network Motivation -real-time restoration of mesh networks -increase the speed of mesh-based restoration schemes

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration6 Cycle-Oriented Distributed Preconfiguration The concept of Cycle Preconfiguration P-cycles: base on the formation of pre-configured cycles - more widely protect the network as a whole - two nodes have real-time cross-connection workload for any failure

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration7 Cycle-Oriented Distributed Preconfiguration The concept of Cycle Preconfiguration Fig. a - an example of p-cycle Fig. b - a span on the cycle breaks and the remaining arc restore Fig. c and d - p-cycle can be accessed for restoration of working paths that are not on the cycle [Credit: Grover-Stamatelakis-1998]

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration8 Cycle-Oriented Distributed Preconfiguration The concept of Cycle Preconfiguration Comparison of the p-cycle and ring technologies - the speed of rings, with the efficiency of mesh network [Credit: Grover-Stamatelakis-1998]

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration9 Cycle-Oriented Distributed Preconfiguration Optimal Design of p-Cycle Restorable Networks The concept of Cycle Preconfiguration Optimal Design of p-Cycle Restorable Networks Self-organization of the p-cycle state Conclusion

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration10 Cycle-Oriented Distributed Preconfiguration Optimal Design of p-Cycle Restorable Networks How p-cycle is generated - Linear integer program (IP) is formulated - simple distinct cycles are generated from the network topology - IP generate an optimal p-cycle plan

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration11 Cycle-Oriented Distributed Preconfiguration Optimal Design of p-Cycle Restorable Networks Two p-cycle variations are developed and tested -a p-cycle plan within an existing mesh network spare capacity - a fully restorable plan minimizing spare capacity

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration12 Excess Sparing - percentage of spare capacity p-cycle design required above the mesh spare capacity design Cycle-Oriented Distributed Preconfiguration Optimal Design of p-Cycle Restorable Networks [Credit: Grover-Stamatelakis-1998]

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration13 Cycle-Oriented Distributed Preconfiguration Self-organization of the p-cycle state The concept of Cycle Preconfiguration Optimal Design of p-Cycle Restorable Networks Self-organization of the p-cycle state Conclusion

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration14 DCPC (Distributed Cycle PreConfiguration) -an adaption of the statelet processing rules of SHN (Self Healing Network) protocol -deployment and adaptation of the network cycle preconfiguration state Statelet - embedded on each spare link and contains state fields - incoming statelet - outgoing statelet - broadcast through a network - statelet format: index, hopcount, sendnode, numpaths, route Cycle-Oriented Distributed Preconfiguration Self-organization of the p-cycle state

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration15 Cycle-Oriented Distributed Preconfiguration Self-organization of the p-cycle state The p-cycle process - each node explores the network for p-cycle candidates - hand off to the next node in order - all nodes show its best found cycle - the competition flood expands through the network - the globally best cycle candidate dominates everywhere - nodes on the p-cycle update pre-plans to exploit the new one - repeat until a complete deployment of p-cycles is built

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration16 Two node roles in the DCPC - Cycler: in charge of the cycle-exploration process within the network - Tandem node: mediate the statelet broadcast competition Cycle-Oriented Distributed Preconfiguration Self-organization of the p-cycle state

© Rui Wang 1 Sep Cycle-oriented distributed preconfiguration 17 The Tandem Node - rules determine what p-cycle candidate the cycler node will discover - a new incoming statelet displace an outgoing statelet - statelets forward to adjacent nodes - from a Cycle node to Cycle node - from a Tandem to Cycle node Cycle-Oriented Distributed Preconfiguration Self-organization of the p-cycle state [Credit: Grover-Stamatelakis-1998]

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration18 Statelet’s score: s=(numpaths)/(hopcount) - numpaths: the number of useful paths - hopcount: the number of spans traverse in the statelet’s route Cycle-Oriented Distributed Preconfiguration Self-organization of the p-cycle state

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration19 The Cycler Node Role - the cycler places an outgoing statelet on one spare link - the cycler node invests a pre-determined time - the cycler maintains a record of received statelet with the best score - it grows in size as it improves its score Cycle-Oriented Distributed Preconfiguration Self-organization of the p-cycle state [Credit: Grover-Stamatelakis-1998]

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration20 Six main regions appear in the plot 10 individual cycler node exploration In the last region no node finds any feasible p-cycle candidates and the protocol terminates Cycle-Oriented Distributed Preconfiguration Self-organization of the p-cycle state [Credit: Grover-Stamatelakis-1998]

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration21 DCPC protocol performance assessment The p-cycle restorability levels achievement Trigger a follow-up real-time restoration protocol Cycle-Oriented Distributed Preconfiguration Self-organization of the p-cycle state [Credit: Grover-Stamatelakis-1998]

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration22 Cycle-Oriented Distributed Preconfiguration Conclusion The concept of Cycle Preconfiguration Optimal Design of p-Cycle Restorable Networks Self-organization of the p-cycle state Conclusion

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration23 Cycle-Oriented Distributed Preconfiguration Conclusion Cycle-oriented preconfiguration of spare capacity is a technological enabler for restoration with the speed of rings while retaining the capacity efficiency of a span restorable mesh network - restoration is performed by simply breaking into these cycles and substituting traffic at failure time - it remains a mesh restoration technology

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration24 Acknowledgements Thanks to Prof. James for advice Thanks to ResiliNets group for help

© Rui Wang 1 Sep. 2009Cycle-oriented distributed preconfiguration25 Reference [Credit: Grover-Stamatelakis-1998] W.D. Grover and D. Stamatelakis, "Cycle-oriented distributed pre-configuration: ring- like speed with mesh-like capacity for self-planning network restoration", in Proc. IEEE International Conf. Commun. (ICC '98), pp , Atlanta, June 8-11, 1998