A Study of Path Protection in Large-Scale Optical Networks (original) (raw)
Related papers
Provisioning algorithms in survivable optical networks with shared protection
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003, 2003
The efficient use of network capacity strongly depends upon the path selection procedure. In this paper we propose and evaluate efficient path selection algorithms for survivable optical networks with shared protection. Two distributed path selection algorithms are presented. The first approach maintains global information on network resource usage to determine link sharability and compute optimal shared paths. The second approach, however, only relies upon local information maintained at each node. Subsequently, we present an analytical model to evaluate the performance of these path selection algorithms and show its accuracy through numerical examples.
Survivable Hierarchical Optical Path Network Design With Dedicated Wavelength Path Protection
IEEE/OSA Journal of Lightwave Technology, 2011
In this paper, we propose a novel network design algorithm that yields the hierarchical optical path network with dedicated wavelength path protection. A hierarchical optical path network provides two granularities in implementing dedicated protection in the optical layer, namely waveband path protection and wavelength path protection. The characteristics of both protection mechanisms are investigated. We develop the concept of the source-destination Cartesian product space to aggregate closely located traffic demands, which leads to a significant reduction in network resources needed. The proposed wavelength path protection algorithm achieves lower network costs than that possible with waveband protection when traffic volume is relatively small. On the other hand, in the large traffic demand area, both schemes offer almost the same cost, which makes the waveband protection scheme attractive because of its operational simplicity. Numerical results clarify that survivable hierarchical optical path network is more cost effective than the single layer optical path network with optical layer protection, irrespective of which protection scheme is utilized.
Routing Strategies in Survivable Optical Networks
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
Routing and wavelength assignment problem is one of the main problem in optical networks. The foremost problem is the routing problem after which the wavelength assignment is to be decided. In this paper we have proposed a routing strategy for optimization of the performance of the optical network in terms of blocking probability. The strategy proposed is better than the conventional algorithm in terms of blocking.Â
Resilient Resource Allocation Schemes in Optical Networks
2017
Recent studies show that deliberate malicious attacks performed by high-power signals can put large amount of data under risk. We investigate the problem of survivable optical networks resource provisioning scheme against malicious attacks, more specifically crosstalk jamming attacks. These types of attacks may cause service disruption (or possibly service denial). We consider optical networks based on wavelength-division multiplexing (WDM) technology and two types of jamming attacks: in-band and out-of-band attacks. We propose an attack-aware routing and wavelength assignments (RWA) scheme to avoid or reduce the damaging effects of potential attacking signals on individual or multiple legitimate lightpaths traversing the same optical switches and links. An integer linear programs (ILPs) as well as heuristic approaches were proposed to solve the problem. We consider dynamic traffic where each demand is defined by its start time and a duration. Our results show that the proposed appr...
2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN), 2011
The survivable logical topology mapping problem in an IP-over-WDM optical network is to map each link (u, v) in the logical topology (at the IP layer) into a lightpath between the nodes u and v in the physical topology (at the optical layer) such that failure of a physical link does not cause the logical topology to become disconnected. It is assumed that both the physical and logical topologies are 2-edge connected. For this problem two lines of investigations have been pursued in the literature: one pioneered by Modiano et al., and the other pioneered by Kurant and Thiran. Since then there have been a great deal of research on this problem. Most of the works have not considered limitations imposed on the routings by physical capacity limits. In this paper, we first introduce two concepts: weakly survivable routing and strongly survivable routing. We then provide mathematical programming formulations for two problems. Problem 1 is to design a survivable lightpath routing that maximizes the logical capacity available before and after a physical link failure. The second problem is to add spare capacities to the physical links to guarantee routability of all logical link demands before and after a physical link failure. The frameworks provided by our formulation can be used to accommodate other scenarios such as those involving load balancing and fair capacity allocation constraints. We conclude with simulations that compare the results using these formulations and those obtained by heuristics that mitigate the computational complexity of the mathematical programming formulations. 2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN)
On the physical and logical topology design of large-scale optical networks
Journal of Lightwave Technology, 2003
We consider the problem of designing a network of optical cross-connects (OXCs) to provide end-to-end lightpath services to large numbers of label switched routers (LSRs). We present a set of heuristic algorithms to address the combined problem of physical topology design (i.e., determine the number of OXCs required and the fiber links among them) and logical topology design (i.e., determine the routing and wavelength assignment for the lightpaths among the LSRs). Unlike previous studies which were limited to small topologies with a handful of nodes and a few tens of lightpaths, we have applied our algorithms to networks with hundreds or thousands of LSRs and with a number of lightpaths that is an order of magnitude larger than the number of LSRs. In order to characterize the performance of our algorithms, we have developed lower bounds which can be computed efficiently. We present numerical results for up to 1000 LSRs and for a wide range of system parameters such as the number of wavelengths per fiber, the number of transceivers per LSR, and the number of ports per OXC. The results indicate that it is possible to build large-scale optical networks with rich connectivity in a cost-effective manner, using relatively few but properly dimensioned OXCs.
Comparison of failure dependent protection strategies in optical networks
Photonic Network Communications, 2006
The criticality of survivable network design and operation increases with increasing transmission speed. Path protection strategies achieve better network utilization compared to link protection strategies; however the recovery time of connections in path protection strategies are higher than that in link protection strategies. This paper evaluates and compares the performance of three failure dependent strategies: (1) failure dependent path protection; (2) link protection; and (3) Diversion-a variant of the segmented path protection approach. In addition, A framework for evaluating the connection recovery time is also developed. The protection strategies are compared for their recovery time and blocking performance using extensive simluations.
Design of survivable optical networks with minimum capex
2009
We present a genetic algorithm for the design of survivable networks with minimum capital expenditure. The survivability against any single link failure is ensured by path dedicated protection. An integer linear programming model to evaluate the quality of the genetic algorithm solutions is also presented. Using the integer linear programming model and the genetic algorithm near-optimal topologies are determined.