Abstract

There has been considerable research interest in the area of traffic grooming for WDM mesh networks. The vast majority of the current work can be classified into one of two categories, either static grooming or dynamic grooming. In many situations, the individual traffic demands require bandwidth at certain predefined intervals, and resources allocated to nonoverlapping demands can be reused in time. In this paper, we propose a new traffic grooming technique that exploits knowledge of the connection holding times of traffic demands to lead to more efficient resource utilization. We consider wavelength-convertible networks as well as networks without any wavelength conversion capability and implement survivability using dedicated and shared path protection. Although individual demands may be short lived, it is desirable to have a logical topology that is relatively stable and not subject to frequent changes. Therefore, our objective is to design a stable logical topology that can accommodate a collection of low-speed traffic demands with specified setup and teardown times. Our approach results in lower equipment cost and significantly reduced overhead for connection setup/teardown. We present efficient integer linear program (ILP) formulations that address the complete traffic grooming problem, including logical topology design, routing and wavelength assignment, and routing of traffic demands over the selected topology. The primary focus of our ILP formulations is to minimize the resource requirements. However, it is possible to modify our formulations to maximize the throughput, if necessary.

© 2010 Optical Society of America

Full Article  |  PDF Article

References

  • View by:
  • |
  • |
  • |

  1. R. Ramaswami, K. N. Sivarajan, Optical Networks: A Practical Perspective, 2nd Ed.Morgan Kaufmann, 1998.
  2. I. Chlamtac, A. Ganz, G. Karmi, “Lightnets: topologies for high-speed optical networks,” J. Lightwave Technol., vol. 11, no. 5, pp. 951–961, May/June 1993.
    [CrossRef]
  3. K. Zang, B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag., vol. 4, no. 2, pp. 55–64, Mar. 2003.
  4. K. Zhu, B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122–133, Jan. 2002.
    [CrossRef]
  5. J. Q. Hu, B. Leida, “Traffic grooming routing and wavelength assignment in optical WDM mesh networks,” in 23rd Annu. Joint Conf. of the IEEE Computer and Communications Societies, 2004, pp. 495–501.
  6. A. Jaekel, A. Bari, Y. Chen, S. Bandyopadhyay, “Strategies for optimal logical topology design and traffic grooming,” Photonic Network Commun., vol. 19, no. 2, pp. 223–232, Apr. 2010.
    [CrossRef]
  7. S. Zhang, B. Ramamurthy, “Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 7, pp. 1165–1172, Sept. 2003.
    [CrossRef]
  8. C. Xin, B. Wang, X. Cao, J. Li, “Logical topology design for dynamic traffic grooming in WDM optical networks,” J. Lightwave Technol., vol. 24, no. 6, pp. 2267–2275, June 2006.
    [CrossRef]
  9. J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
    [CrossRef]
  10. H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, pp. 47–60, Jan. 2000.
  11. N. Skorin-Kapov, “Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks,” IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 2–15, Aug. 2006.
  12. B. Wang, T. Li, C. Xin, X. Zhang, “On survivable service provisioning in WDM networks under a scheduled traffic model,” in IEEE Global Telecommunications Conf., 2005, pp. 1900–1904.
  13. T. Li, B. Wang, “Path protection based routing and wavelength assignment in wavelength division multiplexing optical networks under a scheduled traffic model,” J. Opt. Netw., vol. 5, pp. 575–588, 2006.
    [CrossRef]
  14. M. Tornatore, C. Ou, J. Zhang, A. Pattavina, B. Mukherjee, “Efficient shared-path protection exploiting the knowledge of connection-holding time,” in Optical Fiber Communication Conf., 2005, pp. 65–72.
  15. A. Jaekel, Y. Chen, “Quality of service based resource allocation for scheduled lightpath demands,” Comput. Commun., vol. 30, no. 18, pp. 3550–3558, Dec. 2007.
    [CrossRef]
  16. F. Ricciato, S. Salsano, A. Belmonte, M. Listanti, “Offline configuration of a MPLS over WDM network under time-varying offered traffic,” in 21st Annu. Joint Conf. of the IEEE Computer and Communications Societies, New York, NY, 2002, pp. 57–65.
  17. W. Yao, B. Ramamurthy, “Survivable traffic grooming in WDM mesh networks under SRLG constraints,” in IEEE Int. Conf. on Communications, 2005, vol. 3, pp. 1751–1755.
  18. B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in 2nd Int. Conf. on Broadband Networks, 2005, pp. 15–24.
  19. W. Su, G. Sasaki, “Scheduling of periodic connections with flexibility,” in 41st Allerton Conf. on Communications, Control and Computing, 2003.
  20. A. Jaekel, Y. Chen, “Resource provisioning for survivable WDM networks under a sliding scheduled traffic model,” Opt. Switching Networking, vol. 6, no. 1, pp. 44–54, Jan. 2009.
    [CrossRef]
  21. B. Wang, T. Li, X. Luo, Y. Fan, “Traffic grooming under a sliding scheduled traffic model in WDM optical networks,” in IEEE Workshop on Traffic Grooming in WDM Networks, 2004.
  22. G. Agrawal, D. Medhi, “Lightpath topology configuration for wavelength-routed IP/MPLS networks with time-dependent traffic,” in IEEE Global Telecommunications Conf., San Francisco, CA, 2006, pp. 1–5.
  23. P. Pavon-Marino, R. Aparicio-Pardo, B. Garcia-Manrubia, N. Skorin-Kapov, “Virtual topology design and flow routing in optical networks under multi-hour traffic demand,” Photonic Network Commun., vol. 19, no. 1, pp. 41–51, 2009.
  24. W. Yao, B. Ramamurthy, “Survivable traffic grooming with path protection at the connection level in WDM mesh networks,” in 1st Int. Conf. on Broadband Networks, 2004, pp. 310–319.
  25. A. Jaekel, A. Bari, S. Bandyopadhyay, “Resilient traffic grooming for WDM networks,” J. Opt. Netw., vol. 7, no. 5, pp. 378–387, 2008.
    [CrossRef]
  26. C. Ou, K. Zhu, H. Zang, L. H. Sahasrabuddhe, B. Mukherjee, “Traffic grooming for survivable WDM networks-shared protection,” IEEE J. Sel. Areas Commun., vol. 21, pp. 1367–1383, 2003.
    [CrossRef]
  27. A. Jaekel, Y. Chen, A. Bari, “Survivable traffic grooming for scheduled demands,” in 5th Int. Conf. on Broadband Communications, Networks and Systems, 2008, pp. 176–183.
  28. R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows. Prentice-Hall, 1993.
  29. M. Sridharan, M. V. Salapaka, A. Somani, “A practical approach to operating survivable WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 34–46, Jan. 2002.
    [CrossRef]
  30. ILOG CPLEX 9.1. Documentation available at http://www.columbia.edu/dano/resources/cplex91man/index.html.

