Advertisement

Computational Complexity

  • Shu Huang
Part of the Optical Networks book series (OPNW)

Keywords

Source Node Decision Version Path Network Ring Network Virtual Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dutta R. and Rouskas G.N. (2002) Traffic Grooming in WDM Networks: Past and Future, IEEE Network.Google Scholar
  2. 2.
    Chiu A. and Modiano E. (2000) Traffic Grooming Algorithms for Reducing Electronic Multiplexing Costs in WDM Ring Networks, IEEE Journal on Lightwave Technology.Google Scholar
  3. 3.
    Chow T. and Lin P. (2004) The Ring Grooming Problem, Networks.Google Scholar
  4. 4.
    Gerstel, O. and Lin, P. and Sasaki, G. (1999) Combined WDM and SONET Network Design, IEEE INFOCOM.Google Scholar
  5. 5.
    Erlebach T. (1998) Scheduling Connections in Fast Networks, Thesis, Swiss Federal Institute of Technology, Zurich.Google Scholar
  6. 6.
    Liu L.W., Li X.Y., Wan P.J., Frieder O. (2000) Wavelength Assignment in WDM Rings to Minimize SONET ADMs, IEEE INFOCOM.Google Scholar
  7. 7.
    Wan P.J., Calinescu G., Liu L.W., Frieder O. (1999) Grooming of Arbitrary Traffic in SONET BLSRs, GLOBECOM.Google Scholar
  8. 8.
    Zhu, K. and Mukherjee, B. (2002) Traffic Grooming in an Optical WDM Mesh Network, IEEE Journal on Selected Areas in Communications.Google Scholar
  9. 9.
    Huang S., Dutta R., and Rouskas G.N. (2006) Traffic Grooming in Path, Star, Tree Networks: Complexity, Bounds and Algorithms, IEEE Journal on Selected Areas in Communications.Google Scholar
  10. 10.
    Garey, M.R. and Johnson, D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company.Google Scholar
  11. 11.
    Elmallah, E.S. and Culberson, J. (1995) Multicommodity Flows in Simple Multistage Networks, Networks.Google Scholar
  12. 12.
    Okamura, H. and Seymour, P.D. (1981) Multicommodity Flows in Planar Graphs, Journal of Combinatorial Theory.Google Scholar
  13. 13.
    Iyer P., Dutta R., and Savage C.D. (2005) On the Complexity of Path Traffic Grooming, Proceedings of the Second International IEEE/Create-Net Workshop on Traffic Grooming, Boston, MA.Google Scholar
  14. 14.
    Chen B.S., Rouskas G.N., Dutta R. (2005) Traffic Grooming in WDM Ring Networks to Minimize the Maximum Electronic Port Cost, Optical Switching and Networking.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Shu Huang

There are no affiliations available

Personalised recommendations