Profit Maximization in Flex-Grid All-Optical Networks

Abstract. All-optical networks have been largely investigated due to their high data transmission rates. The key to the high speeds in alloptical networks is to maintain the signal in optical form, to avoid the overhead of conversion to and from electrical form at the intermediate nodes. In the traditional WDM technology the spectrum of light that can be transmitted through the optical fiber has been divided into frequency intervals of fixed width with a gap of unused frequencies between them. In this context the term wavelength refers to each of these predefined frequency intervals. An alternative architecture emerging in very recent studies is to move towards a flexible model in which the usable frequency intervals are of variable width. Every lightpath is assigned a frequency interval which remains fixed through all the links it traverses. Two different lightpaths using the same link have to be assigned disjoint sub-spectra. This technology is termed flex-grid or flex-spectrum. The introduction of this technology requires the generalization of many optimization problems that have been studied for the fixed-grid technology. Moreover it implies new problems that are irrelevant or trivial in the current technology. In this work we focus on bandwidth utilization in path toplogy and consider two wavelength assignment, or in graph theoretic terms coloring, problems where the goal is to maximize the total profit. We obtain bandwidth maximization as a special case.

[1]  M. Golumbic Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[2]  M. Golumbic Algorithmic graph theory and perfect graphs , 1980 .

[3]  Guy Kortsarz,et al.  Multicoloring: Problems and Techniques , 2004, MFCS.

[4]  Mordechai Shalom,et al.  On the interval chromatic number of proper interval graphs , 2015, Discret. Math..

[5]  Ori Gerstel Realistic approaches to scaling the IP network using optics , 2011, 2011 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference.

[6]  R. Möhring Algorithmic graph theory and perfect graphs , 1986 .

[7]  Ralf Klasing,et al.  Methods and Problems of Wavelength-Routing in All-Optical Networks , 1998 .

[8]  Mikkel Thorup,et al.  OPT versus LOAD in dynamic storage allocation , 2003, STOC '03.

[9]  Masahiko Jinno,et al.  Spectrum-efficient and scalable elastic optical path network: architecture, benefits, and enabling technologies , 2009, IEEE Communications Magazine.

[10]  Shmuel Zaks,et al.  Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling , 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.

[11]  Suresh Venkatasubramanian,et al.  Restricted strip covering and the sensor cover problem , 2007, SODA '07.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective, 3rd Edition , 2009 .

[14]  Andrew V. Goldberg,et al.  Finding minimum-cost circulations by canceling negative cycles , 1989, JACM.

[15]  O. Gerstel Flexible use of Spectrum and Photonic Grooming , 2010 .

[16]  Shmuel Zaks,et al.  Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract) , 2014, MFCS.