Comparison of Distance Limiting Methods for Risk-aware Data Replication in Urban and Suburban Area

• Item type: Journal(1)
• 公開日: 2016-03-15
• タイトル: Comparison of Distance Limiting Methods for Risk-aware Data Replication in Urban and Suburban Area
• タイトル / 言語: en
• タイトル: Comparison of Distance Limiting Methods for Risk-aware Data Replication in Urban and Suburban Area
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [特集：クラウド時代のインターネットと運用技術] remote replication, disaster recovery, distributed storage, integer programming problem, availability
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Research Institute of Electrical Communication, Tohoku University
• 著者所属: Research & Development Group, Hitachi, Ltd.
• 著者所属: Hitachi Solutions East Japan, Ltd.
• 著者所属: Cyberscience Center, Tohoku University
• 著者所属: Research Institute of Electrical Communication, Tohoku University
• 著者所属(英): en
• 著者所属(英): Research Institute of Electrical Communication, Tohoku University
• 著者所属(英): en
• 著者所属(英): Research & Development Group, Hitachi, Ltd.
• 著者所属(英): en
• 著者所属(英): Hitachi Solutions East Japan, Ltd.
• 著者所属(英): en
• 著者所属(英): Cyberscience Center, Tohoku University
• 著者所属(英): en
• 著者所属(英): Research Institute of Electrical Communication, Tohoku University
• 著者名: Takaki, Nakamura; Shinya, Matsumoto; Masaru, Tezuka; Satoru, Izumi; Hiroaki, Muraoka
• 著者名(英): Takaki, Nakamura; Shinya, Matsumoto; Masaru, Tezuka; Satoru, Izumi; Hiroaki, Muraoka
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Risk-aware data replication (RDR), which replicates data at primary sites to safe backup sites, has been proposed to mitigate a service disruption in a disaster area even after a widespread disaster that damages a network and a primary site. RDR assigns a safe backup site to a primary site while considering a damage risk for both the primary site and the backup candidate site. When the backup candidate sites are widely distributed in an urban and suburban area, RDR sometimes assigns a backup site too far from the primary site. However the backup site is desired to be reachable from the primary site by physical transfer such as walking, bicycle, car, or drone in case that a severe disaster damages network among the sites. Therefore, limiting the distance between the primary site and the backup site is required. To approach this challenge, we propose two possible methods: the average distance limiting (ADL) method and the maximum distance limiting (MDL) method. In this paper, we compare the distance distributions, the data availability, and the computation time of two methods. Then, we conclude that the MDL method is the most practicable from a comprehensive perspective.; \n------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.24(2016) No.2 (online); DOI http://dx.doi.org/10.2197/ipsjjip.24.381; ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Risk-aware data replication (RDR), which replicates data at primary sites to safe backup sites, has been proposed to mitigate a service disruption in a disaster area even after a widespread disaster that damages a network and a primary site. RDR assigns a safe backup site to a primary site while considering a damage risk for both the primary site and the backup candidate site. When the backup candidate sites are widely distributed in an urban and suburban area, RDR sometimes assigns a backup site too far from the primary site. However the backup site is desired to be reachable from the primary site by physical transfer such as walking, bicycle, car, or drone in case that a severe disaster damages network among the sites. Therefore, limiting the distance between the primary site and the backup site is required. To approach this challenge, we propose two possible methods: the average distance limiting (ADL) method and the maximum distance limiting (MDL) method. In this paper, we compare the distance distributions, the data availability, and the computation time of two methods. Then, we conclude that the MDL method is the most practicable from a comprehensive perspective.; \n------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.24(2016) No.2 (online); DOI http://dx.doi.org/10.2197/ipsjjip.24.381; ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 57, 号 3, 発行日 2016-03-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764