skip to main content
10.1145/781027.781066acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
Article

Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms

Published:10 June 2003Publication History

ABSTRACT

No abstract available.

References

  1. A. L. Chiu and E. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Journal of Lightwave Technology, 18(1):2--12, Jan. 2000.Google ScholarGoogle ScholarCross RefCross Ref
  2. R. Dutta and G. N. Rouskas. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks, 1(1):73--89, January 2000.Google ScholarGoogle Scholar
  3. R. Dutta and G. N. Rouskas. On optimal traffic grooming in WDM rings. Proc. ACM SIGMETRICS, pp. 164--174, June 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Dutta and G. N. Rouskas. Traffic grooming in WDM networks: Past and future. IEEE Network, 16(6):46--56, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. R. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman and Co., New York.Google ScholarGoogle Scholar
  6. S. Huang. Traffic Grooming in Wavelength Routed Path Networks. North Carolina State University. M.S. thesis, 2002. http://www.lib.ncsu.edu/ETD-db/Google ScholarGoogle Scholar
  7. K. Zhu and B. Mukherjee. Traffic grooming in an optical WDM mesh network. IEEE JSAC, 20(1):122--133, Jan 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGMETRICS '03: Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
      June 2003
      338 pages
      ISBN:1581136641
      DOI:10.1145/781027
      • cover image ACM SIGMETRICS Performance Evaluation Review
        ACM SIGMETRICS Performance Evaluation Review  Volume 31, Issue 1
        June 2003
        325 pages
        ISSN:0163-5999
        DOI:10.1145/885651
        Issue’s Table of Contents

      Copyright © 2003 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 10 June 2003

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      SIGMETRICS '03 Paper Acceptance Rate26of222submissions,12%Overall Acceptance Rate459of2,691submissions,17%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader