Mathematical Programming Approaches

  • JianQiang Hu
Part of the Optical Networks book series (OPNW)


Feasible Solution Decomposition Method Integer Linear Programming Optical Network Mesh Network 
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.
    A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan, “Efficient routing and scheduling algorithms for optical networks,” In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 412–423, Jan. 1994.Google Scholar
  2. 2.
    V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano, “Random path coloring on binary trees,” In Proceedings of the 3nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’00), LNCS 1913, Springer, pp. 60–71, 2000.Google Scholar
  3. 3.
    I. Chlamtac, A. Ganz, and G. Karmi, “Lightpath communications: an approach to high bandwidth optical WAN’s,” IEEE Transactions on Communications, Vol. 40, No. 7, pp. 1171–1182, 1992.CrossRefGoogle Scholar
  4. 4.
    L. A. Cox, J. Sanchez, and L. Lu, “Cost savings from optimized packing and grooming of optical circuits: mesh versus ring comparisons,” Optical Networks Magazines, pp. 72–90, May/June, 2001.Google Scholar
  5. 5.
    Z. Ding and M. Hamdi, “Clustering techniques for traffic grooming in optical WDM mesh networks,” Proceedings of 2002 Global Telecommunications Conference, Vol. 3, pp. 2711–2715, 2002.CrossRefGoogle Scholar
  6. 6.
    W. Grover, J. Doucette, M. Clouqueur, D. Leung, and D. Stamatelakis, “New options and insights for survivable transport networks,” IEEE Communications Magazine, Vol. 40, No. 1, pp. 34–41, January 2002.Google Scholar
  7. 7.
    J. Q. Hu and B. Leida, “Traffic Grooming, Routing, and Wavelength Assignment in Optical WDM Mesh Networks,” Proceedings of 2004 INFOCOM, pp. 495–501, 2004.Google Scholar
  8. 8.
    C. Lee and E. K. Park, “A genetic algorithm for traffic grooming in all-optical mesh networks,” Proceedings of 2002 IEEE International Conference on Systems, Man and Cybernetics, Vol. 7, 2003.Google Scholar
  9. 9.
    M. Mihail, C. Kaklamanis, and S. Rao, “Efficient access to optical bandwidth–wavelength routing on directed fiber trees, rings, and trees of rings,” In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 548–557, Milwaukee, Wisconsin, 23–25 October, 1995.Google Scholar
  10. 10.
    K. G. Patrocinio Jr. and G. R. Mateus, “A lagrangian-based heuristic for traffic grooming in WDM optical networks,” Proceedings of 2003 Global Telecommunications Conference, Vol. 5, pp. 2767–2771, 2003Google Scholar
  11. 11.
    P. Raghavan and E. Upfal, “Efficient routing in all-optical networks,” In Proceedings of the 26th ACM Symposium on Theory of Computing, pp. 134–143, May 1994.Google Scholar
  12. 12.
    R. Ramaswami and K. Sivarajan, Optical Networks: A Practical Perspective, Morgan Kaufmann Publishers, 1998.Google Scholar
  13. 13.
    S. Subramaniam, M. Azizoglu, and A. Somani, “On optimal converter placement in wavelength-routed networks,” IEEE/ACM Transactions on Networking, Vol. 7, No. 5, pp. 754–766, 1999.CrossRefGoogle Scholar
  14. 14.
    Y. Tao, Design and Performance Analysis of WDM Optical Networks, Ph.D. Dissertation, Boston University, 2006.Google Scholar
  15. 15.
    Y. Tao and J.Q. Hu, “Amplifier Placement for Optical Networks," Manuscript, Department of Manufacturing Engineering, Boston University, 2003.Google Scholar
  16. 16.
    K. Zhu and B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” Proceedings of IEEE International Conference on Communications, pp. 721–725, Helsinki, Finland, June, 2001.Google Scholar
  17. 17.
    “The intelligent optical core: improving bandwidth efficiency,” Sycamore Networks, white paper, 2001.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • JianQiang Hu

There are no affiliations available

Personalised recommendations