A Traffic-Grooming Algorithm for Wavelength-Routed Optical Networks

Published Online:https://doi.org/10.1287/ijoc.1060.0197

References

  • Ajmone M., Leonardi E., Mellia M., Nucci A. Design of local topologies in wavelength routed IP networks. J. Photonic Network Comm. (2002) 4:423–442CrossrefGoogle Scholar
  • Banerjee D., Mukherjee B. A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE J. Selected Areas Comm. (1996) 14:903–908CrossrefGoogle Scholar
  • Baroni S., Bayvel P. Wavelength requirements in arbitrarily connected wavelength-routed optical networks. J. Lightwave Tech. (1997) 15:242–251CrossrefGoogle Scholar
  • Chiu A. L., Modiano E. H. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. J. Lightwave Tech. (2000) 16:2–12CrossrefGoogle Scholar
  • Chu X., Bo L., Chlamtac I. Wavelength converter placement under different RWA algorithms in wavelength-routed all-optical networks. IEEE Trans. Comm. (2003) 51:607–617CrossrefGoogle Scholar
  • Cinkler T. Traffic and λ grooming. IEEE Network (2003) 17:16–21CrossrefGoogle Scholar
  • Crainic T. G., Frangioni A., Gendron B. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. (2001) 112:73–99CrossrefGoogle Scholar
  • Dutta R., Rouskas G. N. Traffic grooming in WDM networks: Past and future. IEEE Network (2002) 16:46–56CrossrefGoogle Scholar
  • Fisher M. L. An application oriented guide to Lagrangian relaxation. Interfaces (1985) 15:1–18LinkGoogle Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, San Francisco, CA) Google Scholar
  • Geoffrion A. Lagrangian relaxation for integer programming. Math. Programming Stud. (1974) 2:82–114CrossrefGoogle Scholar
  • Gerstel O., Ramaswami R., Sasaki G. H. Cost-effective traffic grooming in WDM rings. IEEE/ACM Trans. Networking (2000) 8:618–630CrossrefGoogle Scholar
  • Hu J. Q., Leida B. Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks. Sixth INFORMS Telecomm. Conf. (2002) Boca Raton, FL:156–164Google Scholar
  • Jia X. A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide-area networks. IEEE/ACM Trans. Networking (1998) 6:828–837CrossrefGoogle Scholar
  • Jia X., Hu X., Ruan L., Sun J. Multicast routing, load-balancing and wavelength assignment on a tree of rings. IEEE Comm. Lett. (2002) 6:78–81Google Scholar
  • Jia X., Du D., Hu X., Lee M., Gu J. Optimization of wavelength assignment for QoS multicast in WDM networks. IEEE Trans. Comm. (2001) 49:341–350CrossrefGoogle Scholar
  • Lee K. L., Kang K. C., Lee T., Park S. An optimization approach to routing and wavelength assignment in WDM all-optical mesh networks without wavelength conversion. ETRI J. (2002) 24:131–141CrossrefGoogle Scholar
  • Modiano E., Lin P. J. Traffic grooming in WDM networks. IEEE Comm. Magazine (2001) 39:124–129CrossrefGoogle Scholar
  • Mukherjee B.Optical Communication Networks (1997) (McGraw-Hill, New York) Google Scholar
  • Ozdalgar A. E., Bertsekas D. P. Routing and wavelength assignment in optical networks. IEEE/ACM Trans. Networking (2000) 11:633–644Google Scholar
  • Ramaswami R., Sivarajan K. N. Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Networking (1995) 3:489–500CrossrefGoogle Scholar
  • Waxman B. M. Routing of multipoint connections. IEEE J. Selected Areas Comm. (1988) 6:1617–1622CrossrefGoogle Scholar
  • Yoon M.-G. Traffic grooming and lightpath routing in WDM ring networks with hop-count constraints. ICC 2001, IEEE Internat. Conf. Comm. (2001) 3:731–737Google Scholar
  • Zang H., Jue J. P., Mukherjee B. A review of routing and wavelength assignment approaches for wavelength-routed networks. Optical Networks Magazine (2000) 1:47–59Google Scholar
  • Zegura E. W., Calvert K. L., Bhattacharjee S. How to model an internetwork. Proc. 15th IEEE INFOCOM Annual Joint Conf., IEEE Comput. Comm. Societies (1996) San Francisco, CA:594–602CrossrefGoogle Scholar
  • Zhu H., Zang H., Zhu K., Mukherjee B. Novel generic graph model for traffic grooming in heterogeneous WDM mesh network. IEEE/ACM Trans. Networking (2003) 11:432–447Google Scholar
  • Zhu K., Mukherjee B. Traffic grooming in an optical WDM mesh network. IEEE J. Selected Areas Comm. (2002) 20:122–133CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.