The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
pandangan teks lengkap
84
Rangkaian komunikasi kini menjadi infrastruktur penting masyarakat. Banyak perkhidmatan dibina merentas berbilang domain rangkaian. Oleh itu, kebolehpercayaan rangkaian berbilang domain harus dinilai untuk menilai kemampanan masyarakat kita, tetapi tidak ada kaedah yang diketahui untuk menilainya. Satu sebab ialah kerumitan pengiraan yang tinggi; iaitu, penilaian kebolehpercayaan rangkaian diketahui sebagai #P-lengkap, yang telah menghalang penilaian kebolehpercayaan rangkaian berbilang domain. Sebab lain ialah privasi dalam domain; iaitu, pembekal rangkaian tidak pernah mendedahkan data dalaman yang diperlukan untuk penilaian kebolehpercayaan. Kertas ini mencadangkan kaedah baru yang mengira bahagian bawah dan atas Sempadan kebolehpercayaan dalam cara yang diedarkan tanpa memerlukan pendedahan privasi. Kaedah kami adalah berdasarkan teori graf dengan kukuh dan disokong oleh protokol mudah yang menjamin privasi dalam domain. Percubaan pada set data sebenar menunjukkan bahawa kaedah kami berjaya mengira kebolehpercayaan untuk rangkaian 14 domain dalam satu saat. Kebolehpercayaan dibatasi dengan ralat yang munasabah; cth, jurang terikat adalah kurang daripada 0.1% untuk rangkaian yang boleh dipercayai.
Atsushi TANIGUCHI
Graduate University for Advanced Studies (SOKENDAI),NTT Corporation
Takeru INOUE
NTT Corporation
Kohei MIZUNO
NTT Corporation
Takashi KURIMOTO
Graduate University for Advanced Studies (SOKENDAI),National Institute of Informatics
Atsuko TAKEFUSA
Graduate University for Advanced Studies (SOKENDAI),National Institute of Informatics
Shigeo URUSHIDANI
Graduate University for Advanced Studies (SOKENDAI),National Institute of Informatics
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Atsushi TANIGUCHI, Takeru INOUE, Kohei MIZUNO, Takashi KURIMOTO, Atsuko TAKEFUSA, Shigeo URUSHIDANI, "Efficient Reliability Evaluation of Multi-Domain Networks with Secure Intra-Domain Privacy" in IEICE TRANSACTIONS on Communications,
vol. E103-B, no. 4, pp. 440-451, April 2020, doi: 10.1587/transcom.2019EBP3119.
Abstract: Communication networks are now an essential infrastructure of society. Many services are constructed across multiple network domains. Therefore, the reliability of multi-domain networks should be evaluated to assess the sustainability of our society, but there is no known method for evaluating it. One reason is the high computation complexity; i.e., network reliability evaluation is known to be #P-complete, which has prevented the reliability evaluation of multi-domain networks. The other reason is intra-domain privacy; i.e., network providers never disclose the internal data required for reliability evaluation. This paper proposes a novel method that computes the lower and upper bounds of reliability in a distributed manner without requiring privacy disclosure. Our method is solidly based on graph theory, and is supported by a simple protocol that secures intra-domain privacy. Experiments on real datasets show that our method can successfully compute the reliability for 14-domain networks in one second. The reliability is bounded with reasonable errors; e.g., bound gaps are less than 0.1% for reliable networks.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2019EBP3119/_p
Salinan
@ARTICLE{e103-b_4_440,
author={Atsushi TANIGUCHI, Takeru INOUE, Kohei MIZUNO, Takashi KURIMOTO, Atsuko TAKEFUSA, Shigeo URUSHIDANI, },
journal={IEICE TRANSACTIONS on Communications},
title={Efficient Reliability Evaluation of Multi-Domain Networks with Secure Intra-Domain Privacy},
year={2020},
volume={E103-B},
number={4},
pages={440-451},
abstract={Communication networks are now an essential infrastructure of society. Many services are constructed across multiple network domains. Therefore, the reliability of multi-domain networks should be evaluated to assess the sustainability of our society, but there is no known method for evaluating it. One reason is the high computation complexity; i.e., network reliability evaluation is known to be #P-complete, which has prevented the reliability evaluation of multi-domain networks. The other reason is intra-domain privacy; i.e., network providers never disclose the internal data required for reliability evaluation. This paper proposes a novel method that computes the lower and upper bounds of reliability in a distributed manner without requiring privacy disclosure. Our method is solidly based on graph theory, and is supported by a simple protocol that secures intra-domain privacy. Experiments on real datasets show that our method can successfully compute the reliability for 14-domain networks in one second. The reliability is bounded with reasonable errors; e.g., bound gaps are less than 0.1% for reliable networks.},
keywords={},
doi={10.1587/transcom.2019EBP3119},
ISSN={1745-1345},
month={April},}
Salinan
TY - JOUR
TI - Efficient Reliability Evaluation of Multi-Domain Networks with Secure Intra-Domain Privacy
T2 - IEICE TRANSACTIONS on Communications
SP - 440
EP - 451
AU - Atsushi TANIGUCHI
AU - Takeru INOUE
AU - Kohei MIZUNO
AU - Takashi KURIMOTO
AU - Atsuko TAKEFUSA
AU - Shigeo URUSHIDANI
PY - 2020
DO - 10.1587/transcom.2019EBP3119
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E103-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2020
AB - Communication networks are now an essential infrastructure of society. Many services are constructed across multiple network domains. Therefore, the reliability of multi-domain networks should be evaluated to assess the sustainability of our society, but there is no known method for evaluating it. One reason is the high computation complexity; i.e., network reliability evaluation is known to be #P-complete, which has prevented the reliability evaluation of multi-domain networks. The other reason is intra-domain privacy; i.e., network providers never disclose the internal data required for reliability evaluation. This paper proposes a novel method that computes the lower and upper bounds of reliability in a distributed manner without requiring privacy disclosure. Our method is solidly based on graph theory, and is supported by a simple protocol that secures intra-domain privacy. Experiments on real datasets show that our method can successfully compute the reliability for 14-domain networks in one second. The reliability is bounded with reasonable errors; e.g., bound gaps are less than 0.1% for reliable networks.
ER -