본문 바로가기
KERD
논문KCI 등재

비용 제약을 갖는 컴퓨터 네트워크의 최적화

Optimization of Computer Network with a Cost Constraint

0

조회

0

다운로드

2

인용

0

참고문헌

주제분류산업공학

초록

Abstract

This paper considers a topological optimization of a computer network design with a cost constraint. The objective is to find the topological layout of links, at maximal reliability, under the constraint that the network cost is less or equal than a given level of budget. This problem is known to be NP-hard. To efficiently solve the problem, a genetic approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with a simulated annealing method.

참고문헌 (9)

  1. Arts, "Local Search in Combinatorial Optimization" (1997), John Wiley and Sons
  2. Cancela, "A Recursive Variance- Reduction Algorithm for Estimating Communication- Network Reliability", 44(4), pp.595~602 (1995)
  3. Costamagna, "A Simulated Annealing Algorithm for the Optimization of Communication Networks in : Proceedings of International Symposium On Signals Systems and Electronics", pp.405~408 (1995)
  4. Deeter, "Economic Design of Reliable Networks", 30, pp.1161~1174 (1998)
  5. Dengiz, "Efficient Optimization of All-Terminal Reliable Networks Using an Evolutionary Approach", 46(1), pp.11~17 (1997)
  6. Jan, "; “Topological Optimization of a Communication Network Subject to a Reliability Constraint ” IEEE Transactions of Reliability", pp.63~70 (1993)
  7. Kirkpatrick, "; “Optimization by Simulated Annealing", pp.671~680 (1983)
  8. Tate, "A Genetic Approach to the Quadratic Assignment Problem", 22(1), pp.73~83 (1995)
  9. Wood, "; “Factoring Algorithms for Computing K-Terminal Network Reliability ” IEEE Transactions On Reliability", pp.269~278 (1986)

관련 논문AI추천

이 간행물의 다른 논문 (14건)