Advertisement

Theory of Computing Systems

, Volume 64, Issue 2, pp 311–326 | Cite as

Profit Maximization in Flex-Grid All-Optical Networks

  • Mordechai ShalomEmail author
  • Prudence W. H. Wong
  • Shmuel Zaks
Article
  • 22 Downloads

Abstract

All-optical networks have been largely investigated due to their high data transmission rates. The key to the high speeds in all-optical 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.

Keywords

All-optical networks Flex-grid Approximation algorithms Network design Network optimization 

Notes

References

  1. 1.
    Gerstel, O.: Flexible use of spectrum and photonic grooming. In: Photonics in Switching, OSA (Optical Society of America) Technical Digest, page paper PMD3 (2010)Google Scholar
  2. 2.
    Ramaswami, R., Sivarajan, K.N., Sasaki, G.H.: Optical Networks: a Practical Perspective. Morgan Kaufmann Publisher Inc., San Francisco (2009)Google Scholar
  3. 3.
    Klasing, R.: Methods and problems of wavelength-routing in all-optical networks. In: Proceeding of the MFCS’98 Workshop on Communication, August 24–25, Brno, Czech Republic, pp. 1–9 (1998)Google Scholar
  4. 4.
    Jinno, M., Takara, H., Kozicki, B., Tsukishima, Y., Sone, Y., Matsuoka, S.: Spectrum-efficient and scalable elastic optical path network: architecture, benefits, and enabling technologies. Comm. Mag. 47, 66–73 (2009)CrossRefGoogle Scholar
  5. 5.
    Gerstel, O.: Realistic approaches to scaling the IP network using optics. In: Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), pp. 1–3 (2011)Google Scholar
  6. 6.
    Shachnai, H., Voloshin, A., Zaks, S.: Optimizing bandwidth allocation in flex-grid optical networks with application to scheduling. In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium, Phoenix, AZ, USA, May 19–23, 2014, pp. 862–871 (2014)Google Scholar
  7. 7.
    Shachnai, H., Voloshin, A., Zaks, S.: Flexible bandwidth assignment with application to optical networks - (extended abstract). In: Mathematical Foundations of Computer Science 2014—39th International Symposium, MFCS 2014, Budapest, Hungary, August 25–29, 2014. Proceedings, Part II, pp. 613–624 (2014)CrossRefGoogle Scholar
  8. 8.
    Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57). North-Holland Publishing Co., Amsterdam (2004)Google Scholar
  9. 9.
    Garey, M., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)zbMATHGoogle Scholar
  10. 10.
    Halldórson, M.M., Kortzarz, G.: Multicoloring: problems and techniques. In: 29th International Symposium on Mathematical Foundations of Computer Science, MFCS, LNCS 3153, pp. 25–41. Springer (2004)Google Scholar
  11. 11.
    Shalom, M.: On the interval chromatic number of proper interval graphs. Discret. Math. 338, 1907–1916 (2015)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Buchsbaum, A.L., Karloff, H., Kenyon, C., Reingold, N., Thorup, M.: Opt versus load in dynamic storage allocation. SIAM J. Comput. 33(3), 632–646 (2004)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covenring and the sensor cover problem. In: SODA ’07 Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1056–1063 (2007)Google Scholar
  14. 14.
    Shalom, M., Wong, P.W.H., Zaks, S.: Profit maximizing colorings in flex-grid optical networks. In: Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Ischia, Italy, pp. 249–260 (2013)Google Scholar
  15. 15.
    Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. ACM 36(4), 873–886 (1989)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.TelHai Academic CollegeUpper GalileeIsrael
  2. 2.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK
  3. 3.Department of Computer ScienceTechnionHaifaIsrael
  4. 4.School of Engineering, Ruppin Academic CenterEmek-HeferIsrael

Personalised recommendations