Skip to main content
SpringerLink
Log in

Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5344))

Included in the following conference series:

Abstract

Traffic grooming is a major issue in optical networks. It refers to grouping low rate signals into higher speed streams, in order to reduce the equipment cost. In SONET WDM networks, this cost is mostly given by the number of electronic terminations, namely Add-Drop Multiplexers (ADMs for short). We consider the unidirectional ring topology with a generic grooming factor C, and in this case, in graph-theoretical terms, the traffic grooming problem consists in partitioning the edges of a request graph into subgraphs with at most C edges, while minimizing the total number of vertices of the decomposition.

We consider the case when the request graph has bounded degree Δ, and our aim is to design a network (namely, place the ADMs at each node) being able to support any request graph with maximum degree at most Δ. The existing theoretical models in the literature are much more rigid, and do not allow such adaptability. We formalize the problem, and we solve the cases Δ= 2 (for all values of C) and Δ= 3 (except the case C = 4). We also provide lower and upper bounds for the general case.

This work has been partially supported by European project IST FET AEOLUS, PACA region of France, Ministerio de Educación y Ciencia of Spain, European Regional Development Fund under project TEC2005-03575, Catalan Research Council under project 2005SGR00256, and COST action 293 GRAAL, and has been done in the context of the crc Corso with France Telecom.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amini, O., Pérennes, S., Sau, I.: Hardness and Approximation of Traffic Grooming. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 561–573. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Bermond, J.-C., Coudert, D.: Traffic grooming in unidirectional WDM ring networks using design theory. In: IEEE ICC, Anchorage, Alaska, vol. 2, pp. 1402–1406 (May 2003)

    Google Scholar 

  3. Bermond, J.-C., Coudert, D.: The CRC Handbook of Combinatorial Designs, 2nd edition. In: Colbourn, C.J., Dinitz, J.H. (eds.) Discrete Mathematics and Its Applications, ch. VI.27, Grooming, 2nd edn. Discrete Mathematics and Its Applications, vol. 42, pp. 493–496. CRC Press, Boca Raton (2006)

    Google Scholar 

  4. Bermond, J.-C., Coudert, D., Muñoz, X.: Traffic grooming in unidirectional WDM ring networks: the all-to-all unitary case. In: The 7th IFIP Working Conference on Optical Network Design & Modelling – ONDM 2003, pp. 1135–1153 (February 2003)

    Google Scholar 

  5. Bermond, J.-C., Fouquet, J.-L., Habib, M., Péroche, B.: On linear k-arboricity. Discrete Math. 52(2-3), 123–132 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  6. Berry, R., Modiano, E.: Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic. IEEE J. on Selected Areas in Comm. 18, 1961–1971 (2000)

    Article  Google Scholar 

  7. Chiu, A.L., Modiano, E.H.: Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. IEEE/OSA Journal of Lightwave Technology 18(1), 2–12 (2000)

    Article  Google Scholar 

  8. Dutta, R., Rouskas, N.: On optimal traffic grooming in WDM rings. IEEE Journal of Selected Areas in Communications 20(1), 1–12 (2002)

    Article  Google Scholar 

  9. Dutta, R., Rouskas, N.: Traffic grooming in WDM networks: Past and future. IEEE Network 16(6), 46–56 (2002)

    Article  Google Scholar 

  10. Erdös, P., Sachs, H.: Reguläre graphe gegebener taillenweite mit minimaler knotenzahl. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 12, 251–257 (1963)

    Google Scholar 

  11. Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem in tree and star networks. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 147–158. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Flammini, M., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 915–924. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings. In: IEEE Infocom, San Francisco, California, pp. 94–101 (1998)

    Google Scholar 

  14. Gerstel, O., Ramaswani, R., Sasaki, G.: Cost-effective traffic grooming in WDM rings. IEEE/ACM Transactions on Networking 8(5), 618–630 (2000)

    Article  Google Scholar 

  15. Goldschmidt, O., Hochbaum, D., Levin, A., Olinick, E.: The SONET edge-partition problem. Networks 41(1), 13–23 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Modiano, E., Lin, P.: Traffic grooming in WDM networks. IEEE Communications Magazine 39(7), 124–129 (2001)

    Article  Google Scholar 

  17. Petersen, J.P.: Die Theorie der Regulären Graphs (The Theory of Regular Graphs). Acta Mathematica 15, 193–220 (1891)

    Article  MathSciNet  MATH  Google Scholar 

  18. Somani, A.: Survivable traffic grooming in WDM networks. In: Gautam, D.K. (ed.) Broad band optical fiber communications technology – BBOFCT, Jalgaon, India, December 2001, pp. 17–45. Nirtali Prakashan (2001) (Invited paper)

    Google Scholar 

  19. Thomassen, C.: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5. J. Comb. Theory Ser. B 75(1), 100–109 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  20. Wan, P.-J., Calinescu, G., Liu, L., Frieder, O.: Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal of Selected Areas in Communications 18(10), 1995–2003 (2000)

    Article  Google Scholar 

  21. Wang, J., Cho, W., Vemuri, V., Mukherjee, B.: Improved approches for cost-effective traffic grooming in WDM ring networks: Ilp formulations and single-hop and multihop connections. IEEE/OSA Journal of Lightwave Technology 19(11), 1645–1653 (2001)

    Article  Google Scholar 

  22. Zhu, K., Mukherjee, B.: A review of traffic grooming in WDM optical networks: Architectures and challenges. Optical Networks Magazine 4(2), 55–64 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graph Theory and Combinatorics Group at Applied Mathematics IV, Department of UPC, Barcelona, Spain

    Xavier Muñoz & Ignasi Sau

  2. Mascotte joint Project - INRIA/CNRS-I3S/UNSA - 2004, route des Lucioles, Sophia-Antipolis, France

    Ignasi Sau

Authors
  1. Xavier Muñoz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ignasi Sau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Durham University, South Road, DH1 3LE, Durham, UK

    Hajo Broersma , Tom Friedetzky  & Daniel Paulusma ,  & 

  2. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Thomas Erlebach

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Muñoz, X., Sau, I. (2008). Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2008. Lecture Notes in Computer Science, vol 5344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92248-3_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92248-3_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92247-6

  • Online ISBN: 978-3-540-92248-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation