Distributed restoration strategies in telecommunications networks

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

doi:10.1109/icc.1994.368857

Cited by 13 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A drawback of link-based protection (but not of local recovery approach) is that node failures are not managed. A comparison of link-based protection and path-based protection can be found in [10].…”

Section: State Of the Art Of Dependable Connectionsmentioning

confidence: 99%

Efficient Protection of Many-to-One Communications

Molnár

Guitton

Cousin

et al. 2005

Dependable Computing - EDCC 5

View full text Add to dashboard Cite

Abstract. The dependability of a network is its ability to cope with failures, i.e., to maintain established connections even in case of failures. IP routing protocols (such as OSPF and RIP) do not fit the dependability objectives of today applications. Moreover, forwarding techniques based on destination address (like IP) induce many-to-one connections. If a dependable connection is needed, all primary paths and protections having the same destination must be established in a coordinated way. In this paper, we propose a fault recovery for many-to-one connections based on a cold (preplanned) protection. The main advantage of our approach is that the recovery in case of failures is achieved within a short delay.Additionally, with respect to other approaches, the dependability of the routing scheme is increased in the way that it statistically copes with many failures. The algorithm we propose computes an efficient backup for an arbitrary primary tree using an improved multi-tree algorithm.

show abstract

Section: State Of the Art Of Dependable Connectionsmentioning

confidence: 99%

Efficient Protection of Many-to-One Communications

Molnár

Guitton

Cousin

et al. 2005

Dependable Computing - EDCC 5

View full text Add to dashboard Cite

show abstract

“…A succint comparison of the different options can be found in [75, pp. 291-294] and in [30]. Our algorithm considers path rerouting which is preplanned and centrally computed.…”

Section: Introductionmentioning

confidence: 99%

Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

Médard

Finn²,

Barry³

et al. 1999

IEEE/ACM Trans. Networking

264

195

View full text Add to dashboard Cite

Abstract-We present a new algorithm which creates redundant trees on arbitrary node-redundant or link-redundant networks. These trees are such that any node is connected to the common root of the trees by at least one of the trees in case of node or link failure. Our scheme provides rapid preplanned recovery of communications with great flexibility in the topology design. Unlike previous algorithms, our algorithm can establish two redundant trees in the case of a node failing in the network. In the case of failure of a communications link, our algorithm provides a superset of the previously known trees.

show abstract

Fast restoring gigabit wireless networks using a directional mesh architecture

Hui

Sun

2003

Computer Communications

View full text Add to dashboard Cite

Distributed restoration strategies in telecommunications networks

Cited by 13 publications

References 5 publications

Efficient Protection of Many-to-One Communications

Efficient Protection of Many-to-One Communications

Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

Fast restoring gigabit wireless networks using a directional mesh architecture

Contact Info

Product

Resources

About