Download presentation

Presentation is loading. Please wait.

Published byNorman Buttrum Modified over 2 years ago

1
copyright © Wayne D. Grover 2000 EE 681 Fall 2000 Lecture 14 Mesh-restorable Network Design (1) Wayne D. Grover, TRLabs / University of Alberta October 24, 2000

2
copyright © Wayne D. Grover 2000 Key ideas and vision behind “mesh” restoration (1) many real networks are highly mesh-like in their topology (2) for restoration, generalized re-routing over the graph can permit greater sharing of spare capacity –the redundancy will go down in proportion to the average nodal degree (3) the network can be its own computer for the real-time solution of the restoration re-routing problem –the network can self-organize restoration pathsets is a split-second –without any external control or databases (4) if a network is mesh-oriented it is more flexible and adaptable to unforeseen patterns of demand –the network can continually self-organize its mapping of physical transmission to logical transport configuration to suit time-and-spatially varying demand patterns

3
copyright © Wayne D. Grover 2000 A look at some real network topologies 32-node Italian backbone transport network

4
copyright © Wayne D. Grover 2000 A look at some real network topologies Belgian national transport network (Belga 39 - 39 nodes, 59 spans)

5
copyright © Wayne D. Grover 2000 A look at some real network topologies “COST 239” European Community project model ( 19 nodes, 40 spans)

6
copyright © Wayne D. Grover 2000 A look at some real network topologies “Bellcore” (New-Jersey LATA) (LATA = local access and transport area)

7
copyright © Wayne D. Grover 2000 A look at some real network topologies “MCI” North American continental backbone (homeomorphism of topology only)

8
copyright © Wayne D. Grover 2000 A look at some real network topologies Level (3) North American continental backbone

9
copyright © Wayne D. Grover 2000 Representing networks in a “.snif” file Date: File Name: bellcore.snif Network: New Jersey LATA area from 1993 publication... Program: Jointspandatprep.exe followed by AMPL JointSCP.mod NodeXcoordYcoord 06075 14080 27080 35070 41040 51055 64550 73047 84540 96030 103030 111020 125010 131570 147050 SpanNodeANodeBDistanceWorkingSpare 1019.0000002012 2026.000000816 301421.000000164 41214.000000284 5136.0000003232 611311.0000004816 721416.0000002012 83138.0000002416 931411.0000004816 10477.0000002828 114117.000000028 12565.0000001228 13577.0000007624..... to last span entry (28 here) snif = TRLabs standard network interface file Notes: - x,y node co-ordinates are optional to support graphical display applications - working and spare quantities may or may not be present depending on use or stage of design processing

10
copyright © Wayne D. Grover 2000 Our journey will follow this sequence of concepts.... Theory and methods for mesh-restorable network capacity design –span restoration –path restoration –non-joint, joint, modular,..other variations “Selfhealing”: –distributed real-time restoration Self-organization: –continual autonomous adaptation of transport to suit demands

11
copyright © Wayne D. Grover 2000 Capacity design of Mesh restorable networks Start by looking at some actual fiber-optic transmission facilty networks...

12
copyright © Wayne D. Grover 2000 Basics of Mesh-restorable networks (28 nodes, 31 spans) 30% restoration 70% restoration 100% restoration span cut

13
copyright © Wayne D. Grover 2000 Basics of Mesh-restorable networks (28 nodes, 31 spans) span cut 40% restoration 70% restoration 100% restoration

14
copyright © Wayne D. Grover 2000 Basics of Mesh-restorable networks Spans where spare capacity was shared over the two failure scenarios ?..... This sharing efficiency increases with the degree of network connectivity “nodal degree”

15
copyright © Wayne D. Grover 2000 Basics of Mesh-restorable networks

16
copyright © Wayne D. Grover 2000 Basics of Mesh-restorable networks Mesh networks require less capacity as graph connectivity increases (sample result)

17
copyright © Wayne D. Grover 2000 A simple lower-bound on achievable redundancy Consider two idealizations: –(1) restoration is “end node limited” i.e., the min cut governing restoration path number is at one or the other of the custodial nodes –(2) node has span degree d –(3) all wi are equal at the node mesh equivalent of the ‘perfect balance’ notion with rings then:... OCX W W W W d spans in total if any one span fails, the total spare capacity on the surviving (d-1) spans must be >= to w. hence.... redundancy = (node) d

