Resource provisioning for survivable WDM networks under a sliding scheduled traffic model

Jaekel, Arunita; Chen, Y.

doi:10.1016/j.osn.2008.05.001

Cited by 35 publications

(15 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They also propose a two-phase approach: time conflict resolution followed by RWA. ILP formulations which jointly solve lightpath scheduling and RWA for the sliding scheduled traffic model are given in [22], along with a faster two-step optimization approach for larger problems.…”

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

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

show abstract

“…The intention of this work is neither to defend nor to challenge the notion that greater temporal flexibility for AR demands aids in improving network resource consumption, since this area has been widely investigated already [7], [8]. Nor is it our objective to identify, evaluate, or optimize new or existing protocols by which to harness such flexibility.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper we develop a novel Integer Linear Program (ILP) model to describe and evaluate λ-switching when applied to SSLE. The first and only UTSD scheduling ILPs are presented in [8]. These formulations consider survivable network solutions in case of link or path element failure, however the models are also simplified to consider straightforward SSLE.…”

Section: Introductionmentioning

confidence: 99%

Sliding Scheduled Lightpath Establishment for Time-Continuous Demands with Slotted Wavelength-Switching

Plante

Vokkarane

2015

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Critical data transmissions are often scheduled hours or days in advance of the actual acquirement of network resources, allowing for efficient allocation and scheduling among a set of competing or temporally overlapping lightpath demands. Many periodic applications may not only desire service at some future time, but may further require repeatable and predictable scheduling services. Typically, such application demands are deadline-driven and therefore mutable within some sliding window depending on congestion, competition, or load. This paper considers Sliding Scheduled Lightpath Establishment (SSLE) in time-slotted optical networks and enhances scheduling by incorporating spectral flexibility at wavelength/time-slot granularity. A novel wavelength-switching integer linear program and two conservative heuristics are presented to describe and evaluate the SSLE problem under various degrees of temporal conflict and flexibility. 1

show abstract

“…Previous papers [5][6][7] have suggested that each service or connection should be equipped with a disjoint-routed working-backup pair. Once the working label switching path (LSP) is interrupted by any unexpected failure, the working traffic can be switched to the corresponding backup LSP in order to protect the network service.…”

Section: Introductionmentioning

confidence: 99%

Survivable routing algorithm with mixed shared protection in fault‐tolerant GMPLS multi‐layered optical networks

Guo

Cao

Wang

et al. 2010

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYIn this paper, we studied survivability in general multi-protocol label switching (GMPLS) multi-layered optical networks and proposed a novel mixed shared protection algorithm (MSPA) based on the integrated layered graph (ILG) to tolerate single-fibre link failure. The ILG is composed of one virtual topology layer (VTL), corresponding to IP/MPLS layer; multiple wavelength-plane layers (WPLs), corresponding to the wavelength-division multiplexing (WDM) optical layer; and some virtual links that connect the VTL to each WPL in order to solve the problem on routing, wavelength assignment and low-speed traffic grooming. For every connection request, the MSPA first computes a single-hop or multi-hop label switching path (LSP) pair, involving a working LSP and a physical link-disjoint backup LSP in the VTL. If the LSP pair is not found in the VTL, the MSPA computes the new LSP pair in the WPL. Conversely, if the new LSP pair is not detected in the WPL, the MSPA computes the hybrid multi-hop LSP pair in the ILG. In the MSPA, if the two working LSPs are in physical link-disjoint, their corresponding backup LSPs can share the backup bandwidth. In addition, the working LSPs and the backup LSPs can also share the same mixed of wavelength, in which the different bandwidths can be assigned to different working and backup LSPs. Simulation results show that, compared to previous algorithm, the MSPA can obtain a better bandwidth utilisation ratio (BUR) with a lower blocking probability.

show abstract

Resource provisioning for survivable WDM networks under a sliding scheduled traffic model

Cited by 35 publications

References 6 publications

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

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

Sliding Scheduled Lightpath Establishment for Time-Continuous Demands with Slotted Wavelength-Switching

Survivable routing algorithm with mixed shared protection in fault‐tolerant GMPLS multi‐layered optical networks

Contact Info

Product

Resources

About