A New Algorithm for Designing WDM Mesh Networks

그물구조 WDM 망 설계 알고리즘과 망 설계 시스템 연구

  • Published : 2005.03.01

Abstract

In this paper, we deal with a mesh network design problem arising from the deployment of WDM for the optical internet. The mesh network consists of mesh topology for satisfying traffic demand while minimizing the cost of WDM, OXC, and fiber cables. The problem seeks to find an optimal routing of traffic demands in the network such that the total cost is minimized. We formulate the problem as a mixed-integer programming model and devise a tabu search heuristic procedure. Also we develop an optical internet design system that implements the proposed tabu search heuristic procedure. We demonstrate the computational efficacy of the proposed algorithm, compared with CPLEX 8.0.

Keywords

References

  1. 박구현, 우재현, 'WDM 광전달망에서 최소 파장 수를 갖는 경로설계 및 파장할당' 한국통신학회논문지, Vol.23, No.8(1998), pp.1883-1982
  2. 이창형, 이형일, 서승우, '매쉬 기반의 생존성 파장 분할 다중화망의 설계 기법', 한국통신학회논문지, Vol.26, No.2A(2001), pp.171-178
  3. 정노선, 안기석, 홍상기, 홍종일, 강철신, 'Mesh 구조의 WDM 기간망 구조 설계', 한국통신학회지, Vol.25, No.5(2000), pp.889-898
  4. 한국인터넷정보센터, 2003년 상반기 정보화 실태 조사, 2003. 7
  5. J. Anderson, B.T. Doshi, S. Dravida and P. Harshavardhana, 'Fast Restoration of ATM Networks,' IEEE Journal on Selected Areas in Communications, Vol.12(1994), pp.128-138 https://doi.org/10.1109/49.265712
  6. CPLEX 8.0 ILOG, 2003
  7. Grover, W.D. and J. Doucette, 'Topological Design of Survivable Mesh-based Transport Networks,' Annals of Operations Research, Vol.106(2001), pp.79-125 https://doi.org/10.1023/A:1014557624540
  8. Grover, W.D., T.D. Bilodeau and B.D. Venables, Near Optimal Spare Capacity Planning in a Mesh Restorable Network, In Proceedings of Globecom'91, Dec. 1991, pp.2007-2012
  9. Grover, W.D., R.R. Irashko and Y. Zheng, 'Comparative Methods and Issues in Design of Mesh-Restorable STM and ATM Networks,' Chapter 10, Telecommunication Network Planning, Kluwer Academic Publishers, 1999, pp.169-200
  10. Pin-Han Ho, H.T. Mouftah, 'Allocation of Protection Domains in Dynamic WDM Mesh Networks,' ICNP'02 Paris France, 2002, pp.188-189
  11. Pin-Han Ho and H.T. Mouftah, 'Issues on Diverse Routing for WDM Mesh Networks with Survivability,' ICCCN '01, 2001, pp. 61-66
  12. Kawamura, R, Architectures for ATM Network survivability, IEEE Communications Surveys, 1998
  13. Ramamurthy, S. and B. Mukherjee, 'Survivable WDM mesh networks,' in Proceeding of IEEE INFOCOMM '99, March 1999, pp.744-751
  14. Suurballe, J,W. and R.E. Tarjan, 'A quick method for finding shortest pairs of disjoint paths,' Networks, Vol.14(1984), pp.325-336 https://doi.org/10.1002/net.3230140209
  15. HUI ZANG, WDM Mesh Networks Management and Survivability, Kluwer Academic Publishers, Boston, 2003