Regenerator Placement with Guaranteed Connectivity in Optical Networks

  • Marcio S. Savasini
  • Paolo Monti
  • Marco Tacca
  • Andrea Fumagalli
  • Helio Waldman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4534)

Abstract

The problem of minimizing the number of optical nodes with signal regeneration capability can be constrained to guarantee a desired degree of end-to-end connectivity in the all-optical transport network. The problem can be formulated using a k-connected, k-dominating node set, which is a known approach in mobile ad hoc wireless networks. This paper presents a preliminary study aimed at establishing whether efficient centralized solutions to this problem in optical networking ought to be investigated to improve the decentralized solutions already available for wireless networks.

Index Terms

Regenerator Placement Connected Dominating Set k-Connectivity Greedy Algorithm Optical Networks 

References

  1. 1.
    Chlamtac, I., Ganz, A., Karmi, G.: Lightpath communications: an approach to high-bandwidth optical WAN’s. IEEE Trans. Commun. 40, 1171–1182 (1992)CrossRefGoogle Scholar
  2. 2.
    Ramamurthy, B., Feng, H., Datta, D., Heritage, J., Mukerjee, B.: Transparent vs. opaque vs. translucent wavelength-routed optical networks. In: Optical Fiber Communication (OFC ’99) Technical Digest, San Diego, CA (February 1999)Google Scholar
  3. 3.
    Ramaswami, R.: Optical networking technologies: What worked and what didn’t. IEEE Commun. Mag. 44, 132–139 (2006)CrossRefGoogle Scholar
  4. 4.
    Cerutti, I., Fumagalli, A.: Traffic grooming in static wavelength division mul- tiplexing networks. IEEE Commun. Mag. 43, 101–107 (2005)CrossRefGoogle Scholar
  5. 5.
    Saleh, A.A.M.: Islands of transparency - an emerging reality in multiwave opti- cal networking. In: 11th Annual Meeting IEEE Lasers and Electro-Optics Society, IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
  6. 6.
    Strand, J., Chiu, A.: Impairments and other constraints on optical layer rout- ing. RFC 4054, Internet Engineering Task Force (2005)Google Scholar
  7. 7.
    Ramaswami, R., Sivarajan, K.N.: Optical Networks: a Practical Perspective, M. Morgan Kaufmann Publishers, San Francisco (2002)Google Scholar
  8. 8.
    Nolting, H.-P.: All-optical 3R-regeneration for photonic networks, In: ONDM 2003: Proceedings of the 7th IFIP Working Conference on Optical Network De- sign & Modelling (2003)Google Scholar
  9. 9.
    Yetginer, E., Karasan, E.: Regenerator placement and traffic engineering with restoration in GMPLS networks. Photonic Network Communications 2, 139–149 (2003)CrossRefGoogle Scholar
  10. 10.
    Kim, S.-W., Seo, S.-W., Kim, S.C.: Regenerator placement algorithms for con- nection establishment in all-optical networks. In: IEEE Global Telecommunications Conference, 2, pp. 1205–1209 (November 2000)Google Scholar
  11. 11.
    Yang, X., Ramamurthy, B.: Sparse regeneration in a translucent WDM optical network. In: Proceedings of APOC 2001, pp. 61–70 (2001)Google Scholar
  12. 12.
    Shen, G., Grover, W.D., Cheng, T.H., Bose, S.K.: Sparse placement of electronic switching nodes for low blocking in translucent optical networks. Journal of Optical Networking 1(12), 424 (2002)Google Scholar
  13. 13.
    Subramaniam, S., Azizoglu, M., Somani, A.: On optimal converter placement in wavelength-routed networks. In: INFOCOM, vol. 1, pp. 500–507 (1997)Google Scholar
  14. 14.
    Chu, X., Li, B., Chlamtac, I.: Wavelength converter placement under different RWA algorithms in wavelength-routed all-optical networks. IEEE Trans. Com- mun. 51, 607–617 (2003)Google Scholar
  15. 15.
    Dai, F., Wu, J.: On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. Journal of Parallel and Distributed Computing 66, 947–958 (2006)MATHCrossRefGoogle Scholar
  16. 16.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algo- rithms, 2nd edn. MIT Press, Cambridge, MA (2001)Google Scholar
  17. 17.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, New York, NY, USA (1979)MATHGoogle Scholar
  18. 18.
  19. 19.
    M. Doar, I.M. Leslie: How bad is naive multicast routing? In: INFOCOM, vol. 1, pp. 82–89 (March/April 1993)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Marcio S. Savasini
    • 1
  • Paolo Monti
    • 2
  • Marco Tacca
    • 2
  • Andrea Fumagalli
    • 2
  • Helio Waldman
    • 1
  1. 1.Optical Networking Lab, Faculdade de Engenharia Eletrica e de Computacao, State University of Campinas, Campinas, SPBrazil
  2. 2.Open Networking Advanced Research (OpNeAR) Lab, Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, Richardson, TXUSA

Personalised recommendations