Diverse routing of scheduled lightpath demands in an optical transport network

Kuri, J.; Puech, Nicolas; Gagnaire, Maurice

doi:10.1109/drcn.2003.1275340

Cited by 32 publications

(13 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fault tolerant routing and wavelength assignment of scheduled lightpath demands was studied in [11] and [12]. In [11], the authors formulate the problem of fault tolerant RWA SLD with the objective being to minimize the number of WDM channels.…”

Section: Related Workmentioning

confidence: 99%

Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks

Skorin-Kapov

2006

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converters. The objective is to minimize the number of wavelengths used. This problem has been shown to be NPcomplete so heuristic algorithms have been developed to solve it suboptimally. Suggested is a tabu search algorithm along with two simple and fast greedy algorithms for the RWA SLD problem. We compare the proposed algorithms with an existing tabu search algorithm for the same problem and with lower bounds derived in this paper. Results indicate that the suggested algorithms not only yield solutions superior in quality to those obtained by the existing algorithm, but have drastically shorter execution times.Index Terms-Routing and wavelength assignment, scheduled lightpath demands, optical networks, tabu search

show abstract

Section: Related Workmentioning

confidence: 99%

Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks

Skorin-Kapov

2006

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…The first planning model to incorporate this phenomenon in transparent optical networks was the Scheduled Lightpath Demands (SLD) model from [5] where the set-up and tear-down times of lightpaths are known in advance. In [6] and [7], RWA heuristic approaches for a set of SLDs are proposed. A Simulated Annealing algorithm using channel re-use and back-up multiplexing for fault tolerant RWA is introduced in [6].…”

Section: Introductionmentioning

confidence: 99%

“…In [6] and [7], RWA heuristic approaches for a set of SLDs are proposed. A Simulated Annealing algorithm using channel re-use and back-up multiplexing for fault tolerant RWA is introduced in [6]. A more general model, called the sliding scheduled traffic model was proposed in [8], while fault tolerant RWA for this model was considered in [9].…”

Section: Introductionmentioning

confidence: 99%

MILP formulations for scheduling lightpaths under periodic traffic

Garcia-Manrubia

Aparicio-Pardo

Pavón‐Mariño

et al. 2009

2009 11th International Conference on Transparent Optical Networks

View full text Add to dashboard Cite

This paper addresses offline virtual topology design in transparent optical networks under given periodic traffic. We call this planning problem "Scheduled Virtual Topology Design". Two problem variants are considered: for a network based on non-reconfigurable equipment and for a network based on reconfigurable equipment. Two MILP (Mixed Integer Linear Program) formulations are proposed, one for each alternative. The number of transceivers in the network is the selected cost figure to minimize. Tests are performed to evaluate the benefits of using reconfigurable equipment under different traffic conditions and network sizes. The reduction in the number of transceivers obtained by allowing temporal variations in the virtual topology seems low in all cases, indicating that using reconfigurable equipment may not be cost-effective for periodic traffic. Keywords: All-optical networks, virtual topology design, multilayer optimization, scheduling. INTRODUCTIONTransparent optical networks have been proposed to decrease costs and increase capacity in the Future Internet, i.e., "converged" multi-granular network architectures [1], [2]. In transparent optical networks, traffic is carried onto lightpaths which occupy one transmission wavelength in each traversed link. The carried traffic is electronically processed at the ingress and egress nodes of the lightpath, but not at intermediate transit nodes, saving electronic switching costs, and providing the data plane with a sort of traffic format transparency.The Wavelength Switch Fabric (WSF) is the central optical part of a switching node in transparent optical networks. A WSF can have a fixed or reconfigurable structure. In non-reconfigurable switching fabrics, connections between the input and output ports of the WSF are manually hard-wired. However, if the WSF is a device implemented using reconfigurable optical add/drop multiplexers (R-OADM) or reconfigurable wavelength crossconnects (R-WXC), then connections from input to output ports can be dynamically reconfigured allowing lightpaths to change along the time.In this paper, we focus on the offline planning of transparent optical networks for a given periodic traffic demand, which changes along a sequence of time intervals. The objective of our planning problem is to find the most cost-effective (i) scheduled virtual topology design, and (ii) routing of the electronic flows on top of the virtual topology.Scheduled virtual topology design determines the number of lightpaths to be established between every inputoutput pair of nodes over time. This resolves the number of transceivers needed in the network, which is a common cost figure of interest. Naturally, in the lower layer, each lightpath in the virtual topology has to be routed over the physical topology and assigned a wavelength. This problem is called the Routing and Wavelength Assignment (RWA) problem [3]. In this paper, we assume that the network links support a sufficient number of wavelengths for any RWA scheme. Thus, the physical-layer constraints do ...

show abstract

“…An enhanced Tabu Search algorithm and efficient greedy algorithms for the same problem were proposed in [16]. Fault tolerant RWA was studied in [17] where the authors propose a Simulated Annealing algorithm using channel re-use and back-up multiplexing. Fault-tolerant RWA SLDs under single component failure was considered in [18].…”

Section: Related Workmentioning

confidence: 99%

Heuristic Approaches for Periodic Reconfiguration of Lightpath-based Networks under Multi-hour Traffic

Aparicio-Pardo¹,

Garcia-Manrubia²,

Skorin-Kapov³

et al. 2012

JNW

View full text Add to dashboard Cite

Abstract-Periodic lightpath reconfiguration of virtual topologies in transparent optical networks has been recently investigated as a mechanism to more efficiently adapt the network to predictable periodic traffic variations along a day or week. Scheduling periodic reconfigurations involves tuning a trade-off between a lower network cost obtained through better resource allocation, and undesired traffic disruptions that these reconfigurations may cause. This paper presents and compares two algorithms for planning a reconfigurable virtual topology suitable for exploring this trade-off. The first is based on a Lagrangean Relaxation of the planning problem, and the second is based on a Tabu Search meta-heuristic. The merits of both algorithms are assessed for moderate network sizes through comparison with analytical lower bounds and exact solutions obtained by a MILP formulation.Index Terms-virtual topology design, network planning, multi-hour traffic, Lagrangean Relaxation, Tabu Search.

show abstract

Diverse routing of scheduled lightpath demands in an optical transport network

Cited by 32 publications

References 13 publications

Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks

Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks

MILP formulations for scheduling lightpaths under periodic traffic

Heuristic Approaches for Periodic Reconfiguration of Lightpath-based Networks under Multi-hour Traffic

Contact Info

Product

Resources

About