High capacity digital network management and control

Doherty, Dennis; Hutcheson, W.; Raychaudhuri, K.

doi:10.1109/glocom.1990.116479

Cited by 16 publications

(4 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Centralized restoration methods 7,11,12,13,14 compute restoration (and primary) paths for all demands at a central controller where up-to-date information concerning the network is assumed to be available. The routes computed by this central controller may then be downloaded into nodal databases for primary and restoration route tables.…”

Section: Alternatives For General Mesh Network Restorationmentioning

confidence: 99%

Optical network design and restoration

Doshi¹,

Dravida²,

et al. 2002

View full text Add to dashboard Cite

Section: Alternatives For General Mesh Network Restorationmentioning

confidence: 99%

Optical network design and restoration

Doshi¹,

Dravida²,

et al. 2002

View full text Add to dashboard Cite

“…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.…”

Section: Introductionmentioning

confidence: 99%

“…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.…”

mentioning

confidence: 99%

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

“…Doherty, Hutcheson, and Raychaudhuri (1990) give a method that uses centralized control for all steps (although the return-to-normal step is not discussed). Doverspike (1990) gives a centralized approach (called "Bandwidth Management") that integrates control of fast DSliDS3 demand provisioning and DCS survivability rerouting under the same centralized system.…”

Section: Figure 4: Point-to-point Reroutingmentioning

confidence: 99%

A multi-layered model for survivability in intra-LATA transport networks

Doverspike

IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record

View full text Add to dashboard Cite

The Intra-LATA transport network is modeled into 4 layers (from high to low): The switched layer, ~O S S -C O M K~ layer, multiplex layer, and physical layer. Capacity provided to meet demand at a given layer in turn becomes demand for the next lower layer. Thus, survivability provided for a subnetwork at a given layer protects the demand originating at that layer as well as higher layer subnetworks.In this paper we define the layered model, give a general characterization of survivability restoral methods, and then compare principal existing and proposed methods at each layer, especially the ~OSS-COMIZC~ layer. In particular, we discuss routing efficiency, speed, control architectures (centralized and distributed), feasibility, and, most important to Intra-LATA carriers, potential integration with other operations functions, such as demand provisioning, network operations, customer control, and network planning.

show abstract

High capacity digital network management and control

Cited by 16 publications

References 1 publication

Optical network design and restoration

Optical network design and restoration

Performance analysis of fast distributed link restoration algorithms

A multi-layered model for survivability in intra-LATA transport networks

Contact Info

Product

Resources

About