scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

01 Jun 1998-IEEE ACM Transactions on Networking (IEEE Press)-Vol. 6, Iss: 3, pp 325-336
TL;DR: A method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfermode (ATM) virtual path (VP)-based restoration and jointly optimizing working path routing and spare capacity placement.
Abstract: The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long-haul networks. Previously, the spare capacity of a network with a given set of working span sizes has been optimized to facilitate span restoration. Path restorable networks can, however, be even more efficient by defining the restoration problem from an end to end rerouting viewpoint. We provide a method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfer mode (ATM) virtual path (VP)-based restoration. Lower bounds on spare capacity requirements in span and path restorable networks are first compared, followed by an integer program formulation based on flow constraints which solves the spare and/or working capacity placement problem in either span or path restorable networks. The benefits of path and span restoration, and of jointly optimizing working path routing and spare capacity placement, are then analyzed.
Citations
More filters
Proceedings ArticleDOI
11 May 2003
TL;DR: This work introduces a significant extension to the p-cycle technique to include path protection or protection of any flow segment along a path as well as the original span protection use of p-cycles, and shows that path-segment-protecting p- cycles have capacity efficiency near that of a path-restorable network.
Abstract: This work introduces a significant extension to the method p-cycles for network protection. The main advance is the generalization of the p-cycle concept to protect multi-span segments of contiguous working flow, not only spans that lie on the cycle or directly straddle the p-cycle. This effectively extends the p-cycle technique to include path protection or protection of any flow segment along a path as well as the original span protection use of p-cycles. It also gives an inherent means of transit flow protection against node loss. We develop a capacity optimization model for the new scheme and compare it to prior p-cycle designs and other types of efficient mesh-survivable networks. Results show that path-segment-protecting p-cycles have capacity efficiency near that of a path-restorable network is to suggest the use of flow p-cycles to protect transparent optical express flows through a regional network.

32 citations


Cites background from "Optimal capacity placement for path..."

  • ...The reference problems all solved in seconds or minutes at most....

    [...]

Journal ArticleDOI
TL;DR: This paper proposes a novel approach for fault tolerance in MPLS networks that introduces no packet loss and no recovery delay while requiring reasonable redundant bandwidth and can easily handle single and multiple path failures.

31 citations


Cites methods from "Optimal capacity placement for path..."

  • ...The proposed work in reference [31] provides a method for capacity optimization for path and span restorable networks....

    [...]

