Abstract

Many conventional WDM network planning and/or designing schemes assume that future traffic demand is known beforehand. However, it is difficult to predict future traffic demand accurately. We develop a scheme to design a WDM network that accommodates as much traffic as possible against a variety of traffic patterns, that is, a WDM network robust against traffic uncertainties. Our basic idea is to select a node pair that is expected to be a bottleneck in the future and then to deploy network equipment so that the volume of traffic accommodated by the node pair increases. Our simulation results show that the WDM network designed with our method can accommodate more traffic demand than those designed with the existing methods at the same cost.

© 2004 Optical Society of America

PDF Article

References

  • View by:
  • |

  1. N. Nagatsu, S. Okamoto, and K. Sato, "Optical path cross-connect system scale evaluation using path accommodation design for restricted wavelength multiplexing," IEEE J. Sel. Areas Commun. 14, 893-902 (1966).
  2. Y. Miyao and H. Saito, "Optimal design and evaluation of survivable WDM transport networks," IEEE J. Sel. Areas Commun. 16, 1190-1198 (1998).
  3. B. V. Caenegem, W. V. Parys, F. D. Turck, and P. M. Demeester, "Dimensioning of survivable WDM networks," IEEE J. Sel. Areas Commun. 16, 1146-1157 (1998).
  4. K. G. Coffman and A. M. Odlyzko, "Internet growth: Is there a 'Moore's Law' for data traffic?" available at <a href="http://www.research.att.com/areas/transport_evolution/internet.moore.pdf">http://www.research.att.com/areas/transport_evolution/internet.moore.pdf</a>.
  5. A. A. Kuehn and M. J. Hamburger, "A heuristic program for locating warehouses," Management Sci. 9, 643-666 (1963).
  6. M. Kodialam and T. V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in Proceedings of IEEE INFOCOM 2000 (IEEE, 2000), pp. 884-893.
  7. M. Kodialam and T. V. Lakshman, "Integrated dynamic IP and wavelength routing in IP over WDM networks," in Proceedings of IEEE INFOCOM 2001 (IEEE, 2001), pp. 358-366.
  8. X. Cao, V. Anand, Y. Xiong, and C. Qiao, "Performance evaluation of wavelength band switching in multi-fiber all-optical networks," in Proceedings of IEEE INFOCOM 2003 (IEEE, 2003), pp. 2251-2261.
  9. H. Harai, M. Murata, and H. Miyahara, "Performance analysis of wavelength assignment policies in all-optical networks with limited-range wavelength conversion," IEEE J. Sel. Areas Commun. 16, 1051-1060 (1998).
  10. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, 1993).
  11. A. Dacomo, S. D. Patre, G. Maier, A. Pattavina, and M. Martinelli, "Design of static resilient WDM mesh networks with multiple heuristic criteria," in Proceedings of IEEE INFOCOM 2002 (IEEE, 2002), pp. 1793-1802.

IEEE INFOCOM 2000

M. Kodialam and T. V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in Proceedings of IEEE INFOCOM 2000 (IEEE, 2000), pp. 884-893.

IEEE INFOCOM 2001

M. Kodialam and T. V. Lakshman, "Integrated dynamic IP and wavelength routing in IP over WDM networks," in Proceedings of IEEE INFOCOM 2001 (IEEE, 2001), pp. 358-366.

IEEE INFOCOM 2002

A. Dacomo, S. D. Patre, G. Maier, A. Pattavina, and M. Martinelli, "Design of static resilient WDM mesh networks with multiple heuristic criteria," in Proceedings of IEEE INFOCOM 2002 (IEEE, 2002), pp. 1793-1802.

IEEE INFOCOM 2003

X. Cao, V. Anand, Y. Xiong, and C. Qiao, "Performance evaluation of wavelength band switching in multi-fiber all-optical networks," in Proceedings of IEEE INFOCOM 2003 (IEEE, 2003), pp. 2251-2261.

IEEE J. Sel. Areas Commun.

H. Harai, M. Murata, and H. Miyahara, "Performance analysis of wavelength assignment policies in all-optical networks with limited-range wavelength conversion," IEEE J. Sel. Areas Commun. 16, 1051-1060 (1998).

N. Nagatsu, S. Okamoto, and K. Sato, "Optical path cross-connect system scale evaluation using path accommodation design for restricted wavelength multiplexing," IEEE J. Sel. Areas Commun. 14, 893-902 (1966).

Y. Miyao and H. Saito, "Optimal design and evaluation of survivable WDM transport networks," IEEE J. Sel. Areas Commun. 16, 1190-1198 (1998).

B. V. Caenegem, W. V. Parys, F. D. Turck, and P. M. Demeester, "Dimensioning of survivable WDM networks," IEEE J. Sel. Areas Commun. 16, 1146-1157 (1998).

Management Sci.

A. A. Kuehn and M. J. Hamburger, "A heuristic program for locating warehouses," Management Sci. 9, 643-666 (1963).

Other

K. G. Coffman and A. M. Odlyzko, "Internet growth: Is there a 'Moore's Law' for data traffic?" available at <a href="http://www.research.att.com/areas/transport_evolution/internet.moore.pdf">http://www.research.att.com/areas/transport_evolution/internet.moore.pdf</a>.

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, 1993).

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.