Distributed restoration strategies in telecommunications networks

Mark Sinclair; D. Johnson; G.N. Brown; S.I. Beggs; C.P. Botham; I. Hawker; R.S.K Chng; Mike J. O'Mahony

doi:10.1109/ICC.1994.368857

Distributed restoration strategies in telecommunications networks

Mark Sinclair, D. Johnson, G.N. Brown, S.I. Beggs, C.P. Botham, I. Hawker, R.S.K Chng, Mike J. O'Mahony

Computer and Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Failures in future high-bandwidth transport networks could result in very high traffic and revenue losses. A failure restoration strategy is therefore required which is fast, minimal-cost and low-risk. In this paper we advocate the systematic application of distributed restoration methods to meet this future need. We have developed a software simulation tool to investigate distributed restoration algorithms and present results that suggest distributed span restoration in SDH networks is feasible in about one second. We have also extended a heuristic algorithm to optimise the true cost of protection capacity in meshed networks, and adapted it to produce networks resilient to node failure, assuming prioritised restoration problems.

Original language	English
Title of host publication	Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications
DOIs	https://doi.org/10.1109/ICC.1994.368857
Publication status	Published - 1 May 1994

Access to Document

10.1109/ICC.1994.368857

Cite this

@inproceedings{c9544c6b1ec94864b6d122a1df79bfbb,

title = "Distributed restoration strategies in telecommunications networks",

abstract = "Failures in future high-bandwidth transport networks could result in very high traffic and revenue losses. A failure restoration strategy is therefore required which is fast, minimal-cost and low-risk. In this paper we advocate the systematic application of distributed restoration methods to meet this future need. We have developed a software simulation tool to investigate distributed restoration algorithms and present results that suggest distributed span restoration in SDH networks is feasible in about one second. We have also extended a heuristic algorithm to optimise the true cost of protection capacity in meshed networks, and adapted it to produce networks resilient to node failure, assuming prioritised restoration problems.",

author = "Mark Sinclair and D. Johnson and G.N. Brown and S.I. Beggs and C.P. Botham and I. Hawker and R.S.K Chng and O'Mahony, {Mike J.}",

year = "1994",

month = may,

day = "1",

doi = "10.1109/ICC.1994.368857",

language = "English",

isbn = "0-7803-1825-0",

booktitle = "Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications",

}

TY - GEN

T1 - Distributed restoration strategies in telecommunications networks

AU - Sinclair, Mark

AU - Johnson, D.

AU - Brown, G.N.

AU - Beggs, S.I.

AU - Botham, C.P.

AU - Hawker, I.

AU - Chng, R.S.K

AU - O'Mahony, Mike J.

PY - 1994/5/1

Y1 - 1994/5/1

N2 - Failures in future high-bandwidth transport networks could result in very high traffic and revenue losses. A failure restoration strategy is therefore required which is fast, minimal-cost and low-risk. In this paper we advocate the systematic application of distributed restoration methods to meet this future need. We have developed a software simulation tool to investigate distributed restoration algorithms and present results that suggest distributed span restoration in SDH networks is feasible in about one second. We have also extended a heuristic algorithm to optimise the true cost of protection capacity in meshed networks, and adapted it to produce networks resilient to node failure, assuming prioritised restoration problems.

AB - Failures in future high-bandwidth transport networks could result in very high traffic and revenue losses. A failure restoration strategy is therefore required which is fast, minimal-cost and low-risk. In this paper we advocate the systematic application of distributed restoration methods to meet this future need. We have developed a software simulation tool to investigate distributed restoration algorithms and present results that suggest distributed span restoration in SDH networks is feasible in about one second. We have also extended a heuristic algorithm to optimise the true cost of protection capacity in meshed networks, and adapted it to produce networks resilient to node failure, assuming prioritised restoration problems.

U2 - 10.1109/ICC.1994.368857

DO - 10.1109/ICC.1994.368857

M3 - Conference contribution

SN - 0-7803-1825-0

BT - Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications

ER -

Distributed restoration strategies in telecommunications networks

Abstract

Access to Document

Fingerprint

Cite this