Shared risk link Group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks

Abstract

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.

A cross-layer approach for IP network protection

“…It removes e m,n (line 9), and then uses Algorithm 1 to compute B m,n with minimum failure probability (line 10). Next, the algorithm determines the rerouted traffic load r m,n (lines [11][12][13][14][15][16], which is the smaller one between l m,n and the usable bandwidth of B m,n . Finally, it updates the usable bandwidth of logical links and removes the logical links without usable bandwidth (lines [17][18][19][20][21][22] …”

Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints

“…Note at that point that an arc of the virtual network may belong to several SRGs (= colors). However, following [1], [2], [5], we apply the simple transformation on G VN described in [6], [8] : each multi-colored arc is replaced with a chain of monocolored arcs, so that each arc now belongs to exactly one color. For simplicity purpose we will denote also by G VN the modified graph.…”

“…This has been fostered by the growing use of virtual and overlay networks which are embedded, in a transparent way, on an underlying network. Therefore, a great deal of researchers efforts have been concentrated on the design of efficient protection mechanisms at the backbone level (see for example [1]- [4]). At this level, the reliability of a single connection in the network might be measured as a function of the number of links it uses, each single link having its own probability of failure.…”

“…It has been proved to be NP-hard [1], hard to approximate [6], and heuristic algorithms have been designed. For example [1] studied a tabu search heuristic algorithm for routing requests with different requirements. However, if we consider a network with edge cost, such an objective may lead to a costly routing.…”

Survivable traffic grooming with path protection at the connection level in WDM mesh networks

“…Two heuristics, maximizing single-hop traffic (MSHT) and maximizing resource utilization (MRU), were proposed to solve the problem efficiently. The works in [8] and [9] considered the static-routing and wavelength-assignment problems with path protection in wavelength-division-multiplexed (WDM) mesh networks without grooming capability.…”