Advertisement

On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming

  • Michele Flammini
  • Gianpiero Monaco
  • Luca Moscardelli
  • Mordechai Shalom
  • Shmuel Zaks
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7109)

Abstract

We consider the problem of minimizing the number of regenerators in optical networks with traffic grooming. In this problem we are given a network with an underlying topology of a graph G, a set of requests that correspond to paths in G and two positive integers g and d. There is a need to put a regenerator every d edges of every path, because of a degradation in the quality of the signal. Each regenerator can be shared by at most g paths, g being the grooming factor. On the one hand, we show that even in the case of d = 1 the problem is APX − hard, i.e. a polynomial time approximation scheme for it does not exist (unless P = NP). On the other hand, we solve such a problem for general G and any d and g, by providing an O(logg)-approximation algorithm and thus extending previous results holding only for specific topologies and specific values of d or g.

Keywords

Optical Networks Wavelength Division Multiplexing (WDM) Regenerators Traffic Grooming Approximation Algorithms and Complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amini, O., Pérennes, S., Sau, I.: Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410(38-40), 3751–3760 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  3. 3.
    Chen, S., Ljubic, I., Raghavan, S.: The regenerator location problem, vol. 55, pp. 205–220 (2010)Google Scholar
  4. 4.
    Chvátal, V.: A greedy heuristic for the set covering problem. Mathematics of Operation Research 4, 233–235 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Călinescu, G., Frieder, O., Wan, P.-J.: Minimizing electronic line terminals for automatic ring protection in general wdm optical networks. IEEE Journal of Selected Area on Communications 20(1), 183–189 (2002)CrossRefGoogle Scholar
  6. 6.
    Călinescu, G., Wan, P.-J.: Splitable traffic partition in wdm/sonet rings to minimize sonet adms. Theoretical Computer Science 276(1-2), 33–50 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Călinescu, G., Wan, P.-J.: Traffic partition in wdm/sonet rings to minimize sonet adms. Journal of Combinatorial Optimization 6(4), 425–453 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Fedrizzi, R., Galimberti, G.M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C.V., Tanzi, A., Zanardi, A.: A Framework for Regenerator Site Selection Based on Multiple Paths. In: Prooceedings of IEEE/OSA Conference on Optical Fiber Communications, OFC (2010)Google Scholar
  9. 9.
    Flammini, M., Marchetti-Spaccamela, A., Monaco, G., Moscardelli, L., Zaks, S.: On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Transactions on Networking 19(2), 498–511 (2011)CrossRefGoogle Scholar
  10. 10.
    Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., Zaks, S.: Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40-42), 3553–3562 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. In: Luque, E., Margalef, T., Benítez, D. (eds.) Euro-Par 2008. LNCS, vol. 5168, pp. 920–929. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  12. 12.
    Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Optimizing Regenerator Cost in Traffic Grooming (extended abstract). In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 443–458. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  13. 13.
    Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Optimizing regenerator cost in traffic grooming. Technical Report CS-2011-07, Technion, Department of Computer Science (2011)Google Scholar
  14. 14.
    Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a wdm ring to minimize cost of embedded sonet rings. In: INFOCOM 1998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 69–77 (1998)Google Scholar
  15. 15.
    Mertzios, G.B., Sau, I., Shalom, M., Zaks, S.: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 333–344. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  16. 16.
    Sriram, K., Griffith, D., Su, R., Golmie, N.: Static vs. dynamic regenerator assignment in optical switches: models and cost trade-offs. In: Workshop on High Performance Switching and Routing (HPSR), pp. 151–155 (2004)Google Scholar
  17. 17.
    Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2004)Google Scholar
  18. 18.
    Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: SODA, pp. 830–831 (2003)Google Scholar
  19. 19.
    Yang, X., Ramamurthy, B.: Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing. Photonic Network Communications 10(1), 39–53 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michele Flammini
    • 1
  • Gianpiero Monaco
    • 1
  • Luca Moscardelli
    • 2
  • Mordechai Shalom
    • 3
  • Shmuel Zaks
    • 4
  1. 1.Department of Computer ScienceUniversity of L’AquilaL’AquilaItaly
  2. 2.Department of ScienceUniversity of Chieti-PescaraPescaraItaly
  3. 3.Tel Hai Academic CollegeUpper GalileeIsrael
  4. 4.Department of Computer ScienceTechnionHaifaIsrael

Personalised recommendations