Dynamic Grooming Algorithms

  • Byrav Ramamurthy
Part of the Optical Networks book series (OPNW)


Tabu Search Greedy Algorithm Wavelength Division Multiplex Tabu List Candidate List 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Angela L. Chiu and Eytan H. Modiano (1998), “Reducing Electronic Multiplexing Costs in Unidirectional SONET/WDM Ring Networks via Efficient Traffic Grooming,” IEEE/IEICE Global Telecommunication Conference, vol. 1, pp. 332–327, Sydney, Australia.Google Scholar
  2. 2.
    Eytan Modiano and Aradhana Narula-Tam (2000), “Mechanisms for providing optical bypass in WDM-based networks,” SPIE Optical Networks Magazine.Google Scholar
  3. 3.
    Jian Wang, V. Rao Vemuri, Wonhong Cho and Biswanath Mukherjee (2000), “Improved Approaches for Cost-effective Traffic Grooming in WDM Ring networks: Non-uniform Traffic and Bidirectional Ring,” Proceedings ICC 2000.Google Scholar
  4. 4.
    Xijun Zhang and Chunming Qiao (1998), “An Effective and Comprehensive Approach for Traffic Grooming and Wavelength Assignment in SONET/WDM Rings,” Proceedings of the SPIE-The International Society for Optical Engineering, vol. 3531, pp. 221–232.Google Scholar
  5. 5.
    Ori Gerstel and Rajiv Ramaswami (1998), “Cost Effective Traffic Grooming in WDM rings", Proceedings of IEEE INFOCOM ’98, vol. 1, pp. 69–77.Google Scholar
  6. 6.
    Randall Berry and Eytan Modiano (2000), “Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic,” IEEE Journal on Selected Areas in Communications, vol. 18, No. 10, pp. 1961–1971.CrossRefGoogle Scholar
  7. 7.
    Alexander Schrijver (1986), Theory of Linear and Integer Programming, John Wiley & Sons, New York.MATHGoogle Scholar
  8. 8.
    Murari Sridharan and Arun K. Somani (2000), “Revenue Maximization in Survivable WDM Networks,” Optical Networking and Communications, Proceeding of SPIE, vol. 4233.Google Scholar
  9. 9.
    Wang Yao and Byrav Ramamurthy (2005), “A Novel Link Bundled Auxiliary Graph Model for Constrained Dynamic Traffic Grooming in Optical WDM Mesh Networks,” IEEE Journal of Selected Areas in Communications, vol. 23, no. 8, pp. 1542–55.CrossRefGoogle Scholar
  10. 10.
    Wang Yao and Byrav Ramamurthy (2004), “Dynamic traffic grooming using fixed-alternate routing in WDM mesh optical networks,” in the First Workshop on Traffic Grooming in WDM Networks, Co-located with BroadNets’2004, San Jose, California.Google Scholar
  11. 11.
    Wang Yao and Byrav Ramamurthy (2004), “Rerouting schemes for dynamic traffic grooming in optical WDM mesh networks,” in IEEE Globecom 2004, Dallas, Texas.Google Scholar
  12. 12.
    Wang Yao (2005), Traffic grooming in next-generation optical WDM mesh networks, Ph.D. dissertation, Department of Computer Science and Engineering, University of Nebraska-Lincoln.Google Scholar
  13. 13.
    Shu Huang and Rudra Dutta (2006), Dynamic traffic grooming: The changing role of traffic grooming, IEEE Communications Surveys and Tutorials, vol. 8, no. 4, pp. 32–50.Google Scholar
  14. 14.
    Peng-jun Wan, Liwu Liu and Ophir Frieder (1999),“Grooming of Arbitrary Traffic in SONET/WDM Rings,” IEEE/IEICE Global Telecommunication Conference, vol. 1B, pp. 1012–1016.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Byrav Ramamurthy

There are no affiliations available

Personalised recommendations