IEICE TRANSACTIONS on Communications
Open Access
Efficient Reliability Evaluation of Multi-Domain Networks with Secure Intra-Domain Privacy
-
Full Text Views
18
- Cite this
- Free PDF (2MB)
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E103-B No.4 pp.440-451
- Publication Date
- 2020/04/01
- Publicized
- 2019/09/27
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2019EBP3119
- Type of Manuscript
- PAPER
- Category
- Network Management/Operation
Authors
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
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