2010

A. Jaekel, A. Bari, Y. Chen, S. Bandyopadhyay, “Strategies for optimal logical topology design and traffic grooming,” Photonic Network Commun., vol. 19, no. 2, pp. 223–232, Apr. 2010.
[CrossRef]

2009

A. Jaekel, Y. Chen, “Resource provisioning for survivable WDM networks under a sliding scheduled traffic model,” Opt. Switching Networking, vol. 6, no. 1, pp. 44–54, Jan. 2009.
[CrossRef]

P. Pavon-Marino, R. Aparicio-Pardo, B. Garcia-Manrubia, N. Skorin-Kapov, “Virtual topology design and flow routing in optical networks under multi-hour traffic demand,” Photonic Network Commun., vol. 19, no. 1, pp. 41–51, 2009.

2008

2007

A. Jaekel, Y. Chen, “Quality of service based resource allocation for scheduled lightpath demands,” Comput. Commun., vol. 30, no. 18, pp. 3550–3558, Dec. 2007.
[CrossRef]

2006

2003

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

S. Zhang, B. Ramamurthy, “Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 7, pp. 1165–1172, Sept. 2003.
[CrossRef]

K. Zang, B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag., vol. 4, no. 2, pp. 55–64, Mar. 2003.

C. Ou, K. Zhu, H. Zang, L. H. Sahasrabuddhe, B. Mukherjee, “Traffic grooming for survivable WDM networks-shared protection,” IEEE J. Sel. Areas Commun., vol. 21, pp. 1367–1383, 2003.
[CrossRef]

2002

M. Sridharan, M. V. Salapaka, A. Somani, “A practical approach to operating survivable WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 34–46, Jan. 2002.
[CrossRef]

