대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제35권1호
  • /
  • Pages.87-91
  • /
  • 2009
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

링 네트워크에서의 서버 단절문제에 대한 해법

The Server Disconnection Problem on a Ring Network

  • 명영수 (단국대학교 천안캠퍼스 경영학부)
  • 투고 : 2008.08.20
  • 심사 : 2009.01.10
  • 발행 : 2009.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In the server disconnection problem, a network with m servers and their users is given and an attacker is to destroy a set of edges to maximize his net gain defined as the total disconnected utilities of the users minus the total edge-destruction cost. The problem is known to be NP-hard. In this paper, we study the server disconnection problem restricted to a ring network. We present an efficient combinatorial algorithm that generates an optimal solution in polynomial time.

키워드

참고문헌

  1. Cosares, S., Deutch, N. D., Saniee, I., and Wasem, O. J. (1995), SONET toolkit : A decision support system for designing robust and cost-effective fiber-optic networks, Interfaces, 25, 20-40 https://doi.org/10.1287/inte.25.1.20
  2. Costa, M. -C., Letocart, L., Roupin, F. (2003), A greedy algorithm for multicut and integral multiflow in rooted trees, Operations Research Letters, 31, 21-27 https://doi.org/10.1016/S0167-6377(02)00184-0
  3. Dahlhaus, E., Johnson, D. S., Papadimitriou, C. H., Seymour, P. D., Yannakakis, M. (1994), The complexity of multi-terminal cuts, SIAM J. Computing, 23, 864-894 https://doi.org/10.1137/S0097539792225297
  4. Garg, N., Vazirani, V. V., Yannakakis, M., Primal-dual approximation algorithms for integral flow and milticut in trees (1997), Algorithmica, 18, 3-20 https://doi.org/10.1007/BF02523685
  5. Hong, S. -P. and Choi, B. -C. (2007), Approximability of the k-server disconnection problem, Networks, 50, 273-282 https://doi.org/10.1002/net.20203
  6. Myung, Y. -S. (2007), Algorithms for maximum integer multiflow and multicut in a ring network, Journal of Korean OR and MS society, 32, 89-97
  7. Myung, Y. -S. (2008), A survey on network survivability models, Journal of the Korean Institute of Industrial Engineers, 34, 181-189
  8. Suzuki, H., Ishiguro, A., and Nishizeki, T. (1992), Variable-priority queue and doghnut routing, Journal of Algorithms, 13, 606-635 https://doi.org/10.1016/0196-6774(92)90059-L
  9. Vazirani, V. V. (2001) Approximation Algorithms, Springer, Berlin, 2001
  10. Wu, T. (1992), Fiber network survivability, Artech House, Inc.