Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
TL;DR: A method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfermode (ATM) virtual path (VP)-based restoration and jointly optimizing working path routing and spare capacity placement.
Abstract: The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long-haul networks. Previously, the spare capacity of a network with a given set of working span sizes has been optimized to facilitate span restoration. Path restorable networks can, however, be even more efficient by defining the restoration problem from an end to end rerouting viewpoint. We provide a method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfer mode (ATM) virtual path (VP)-based restoration. Lower bounds on spare capacity requirements in span and path restorable networks are first compared, followed by an integer program formulation based on flow constraints which solves the spare and/or working capacity placement problem in either span or path restorable networks. The benefits of path and span restoration, and of jointly optimizing working path routing and spare capacity placement, are then analyzed.
Citations
More filters
TL;DR: In this article, a network optimization design methodology for ultra-longhaul terrestrial networks is presented and a variety of network architectures analyzed: optical networks with a 1:N path restoration mechanism; optical network with express routes and a 1 :N path recovery; line shared protection ring (LSPR) networks.
Abstract: Today's new generation of undersea cable systems extensively uses optical amplifiers, which allows the systems to be implemented over transoceanic distances. Optical amplifiers offer significantly increased transmission capacity, networking functionality and operational flexibility - all potentially at lower cost than traditional regeneration systems. Thus, similar techniques are now being used in terrestrial networks to exploit the wide bandwidth of optical fibers for long-distance transmission (thousand of miles) since the frequency range is in THz. A network optimization design methodology for ultra-long-haul terrestrial networks is presented and a variety of network architectures analyzed: optical networks with a 1:N path restoration mechanism; optical networks with express routes and a 1:N path restoration; line shared protection ring (LSPR) networks. This methodology is applied to an example network using several traffic scenarios. The optimal network architecture depends on the network itself and on the criteria determining the network design.
01 Jan 2003
TL;DR: This thesis investigates the operation of popular survivability mechanisms operating at the IP and optical layers and suggests ways and means of improving their speed of recovery from network failures.
Abstract: The problem of traffic engineering has been widely recognized as critical to the development of operational Internet. Traffic engineering involves evaluation and optimization of the performance of operational IP networks. This thesis studies the performance evaluation problem from the perspectives of the users and the providers. Scalability requirements necessitate the use of an analytical framework to translate network level service quality in terms of the performance of user level applications. This thesis presents an important building block for such a framework in the form of an analytical model for TCP throughput prediction using easily available input information. Evaluating the performance of the networks from the providers' perspective naturally involves taking into account the service quality requirements of the users. The ever-increasing dependence on the Internet has made it important that the Internet service can survive the failures in the networks. The cost of survivability and the speed of recovery constitute the two important aspects of the network survivability. This thesis evaluates the cost of network operation for the providers taking into account the survivability requirements. This is followed by an investigation into the role of simple topological modifications in reducing the cost of survivability. The speed of recovery problem is studied from the perspective of different time scales. At the macro time scale, the objective is to enable fast detection and correction of network failures by the network administrators. This thesis compares the two most relevant alternatives for the purpose. At the micro time scale, the objective is fast rerouting of the traffic around the failures by the in-built survivability mechanisms while the failures have not yet been corrected. This thesis investigates the operation of popular survivability mechanisms operating at the IP and optical layers and suggests ways and means of improving their speed of recovery from network failures.
Cites background from "Optimal capacity placement for path..."
...Regarding the cost of survivability, many studies, over past several years, have confirmed that end-to-end recovery results in lower extra capacity requirements for protection against failures than local recovery [8, 76, 103, 67, 144, 118, 19]....
[...]
...However, a number of studies [8, 76, 103, 67, 144, 118] have confirmed that local recovery required significantly more capacity than end-to-end recovery....
[...]
...Several of these works [103, 67, 144, 118] performed the comparison on the basis of optimized capacity requirements for local and end-to-end recovery....
[...]
01 Jan 2009
TL;DR: The greater focus on spare capacity design and network restoration techniques to mitigate the impact of failures and attacks, providing network survivability for circuit switched networks is described.
Abstract: Due to the distributed administration, large geographic coverage, and expensive resource cost, communication networks are one of the most vulnerable parts in the current information infrastructure. Both failures and malicious attacks are difficult to eliminate in such systems recent advances in fiber transmission and switching/routing techniques have dramatically increased the communication capacity of links. Moreover, merging large amount and multiple classes of services over the same communication links is also common now a days. An adverse consequence of these advances is increasing network vulnerability since a small network failure or network attack can significantly reduce the capability to deliver services in large-scale information systems. Hence, this paper describes about the greater focus on spare capacity design and network restoration techniques to mitigate the impact of failures and attacks, providing network survivability for circuit switched networks.
TL;DR: In this article , the authors proposed to employ the conventional network protection techniques that are usually implemented to protect against network node/link failures to also protect against the failure of QoT prediction.
Abstract: Machine learning (ML)-based methods are being widely explored to predict the quality of transmission (QoT) of a lightpath. They are expected to reduce the signal-to-noise ratio margin reserved for the lightpath, thus improving the spectrum efficiency of an optical network. However, many studies on this prediction are often based on synthetic datasets or datasets obtained from laboratories. As such, these datasets may not accurately represent the entire state space of a practical optical network, which is exposed in harsh environments. There are risks of failure when using these ML-based QoT prediction models. Thus, it is necessary to develop a mechanism that can guarantee the reliability of lightpath service even if the prediction model fails. For this scenario, we propose to employ the conventional network protection techniques that are usually implemented to protect against network node/link failures to also protect against the failure of QoT prediction. Based on the two representative protection techniques, i.e., 1 + 1 dedicated path protection and shared backup path protection (SBPP), the performance of the proposed protection mechanism is evaluated by reserving different margins for the working and protection lightpaths. For 1 + 1 path protection, we find that the proposed mechanism can achieve a zero design margin (D-margin) for a working lightpath, thereby significantly improving network spectrum efficiency, while not sacrificing the availability of lightpath services. For SBPP, we find that an optimal D-margin should be identified to balance the spectrum efficiency and service availability; the proposed mechanism can save up to 0.5-dB D-margin for a working lightpath, while guaranteeing service availability.
DOI•
15 Oct 2021
TL;DR: In this paper, a load balancing routing algorithm based on conditional constraints is proposed, where the link weight is obtained by comparing the difference between the load of the link and the overall average value of the network.
Abstract: In the power communication network, load balancing can reduce the overload of bottleneck nodes, and help to improve the reliability of the power communication network and the utilization of network resources. In this paper, the unique structure and flow characteristics of power ASON networks are describled, a load balancing routing algorithm based on conditional constraints is proposed. In the algorithm, the link weight can obtained by comparing the difference between the load of the link and the overall average value of the network. Then, the algorithm based on resource optimization can dynamically adjust the link weight, so as to ensure the overall load balance of the network. The simulation results show that, compared to the traditional algorithm, the proposed algorithm can maintain a high resource utilization rate and meet the different requirements of the services in the future power communication network.
References
More filters
Book•
16 Feb 1970
TL;DR: Interestingly, integer programming and network flows that you really wait for now is coming, it's significant to wait for the representative and beneficial books to read.
Abstract: (1970). Integer Programming and Network Flows. Journal of the Operational Research Society: Vol. 21, No. 4, pp. 500-501.
638 citations
TL;DR: Self-healing network techniques suitable for ATM networks in order to realize a high-reliablity B-ISDN are proposed and high-speed restoration technique which exploits the benefits of the VP is proposed and described.
Abstract: This paper proposes self-healing network techniques suitable for ATM networks in order to realize a high-reliablity B-ISDN. First, the characteristics of the virtual paths (VP) and their influence on failure restoration are discussed. A high-speed restoration technique which exploits the benefits of the VP is then proposed and described. The technique simplifies the message transmission processes and reduces the number of generated messages by using preassigned backup virtual paths. Next, the scheme used to design the backup VP routes and spare resource distribution for each link is proposed in order to create a network that applies the proposed restoration scheme. Next, self-reconstruction techniques of backup virtual paths are proposed for the realization of a reversionless restoration cycle. Finally, the feasibility of the distributed control operation is discussed. >
233 citations
TL;DR: A comparative study of the effectiveness of KSP versus Max Flow as an alternative rerouting criteria in the context of transport network span restoration, and the hypothesis is made that a generalized "trap" topology is responsible for all KSP-Max Flow capacity differences.
Abstract: In the development of technologies for span failure restoration, a question arises about the restoration rerouting characteristics to be specified. In theory, maximal rerouting capacity is obtained with a maximum flow (Max Flow) criterion. However, rerouting that realizes the k-successively shortest link disjoint paths (KSP) may be faster, easier, and, in distributed implementation, more robust than a distributed counterpart for Max Flow. The issue is, therefore, what the restoration capacity penalty is if KSP is used instead of Max Flow. To explore this tradeoff, the authors present a comparative study of the effectiveness of KSP versus Max Flow as an alternative rerouting criteria in the context of transport network span restoration. The comparison applies to both centrally controlled and distributed restoration systems. Study methods include exhaustive span failure experiments on a range of network models, and parametric and analytical investigations for insight into the factors resulting in KSP versus Max Flow differences. The main finding is that KSP restoration capacity is more than 99.9% of that from Max Flow in typical network models. The hypothesis is made that a generalized "trap" topology is responsible for all KSP-Max Flow capacity differences. The hypothesis is tested experimentally and used to develop analytical bounds which agree well with observed results. These findings and data are relevant to standards makers and equipment developers in specifying and engineering future restorable networks. >
199 citations
NEC1
TL;DR: In order to achieve fast restoration, a distributed control mechanism that is applicable to both line and path restoration is proposed, and the shared use of spare channels for various failure scenarios, including multiple failure cases, are allowed.
Abstract: With the advent of networking technologies intelligent network elements, such as the digital cross-connect system (DCS), will make it possible to dynamically reconfigure a network for restoration purposes. Both restoration control of DCSs and spare-channel design issues are presented, and how they work together so that a fast and economical SONET self-healing network is obtained. In order to achieve fast restoration, a distributed control mechanism that is applicable to both line and path restoration is proposed. The proposed method allows the shared use of spare channels for various failure scenarios, including multiple failure cases, so that the efficient use of spare channels can be achieved. A linear-programming-based scheme is proposed to obtain spare-channel assignment, where a network-flow technique is used. Through a simulation study, a fast and economical self-healing network is verified. >
193 citations
"Optimal capacity placement for path..." refers background or methods in this paper
...Previous work used an IP approach based on -flow -cut considerations to solve the spare capacity placement problem in a span-restorable network [4], [11], [20]....
[...]
...Issues related to the restoration mechanisms themselves are addressed in related works [1], [2], [4], [21], [27]....
[...]
Proceedings Article•
01 Jan 1987
180 citations