K. Zhu, B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122–133, Jan. 2002.
[CrossRef]

2000

H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, pp. 47–60, Jan. 2000.

1993

I. Chlamtac, A. Ganz, G. Karmi, “Lightnets: topologies for high-speed optical networks,” J. Lightwave Technol., vol. 11, no. 5, pp. 951–961, May/June 1993.
[CrossRef]

Agrawal, G.

G. Agrawal, D. Medhi, “Lightpath topology configuration for wavelength-routed IP/MPLS networks with time-dependent traffic,” in IEEE Global Telecommunications Conf., San Francisco, CA, 2006, pp. 1–5.

Ahuja, R. K.

R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows. Prentice-Hall, 1993.

Aparicio-Pardo, R.

P. Pavon-Marino, R. Aparicio-Pardo, B. Garcia-Manrubia, N. Skorin-Kapov, “Virtual topology design and flow routing in optical networks under multi-hour traffic demand,” Photonic Network Commun., vol. 19, no. 1, pp. 41–51, 2009.

Bandyopadhyay, S.

A. Jaekel, A. Bari, Y. Chen, S. Bandyopadhyay, “Strategies for optimal logical topology design and traffic grooming,” Photonic Network Commun., vol. 19, no. 2, pp. 223–232, Apr. 2010.
[CrossRef]

A. Jaekel, A. Bari, S. Bandyopadhyay, “Resilient traffic grooming for WDM networks,” J. Opt. Netw., vol. 7, no. 5, pp. 378–387, 2008.
[CrossRef]

Bari, A.

A. Jaekel, A. Bari, Y. Chen, S. Bandyopadhyay, “Strategies for optimal logical topology design and traffic grooming,” Photonic Network Commun., vol. 19, no. 2, pp. 223–232, Apr. 2010.
[CrossRef]

A. Jaekel, A. Bari, S. Bandyopadhyay, “Resilient traffic grooming for WDM networks,” J. Opt. Netw., vol. 7, no. 5, pp. 378–387, 2008.
[CrossRef]

A. Jaekel, Y. Chen, A. Bari, “Survivable traffic grooming for scheduled demands,” in 5th Int. Conf. on Broadband Communications, Networks and Systems, 2008, pp. 176–183.

Belmonte, A.

F. Ricciato, S. Salsano, A. Belmonte, M. Listanti, “Offline configuration of a MPLS over WDM network under time-varying offered traffic,” in 21st Annu. Joint Conf. of the IEEE Computer and Communications Societies, New York, NY, 2002, pp. 57–65.

Cao, X.

Chen, Y.

A. Jaekel, A. Bari, Y. Chen, S. Bandyopadhyay, “Strategies for optimal logical topology design and traffic grooming,” Photonic Network Commun., vol. 19, no. 2, pp. 223–232, Apr. 2010.
[CrossRef]

A. Jaekel, Y. Chen, “Resource provisioning for survivable WDM networks under a sliding scheduled traffic model,” Opt. Switching Networking, vol. 6, no. 1, pp. 44–54, Jan. 2009.
[CrossRef]

A. Jaekel, Y. Chen, “Quality of service based resource allocation for scheduled lightpath demands,” Comput. Commun., vol. 30, no. 18, pp. 3550–3558, Dec. 2007.
[CrossRef]

A. Jaekel, Y. Chen, A. Bari, “Survivable traffic grooming for scheduled demands,” in 5th Int. Conf. on Broadband Communications, Networks and Systems, 2008, pp. 176–183.

Chlamtac, I.

I. Chlamtac, A. Ganz, G. Karmi, “Lightnets: topologies for high-speed optical networks,” J. Lightwave Technol., vol. 11, no. 5, pp. 951–961, May/June 1993.
[CrossRef]

Dotaro, E.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

Douville, R.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

Fan, Y.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in 2nd Int. Conf. on Broadband Networks, 2005, pp. 15–24.

B. Wang, T. Li, X. Luo, Y. Fan, “Traffic grooming under a sliding scheduled traffic model in WDM optical networks,” in IEEE Workshop on Traffic Grooming in WDM Networks, 2004.

Gagnaire, M.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

Ganz, A.