Posted Content
TL;DR: This work improves over the self-healing algorithms Forgiving tree and Forgiving graph in that it is able to give guarantees on degree and stretch, while at the same time preserving the expansion and spectral properties of the network.
Abstract: We consider the problem of self-healing in reconfigurable networks (e.g. peer-to-peer and wireless mesh networks) that are under repeated attack by an omniscient adversary and propose a fully distributed algorithm, Xheal that maintains good expansion and spectral properties of the network, also keeping the network connected. Moreover, Xheal does this while allowing only low stretch and degree increase per node. Thus, the algorithm heals global properties while only doing local changes and using only local information. Our work improves over the self-healing algorithms 'Forgiving tree'[PODC 2008] and 'Forgiving graph'[PODC 2009] (using a similar model) in that we are able to give guarantees on degree and stretch, while at the same time preserving the expansion and spectral properties of the network. These repairs preserve the invariants in the following sense. At any point in the algorithm, the expansion of the graph will be either `better' than the expansion of the graph formed by considering only the adversarial insertions (not the adversarial deletions) or the expansion will be, at least, a constant. Also, the stretch i.e. the distance between any pair of nodes in the healed graph is no more than a $O(\log n)$ factor. Similarly, at any point, a node $v$ whose degree would have been $d$ in the graph with adversarial insertions only, will have degree at most $O(\kappa d)$ in the actual graph, for a small parameter $\kappa$. We also provide bounds on the second smallest eigenvalue of the Laplacian which captures key properties such as mixing time, conductance, congestion in routing etc. Our distributed data structure has low amortized latency and bandwidth requirements.

31 citations


Cites background from "Optimal capacity placement for path..."

  • ...Many papers have discussed strategies for adding additional capacity or rerouting in anticipation of failures [3, 7, 10, 19, 26, 32, 33]....

    [...]

Book ChapterDOI
01 Jan 1999
TL;DR: Today virtually all forms of traffic, whether circuit switched as in telephony, cell-based, or packet-switched, such as in B-ISDN or the Internet, are combined into standard synchronous optical network (SONET) carrier signals for transport on fiber optic transmission systems.
Abstract: Many sectors of society, business, and industry have become dependent on the availability of communication networks. Today virtually all forms of traffic, whether circuit switched as in telephony, cell-based, or packet-switched, such as in B-ISDN or the Internet, are combined into standard synchronous optical network (SONET) carrier signals for transport on fiber optic transmission systems. A pair of optical fibers operating at the SONET rate of 9.8 Gb/s (called an OC-192) carries the equivalent of 129,000 voice or data circuits. A single cable may contain 48 or more of these fibers. The sheer volume of traffic makes the impact of a cable cut widespread and severe. Such events are, however, surprisingly frequent in practice. They have not only caused widespread congestion effects, but more serious effects such as loss of 911 service, loss of credit card services, and even the shut down of a major air traffic control network (MacDonald, 1994).

30 citations

Journal ArticleDOI
TL;DR: It can be very beneficial to exploit GMPLS protocol suite functionality to enhance the cost effectiveness of multilayer recovery significantly and highlight the opportunities and challenges to be faced.
Abstract: IP-based backbone networks are gradually moving towards a network model consisting of high-speed routers that are flexibly interconnected by lightpaths set up by an optical transport network consisting of WDM links and optical cross-connects. Recovery mechanisms at both network layers are crucial to reach the high availability requirements of critical services. In such a model, the GMPLS protocol suite can provide a distributed control plane that can be used to deliver rapid and dynamic circuit provisioning of end-to-end optical lightpaths. This article explains that it can be very beneficial to exploit this functionality to enhance the cost effectiveness of multilayer recovery significantly. Several practical case studies illustrate this concept and highlight the opportunities and challenges to be faced.

29 citations


Cites background from "Optimal capacity placement for path..."

  • ...Also, spare and working capacity are jointly optimized in the design; see [7] for information on this....

    [...]

References
More filters
Book
16 Feb 1970
TL;DR: Interestingly, integer programming and network flows that you really wait for now is coming, it's significant to wait for the representative and beneficial books to read.
Abstract: (1970). Integer Programming and Network Flows. Journal of the Operational Research Society: Vol. 21, No. 4, pp. 500-501.

638 citations

Journal ArticleDOI
TL;DR: Self-healing network techniques suitable for ATM networks in order to realize a high-reliablity B-ISDN are proposed and high-speed restoration technique which exploits the benefits of the VP is proposed and described.
Abstract: This paper proposes self-healing network techniques suitable for ATM networks in order to realize a high-reliablity B-ISDN. First, the characteristics of the virtual paths (VP) and their influence on failure restoration are discussed. A high-speed restoration technique which exploits the benefits of the VP is then proposed and described. The technique simplifies the message transmission processes and reduces the number of generated messages by using preassigned backup virtual paths. Next, the scheme used to design the backup VP routes and spare resource distribution for each link is proposed in order to create a network that applies the proposed restoration scheme. Next, self-reconstruction techniques of backup virtual paths are proposed for the realization of a reversionless restoration cycle. Finally, the feasibility of the distributed control operation is discussed. >

233 citations

Journal ArticleDOI
TL;DR: A comparative study of the effectiveness of KSP versus Max Flow as an alternative rerouting criteria in the context of transport network span restoration, and the hypothesis is made that a generalized "trap" topology is responsible for all KSP-Max Flow capacity differences.
Abstract: In the development of technologies for span failure restoration, a question arises about the restoration rerouting characteristics to be specified. In theory, maximal rerouting capacity is obtained with a maximum flow (Max Flow) criterion. However, rerouting that realizes the k-successively shortest link disjoint paths (KSP) may be faster, easier, and, in distributed implementation, more robust than a distributed counterpart for Max Flow. The issue is, therefore, what the restoration capacity penalty is if KSP is used instead of Max Flow. To explore this tradeoff, the authors present a comparative study of the effectiveness of KSP versus Max Flow as an alternative rerouting criteria in the context of transport network span restoration. The comparison applies to both centrally controlled and distributed restoration systems. Study methods include exhaustive span failure experiments on a range of network models, and parametric and analytical investigations for insight into the factors resulting in KSP versus Max Flow differences. The main finding is that KSP restoration capacity is more than 99.9% of that from Max Flow in typical network models. The hypothesis is made that a generalized "trap" topology is responsible for all KSP-Max Flow capacity differences. The hypothesis is tested experimentally and used to develop analytical bounds which agree well with observed results. These findings and data are relevant to standards makers and equipment developers in specifying and engineering future restorable networks. >

199 citations

Proceedings ArticleDOI
02 Dec 1990
TL;DR: In order to achieve fast restoration, a distributed control mechanism that is applicable to both line and path restoration is proposed, and the shared use of spare channels for various failure scenarios, including multiple failure cases, are allowed.
Abstract: With the advent of networking technologies intelligent network elements, such as the digital cross-connect system (DCS), will make it possible to dynamically reconfigure a network for restoration purposes. Both restoration control of DCSs and spare-channel design issues are presented, and how they work together so that a fast and economical SONET self-healing network is obtained. In order to achieve fast restoration, a distributed control mechanism that is applicable to both line and path restoration is proposed. The proposed method allows the shared use of spare channels for various failure scenarios, including multiple failure cases, so that the efficient use of spare channels can be achieved. A linear-programming-based scheme is proposed to obtain spare-channel assignment, where a network-flow technique is used. Through a simulation study, a fast and economical self-healing network is verified. >

193 citations


"Optimal capacity placement for path..." refers background or methods in this paper

  • ...Previous work used an IP approach based on -flow -cut considerations to solve the spare capacity placement problem in a span-restorable network [4], [11], [20]....

    [...]

  • ...Issues related to the restoration mechanisms themselves are addressed in related works [1], [2], [4], [21], [27]....

    [...]