{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:11:58Z","timestamp":1774627918541,"version":"3.50.1"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2021,8,1]]},"DOI":"10.1587\/transcom.2020ebp3145","type":"journal-article","created":{"date-parts":[[2021,1,31]],"date-time":"2021-01-31T22:06:59Z","timestamp":1612130819000},"page":"942-950","source":"Crossref","is-referenced-by-count":10,"title":["Heuristic Approach to Distributed Server Allocation with Preventive Start-Time Optimization against Server Failure"],"prefix":"10.23919","volume":"E104.B","author":[{"given":"Souhei","family":"YANASE","sequence":"first","affiliation":[{"name":"Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuto","family":"MASUDA","sequence":"additional","affiliation":[{"name":"Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fujun","family":"HE","sequence":"additional","affiliation":[{"name":"Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akio","family":"KAWABATA","sequence":"additional","affiliation":[{"name":"NTT Network Technology Laboratories"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"OKI","sequence":"additional","affiliation":[{"name":"Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] J. Marsh, M. Glencross, S. Pettifer, and R. Hubbold, \u201cA network architecture supporting consistent rich behavior in collaborative interactive applications,\u201d IEEE Trans. Vis. Comput. Graphics, vol.12, no.3, pp.405-416, 2006. 10.1109\/tvcg.2006.40","DOI":"10.1109\/TVCG.2006.40"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] W. Shi and S. Dustdar, \u201cThe promise of edge computing,\u201d Computer, vol.49, no.5, pp.78-81, 2016. 10.1109\/mc.2016.145","DOI":"10.1109\/MC.2016.145"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] A. Kawabata, B.C. Chatterjee, S. Ba, and E. Oki, \u201cA real-time delay-sensitive communication approach based on distributed processing,\u201d IEEE Access, vol.5, pp.20235-20248, 2017. 10.1109\/access.2017.2758803","DOI":"10.1109\/ACCESS.2017.2758803"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S. Ba, A. Kawabata, B.C. Chatterjee, and E. Oki, \u201cComputational time complexity of allocation problem for distributed servers in real-time applications,\u201d Proc. APNOMS, pp.1-4, 2016. 10.1109\/apnoms.2016.7737236","DOI":"10.1109\/APNOMS.2016.7737236"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] T. Ito, N. Kakimura, N. Kamiyama, Y. Kobayashi, Y. Okamoto, and T. Shiitada, \u201cTight approximability of the server allocation problem for real-time applications,\u201d Proc. ALGOCLOUD, pp.41-55, 2018. 10.1007\/978-3-319-74875-7_4","DOI":"10.1007\/978-3-319-74875-7_4"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] T. Sawa, F. He, A. Kawabata, and E. Oki, \u201cPolynomial-time algorithm for distributed server allocation problem,\u201d Proc. IEEE CloudNet, pp.1-3, 2019. 10.1109\/cloudnet47604.2019.9064128","DOI":"10.1109\/CloudNet47604.2019.9064128"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] A. Kawabata, B.C. Chatterjee, and E. Oki, \u201cParticipating-domain segmentation based delay-sensitive distributed server selection scheme,\u201d IEEE Access, vol.7, pp.20689-20697, 2019. 10.1109\/access.2019.2897986","DOI":"10.1109\/ACCESS.2019.2897986"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] W. Shi, J. Cao, Q. Zhang, Y. Li, and L. Xu, \u201cEdge computing: Vision and challenges,\u201d IEEE Internet Things J., vol.3, no.5, pp.637-646, 2016. 10.1109\/jiot.2016.2579198","DOI":"10.1109\/JIOT.2016.2579198"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] S. Masuda, F. He, A. Kawabata, and E. Oki, \u201cDistributed server allocation model with preventive start-time optimization against single failure,\u201d Proc. 20th IEEE Int. Conf. High Performance Switching and Routing (HPSR 2020), pp.1-6, May 2020. 10.1109\/hpsr48589.2020.9098979","DOI":"10.1109\/HPSR48589.2020.9098979"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] S. Yanase, F. He, and E. Oki, \u201cHeuristic approach to distributed server allocation with preventive start-time optimization against server failure,\u201d 11th International Conference on Information and Communication Technology on Convergence (ICTC), pp.1-6, Oct. 2020. 10.1109\/ictc49870.2020.9289487","DOI":"10.1109\/ICTC49870.2020.9289487"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] R. Birke, I. Giurgiu, L.Y. Chen, D. Wiesmann, and T. Engbersen, \u201cFailure analysis of virtual and physical machines: patterns, causes and characteristics,\u201d IEEE\/IFIP DSN, pp.1-12, 2014. 10.1109\/dsn.2014.18","DOI":"10.1109\/DSN.2014.18"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Y. Hirano, F. He, T. Sato, and E. Oki, \u201cBackup network design against multiple link failures to avoid link capacity overestimation,\u201d IEEE Trans. Netw. Serv. Manag., vol.17, no.2, pp.1254-1267, June 2020. 10.1109\/tnsm.2019.2959072","DOI":"10.1109\/TNSM.2019.2959072"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] M. Johnston, H.W. Lee, and E. Modiano, \u201cA robust optimization approach to backup network design with random failures,\u201d IEEE\/ACM Trans. Netw., vol.23, no.4, pp.1216-1228, 2015. 10.1109\/TNET.2014.2320829","DOI":"10.1109\/TNET.2014.2320829"},{"key":"14","unstructured":"[14] \u201cCbc: COIN-OR,\u201d [Online]. Available: https:\/\/github.com\/coin-or\/Cbc, [Accessed: 27-Jul.-2020]."},{"key":"15","unstructured":"[15] \u201cPuLP: PyPI,\u201d [Online]. Available: https:\/\/pypi.org\/project\/PuLP\/, [Accessed: 27-Jul.-2020]."},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] I.M. Kamrul and E. Oki, \u201cPSO: Preventive start-time optimization of OSPF link weights to counter network failure,\u201d IEEE Commun. Lett., vol.14, no.6, pp.581-583, 2010. 10.1109\/lcomm.2010.06.100363","DOI":"10.1109\/LCOMM.2010.06.100363"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] Y. Hirano, F. He, T. Sato, and E. Oki \u201cPreventive start-time optimization to determine link weights against multiple link failures,\u201d Proc. IEEE CloudNet, pp.1-3, 2019. 10.1109\/cloudnet47604.2019.9064130","DOI":"10.1109\/CloudNet47604.2019.9064130"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] F. He, T. Sato, B.C. Chatterjee, T. Kurimoto, S. Urushidani, and E. Oki, \u201cRobust optimization model for backup resource allocation in cloud provider,\u201d IEEE ICC 2018, pp.1-6, May 2018. 10.1109\/icc.2018.8422840","DOI":"10.1109\/ICC.2018.8422840"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] M. Ito, F. He, and E. Oki, \u201cRobust optimization model for probabilistic protection under uncertain virtual machine capacity in cloud,\u201d 16th International Conference on the Design of Reliable Communication Networks (DRCN 2020), pp.1-8, March 2020. 10.1109\/drcn48652.2020.1570609411","DOI":"10.1109\/DRCN48652.2020.1570609411"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] S. Khouangvichit, N. Kitsuwan, and E. Oki, \u201cOptimization approach to minimize backup capacity considering routing in primary and backup networks for random multiple link failures,\u201d IEICE Trans. Commun., vol.E103-B, no.7, pp.726-735, July 2020. 10.1587\/transcom.2019ebp3173","DOI":"10.1587\/transcom.2019EBP3173"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] S. Khouangvichit and E. Oki, \u201cOptimization model for backup network design with primary and backup routing against multiple link failures under uncertain traffic demands,\u201d IEICE Trans. Commun., vol.E104-B, no.4, pp.378-390, April 2021. 10.1587\/transcom.2020ebp3084","DOI":"10.1587\/transcom.2020EBP3084"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E104.B\/8\/E104.B_2020EBP3145\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T15:00:00Z","timestamp":1704898800000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E104.B\/8\/E104.B_2020EBP3145\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,1]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2020ebp3145","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,1]]},"article-number":"2020EBP3145"}}