I. Chlamtac, A. Ganz, G. Karmi, “Lightnets: topologies for high-speed optical networks,” J. Lightwave Technol., vol. 11, no. 5, pp. 951–961, May/June 1993.
[CrossRef]

Garcia-Manrubia, B.

P. Pavon-Marino, R. Aparicio-Pardo, B. Garcia-Manrubia, N. Skorin-Kapov, “Virtual topology design and flow routing in optical networks under multi-hour traffic demand,” Photonic Network Commun., vol. 19, no. 1, pp. 41–51, 2009.

Hu, J. Q.

J. Q. Hu, B. Leida, “Traffic grooming routing and wavelength assignment in optical WDM mesh networks,” in 23rd Annu. Joint Conf. of the IEEE Computer and Communications Societies, 2004, pp. 495–501.

Jaekel, A.

A. Jaekel, A. Bari, Y. Chen, S. Bandyopadhyay, “Strategies for optimal logical topology design and traffic grooming,” Photonic Network Commun., vol. 19, no. 2, pp. 223–232, Apr. 2010.
[CrossRef]

A. Jaekel, Y. Chen, “Resource provisioning for survivable WDM networks under a sliding scheduled traffic model,” Opt. Switching Networking, vol. 6, no. 1, pp. 44–54, Jan. 2009.
[CrossRef]

A. Jaekel, A. Bari, S. Bandyopadhyay, “Resilient traffic grooming for WDM networks,” J. Opt. Netw., vol. 7, no. 5, pp. 378–387, 2008.
[CrossRef]

A. Jaekel, Y. Chen, “Quality of service based resource allocation for scheduled lightpath demands,” Comput. Commun., vol. 30, no. 18, pp. 3550–3558, Dec. 2007.
[CrossRef]

A. Jaekel, Y. Chen, A. Bari, “Survivable traffic grooming for scheduled demands,” in 5th Int. Conf. on Broadband Communications, Networks and Systems, 2008, pp. 176–183.

Jue, J. P.

H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, pp. 47–60, Jan. 2000.

Karmi, G.

I. Chlamtac, A. Ganz, G. Karmi, “Lightnets: topologies for high-speed optical networks,” J. Lightwave Technol., vol. 11, no. 5, pp. 951–961, May/June 1993.
[CrossRef]

Kuri, J.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

Leida, B.

J. Q. Hu, B. Leida, “Traffic grooming routing and wavelength assignment in optical WDM mesh networks,” in 23rd Annu. Joint Conf. of the IEEE Computer and Communications Societies, 2004, pp. 495–501.

Li, J.

Li, T.

T. Li, B. Wang, “Path protection based routing and wavelength assignment in wavelength division multiplexing optical networks under a scheduled traffic model,” J. Opt. Netw., vol. 5, pp. 575–588, 2006.
[CrossRef]

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in 2nd Int. Conf. on Broadband Networks, 2005, pp. 15–24.

B. Wang, T. Li, X. Luo, Y. Fan, “Traffic grooming under a sliding scheduled traffic model in WDM optical networks,” in IEEE Workshop on Traffic Grooming in WDM Networks, 2004.

B. Wang, T. Li, C. Xin, X. Zhang, “On survivable service provisioning in WDM networks under a scheduled traffic model,” in IEEE Global Telecommunications Conf., 2005, pp. 1900–1904.

Listanti, M.

F. Ricciato, S. Salsano, A. Belmonte, M. Listanti, “Offline configuration of a MPLS over WDM network under time-varying offered traffic,” in 21st Annu. Joint Conf. of the IEEE Computer and Communications Societies, New York, NY, 2002, pp. 57–65.

Luo, X.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in 2nd Int. Conf. on Broadband Networks, 2005, pp. 15–24.

B. Wang, T. Li, X. Luo, Y. Fan, “Traffic grooming under a sliding scheduled traffic model in WDM optical networks,” in IEEE Workshop on Traffic Grooming in WDM Networks, 2004.

Magnanti, T. L.

R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows. Prentice-Hall, 1993.

Medhi, D.

G. Agrawal, D. Medhi, “Lightpath topology configuration for wavelength-routed IP/MPLS networks with time-dependent traffic,” in IEEE Global Telecommunications Conf., San Francisco, CA, 2006, pp. 1–5.

Mukherjee, B.

K. Zang, B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag., vol. 4, no. 2, pp. 55–64, Mar. 2003.

