An optimal spare-capacity assignment model for survivable networks with hop limits

Herzberg, M.; Bye, S.J.

doi:10.1109/glocom.1994.513045

Cited by 73 publications

(59 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While there have been several heuristic methods developed to design p-cycle networks [15], we will focus on integer linear programming (ILP) techniques, which can be classified as either arc-path or node-arc models. Arc-path models derive from the original span-restorable network design model in [16], where working and restoration routing is carried out over a set of preenumerated eligible routes. In contrast to the arcpath approach, node-arc models (also called transhipment models) do not utilize eligible restoration routes [17], rather they are assembled on the fly by the ILP solver.…”

Section: Straddling Spans P-cyclementioning

confidence: 99%

ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization inp-Cycle Networks

Noor‐E‐Alam

Kasem

Doucette

2012

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

p-cycle networks have attracted a considerable interest in the network survivability literature in recent years. However, most of the existing work assumes a known network topology upon which to apply p-cycle restoration. In the present work, we develop an incremental topology optimization ILP for p-cycle network design, where a known topology can be amended with new fibre links selected from a set of eligible spans. The ILP proves to be relatively easy to solve for small test case instances but becomes computationally intensive on larger networks. We then follow with a relaxation-based decomposition approach to overcome this challenge. The decomposition approach significantly reduces computational complexity of the problem, allowing the ILP to be solved in reasonable time with no statistically significant impact on solution optimality.

show abstract

Section: Straddling Spans P-cyclementioning

confidence: 99%

ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization inp-Cycle Networks

Noor‐E‐Alam

Kasem

Doucette

2012

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

show abstract

“…If two backup paths are never needed at the same time, then max(u 1 , u 2 ) will suffice. Investigations giving models and algorithms for designing fault-tolerant networks can be found in [2,6,7,8,9,10,11,12,14,18,19] …”

Section: With Protectionmentioning

confidence: 99%

An Incremental Procedure for Improving Path Assignment in a Telecommunications Network

Allen

Ismail

Kennington

et al. 2003

Journal of Heuristics

View full text Add to dashboard Cite

A fundamental problem in the design and management of a telecommunications network is that of determining an optimal routing pattern for a given set of origin-destination demand pairs. In addition, reliability considerations may require provisioning a set of backup paths to protect the working traffic against network failures. In the literature, the problem of finding an optimal routing for a network with fixed link capacities and a list of point-to-point demands (origin-destination pairs), each with a set of candidate routing paths has been referred to as the path-assignment problem. There are three versions of this problem that correspond to the type of network protection required (no protection, dedicated protection, and shared protection).The solution to those models can be used to determine an initial design for a new network.Over time, however, changes in the demand pattern and/or upgrades to the network equipment may create a situation in which the working and/or backup paths are sub-optimal.For network managers who are reluctant to make wholesale changes to an established and reliable routing assignment, a complete modification to obtain an optimal assignment that uses fewer network resources is viewed as highly risky. This investigation presents a new procedure to take a given feasible, but sub-optimal design and improve it by making a series of incremental improvements each of which only changes a small number of path assignments. Network managers view this strategy as much less risky since only a few customers are affected by any one change. Test cases that require no protection, dedicated protection, and shared protection were examined in an empirical analysis. For all cases, near-optimal solutions were achieved irrespective of the quality of the given sub-optimal starting solutions.

show abstract

“…Another scheme [4] makes use of efficient signaling mechanism and fast switching. Several algorithms [5]- [7] based on integer linear programming were previously designed for traffic routing and network planning. For all-optical networks, lightpath routing algorithms were developed [8], [9], and related work on spare capacity planning is also reported in [10].…”

mentioning

confidence: 99%

Supervisory Management and Lightpath Restoration for Wavelength Routing Networks

Tong¹,

Yum²,

Hui³

1999

Optical Networking

View full text Add to dashboard Cite

Abstract-We present here a supervisory management scheme and two complete lightpath restoration algorithms based on integer linear programming. The supervisory management uses a hierarchical approach with a network manager supervising all node managers, each of which monitors the health status of all network components and subsystems on that link. Extension to the existing CCS7 protocol is proposed to include the surveillance information in the signaling network. For the restoration algorithms, their performances are compared in three networks commonly cited for testing purposes. In general, the source-based restoration algorithm performs better than that based on the link-based restoration algorithm, but requires much longer computation time. Also, the former restoration algorithm ensures the fairness in satisfying lightpath demands within the network.

show abstract

An optimal spare-capacity assignment model for survivable networks with hop limits

Cited by 73 publications

References 9 publications

ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization inp-Cycle Networks

ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization inp-Cycle Networks

An Incremental Procedure for Improving Path Assignment in a Telecommunications Network

Supervisory Management and Lightpath Restoration for Wavelength Routing Networks

Contact Info

Product

Resources

About