Management Science and Financial Engineering

  • 제16권3호
  • /
  • Pages.85-93
  • /
  • 2010
  • /
  • 2287-2043(pISSN)
  • /
  • 2287-2361(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

An Efficient Algorithm for Finding the k-edge Survivability in Ring Networks

  • 투고 : 2010.07.07
  • 심사 : 2010.10.13
  • 발행 : 2010.11.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Given an undirected network with a set of source-sink pairs, we are assumed to get a benefit if a pair of source and sink nodes are connected. The k-edge survivability of a network is defined as the total benefit secured after arbitrarily selected k edges are destroyed. The problem of computing k-edge survivability is known to be NP-hard and has applications of evaluating the survivability or vulnerability of a network. In this paper, we consider the k-edge survivability problem restricted to ring networks and develop an algorithm to solve it in O($n^3$|K|) time where n is the number of nodes and K is the set of source-sink pairs.

키워드

참고문헌

  1. Cosares, S., N. D. Deutch, I. Saniee, and O. J. Wasem, "SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks," Interfaces 25 (1995), 20-40. https://doi.org/10.1287/inte.25.1.20
  2. Frank, A., T. Nishizeki, N. Saito, H. Suzuki, and E. Tardos, "Algorithms for routing around a rectangle," Discrete Applied Mathematics 40 (1992), 363-378. https://doi.org/10.1016/0166-218X(92)90007-W
  3. Garg, N., V. V. Vazirani, and M. Yannakakis, "Primal-dual approximation algorithms for integral flow and milticut in trees," Algorithmica 18 (1997), 3-20. https://doi.org/10.1007/BF02523685
  4. Kolar, D. J. and T. Wu, "A study of survivability versus cost for several fiber network architectures," Proceedings of IEEE Int'l Conference on Communications (1988), 61-66.
  5. Myung, Y.-S., "Multicommodity flows in cycle graphs," Discrete Applied Mathematics 154 (2006), 1615-1621. https://doi.org/10.1016/j.dam.2006.03.016
  6. Myung, Y.-S., "The server disconnection problems on a a ring network," Journal of KIIE 35 (2009), 87-91.
  7. Myung, Y.-S. and H.-J. Kim, "A Cutting Plane Algorithm for Computing k-edge Survivability of a Network," European Journal of Operational Research 156 (2004), 579-589. https://doi.org/10.1016/S0377-2217(03)00135-8
  8. Myung, Y.-S. and H.-J. Kim, "Network disconnection problems in a centralized network," Naval Research Logistics 54 (2007), 710-719. https://doi.org/10.1002/nav.20242
  9. Myung, Y.-S., H.-G. Kim, and D.-W. Tcha, "Optimal load balancing on SONET bidirectional rings," Operations Research 45 (1997), 148-152. https://doi.org/10.1287/opre.45.1.148
  10. Myung, Y.-S., H.-J. Kim, and D.-W. Tcha, "Design of communication networks with survivability constraints," Management Science 45 (1999), 238-252. https://doi.org/10.1287/mnsc.45.2.238
  11. Schrijver, A., P. Seymour and P. Winkler, The ring loading problem, SIAM J. Discrete Math., 11 (1998), 1-14. https://doi.org/10.1137/S0895480195294994
  12. Suzuki, H., A. Ishiguro, and T. Nishizeki, "Variable-priority queue and doughnut routing," Journal of Algorithms 13 (1992), 606-635. https://doi.org/10.1016/0196-6774(92)90059-L
  13. Wu, T., Fiber network survivability, Artech House, Inc. Boston, 1992.
  14. Wu, T., R. H. Cardwell, and W. E. Woodall, "Decreasing survivable fiber network cost using optical switches," Proceeding of IEEE Int'l Conference on Communications, (1988), 93-97.
  15. Wu, T., D. J. Kolar, and R. H. Cardwell, "Survivable network architectures for broad-band fiber optic networks: model and performance comparison," Journal of Lightwave Technology 6 (1988), 1698-1709. https://doi.org/10.1109/50.9987