Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Generating Mechanisms of Initial and Candidate Solutions in Simulated Annealing for Packet Communication Network Design Problems

패킷 통신 네트워크 설계를 위한 시뮬레이티드 애닐링 방법에서 초기해와 후보해 생성방법

  • 임동순 (한남대학교 산업시스템공학) ;
  • 우훈식 (대전대학교 인터넷정보공학)
  • Published : 2004.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

The design of a communication network has long been a challenging optimization problem. Since the optimal design of a network topology is a well known as a NP-complete problem, many researches have been conducted to obtain near optimal solutions in polynomial time instead of exact optimal solutions. All of these researches suggested diverse heuristic algorithms that can be applied to network design problems. Among these algorithms, a simulated annealing algorithm has been proved to guarantee a good solution for many NP-complete problems. in applying the simulated annealing algorithms to network design problems, generating mechanisms for initial solutions and candidate solutions play an important role in terms of goodness of a solution and efficiency. This study aims at analyzing these mechanisms through experiments, and then suggesting reliable mechanisms.

Keywords

References

  1. Clementi, A and Di Ianni, M. 'On the Hardness of Approximating Optimum Schedule Problems in Store and Forward Networks,' IEEE/ACM Transactions on Networking, Vol.4, No.2(1996), pp.272-280 https://doi.org/10.1109/90.491013
  2. Elbaum, R. and Sidi, M., 'Topological Design of Local Area Networks using Genetic Algorithms, in Proceedings of Infocom 95, IEEE Press : Los Alamitos, CA, (1995), pp.64-71
  3. Esfahanian, A.H. and Hakimi, S.L., On Computing the Connectivities of Graph and Digraph, Networks, 1984, pp.355-366
  4. Gavish, B. 'Topological Design of Computer Communication Networks. The Overall Design Problem,' European Journal of Operational Research, 58(1992), pp.149-172
  5. Gerla, M., Frank, H., Chou, W. and Eckl, J. 'A Cut Saturation Algorithm for Topological Design of Packet Switched Communication Networks,' in Proceedings of the IEEE National Telecommunications Conference, (1974), pp.1074-1085
  6. Grover, G., Kershenbaum, A. and Kermani, P., 'MENTOR: An Algorithm for Mesh Network Topological Optimization and Routing,' IEEE Transactions on Communication, 39(1991), pp.503-513
  7. Kershenbaum, A. Telecommunications Network Design Algorithms, McGraw-Hill, New York, 1993
  8. King-Tim, K, Kit-Sang, T., Cheung-Yan, C., Kim-Fung, M. and Kwong, S., 'Using Genetic Algorithms to Design Mesh Networks,' IEEE Computer, Vol.30, No.8(1997), pp.56-61 https://doi.org/10.1109/2.607086
  9. Kirkpatrick, S., C.D. Gelatt Jr., and M.P. Vecchi, 'Optimization by simulated annealing,' Science, Vol.220(1980), pp.671-680 https://doi.org/10.1126/science.220.4598.671
  10. Kleinrock, L., Communication Nets: Stochastic Message Flow and Delay, McGraw-Hill : New York, 1964
  11. Maruyama, K, 'Designing Reliable Packet Switched Communication Networks,' Proceedings of the IEEE ICCC, (1978), PP.493-498
  12. Pierre S, Hyppolite, M, Bouriolly, J. and Dioume, O., 'Topological Design of Computer Communication Networks Using Simulated Annealing,' Engineering Applications in Artificial Intelligence, Vol.8, No.1(1995), pp.61-69 https://doi.org/10.1016/0952-1976(94)00041-K
  13. Pierre, S. and Legault, G., 'An Evolutionary Approach for Configuring Economical Packet Switched Computer Networks,' Artificial Intelligence in Engineering, 10(1996), pp. 127-134
  14. Prim, R.C., Shortest Connection Networks and Some Generalization, Bell System Tech. J., 36(1957), pp.1389-1401
  15. Steiglitz, K, Weiner, P. and Kleitman, D.J., 'The Design of Minimum Cost Survivable Networks,' IEEE Transactions on Circuit Theory, Vol.16, No.4(1969), pp.455-460 https://doi.org/10.1109/TCT.1969.1083004