In this paper we study an alternate network architecture, called translucent network, to the fully transparent and fully opaque network architectures. In a translucent wavelength-routed optical network, a technique called sparse regeneration is used to overcome the severe lightpath blocking due to signal quality degradation and wavelength contention in a fully transparent network while using much less regenerators than in a fully opaque network. In this paper, we present a node model and a network model that perform sparse regeneration. We address the problem of translucent network design by proposing several regenerator placement algorithms based on different knowledge of future network traffic patterns. We also address the problem of wavelength routing under sparse regeneration by incorporating two regenerator allocation strategies with heuristic wavelength routing algorithms. We compare the performance of different regenerator placement algorithms and wavelength routing schemes through simulation experiments. The benefit of sparse regeneration is quantitatively measured under different network settings.
Abstract-The static provisioning problem in wavelength-routed optical networks has been studied for many years. However, service providers are still facing the challenges arising from the special requirements for provisioning services at the optical layer. In this paper, we incorporate some realistic constraints into the static provisioning problem, and formulate it under different network resource availability conditions. We consider three classes of shared risk link group (SRLG)-diverse path protection schemes: dedicated, shared, and unprotected. We associate with each connection request a lightpath length constraint and a revenue value. When the network resources are not sufficient to accommodate all the connection requests, the static provisioning problem is formulated as a revenue maximization problem, whose objective is maximizing the total revenue value. When the network has sufficient resources, the problem becomes a capacity minimization problem with the objective of minimizing the number of used wavelength-links. We provide integer linear programming (ILP) formulations for these problems. Because solving these ILP problems is extremely time consuming, we propose a tabu search heuristic to solve these problems within a reasonable amount of time. We also develop a rerouting optimization heuristic, which is based on previous work. Experimental results are presented to compare the solutions obtained by the tabu search heuristic and the rerouting optimization heuristic. For both problems, the tabu search heuristic outperforms the rerouting optimization heuristic.Index Terms-Capacity minimization problem, dedicated-path protection, revenue maximization problem, shared-path protection, shared risk link group (SRLG), tabu search, wavelength-routed optical network.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.