C. Ou, K. Zhu, H. Zang, L. H. Sahasrabuddhe, B. Mukherjee, “Traffic grooming for survivable WDM networks-shared protection,” IEEE J. Sel. Areas Commun., vol. 21, pp. 1367–1383, 2003.
[CrossRef]

K. Zhu, B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122–133, Jan. 2002.
[CrossRef]

H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, pp. 47–60, Jan. 2000.

M. Tornatore, C. Ou, J. Zhang, A. Pattavina, B. Mukherjee, “Efficient shared-path protection exploiting the knowledge of connection-holding time,” in Optical Fiber Communication Conf., 2005, pp. 65–72.

Orlin, J. B.

R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows. Prentice-Hall, 1993.

Ou, C.

C. Ou, K. Zhu, H. Zang, L. H. Sahasrabuddhe, B. Mukherjee, “Traffic grooming for survivable WDM networks-shared protection,” IEEE J. Sel. Areas Commun., vol. 21, pp. 1367–1383, 2003.
[CrossRef]

M. Tornatore, C. Ou, J. Zhang, A. Pattavina, B. Mukherjee, “Efficient shared-path protection exploiting the knowledge of connection-holding time,” in Optical Fiber Communication Conf., 2005, pp. 65–72.

Pattavina, A.

M. Tornatore, C. Ou, J. Zhang, A. Pattavina, B. Mukherjee, “Efficient shared-path protection exploiting the knowledge of connection-holding time,” in Optical Fiber Communication Conf., 2005, pp. 65–72.

Pavon-Marino, P.

P. Pavon-Marino, R. Aparicio-Pardo, B. Garcia-Manrubia, N. Skorin-Kapov, “Virtual topology design and flow routing in optical networks under multi-hour traffic demand,” Photonic Network Commun., vol. 19, no. 1, pp. 41–51, 2009.

Puech, N.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

Ramamurthy, B.

S. Zhang, B. Ramamurthy, “Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 7, pp. 1165–1172, Sept. 2003.
[CrossRef]

W. Yao, B. Ramamurthy, “Survivable traffic grooming in WDM mesh networks under SRLG constraints,” in IEEE Int. Conf. on Communications, 2005, vol. 3, pp. 1751–1755.

W. Yao, B. Ramamurthy, “Survivable traffic grooming with path protection at the connection level in WDM mesh networks,” in 1st Int. Conf. on Broadband Networks, 2004, pp. 310–319.

Ramaswami, R.

R. Ramaswami, K. N. Sivarajan, Optical Networks: A Practical Perspective, 2nd Ed.Morgan Kaufmann, 1998.

Ricciato, F.

F. Ricciato, S. Salsano, A. Belmonte, M. Listanti, “Offline configuration of a MPLS over WDM network under time-varying offered traffic,” in 21st Annu. Joint Conf. of the IEEE Computer and Communications Societies, New York, NY, 2002, pp. 57–65.

Sahasrabuddhe, L. H.

C. Ou, K. Zhu, H. Zang, L. H. Sahasrabuddhe, B. Mukherjee, “Traffic grooming for survivable WDM networks-shared protection,” IEEE J. Sel. Areas Commun., vol. 21, pp. 1367–1383, 2003.
[CrossRef]

Salapaka, M. V.

M. Sridharan, M. V. Salapaka, A. Somani, “A practical approach to operating survivable WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 34–46, Jan. 2002.
[CrossRef]

Salsano, S.

F. Ricciato, S. Salsano, A. Belmonte, M. Listanti, “Offline configuration of a MPLS over WDM network under time-varying offered traffic,” in 21st Annu. Joint Conf. of the IEEE Computer and Communications Societies, New York, NY, 2002, pp. 57–65.

Sasaki, G.

W. Su, G. Sasaki, “Scheduling of periodic connections with flexibility,” in 41st Allerton Conf. on Communications, Control and Computing, 2003.

Sivarajan, K. N.

R. Ramaswami, K. N. Sivarajan, Optical Networks: A Practical Perspective, 2nd Ed.Morgan Kaufmann, 1998.

Skorin-Kapov, N.

P. Pavon-Marino, R. Aparicio-Pardo, B. Garcia-Manrubia, N. Skorin-Kapov, “Virtual topology design and flow routing in optical networks under multi-hour traffic demand,” Photonic Network Commun., vol. 19, no. 1, pp. 41–51, 2009.

