Advertisement

Photonic Network Communications

, Volume 18, Issue 1, pp 1–13 | Cite as

Solving virtual topology reconfiguration problem on survivable WDM networks by using simulated annealing and genetic algorithms

  • Der-Rong Din
Article

Abstract

In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology (VT) designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration (VTR). Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and reconfiguration is an important issue in WDM networks. In this paper, the Virtual Topology Reconfiguration Problem (VTRP) in survivable WDM networks with a reconfiguration constraint is studied. Given the physical topology, dedicated path-protection VT, and a new traffic demand matrix, the goal of VTRP is to reconfigure the current VT under the pre-specified reconfiguration constraint so that the objective value can be minimized. The object cost of VTRP is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical, in this paper, a simulated annealing (SA) algorithm and a genetic algorithm (GA) are proposed to solve this problem. Experimental results of these algorithms are also given.

Keywords

WDM Survivability Reconfiguration Simulated annealing algorithm Genetic algorithm Dedicated path-protection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wei J.Y. (2002) Advances in the management and control of optical Internet. IEEE J. Sel. Area. Comm. 20(4): 768–785CrossRefGoogle Scholar
  2. 2.
    Liu K.H. (2002) IP Over WDM. John Wiley & Sons Ltd., New York, N.Y.CrossRefGoogle Scholar
  3. 3.
    Hu, W.W., Hu, R.Q. Qian, Y.: Wavelength retuning in a WDM mesh network with survivable traffic grooming. In: Proceedings of IEEE Int. Conf. of Performance, Computing, and Communications Conference (IPCCC 2006), Phoenix, Arizona, pp. 529–536, April 2006Google Scholar
  4. 4.
    Mukherjee B., Banerjee D., Ramamurthy R. (1996) Some principles for designing a wide-area optical network. IEEE/ACM Trans. Netw. 4(5): 684–696CrossRefGoogle Scholar
  5. 5.
    Rouskas G.N., Ammar M.H. (1995) Dynamic reconfiguration in multihop WDM networks. J. High Speed Netw. 4(3): 221–238Google Scholar
  6. 6.
    Ramaswami R., Sivarjan K.N. (1996) Design of logical topologies for wavelength-routed optical networks. IEEE J. Sel. Area. Comm. 14(5): 840–851CrossRefGoogle Scholar
  7. 7.
    Banerjee D., Mukherjee B. (2000) Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study. IEEE/ACM Trans. Netw. 8(5): 598–607CrossRefGoogle Scholar
  8. 8.
    Kato, M., Oie, Y.: Reconfiguration procedures for torus lightwave networks. In: Proceedings of IEEE Int. Conf. Communications (ICC 98), Atlanta, GA, USA, pp. 531–536, June 1998Google Scholar
  9. 9.
    Modiano, E., Narula-Tam, A.: Survivable routing of logical topologies in WDM networks. In: Proceedings of IEEE Computer and Communications Societies Twentieth Annual Joint Conference, (INFOCOM 2001), Anchorage, AK, USA, pp. 348–357, April 2001Google Scholar
  10. 10.
    Brzezinski A., Modiano E. (2005) Dynamic reconfiguration and routing algorithms for IP-Over-WDM networks with stochastic traffic. IEEE/OSA J. Lightware Technol. 23(10): 3188–3205CrossRefGoogle Scholar
  11. 11.
    Akgun I., Buzlucaa F. (2006) Virtual topology reconfiguration on optical WDM networks considering traffic grooming. Opt. Switch. Netw. 3(1): 11–23CrossRefGoogle Scholar
  12. 12.
    Takagi, H., Zhang, Y., Jia, X., Takagi, H.: Reconfiguration heuristics for logical topologies in wide-area WDM networks. In: Proceedings of IEEE Global Telecommunications (GLOBECOM 02), Taipei, Taiwan, pp. 2701–2705, Nov. 2002Google Scholar
  13. 13.
    Zhang Y., Murata M., Takagi H., Ji Y. (2005) Traffic-based reconfiguration for logical topologies in large-scale WDM optical networks. IEEE/OSA J. Lightware Technol. 23(10): 2854–2867CrossRefGoogle Scholar
  14. 14.
    Sreenath, N., Palanisamy, B.: Distributed reconfiguration for traffic changes in IP-Over-WDM networks. In: Proceedings of 9th International Conference on Information Technology (ICIT’06) Bhuvaneshwar, pp. 96–97, Dec. 2006Google Scholar
  15. 15.
    Narula-Tam, A., Modiano, E.: Dynamic load balancing for WDM based packet networks. In: Proceedings of IEEE Computer and Communications Societies Nineteenth Annual Joint Conference, (INFOCOM 2000), Tel Aviv, Israel, pp. 1010–1019, March 2000Google Scholar
  16. 16.
    Labourdette J.-F.P., Hart F.W., Acampora A.S. (1994) Branch-exchange sequences for reconfiguration of lightwave networks. IEEE Trans. Commun. 42(10): 2822–2832CrossRefGoogle Scholar
  17. 17.
    Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks-part I: protection. In: Proceedings of Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM ’99), New York, NY, USA, pp. 744–751, March 1999Google Scholar
  18. 18.
    Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks-part II: restoration. In: Proceedings of IEEE Int. Conf. Communications (ICC 99), Vancouver, BC, Canada, pp. 2023–2030, June 1999Google Scholar
  19. 19.
    Iraschko R., Grover W. (2000) A highly efficient path-restoration protocol for management of optical network transport integrity. IEEE J. Sel. Area. Comm. 18(5): 779–794CrossRefGoogle Scholar
  20. 20.
    Mohan G., Murthy C.S.R., Somani A.K. (2001) Efficient algorithms for routing dependable connections in WDM optical networks. IEEE/ACM Trans. Netw. 9(10): 553–566CrossRefGoogle Scholar
  21. 21.
    Sengupta, S., Ramamurthy, R.: Capacity efficient distributed routing of mesh-restored lightpaths in optical networks. In: Proceedings of Global Telecommunications Conference (GLOBECOM’01), San Antonio, TX, USA, pp. 2129–2133, Nov. 2001Google Scholar
  22. 22.
    Luo, H., Ruan, L.: Load balancing heuristics for dynamic establishment of restorable lightpaths. In: Proceedings of Eleventh International Conference on Computer Communications and Networks (ICCCN 2002), Miami, USA, pp. 472–477, Oct. 2002Google Scholar
  23. 23.
    Baroni S., Bayvel P., Gibbens R.J., Korotky S.K. (1999) Analysis and design of resilient multifiber wavelength-routed optical transport networks. IEEE/OSA J. Lightwave Technol. 17(5): 743–758CrossRefGoogle Scholar
  24. 24.
    Sridharan M., Salapaka M.V., Somani A.K. (2002) A practical approach to operating survivable WDM networks. IEEE J. Sel. Area. Comm. 20(1): 34–46CrossRefGoogle Scholar
  25. 25.
    Ramamurthy, B., Ramakrishan, A.: Virtual topology reconfiguration of wavelength routed optical WDM networks. In: Proceedings of IEEE Global Telecommunications Conference (GLOBECOM’00), San Francisco, CA, USA, pp. 1269–1275, Nov. 2000Google Scholar
  26. 26.
    Banerjee D., Mukherjee B. (2000) Wavelength-routed optical networks: linear formulation, resource budget tradeoffs and a reconfiguration study. IEEE/ACM Trans. Netw. 8(5): 598–607CrossRefGoogle Scholar
  27. 27.
    Takagi, H., Zhang, Y., Jia, X., Takagi, H.: Virtual topology reconfiguration for wide-area WDM networks. In: Proceedings of IEEE International Conference on Communications, Circuits and Systems and West Sino Expositions, pp. 835–839, June 2002Google Scholar
  28. 28.
    Xin, Y., Shayman, M., La Richard, J., Marcus, S.I.: Reconfiguration of survivable MPLS/WDM networks. In: Proceedings of Global Telecommunications Conference (GLOBECOM’06), San Francisco, CA, USA. pp. 1–5, Nov. 2006Google Scholar
  29. 29.
    Lee, H., Choi, H., Choi, H.-A.: Reconfiguration of survivable logical topologies in WDM ring networks. In: Proceedings of Proc. 36th Conference of Information Science and Systems (CISS), Princeton University, March 2002Google Scholar
  30. 30.
    Suurballe J.W., Tarjan R.E. (1984) A quick method for finding shortest pairs of disjoint paths. Networks 14: 325–336zbMATHCrossRefMathSciNetGoogle Scholar
  31. 31.
    Bhandari, R.: Optimal physical diversity algorithm and survivable networks. In: Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC ’97), Alexandria, Egypt, pp. 433–441, July 1997Google Scholar
  32. 32.
    Macgregor M.H., Grover W.D. (1994) Optimized k-shortest-paths algorithm for facility restoration. Software Pract. Exp. 24(9): 823–834CrossRefGoogle Scholar
  33. 33.
    Chen, C., Banerjee, S.: A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks. In: Proceedings of Fifteenth Annual Joint Conference of the Networking the Next Generation (INFOCOM’96), San Francisco, CA, USA, pp. 164–171, March 1996Google Scholar
  34. 34.
    Ding, A., Poo, G.-S., Tan, S.-T.: An expanded graph model for MCRWA problem in WDM networks. In: Proceedings of IEEE Conf. on Local Computer Networks (LCN’02), Tampa, Florida, USA, pp. 557–564, November 2002Google Scholar
  35. 35.
    Kirkpatrick S., Gelatt C.D., Vecchi M.P. (1983) Optimization by simulated annealing. Science 220: 671–680CrossRefMathSciNetGoogle Scholar
  36. 36.
    Holland J. (1975) Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, Ann ArborGoogle Scholar
  37. 37.
    Arts E., Korst J. (1989) Simulated Annealing and Boltzman Machines. John Wiley & Sons, New York, N.Y.Google Scholar
  38. 38.
    Laarhoven V., Arts E. (1987) Simulated Annealing: Theory and Application. D. Reidel Publishing Company, HolandGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringNational Changhua University of EducationChanghuaTaiwan, R.O.C

Personalised recommendations