한국정보통신학회논문지 (Journal of the Korea Institute of Information and Communication Engineering)

  • 제19권9호
  • /
  • Pages.2037-2043
  • /
  • 2015
  • /
  • 2234-4772(pISSN)
  • /
  • 2288-4165(eISSN)
한국정보통신학회 (The Korea Institute of Information and Commucation Engineering)
권호 표지
DOI QR코드

DOI QR Code

유전 알고리즘을 이용한 이동 에이전트 기반의 경로 탐색 기법

Mobile Agent Based Route Search Method Using Genetic Algorithm

  • Ji, Hong-il (Department of Automotive Software, Youngdong University)
  • 투고 : 2015.04.15
  • 심사 : 2015.09.07
  • 발행 : 2015.08.20
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 제안한 알고리즘은 이전 유전 알고리즘의 분산처리를 위해 라우터 그룹 단위인 셀을 도입하였다. 셀 단위로 유전 알고리즘을 시행하여 전체 네트워크의 탐색 지연시간을 줄이는 방법을 제시하였다. 또한, 실험을 통하여 기존 최적경로 알고리즘인 Dijkstra 알고리즘에서 네트워크가 손상되었을 경우 제안한 알고리즘에는 대체 경로 설정의 연산시간이 단축되었으며 손상된 네트워크의 셀 안에서 2순위의 경로를 가지고 있으므로 Dijkstra 알고리즘보다 신속하게 대체경로를 설정하도록 설계되었다. 이는 제안한 알고리즘이 네트워크상에서 Dijkstra 알고리즘이 손상되었을 경우 대체 경로설정을 보완할 수 있음을 확인하였다.

Proposed algorithm in this thesis introduced cells, units of router group, to conduct distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. Also, through this experiment, in case of a network was damaged in existing optimal path algorithm, Dijkstra algorithm, the proposed algorithm was designed to route an alternative path and also as it has a 2nd shortest path in cells of the damaged network so it is faster than Dijkstra algorithm, The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

키워드

참고문헌

  1. G. Cabri, L. Leonardi, F. Zambonelli, "Mobile-Agent Coordination Models for Internet Applications", IEEE Computer, Vol. 33, No. 2, Feb. 2000. https://doi.org/10.1109/2.820044
  2. V. A. Pham and A. Karmouch, "Mobile Software Agents: An Overview", IEEE Communications Magazine, Jul. 1998.
  3. Filipe Araújo, Bernardete Ribeiro, Luís Rodrigues, "A neural network for shortest path computation", Neural Networks, IEEE Transactions on, Volume 12, Issue 5, pp1067 - 1073, Sep. 2001. https://doi.org/10.1109/72.950136
  4. W. Stalling, “HIGH-SPEED NETWORKS TCP/IP AND ATM DESIGN PRINCIPLES”, Prentice Hall, 2000.
  5. J. Baumann, F. Hohl, K. Rothermel, M. Strasser, W. Theilmann, "MOLE: A mobile agent system", Software: Practice and Experience, Volume 36, Issue 15, Dec. 2006.
  6. B. Liu, S. Choo, S. Lok, S. Leong, S. Lee, F. Poon, H. Tan, "Integrating case-based reasoning, knowledge-based approach and Dijkstra algorithm for route finding", Artificial Intelligence for Applications, 1994, Proceedings of the Tenth Conference, pp. 149 - 155, 1994.
  7. C. Xi, F. Qi, L. Wei, "A New Shortest Path Algorithm based on Heuristic Strategy", Proceedings of the 6th World Congress on Intelligent Control and Automation, 2006.
  8. M. Munemoto, Y. Takai, and Y. Sato, “A migration scheme for the genetic adaptive routing algorithm,” in Proc. IEEE Int. Conf. Systems, Man, and Cybernetics, pp. 2774–2779, 1998.
  9. J. Inagaki, M. Haseyama, and H. Kitajima, “A genetic algorithm for determining multiple routes and its applications,” in Proc. IEEE Int. Symp. Circuits and Systems, pp. 137–140, 1999.