N. Skorin-Kapov, “Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks,” IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 2–15, Aug. 2006.

Somani, A.

M. Sridharan, M. V. Salapaka, A. Somani, “A practical approach to operating survivable WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 34–46, Jan. 2002.
[CrossRef]

Sridharan, M.

M. Sridharan, M. V. Salapaka, A. Somani, “A practical approach to operating survivable WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 34–46, Jan. 2002.
[CrossRef]

Su, W.

W. Su, G. Sasaki, “Scheduling of periodic connections with flexibility,” in 41st Allerton Conf. on Communications, Control and Computing, 2003.

Tornatore, M.

M. Tornatore, C. Ou, J. Zhang, A. Pattavina, B. Mukherjee, “Efficient shared-path protection exploiting the knowledge of connection-holding time,” in Optical Fiber Communication Conf., 2005, pp. 65–72.

Wang, B.

T. Li, B. Wang, “Path protection based routing and wavelength assignment in wavelength division multiplexing optical networks under a scheduled traffic model,” J. Opt. Netw., vol. 5, pp. 575–588, 2006.
[CrossRef]

C. Xin, B. Wang, X. Cao, J. Li, “Logical topology design for dynamic traffic grooming in WDM optical networks,” J. Lightwave Technol., vol. 24, no. 6, pp. 2267–2275, June 2006.
[CrossRef]

B. Wang, T. Li, C. Xin, X. Zhang, “On survivable service provisioning in WDM networks under a scheduled traffic model,” in IEEE Global Telecommunications Conf., 2005, pp. 1900–1904.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in 2nd Int. Conf. on Broadband Networks, 2005, pp. 15–24.

B. Wang, T. Li, X. Luo, Y. Fan, “Traffic grooming under a sliding scheduled traffic model in WDM optical networks,” in IEEE Workshop on Traffic Grooming in WDM Networks, 2004.

Xin, C.

C. Xin, B. Wang, X. Cao, J. Li, “Logical topology design for dynamic traffic grooming in WDM optical networks,” J. Lightwave Technol., vol. 24, no. 6, pp. 2267–2275, June 2006.
[CrossRef]

B. Wang, T. Li, C. Xin, X. Zhang, “On survivable service provisioning in WDM networks under a scheduled traffic model,” in IEEE Global Telecommunications Conf., 2005, pp. 1900–1904.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in 2nd Int. Conf. on Broadband Networks, 2005, pp. 15–24.

Yao, W.

W. Yao, B. Ramamurthy, “Survivable traffic grooming with path protection at the connection level in WDM mesh networks,” in 1st Int. Conf. on Broadband Networks, 2004, pp. 310–319.

W. Yao, B. Ramamurthy, “Survivable traffic grooming in WDM mesh networks under SRLG constraints,” in IEEE Int. Conf. on Communications, 2005, vol. 3, pp. 1751–1755.

Zang, H.

C. Ou, K. Zhu, H. Zang, L. H. Sahasrabuddhe, B. Mukherjee, “Traffic grooming for survivable WDM networks-shared protection,” IEEE J. Sel. Areas Commun., vol. 21, pp. 1367–1383, 2003.
[CrossRef]

H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, pp. 47–60, Jan. 2000.

Zang, K.

K. Zang, B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag., vol. 4, no. 2, pp. 55–64, Mar. 2003.

Zhang, J.

M. Tornatore, C. Ou, J. Zhang, A. Pattavina, B. Mukherjee, “Efficient shared-path protection exploiting the knowledge of connection-holding time,” in Optical Fiber Communication Conf., 2005, pp. 65–72.

Zhang, S.

S. Zhang, B. Ramamurthy, “Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 7, pp. 1165–1172, Sept. 2003.
[CrossRef]

Zhang, X.

B. Wang, T. Li, C. Xin, X. Zhang, “On survivable service provisioning in WDM networks under a scheduled traffic model,” in IEEE Global Telecommunications Conf., 2005, pp. 1900–1904.

Zhu, K.

C. Ou, K. Zhu, H. Zang, L. H. Sahasrabuddhe, B. Mukherjee, “Traffic grooming for survivable WDM networks-shared protection,” IEEE J. Sel. Areas Commun., vol. 21, pp. 1367–1383, 2003.
[CrossRef]