18
copyright © Wayne D. Grover 2000 A simple lower-bound on achievable redundancy Comment and interpretation: This just says that in the idealized limit every span has w working capacity and w/(d-1) spare capacity. Although the redundancy ratio falls as (d-1) -1, the absolute working and spare quantities fall even faster as d increases. In practise, the lower limit is not achieved primarily because w i values are not balanced, rather than because (span-) restoration is not end-node limited (it almost always is above a certain d.) Class problem (extension of the basic result): show that with unequal w i values at a node, a more general lower bound on spare capacity is given by the relationship: where the notation s1, s2, w1, w2 denotes the largest and second-largest spare and working capacity quantities at the node.

19
copyright © Wayne D. Grover 2000 Review: Link, Span, Path and Route terminology G C D E F A B a path its route

20
copyright © Wayne D. Grover 2000 Review: Types of “route”: fully disjoint, span disjoint, and distinct

21
copyright © Wayne D. Grover 2000 Span restoration: what we mean The set of working paths severed by a span cut are restored by substitution of a set of local replacement paths between the end nodes of the failed span. The restoration path-set is equivalent to single-commodity max-flow routing or k- shortest paths routing between failure end nodes within the surviving portion of the reserve network. The number of paths crossing any span must respect the discrete spare capacity on the span. Example:

22
copyright © Wayne D. Grover 2000 Some notes on span restoration A network employing a span restoration mechanism and an optimally designed (e.g., minimal capacity) reserve network that just supports the target level of restorability by that mechanism is what we mean by “a span-restorable mesh network”. It has been found that in relatively sparse but non-planar graphs, k-shortest paths > ~ 99% of max-flow. Ref: ( D.A. Dunn, W.D. Grover, M.H. MacGregor, “A comparison of k-shortest paths and maximum flow methods for network facility restoration”, IEEE J. Sel. Areas in Communications, Jan. 1994, vol. 12, no. 1, pp. 88-99.) In test cases a distributed restoration algorithm (DRA) must find the same maximal number of simultaneously feasible restoration paths within the discrete-capacitated spare capacity graph as a centralized reference algorithm. (P.N.E. = 1 ).

23
copyright © Wayne D. Grover 2000 Overview of three basic * approaches for mesh spare capacity design Sakauchi - “cut oriented” formulation Herzberg - “arc - path” formulation “Transportation-like” problem formulation Note: In these basic methods, the working paths are first shortest-path routed before solving the spare capacity placement problem. This is what we later refer to as the “non-joint” problem.

24
copyright © Wayne D. Grover 2000 Where: S = set of all spans c i = cost of a spare link on span i. s i = number of spare links assigned to span i. C i = set of “partial cutsets” relevant to restoration of span i. = 1 if span j is a member of the c th partial cutset relevant to restoration of span i, 0 otherwise. c = an individual cutset in the set Ci w i = the number of working links on span i (working demands are routed prior to solving for the spare capacity.) Sakauchi’s “min-cut max-flow” approach for spare capacity design Ref: H. Sakauchi, et al., “A self-healing network with an economical spare-channel assignment” IEEE GLOBECOM ‘90, pp. 438-443, 1990. S.t.

25
copyright © Wayne D. Grover 2000 Review of Min-cut max-flow theorem (basis for Sakauchi’s method) A cut of a graph G(V,E) is a partitioning of the nodes of the graph into two disjoint sets A cutset is the set of edges. The capacity of a cut is the sum of the weights on the edges of the cutset. The min-cut max-flow theorem is that : or... More intuitively: “regardless of the routing details, the maximum flow between two nodes is set by the minimum capacity of any cut of the between those two nodes” or…“some combination of spans in parallel will always act as the bottleneck”

26
copyright © Wayne D. Grover 2000 Recall: the “max-flow = min-cut” concept A B E C D F 20 6 6 8 6 6 26 12 20 32 26 the “min-cut” = 12 Hence --> no routing solution can provide more than 12 units of flow between A -F (i.e., this is the “max-flow”)

27
copyright © Wayne D. Grover 2000 How Sakauchi uses this: sizing the cutsets to support restoration 1 2 4 3 5 w 1-2 s 1-4 s 3-4 s 1-3 s 2-5 s 4-5 C 1 C 2 C 3 C 4 C 5 Illustrating the “partial cutsets” relevant to restoration of span (1-2): Corresponding constraints: C1: s1-3 + s1-4 + s1-5 w1-2 C2: s3-4 + s1-4 + s1-5 w1-2 C3: s4-5 + s1-5 w1-2 C4: s4-5 + s1-5 + s2-5 w1-2 C5: s2-5 w1-2

