Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Efficient Real-Time Scalable Make-Before-Break Network Re-Routing

Not Accessible

Your library or personal account may give you access

Abstract

Dynamic traffic in optical networks leads to capacity fragmentation, which significantly reduces network performance. Consequently, non-disruptive re-routing has attracted a lot of attention from network providers as it dramatically improves the amount of traffic that can be granted with a good quality of service. The recent development of flexible and software-defined networks is urgently calling for faster real-time reconfiguration algorithms at all network layers, while being highly efficient in terms of optimized reconfiguration of connections. We propose a very efficient non-disruptive bandwidth defragmentation heuristic (called mbb_df_h) with a make-before-break (MBB) strategy at the user layer. In order to assess its accuracy, we also develop a near-optimal two-phase defragmentation process. First, we formulate an exact optimization model for the decomposition scheme in order to compute the best re-routing, i.e., with minimum bandwidth requirements. Second, we investigate whether the resulting re-routing can be reached with a MBB policy; if not, we exhibit the best possible MBB re-routing. We conduct extensive numerical experiments on several data sets. We first run experiments on small to medium data sets so that the solution efficiency of the mbb_df_h heuristic can be compared with the two-phase optimization models. Next, we focus on the real-time scalability of the mbb_df_h heuristic on large realistic data sets.

© 2019 Optical Society of America

Full Article  |  PDF Article
More Like This
Route Partitioning Scheme for Elastic Optical Networks With Hitless Defragmentation

Seydou Ba, Bijoy Chand Chatterjee, Satoru Okamoto, Naoaki Yamanaka, Andrea Fumagalli, and Eiji Oki
J. Opt. Commun. Netw. 8(6) 356-370 (2016)

Anycast Routing for Survivable Optical Grids: Scalable Solution Methods and the Impact of Relocation

Ali Shaikh, Jens Buysse, Brigitte Jaumard, and Chris Develder
J. Opt. Commun. Netw. 3(9) 767-779 (2011)

Cost-Optimized Reservation and Routing for Scheduled Traffic in Optical Networks

Hui Ding, Pan Yi, and Byrav Ramamurthy
J. Opt. Commun. Netw. 5(11) 1215-1226 (2013)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (4)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (10)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (44)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved