Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration

Murakami, Kazutaka; Kim, Hyong S.

doi:10.1109/90.664269

Cited by 77 publications

(52 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We explain why the results in [4,5] can not be implementedas restoration mechanisms and derive technical side constraints for feasible backup solutions. The path Iayout and the Ioad balancing is calculated for the normal operation mode and for each failure scenario independently and general multi-path structures are allowed.…”

Section: Restrietions For Path Layoutmentioning

confidence: 99%

“…If backup capacity sharing is allowed, this backup capacity may be used in different failure seenarios by different rerouted traffic aggregates, which Ieads to increased resource efficiency since less additional resources must be provisioned in the network. In [4,5] multi-path routing is used. The required network resources are minimized by calculating the optimum path Iayout and routing independently for each failure scenario.…”

Section: Routing Optimizationmentioning

confidence: 99%

See 1 more Smart Citation

Self-Protecting Multipaths – A Simple and Resource-Efficient Protection Switching Mechanism for MPLS Networks

Menth

Reifert

Milbrandt

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we propose the concept of an end-to-end (e2e) SelfProtecting Multi-Path (SPM) as a protection switching mechanism that may be implemented, e.g., in Multiprotocol Label Switching (MPLS) networks. In case of local outages, resilient networks redirect the traffic from a failed link over an e2e backup path to its destination. In this case, Quality of Service (QoS) can only be provided if sufficient extra capacity is available. If backup capacity can be shared among different backup paths, multi-path routing allows for considerable savings regarding this extra capacity. The SPM consists of disjoint paths that carry the traffic bothin normal operation mode and during local outages. If a partial path is affected by a network failure, the traffic is just distributed to the remaining working paths. This structure is easy to configure and the switching to failure mode operation is simple since no signalling is required. Based on analytical results, we show that Ioad balancing of the traffic across the disjoint paths can reduce the required backup capacity significantly. The backup performance depends strongly on the network topology, and the SPM outperforms simple Open Shortest Path First (OSPF) rerouting by far.

show abstract

Section: Restrietions For Path Layoutmentioning

confidence: 99%

Section: Routing Optimizationmentioning

confidence: 99%

Self-Protecting Multipaths – A Simple and Resource-Efficient Protection Switching Mechanism for MPLS Networks

Menth

Reifert

Milbrandt

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The design of survivable networks is a classical problem that has been studied by many authors (see, e.g. [8,36,42,47,49,55]). Only a general description of the problem is given here.…”

Section: Survivable Network Designmentioning

confidence: 99%

Acceleration of cutting‐plane and column generation algorithms: Applications to network design

Ben‐Ameur

Neto

2006

Networks

View full text Add to dashboard Cite

Most of integer, convex, and large-scale linear problems are solved using cutting plane and column generation algorithms. Therefore, to handle large-size problems and to reduce the computing times, it may be very useful to accelerate cutting plane algorithms. We show in this article that we can achieve this goal by choosing good separation points. Focus is given on problems for which we have an exact separation oracle. An in-out algorithm is proposed, and the convergence is proved under some general assumptions. Computational experiments related to three classes of problems, survivable network design, multicommodity flow problems, and random linear programs, clearly point out the savings of time allowed by the simple in-out approach proposed in this article.

show abstract

“…In Path Restoration [4], [6], [8], each path disrupted by the link failure is considered separately and rerouted over an alternate path between the source and destination of that path. Link Restoration is easy to implement since only the two end nodes of the failed link are affected and the rerouting is localized but expensive in spare capacity [9]. In Path Restoration rerouting is done over a large area but is economical in spares.…”

Section: Introductionmentioning

confidence: 99%

“…In Path Restoration rerouting is done over a large area but is economical in spares. A comparative study of the two approaches is presented in [9]. Various other survivability schemes are discussed in [13].…”

Section: Introductionmentioning

confidence: 99%

Highly efficient spare capacity planning for generalized link restoration

Krishnamurthy¹,

Chandrasekaran²,

Venkatesan³

et al.

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)

View full text Add to dashboard Cite

Abstract-We consider the problem of spare capacity allocation in mesh networks for link restoration. Only single link failures are considered and restored traffic is not split across multiple paths. In our model, links that are not part of the original transport network can also be used for restoration. This model, which is a generalized version, is different from the traditional model studied in literature. We present two heuristics to solve this problem and compare their performance with known lower bounds and the optimal solution. In numerous simulation experiments on randomly generated graphs containing up to 100 nodes, the heuristics often produced solutions within 3% of the lower bound for sparse graphs. The Integer Linear Programming solutions suggest that the heuristic solutions are closer to optimal than indicated by the deviation from the lower bounds. The results are optimal or near optimal (within 0.5% of the optimum values) for small graphs containing up to 8 nodes and 18 edges.

show abstract

Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration

Cited by 77 publications

References 19 publications

Self-Protecting Multipaths – A Simple and Resource-Efficient Protection Switching Mechanism for MPLS Networks

Self-Protecting Multipaths – A Simple and Resource-Efficient Protection Switching Mechanism for MPLS Networks

Acceleration of cutting‐plane and column generation algorithms: Applications to network design

Highly efficient spare capacity planning for generalized link restoration

Contact Info

Product

Resources

About