DOI QR코드

DOI QR Code

그리드 네트워크의 강한 Roman 지배수 상계에 대한 해석

Analysis on the upper bound of strong Roman-domination in grid networks

  • Lee, Hoon (Department of Information & Communications Engineering, Changwon National University) ;
  • Sohn, Moo Young (Department of Mathematics, Changwon National University)
  • 투고 : 2018.06.18
  • 심사 : 2018.07.09
  • 발행 : 2018.08.31

초록

본 연구에서는 그리드 네트워크에 대해서 정상적인 트래픽 예측에 의해서 설계된 자원 이외에 예측 불가능한 비상사태를 대비하기 위한 추가자원의 한계용량 설계에 관한 해석적 모델을 제안한다. 구체적으로는 그리드 네트워크 전체를 대상으로 한계용량을 산정하는 경우의 최솟값에 대한 상한을 예측하는 방법을 제안한다. 이를 위해서 본 논문에서는 그리드 네트워크를 그리드 그래프로 추상화하여 Roman domination number의 개념을 이용한 해석적 기법을 통해서 한계용량의 상한을 도출한다.

In this paper, we propose a theoretical framework for provisioning marginal resources in wired and wireless computer networks which include Internet. In more detail, we propose a mathematical model for the upper bounds of marginal capacity in grid networks, where the resource is designed a priori by normal traffic estimation and marginal resource is prepared for unexpected events such as natural disasters and abrupt flash crowd in public affairs. To be specific, we propose a method to evaluate an upper bound for minimum marginal capacity for an arbitrary grid topology using the concept of a strong Roman domination number. To that purpose, we introduce a graph theory to model and analyze the characteristics of general grid structure networks. After that we propose a new tight upper bound for the strong Roman domination number. Via a numerical example, we show the validity of the proposition.

키워드

참고문헌

  1. H. Kim, Internet of Things, Seoul: Hong-Reung publishing company, 2014.
  2. C. Smith and D. Collins, Wireless networks: design and integration for LTE, EVDO, HSPA, and WiMAX, New York, NY: McGraw-Hill, 2014.
  3. H. Lee, "Capacity design of a gateway router for smart farms," J. Inf. Commun. Converg. Eng., vol. 16, no. 1, pp. 31-37, Mar. 2018. https://doi.org/10.6109/JICCE.2018.16.1.31
  4. D. A. Xavier and C. Kujur, "Extended Roman domination number of honeycomb networks," International Journal of Computing Algorithm, vol. 03, pp. 558-561, Feb. 2014.
  5. M.P. Alvarez-Ruiz, T. M. Gradolph, S.M. Sheikholeslami, J.C. Tripodoro and I.G. Yero, "On the strong Roman domination number of graphs," Discrete Applied Mathematics, vol. 231, pp. 44-59, 20 Nov. 2017. https://doi.org/10.1016/j.dam.2016.12.013
  6. T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, New York, NY: Marcel Dekker, 1998.
  7. H. Lee and M. Sohn, "Analysis on the characteristics for upper bound of [1,2]-domination in trees," Journal of the Korea Institute of Information and Communication Engineering, vol. 20, no. 12, pp. 2243-2251, Dec. 2016. https://doi.org/10.6109/jkiice.2016.20.12.2243
  8. E.J. Cockayne, P.A. Dreyer, S. M. Hedetniemi, and S. T. Hedetniemi, "Roman domination in graphs," Discrete Mathematics, vol. 278, issues 1-3, pp. 11-22, Mar. 2004. https://doi.org/10.1016/j.disc.2003.06.004
  9. C.S. Revelle, and K.E. Rosing, "Defendens imperium romanum: A classical problem in military strategy," The American Mathematical Monthly, vol. 107, no. 7, pp. 585-594, Aug. - Sep., 2000. https://doi.org/10.1080/00029890.2000.12005243
  10. I. Stewart, "Defend the Roman empire," Scientific American, vol. 281, no. 6, pp. 136-138, Dec. 1999. https://doi.org/10.1038/scientificamerican1299-136
  11. E.W. Chambers, B. Kinnersley, N. Prince and D. B. West, "Extremal problems for Roman domination," Siam Journal Discrete Mathematics, vol. 23, no. 3, pp. 1575-1686, Jan. 2009. https://doi.org/10.1137/070699688
  12. P. Sridhar and R. Caytiles, "Efficient cloud data hosting availability," Asia-Pacific journal of convergent research interchange, vol. 3, no. 2, pp. 11-19, June 2017, Available: http://dx.doi.org/10.21742/APJCRI.2017.06.02.