K. Zhu, B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122–133, Jan. 2002.
[CrossRef]

Comput. Commun.

A. Jaekel, Y. Chen, “Quality of service based resource allocation for scheduled lightpath demands,” Comput. Commun., vol. 30, no. 18, pp. 3550–3558, Dec. 2007.
[CrossRef]

IEEE J. Sel. Areas Commun.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

N. Skorin-Kapov, “Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks,” IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 2–15, Aug. 2006.

K. Zhu, B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122–133, Jan. 2002.
[CrossRef]

S. Zhang, B. Ramamurthy, “Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 7, pp. 1165–1172, Sept. 2003.
[CrossRef]

C. Ou, K. Zhu, H. Zang, L. H. Sahasrabuddhe, B. Mukherjee, “Traffic grooming for survivable WDM networks-shared protection,” IEEE J. Sel. Areas Commun., vol. 21, pp. 1367–1383, 2003.
[CrossRef]

M. Sridharan, M. V. Salapaka, A. Somani, “A practical approach to operating survivable WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 34–46, Jan. 2002.
[CrossRef]

J. Lightwave Technol.

C. Xin, B. Wang, X. Cao, J. Li, “Logical topology design for dynamic traffic grooming in WDM optical networks,” J. Lightwave Technol., vol. 24, no. 6, pp. 2267–2275, June 2006.
[CrossRef]

I. Chlamtac, A. Ganz, G. Karmi, “Lightnets: topologies for high-speed optical networks,” J. Lightwave Technol., vol. 11, no. 5, pp. 951–961, May/June 1993.
[CrossRef]

J. Opt. Netw.

Opt. Networks Mag.

K. Zang, B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag., vol. 4, no. 2, pp. 55–64, Mar. 2003.

H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, pp. 47–60, Jan. 2000.

Opt. Switching Networking

A. Jaekel, Y. Chen, “Resource provisioning for survivable WDM networks under a sliding scheduled traffic model,” Opt. Switching Networking, vol. 6, no. 1, pp. 44–54, Jan. 2009.
[CrossRef]

Photonic Network Commun.

P. Pavon-Marino, R. Aparicio-Pardo, B. Garcia-Manrubia, N. Skorin-Kapov, “Virtual topology design and flow routing in optical networks under multi-hour traffic demand,” Photonic Network Commun., vol. 19, no. 1, pp. 41–51, 2009.

A. Jaekel, A. Bari, Y. Chen, S. Bandyopadhyay, “Strategies for optimal logical topology design and traffic grooming,” Photonic Network Commun., vol. 19, no. 2, pp. 223–232, Apr. 2010.
[CrossRef]

Other

R. Ramaswami, K. N. Sivarajan, Optical Networks: A Practical Perspective, 2nd Ed.Morgan Kaufmann, 1998.

J. Q. Hu, B. Leida, “Traffic grooming routing and wavelength assignment in optical WDM mesh networks,” in 23rd Annu. Joint Conf. of the IEEE Computer and Communications Societies, 2004, pp. 495–501.

B. Wang, T. Li, C. Xin, X. Zhang, “On survivable service provisioning in WDM networks under a scheduled traffic model,” in IEEE Global Telecommunications Conf., 2005, pp. 1900–1904.

F. Ricciato, S. Salsano, A. Belmonte, M. Listanti, “Offline configuration of a MPLS over WDM network under time-varying offered traffic,” in 21st Annu. Joint Conf. of the IEEE Computer and Communications Societies, New York, NY, 2002, pp. 57–65.

W. Yao, B. Ramamurthy, “Survivable traffic grooming in WDM mesh networks under SRLG constraints,” in IEEE Int. Conf. on Communications, 2005, vol. 3, pp. 1751–1755.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in 2nd Int. Conf. on Broadband Networks, 2005, pp. 15–24.

W. Su, G. Sasaki, “Scheduling of periodic connections with flexibility,” in 41st Allerton Conf. on Communications, Control and Computing, 2003.

W. Yao, B. Ramamurthy, “Survivable traffic grooming with path protection at the connection level in WDM mesh networks,” in 1st Int. Conf. on Broadband Networks, 2004, pp. 310–319.

