FITNESS-failure immunization technology for network services survivability

Yang, Chyan; Hasegawa, S.

doi:10.1109/glocom.1988.26082

Cited by 109 publications

(22 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following Grover's publication, another distributed network restoration process for DCS-based fiber networks was proposed by Yang and Hasegawa in [9]. This method is called FITNESS and also uses a Sender-Chooser relationship for the nodes adjacent to the fiber link cut.…”

Section: B Bellcore's Fitness Approachmentioning

confidence: 99%

“…All algorithm simulators were tested on three networks: the 'New Jersey Network' LATA test network which was defined in the FITNESS [9] paper and is shown in Figure 10 (11) 13 (5) 4 (2) 18 (8) 13 (5) 13 (0) 14 (4) 12 (7) 4(2) 20 (6) 15 (4) 14 (7) 16 (8) 9(2) 20 (7) 13 (7) 12 ( test network which is defined in [8] and is shown in Figure 11, and the 'US Net' test network which is also defined in [8] and is shown in Figure 12.…”

Section: Evaluation Of the Two Prong Algorithm Using Performancementioning

confidence: 99%

“…However, it requires high dedicated spare capacity. With recent advances in digital cross-connect systems, DCS, there is increasing interest in using DCS in network restoration [3,4,5,6,7,8,9,10]. The centralized DCS-based network restoration approach [3,4,5] requires reliable telemetric links between the DCS nodes and the network operation center.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Performance analysis of fast distributed link restoration algorithms

Chow

Bicknell

McCaughey

et al. 1995

Int J Communication

View full text Add to dashboard Cite

Four distributed link restoration algorithms are analyzed in detail using a set of important performance metrics and functional characteristics. The functional characteristics are used to explain how these algorithms function and provide insight into their performance. The analysis and simulation results indicate that the Two Prong link restoration algorithm, which is based on issuing aggregate restoration requests from both ends of the disruption and on an intelligent backtracking mechanism, outperforms the other three algorithms in terms of restoration time. The RREACT link restoration algorithm consistently found paths that use fewer spares. I. IntroductionWith the widespread deployment of fiber optic transmission systems and the alarming rate of outages due to fiber cuts [1], there is great interest in strategies for improving the process of restoring disrupted traffic from minutes to sub-seconds following a fiber cut [2]. Automatic protection switching probably is the fastest technique and can switch the disrupted traffic to dedicated spare links in under 50 milliseconds. However, it requires high dedicated spare capacity. With recent advances in digital cross-connect systems, DCS, there is increasing interest in using DCS in network restoration [3,4,5,6,7,8,9,10]. The centralized DCS-based network restoration approach [3,4,5] requires reliable telemetric links between the DCS nodes and the network operation center. It is slower than distributed DCS-based network restoration, where the affected DCS nodes exchange messages directly to restore the disrupted traffic. The hybrid preplanned approach proposed in Bellcore's NETSPAR uses a distributed topology update protocol to identify the fault and then downloads a precomputed routing table according to the fault. The problem with this approach is that the memory required for storing the routing tables is too great [6]. In this paper, we will focus on distributed network restoration algorithms for DCS-based fiber networks.There are two basic approaches to reroute the disrupted traffic due to a fiber span cut. The link restoration approach replaces the affected link segment of a disrupted channel by a spare path between the two disrupted ends. The path restoration approach releases each disrupted channel and 1. This research was supported by MCI with grant #01-80046. 2. John Bicknell was a graduate student at UCCS when this work was done and is now with MCI. lets the source and destination end of the channel re-establish the connection. With the additional release phase the path restoration will take more time than the link restoration. However, the path restoration can find more efficient spare paths with fewer link segments and can handle the node failure situation with the same logic. The network restoration techniques described in [3,5] fall in the path restoration category. In order to achieve fast network restoration, we focus on the link restoration approach in this paper.The existing shortest path algorithms provide the basic building blocks or in...

show abstract

Section: B Bellcore's Fitness Approachmentioning

confidence: 99%

Section: Evaluation Of the Two Prong Algorithm Using Performancementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Performance analysis of fast distributed link restoration algorithms

Chow

Bicknell

McCaughey

et al. 1995

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Instead of advance path reservation, they use a refined version of flooding to find alternate paths on the occurrence of failures. In (Yang & Hasegawa, 1988) the authors propose a distributed restoration algorithm for broadband networks that uses intelligent routers to restrict the number of messages when flooding in the case of failures. In (Zheng, 1992) the authors propose the use of backup channels for multiple point-to-point communications.…”

Section: Dynamic Network Restorationmentioning

confidence: 99%

On Fault-Tolerance and Bandwidth Consumption Within Fiber-Optic Media Networks

Messmer¹,

Keller²

2011

Optoelectronics - Devices and Applications

View full text Add to dashboard Cite

“…Mesh-based restoration can be performed using Link Restoration or Path Restoration schemes. In Link Restoration [2], [5], [10], [12], traffic on the failed link is rerouted over a replacement path connecting the end-points of the failed link. 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.…”

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

FITNESS-failure immunization technology for network services survivability

Cited by 109 publications

References 0 publications

Performance analysis of fast distributed link restoration algorithms

Performance analysis of fast distributed link restoration algorithms

On Fault-Tolerance and Bandwidth Consumption Within Fiber-Optic Media Networks

Highly efficient spare capacity planning for generalized link restoration

Contact Info

Product

Resources

About