Spare Capacity Assignment for Multiple-Link Failures

Miyazaki, Keiko; Chujo, Takafumi; Komine, H.; Ogura, Takahiro

doi:10.1109/iwaca.1992.639817

Cited by 6 publications

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

The hop-limit approach for spare-capacity assignment in survivable networks

Herzberg

Bye²,

Utano

1995

IEEE/ACM Trans. Networking

118

View full text Add to dashboard Cite

This paper presents a new approach for sparecapacity assignment in mesh-type self-healing networks which use reconfigurable network elements as transmission hubs. Under this approach the process of reducing total weighted cost of spare capacity is obtained by taking into account all network's eligible restoration routes which do not violate a predetermined hop-limit value. The process derived considers a given set of possible failure scenarios, which include single-link, multi-link and node failures, and is adaptive to accommodate several practical considerations such as integrality of spare channels and modularity of transmission systems. This process is generally composed of two parts: Part 1 relies on a linear-programming formulation (Min-Max) from which a lower bound solution of spare cost is found; Part 2 rounds-up the solution of Part 1 to a feasible solution and uses a series of Max-Flow tests aimed at tightening the rounded-up assignment to a practical optimum. For small and moderate size networks a Mixed-Integer-Programming formulation of Part 1 can be used to obtain optimal results. A network, which has already been studied in the literature, is analyzed to illustrate the approach developed and to demonstrate, for cases where hop limits can feasibly be kept low, its superiority over other algorithms published in this area.Index Terms-Self-healing survivable networks, network flow, linear programming.

show abstract

The hop-limit approach for spare-capacity assignment in survivable networks

Herzberg

Bye²,

Utano

1995

IEEE/ACM Trans. Networking

118

View full text Add to dashboard Cite

show abstract

Modeling of self-healing managed object for TMN

Iseda

Miyazaki

Chujo

Proceedings of ICC '93 - IEEE International Conference on Communications

View full text Add to dashboard Cite

Optimal and guaranteed alternative LSP for multiple failures

Hundessa

Domingo‐Pascual

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)

View full text Add to dashboard Cite

Absfrmf-Fast rerouting mechanism are being studied in order to protection techniques. The pre-established altemative LSP is better provide fault tolerance for U P in an MPLS network in ease Of node Or link failure. For QoS promion protected LSP -e handled apart from non-protected LSP. Rerouting mechanisms when applied on protected Lsp tske into Becount QoS This paper presents a mechanism that is able to handle multiple failure a~onp, an LSP while for critical traffic than the alternative LSp established on demand after the occurrence of failure [6], [7]. several schemes haye bee,, proposed for selecting the best route(s) from several candidates based on different criteria [91,[101,[111. using an optimal alternative LSP. The &outing decision is taken close to the point of failure reducing the restoration time. The use of preestablkhed alternative LSP also reduces the restoration time and avoids blocking when looking for an alternative path. The proposal is based on B hybrid approach of segment repair and path repair and provides a new alternative LSP using dynamic rerouting once the protected one has been rerouted. In this way there is always an sltemative I S P for each protected LSP. The oyer all perlomanee (recovery time, end-to. end delay, packet losses, and network resource utilization) b compared with existing protection mechanisms by simulation. The proposed hybrid approach, Optimal and Guaranteed Allemalive Path (OGAP), avoids the possible use of a non-optimal alternative LSP to reroute the protected traffic and provides the flexibility of alternative mute selection and setup as well as better resource utilization. Moreover, our proposal guarantees st least one alternative LSP at any time for the trafiie on the pmteeted LSP.

show abstract

Spare Capacity Assignment for Multiple-Link Failures

Cited by 6 publications

References 5 publications

The hop-limit approach for spare-capacity assignment in survivable networks

The hop-limit approach for spare-capacity assignment in survivable networks

Modeling of self-healing managed object for TMN

Optimal and guaranteed alternative LSP for multiple failures

Contact Info

Product

Resources

About