A. Jaekel, Y. Chen, A. Bari, “Survivable traffic grooming for scheduled demands,” in 5th Int. Conf. on Broadband Communications, Networks and Systems, 2008, pp. 176–183.

R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows. Prentice-Hall, 1993.

B. Wang, T. Li, X. Luo, Y. Fan, “Traffic grooming under a sliding scheduled traffic model in WDM optical networks,” in IEEE Workshop on Traffic Grooming in WDM Networks, 2004.

G. Agrawal, D. Medhi, “Lightpath topology configuration for wavelength-routed IP/MPLS networks with time-dependent traffic,” in IEEE Global Telecommunications Conf., San Francisco, CA, 2006, pp. 1–5.

M. Tornatore, C. Ou, J. Zhang, A. Pattavina, B. Mukherjee, “Efficient shared-path protection exploiting the knowledge of connection-holding time,” in Optical Fiber Communication Conf., 2005, pp. 65–72.

ILOG CPLEX 9.1. Documentation available at http://www.columbia.edu/dano/resources/cplex91man/index.html.

Cited By

OSA participates in CrossRef's Cited-By Linking service. Citing articles from OSA journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (9)

Fig. 1
Fig. 1

Scheduling of partially overlapping demands.

Fig. 2
Fig. 2

Resource requirements versus network size with | K | = 16 in fault-free networks without wavelength conversion.

Fig. 3
Fig. 3

Resource requirements versus network size with | K | = 32 in fault-free networks without wavelength conversion.

Fig. 4
Fig. 4

Percentage improvement in resource requirements compared with the HTU case using ILP1 with | K | = 32 .

Fig. 5
Fig. 5

Resource requirements versus network size with | K | = 16 in fault-free networks with wavelength conversion.

Fig. 6
Fig. 6

Percentage improvement in resource requirements compared with HTU case in fault-free networks with wavelength conversion.

Fig. 7
Fig. 7

Comparison of resource requirements in wavelength-continuous and wavelength-convertible networks under the low-demand-overlap model.

Fig. 8
Fig. 8

Relative improvement with alternative objective functions.

Fig. 9
Fig. 9

Resource requirements versus network size with | K | = 16 in survivable wavelength-continuous networks under the LDO model.

Tables (1)

Tables Icon

Table 1 Number of Demands and Number of Lightpaths Established for Each Network Size

Equations (32)

Equations on this page are rendered with MathJax. Learn more.

Minimize p P q Q f p q n q
p : from ( p ) = i f p q p : to ( p ) = i f p q = { 1 , if i = s q , 1 , if i = d q , 0 , otherwise } ,
q Q , i N ,
q Q f p q n q l j , q g b p , j L , p P .
p : from ( p ) = i b p T X i , i N ,
p : to ( p ) = i b p R X i , i N .
r x r , p = b p , p P ,
s p , e = r x r , p f e s p d p , r , p P , e E ,
k K w k , p = b p , p P ,
w k , p + s p , e α k , p e 1 , k K , e E , p P ,
w k , p α k , p e , k K , e E , p P ,
s p , e α k p e , k K , e E , p P ,
p P α k , p e 1 , k K , e E .
Minimize p P q Q f p q n q
r y r , p = b p , p P ,
t p , e = r y r , p f e s p d p , r , p P , e E ,
k K z k , p = b p , p P ,
z k , p + t p , e β k , p e 1 , k K , e E , p P ,
z k , p β k , p e , k K , e E , p P ,
t p , e β k p e , k K , e E , p P ,
x r , p + y r , p 1 , p P , r = 0 , 1 , 2 , , R 1 ,
β k e β k , p e , k K , e E , p P ,
β k e p P β k , p e , k K , e E ,
p P α k , p e + β k e 1 , k K , e E .
p P β k , p e 1 , k K , e E .
β k , p 1 e 1 + β k , p 2 e 1 + s p 1 , e 2 + s p 2 , e 2 3 ,
k K , e 1 e 2 E , p 1 < p 2 P .
k K α k , p e = s p , e , p P , e E ,
k K β k , p e = t p , e , p P , e E .
Maximize q Q n q m q .
p : from ( p ) = i f p q p : to ( p ) = i f p q = { m q , if i = s q m q , if i = d q 0 , otherwise } .
δ = i l max j = 1 n 1 k = j + 1 n T j , k i 0.5 l max n ( n 1 ) .