28
copyright © Wayne D. Grover 2000 Sakauchi’s method - technical aspects Number of cuts of graph is O(2 S ) –Have only S variables but S O(2 S-1 ) partial cutset constraints in a complete (fully constrained) formulation –> hence row generation (in the primal) methods have been used. Row generation: –Each added row represents a new partial cutset constraint for a span that is not yet fully restorable. –Uses a separate program to test for full restorability (formulation itself has no explicit expression of restorability for built-in infeasibility detection.) –Sakauchi used the N-1 basic cuts of a graph in the initial tableau. –Venables provided composite strategy for incident cutset constraints in initial tableau plus targeted discovery of “most relevant” additional cutset constraints. Other practical aspects: –Can run as LP with rounding up at each iteration –Don’t get (or control) restoration path-sets –Corresponds to perfect max-flow restoration routing

29
copyright © Wayne D. Grover 2000 Venables strategy for initializing Sakauchi’s cut- dimensioning approach “Incident cutset “ constraints: s 2 w 0 s 3 + s 1 w 0 s 5 + s 7 w 2 s 0 w 2 s 6 w 4 s 1 w 4 s 4 w 6 s 5 + s 8 + s 3 w 6 s 3 + s 0 w 1 s 4 w 1 s 6 + s 5 + s 8 w 3 s 0 + s 1 w 3 s 7 s 2 w 5 s 6 + s 8 + s 3 w 5 s 5 + s 2 w 7 s 8 w 7 s 6 + s 5 + s 3 w 8 s 7 w 8 Ref: B. Venables, M.Sc.thesis, “Algorithms for near optimal design of mesh-restorable transport networks”, University of Alberta, Fall 1992.

30
copyright © Wayne D. Grover 2000 1. Run restoration routing algorithm to find an un-restorable span. 2. Inspect the restoration path-set for that span (available as a result from 1.) 3. Remove saturated edges from the graph. 4. Each combination of disconnected sub-graphs in which two subgraphs remain, one containing s, the other t, defines a new cutset constraint. 5. Done when step 1. Finds all spans fully restorable. Venables strategy for discovering new cut-set constraints Next cut-set constraint: s7 + s3 +s6 >= w5 (also: s0 + s7 >= w5 ) s t remove edges saturated by the restoration routing trial (or at zero in the LP) 1 path s i values after first LP iteration

31
copyright © Wayne D. Grover 2000 Where: S, c i, s i, w i are as before P i is a set of “eligible routes” for restoration of span i is an assignment of restoration flow for span i to the p th eligible route encodes the eligible restoration routes: = 1 if span j is in the p th eligible route for restoration of span i Herzberg’s “arc-path” hop-limited approach Subject to: Restorability : Spare capacity : Ref: M. Herzberg, and S. Bye, “An optimal spare- capacity assignment model for survivable networks with hop limits,” Proc. IEEE GLOBECOM ‘94, pp. 1601-1607, 1994.

32
copyright © Wayne D. Grover 2000 Understanding the span-restorable mesh spare capacity problem through Herzberg’s approach Flows over eligible routes Represented in the eligible route - defining information input Flows simultaneously imposed on any span s i values

33
copyright © Wayne D. Grover 2000 Herzberg’s approach - technical aspects working paths are routed prior to this formulation --> (provides the wi’s) A separate program finds “all distinct routes” for each failure scenario (depth-first search). DFS may be limited by a hop - count, a distance limit, any other operational criterion. These become the “eligible routes” for restoration. “Eligible routes” are not apriori decisions about the restoration routes to be taken for each failure…they only represent the routes available for restoration flow assignment. There are –S restorability constraints (equalities) and S(S-1) spare capacity generating inequality constraints. –~ variables - but controllable via eligible routes. Yields restoration path-set details along with reserve network spare capacity. The LP relaxation sometimes acts unimodular but this is data-dependent. Solution as IP often solves quickly enough or a “repair” procedure can be devised for fractional outcomes when solved as LP.

34
copyright © Wayne D. Grover 2000 How hop-limit affects complexity and solution quality in Herzberg’s formulation Threshold value ( for the network shown ) ( Total spare capacity, total number of eligible restoration routes ) Minimum spare Below the design threshold hop-limit, solution quality is affected. Above the threshold hop limit, computational difficulty grows unnecessarily

35
copyright © Wayne D. Grover 2000 Some practical notes re: “hop limit” concept In practice, –hop limits can easily be converted to mileage limits or combined hop / distance limits in generating the eligible route-sets for the formulation. –the basic idea of a single network-wide hop limit can evolves into approaches such as adapting hop limits per span (and per working route in the joint formulations) so as to assure a minimum representation of route diversity, within a computational “budget” for numbers of variables and constraints.

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google