{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:12:26Z","timestamp":1704931946762},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2020,4,1]]},"DOI":"10.1587\/transcom.2019ebp3119","type":"journal-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T22:13:32Z","timestamp":1569536012000},"page":"440-451","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Reliability Evaluation of Multi-Domain Networks with Secure Intra-Domain Privacy"],"prefix":"10.23919","volume":"E103.B","author":[{"given":"Atsushi","family":"TANIGUCHI","sequence":"first","affiliation":[{"name":"Graduate University for Advanced Studies (SOKENDAI)"},{"name":"NTT Network Innovation Laboratories, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeru","family":"INOUE","sequence":"additional","affiliation":[{"name":"NTT Network Innovation Laboratories, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kohei","family":"MIZUNO","sequence":"additional","affiliation":[{"name":"NTT Network Innovation Laboratories, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"KURIMOTO","sequence":"additional","affiliation":[{"name":"Graduate University for Advanced Studies (SOKENDAI)"},{"name":"National Institute of Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuko","family":"TAKEFUSA","sequence":"additional","affiliation":[{"name":"Graduate University for Advanced Studies (SOKENDAI)"},{"name":"National Institute of Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeo","family":"URUSHIDANI","sequence":"additional","affiliation":[{"name":"Graduate University for Advanced Studies (SOKENDAI)"},{"name":"National Institute of Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] F. Moskowitz, \u201cThe analysis of redundancy networks,\u201d Trans. AIEE, Part I: Comm. Electron., vol.77, no.5, pp.627-632, 1958. 10.1109\/tce.1958.6372698","DOI":"10.1109\/TCE.1958.6372698"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] L. Fratta and U. Montanari, \u201cA Boolean algebra method for computing the terminal reliability in a communication network,\u201d IEEE Trans. Circuit Theory, vol.20, no.3, pp.203-211, 1973. 10.1109\/tct.1973.1083657","DOI":"10.1109\/TCT.1973.1083657"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] F.T. Boesch, A. Satyanarayana, and C.L. Suffel, \u201cA survey of some network reliability analysis and synthesis results,\u201d Networks, vol.54, no.2, pp.99-107, 2009. 10.1002\/net.20300","DOI":"10.1002\/net.20300"},{"key":"4","unstructured":"[4] I.B. Gertsbakh and Y. Shpungin, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo, CRC Press, 2009. 10.1201\/b12536"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] P. Agarwal, A. Efrat, S. Ganjugunte, D. Hay, S. Sankararaman, and G. Zussman, \u201cThe resilience of WDM networks to probabilistic geographical failures,\u201d IEEE\/ACM Trans. Netw., vol.21, no.5, pp.1525-1538, 2013. 10.1109\/TNET.2012.2232111","DOI":"10.1109\/TNET.2012.2232111"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] H. Saito, \u201cGeometric evaluation of survivability of disaster-affected network with probabilistic failure,\u201d Proc. IEEE INFOCOM, pp.1608-1616, 2014. 10.1109\/infocom.2014.6848097","DOI":"10.1109\/INFOCOM.2014.6848097"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] F. Samuel, M. Chowdhury, and R. Boutaba, \u201cPolyViNE: Policy-based virtual network embedding across multiple domains,\u201d J. Internet Services and Applications, vol.4, no.1, pp.1-23, 2013. 10.1186\/1869-0238-4-6","DOI":"10.1186\/1869-0238-4-6"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] T. Mano, T. Inoue, K. Mizutani, and O. Akashi, \u201cVirtual network embedding across multiple domains with secure multi-party computation,\u201d IEICE Trans. Commun., vol.E98-B, no.3, pp.437-448, March 2015. 10.1587\/transcom.e98.b.437","DOI":"10.1587\/transcom.E98.B.437"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] T. Mano, T. Inoue, D. Ikarashi, K. Hamada, K. Mizutani, and O. Akashi, \u201cEfficient virtual network optimization across multiple domains without revealing private information,\u201d IEEE Trans. Netw. Serv. Manage., vol.13, no.3, pp.477-488, 2016. 10.1109\/tnsm.2016.2582179","DOI":"10.1109\/TNSM.2016.2582179"},{"key":"10","unstructured":"[10] \u201cNetwork functions virtualization-white paper on NFV priorities for 5G,\u201d ETSI ISG NFV, 2017."},{"key":"11","unstructured":"[11] C.J. Bernardos, L.M. Contreras, I. Vaishnavi, R. Szabo, X. Li, F. Paolucci, A. Sgambelluri, B. Martini, L. Valcarenghi, G. Landi, D. Andrushko, and A. Mourad, \u201cMulti-domain network virtualization,\u201d Internet Engineering Task Force, Internet-Draft draft-bernardos-nfvrg-multidomain-05, 2018, work in progress."},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] L.G. Valiant, \u201cThe complexity of enumeration and reliability problems,\u201d SIAM J. Comput., vol.8, no.3, pp.410-421, 1979. 10.1137\/0208032","DOI":"10.1137\/0208032"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] M.O. Ball, \u201cComputational complexity of network reliability analysis: An overview,\u201d IEEE Trans. Rel., vol.35, no.3, pp.230-239, 1986. 10.1109\/tr.1986.4335422","DOI":"10.1109\/TR.1986.4335422"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] M. L\u00ea, M. Walter, and J. Weidendorfer, \u201cImproving the Kuo-Lu-Yeh algorithm for assessing two-terminal reliability,\u201d Proc. European Dependable Computing Conference, pp.13-22, 2014. 10.1109\/edcc.2014.11","DOI":"10.1109\/EDCC.2014.11"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] T. Inoue, \u201cReliability analysis for disjoint paths,\u201d IEEE Trans. Rel., vol.68, no.3, pp.985-998, 2019. 10.1109\/tr.2018.2877775","DOI":"10.1109\/TR.2018.2877775"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] J. Kawahara, K. Sonoda, T. Inoue, and S. Kasahara, \u201cEfficient construction of binary decision diagrams for network reliability with imperfect vertices,\u201d Reliab. Eng. Syst. Safe., vol.188, pp.142-154, 2019. 10.1016\/j.ress.2019.03.026","DOI":"10.1016\/j.ress.2019.03.026"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] M. Nishino, T. Inoue, N. Yaasuda, S. Minato, and M. Nagata, \u201cOptimizing network reliability via best-first search over decision diagrams,\u201d Proc. IEEE Conference on Computer Communications, ser. INFOCOM, pp.1817-1825, 2018. 10.1109\/infocom.2018.8485859","DOI":"10.1109\/INFOCOM.2018.8485859"},{"key":"18","unstructured":"[18] D.E. Knuth, The Art of Computer Programming, Volume 4A, Combinatorial Algorithms, Part 1, 1st ed., Addison-Wesley Professional, 2011."},{"key":"19","unstructured":"[19] ETSI GR NFV-IFA 022 V3.1.1 Network Functions Virtualisation(NFV) Release 3; Management and Orchestration; Report on Management and Connectivity for Multi-Site Services, ETSI ISG NFV, 2018."},{"key":"20","unstructured":"[20] ETSI GR NFV-IFA 028 V3.1.1 Network Functions Virtualisation(NFV) Release 3; Management and Orchestration; Report on architecture options to support multiple administrative domains, ETSI ISG NFV, 2018."},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] J. Rexford, J. Wang, Z. Xiao, and Y. Zhang, \u201cBGP routing stability of popular destinations,\u201d Proc. 2nd ACM SIGCOMM Workshop on Internet Measurment, ser. IMW'02, pp.197-202, 2002. 10.1145\/637201.637232","DOI":"10.1145\/637201.637232"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications, Cambridge University Press, 2004.","DOI":"10.1017\/CBO9780511721656"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] C. Gentry, A Fully Homomorphic Encryption Scheme, Ph.D. dissertation, aAI3382729, Stanford, CA, USA, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] S. Knight, H.X. Nguyen, N. Falkner, R. Bowden, and M. Roughan, \u201cThe Internet topology zoo,\u201d IEEE J. Sel. Areas Commun., vol.29, no.9, pp.1765-1775, 2011. 10.1109\/jsac.2011.111002","DOI":"10.1109\/JSAC.2011.111002"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] T. Inoue, H. Iwashita, J. Kawahara, and S. Minato, \u201cGraphillion: Software library for very large sets of labeled graphs,\u201d International Journal on Software Tools for Technology Transfer, vol.18, no.1, pp.57-66, 2016. 10.1007\/s10009-014-0352-z","DOI":"10.1007\/s10009-014-0352-z"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] J.M. Wilson, \u201cAn improved minimizing algorithm for sum of disjoint products (reliability theory),\u201d IEEE Trans. Rel., vol.39, no.1, pp.42-45, 1990. 10.1109\/24.52639","DOI":"10.1109\/24.52639"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] A. Satyanarayana and M.K. Chang, \u201cNetwork reliability and the factoring theorem,\u201d Networks, vol.13, no.1, pp.107-120, 1983. 10.1002\/net.3230130107","DOI":"10.1002\/net.3230130107"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] J. Carlier and C. Lucet, \u201cA decomposition algorithm for network reliability evaluation,\u201d Discrete Appl. Math., vol.65, no.1, pp.141-156, 1996, first International Colloquium on Graphs and Optimization. 10.1016\/0166-218x(95)00032-m","DOI":"10.1016\/0166-218X(95)00032-M"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] K. Sekine, H. Imai, and S. Tani, \u201cComputing the Tutte polynomial of a graph of moderate size,\u201d Proc. International Symposium on Algorithms and Computation, pp.224-233, 1995. 10.1007\/bfb0015427","DOI":"10.1007\/BFb0015427"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[30] E. Canale, F. Robledo, P. Romero, and P. Sartor, \u201cMonte Carlo methods in diameter-constrained reliability,\u201d Optical Switching and Networking, vol.14, pp.134-148, 2014. 10.1016\/j.osn.2014.06.003","DOI":"10.1016\/j.osn.2014.06.003"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] T. Maehara, H. Suzuki, and M. Ishihata, \u201cExact computation of influence spread by binary decision diagrams,\u201d Proc. International Conference on World Wide Web, pp.947-956, 2017. 10.1145\/3038912.3052567","DOI":"10.1145\/3038912.3052567"},{"key":"32","unstructured":"[32] T. Yoshida, J. Kawahara, T. Inoue, and S. Kasahara, \u201cOn network reliability with link failure dependencies using bdds,\u201d IPSJ, Technical Report, 2017-AL-1653, 2017 (in Japanese)."},{"key":"33","unstructured":"[33] J. Kawahara, T. Inoue, and S. Kasahara, \u201cNetwork reliability evaluation with arbitrary dependencies on link failures,\u201d IEICE, Technical Report, CQ2018-113, 2019 (in Japanese)."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E103.B\/4\/E103.B_2019EBP3119\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T15:02:43Z","timestamp":1704898963000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E103.B\/4\/E103.B_2019EBP3119\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,1]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2019ebp3119","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,1]]}}}