## Slick Lightpath Reconfiguration Using Spare Resources |

Journal of Optical Communications and Networking, Vol. 5, Issue 9, pp. 1021-1031 (2013)

http://dx.doi.org/10.1364/JOCN.5.001021

Enhanced HTML Acrobat PDF (662 KB)

### Abstract

This paper presents different methods to solve the network reconfiguration problem in wavelength-switching optical networks. The network reconfiguration problem consists of finding a sequence of operations that can be used to migrate traffic from one lightpath configuration to another. Operations correspond to establishing or tearing down a given lightpath. The methods presented exploit for the first time (to our knowledge) the structure of the underlying combinatorial problems in order to divide the reconfiguration process into independent stages, decreasing the amount of disrupted traffic. Our numerical results show that our approaches can reduce the number of disruptions up to 10% more than the traditional approach (computing the minimum feedback vertex set of the dependency graph), while releasing 40% of seized resources during the reconfiguration process. The methodology presented can be easily adapted to other circuit-switching technologies, such as flexpaths.

© 2013 Optical Society of America

**OCIS Codes**

(060.4254) Fiber optics and optical communications : Networks, combinatorial network design

(060.4256) Fiber optics and optical communications : Networks, network optimization

**ToC Category:**

Research Papers

**History**

Original Manuscript: February 27, 2013

Revised Manuscript: June 18, 2013

Manuscript Accepted: July 9, 2013

Published: August 16, 2013

**Citation**

Fernando Solano, "Slick Lightpath Reconfiguration Using Spare Resources," J. Opt. Commun. Netw. **5**, 1021-1031 (2013)

http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-5-9-1021

Sort: Year | Journal | Reset

### References

- A. Farrel, J.-P. Vaseur, and J. Ash, “A path computation element (PCE)-based architecture,” , Aug. 2006.
- “Architecture for the automatically switched optical network (ASON),” , 2001.
- E. Mannie, “Generalized multi-protocol label switching (GMPLS) architecture,” , Oct. 2004.
- F. Solano and M. Pioro, “Lightpath reconfiguration in WDM networks,” J. Opt. Commun. Netw., vol. 2, no. 12, pp. 1010–1021, Dec. 2010.
- N. Jose and A. Somani, “Connection rerouting/network reconfiguration,” in IEEE Design of Reliable Communication Networks (DRCN), Banff, Canada, Oct. 2003, pp. 23–30.
- H.-M. Lin and J.-Y. Jou, “Computing minimum feedback vertex sets by contraction operations and its applications on CAD,” in IEEE Int. Conf. on Computer Design (ICCD), Austin, Texas, Oct. 1999, pp. 364–369.
- D. Couder, F. Huc, D. Mazauric, N. Nisse, and J.-S. Sereni, “Reconfiguration of the routing in WDM networks with two classes of services,” in Proc. of the Optical Network Design and Modeling Conf., Braunschweig, Germany, Feb. 2009, pp. 146–151.
- R. E. Tarjan, “Depth-first search and linear graph algorithms,” SIAM J. Comput., vol. 1, no. 2, pp. 146–160, 1972. [CrossRef]
- M. Pioro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, 2004.
- P. Gleiss, J. Leydold, and P. Stadler, “Circuit bases of strongly connected digraphs,” Discuss. Math. Graph Theory, vol. 23, no. 2, pp. 241–260, 2003.
- B. Schwikowski and E. Speckenmeyer, “On enumerating all minimal solutions of feedback problems,” Discrete Appl. Math., vol. 117, nos. 1–3, pp. 253–265, Mar. 2002. [CrossRef]

## Cited By |
Alert me when this paper is cited |

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article | Next Article »

OSA is a member of CrossRef.