{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:19:57Z","timestamp":1759331997214},"reference-count":38,"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.2019nrp0004","type":"journal-article","created":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T22:12:23Z","timestamp":1571955143000},"page":"347-362","source":"Crossref","is-referenced-by-count":3,"title":["Reducing Dense Virtual Networks for Fast Embedding"],"prefix":"10.23919","volume":"E103.B","author":[{"given":"Toru","family":"MANO","sequence":"first","affiliation":[{"name":"NTT Network Innovation Laboratories"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeru","family":"INOUE","sequence":"additional","affiliation":[{"name":"NTT Network Innovation Laboratories"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimihiro","family":"MIZUTANI","sequence":"additional","affiliation":[{"name":"Kindai University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osamu","family":"AKASHI","sequence":"additional","affiliation":[{"name":"National Institute of Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] N. Chowdhury and R. Boutaba, \u201cNetwork virtualization: State of the art and research challenges,\u201d IEEE Commun. Mag., vol.47, no.7, pp.20-26, 2009. 10.1109\/mcom.2009.5183468","DOI":"10.1109\/MCOM.2009.5183468"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] A. Belbekkouche, M.M. Hasan, and A. Karmouch, \u201cResource discovery and allocation in network virtualization,\u201d IEEE Commun. Surveys Tuts., vol.14, no.4, pp.1114-1128, 2012. 10.1109\/surv.2011.122811.00060","DOI":"10.1109\/SURV.2011.122811.00060"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] A. Fischer, J. Botero, M. Till Beck, H. de Meer, and X. Hesselbach, \u201cVirtual network embedding: A survey,\u201d IEEE Commun. Surveys Tuts., vol.15, no.4, pp.1888-1906, 2013. 10.1109\/surv.2013.013013.00155","DOI":"10.1109\/SURV.2013.013013.00155"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] E. Amaldi, S. Coniglio, A.M. Koster, and M. Tieves, \u201cOn the computational complexity of the virtual network embedding problem,\u201d Electronic Notes in Discrete Mathematics, vol.52, pp.213-220, 2016. 10.1016\/j.endm.2016.03.028","DOI":"10.1016\/j.endm.2016.03.028"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Y. Zhu and M. Ammar, \u201cAlgorithms for assigning substrate network resources to virtual network components,\u201d Proc. IEEE INFOCOM, pp.1-12, 2006. 10.1109\/infocom.2006.322","DOI":"10.1109\/INFOCOM.2006.322"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] M. Yu, Y. Yi, J. Rexford, and M. Chiang, \u201cRethinking virtual network embedding: Substrate support for path splitting and migration,\u201d SIGCOMM Comput. Commun. Rev., vol.38, no.2, pp.17-29, 2008. 10.1145\/1355734.1355737","DOI":"10.1145\/1355734.1355737"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] J. Lischka and H. Karl, \u201cA virtual network mapping algorithm based on subgraph isomorphism detection,\u201d Proc. ACM VISA, pp.81-88, 2009. 10.1145\/1592648.1592662","DOI":"10.1145\/1592648.1592662"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] X. Cheng, S. Su, Z. Zhang, H. Wang, F. Yang, Y. Luo, and J. Wang, \u201cVirtual network embedding through topology-aware node ranking,\u201d SIGCOMM Comput. Commun. Rev., vol.41, no.2, pp.38-47, 2011. 10.1145\/1971162.1971168","DOI":"10.1145\/1971162.1971168"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] M. Chowdhury, M. Rahman, and R. Boutaba, \u201cViNEYard: Virtual network embedding algorithms with coordinated node and link mapping,\u201d IEEE\/ACM Trans. Netw., vol.20, no.1, pp.206-219, 2012. 10.1109\/tnet.2011.2159308","DOI":"10.1109\/TNET.2011.2159308"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] C. Papagianni, A. Leivadeas, S. Papavassiliou, V. Maglaris, C. Cervello-Pastor, and A. Monje, \u201cOn the optimal allocation of virtual resources in cloud computing networks,\u201d IEEE Trans. Comput., vol.62, no.6, pp.1060-1071, June 2013. 10.1109\/tc.2013.31","DOI":"10.1109\/TC.2013.31"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] M. Rahman and R. Boutaba, \u201cSVNE: Survivable virtual network embedding algorithms for network virtualization,\u201d IEEE Trans. Netw. Service Manage, vol.10, no.2, pp.105-118, June 2013. 10.1109\/tnsm.2013.013013.110202","DOI":"10.1109\/TNSM.2013.013013.110202"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] A. Leivadeas, C. Papagianni, and S. Papavassiliou, \u201cEfficient resource mapping framework over networked clouds via iterated local search-based request partitioning,\u201d IEEE Trans. Parallel Distrib. Syst., vol.24, no.6, pp.1077-1086, June 2013. 10.1109\/tpds.2012.204","DOI":"10.1109\/TPDS.2012.204"},{"key":"13","unstructured":"[13] J. Hromkovic and W.M. Oliva, Algorithmics for Hard Problems, 2nd ed., Springer, Secaucus, NJ, USA, 2002."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] C. Wang and T. Wolf, \u201cVirtual network mapping with traffic matrices,\u201d Proc. ACM\/IEEE ANCS, pp.225-226, Oct. 2011. 10.1109\/ancs.2011.44","DOI":"10.1109\/ANCS.2011.44"},{"key":"15","unstructured":"[15] Cisco, \u201cVisual networking index: Forecast and trends, 2017-2022,\u201d https:\/\/www.cisco.com\/c\/en\/us\/solutions\/collateral\/service-provider\/visual-networking-index-vni\/white-paper-c11-741490.html"},{"key":"16","unstructured":"[16] E.T.S.I. (ETSI), \u201cNetwork functions virtualisation (NFV); management and orchestration,\u201d Std. ETSI GS NFV-MAN 001, Dec. 2014."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] T. Kamada, Y. Kuno, H. Tamura, and H. Iwamiya, \u201cPractical implementation of virtualization platform in NTT DOCOMO network,\u201d NTT DOCOMO Techinical Journal, vol.18, no.1, pp.20-28, July 2016. 10.20965\/jdr.2016.p0334","DOI":"10.20965\/jdr.2016.p0334"},{"key":"18","unstructured":"[18] L. Foundation, \u201cDPDK: Data plane development kit,\u201d http:\/\/dpdk.org\/"},{"key":"19","unstructured":"[19] G.B. Dantzig, \u201cMaximiztion of a linear function of variables subject to linear inequalities,\u201d Proc. Activity Analysis of Production and Allocation, New York, pp.339-347, 1951."},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] N. Karmarkar, \u201cA new polynomial-time algorithm for linear programming,\u201d Combinatorica, vol.4, no.4, pp.373-396, 1984. 10.1007\/bf02579150","DOI":"10.1007\/BF02579150"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] M.J. Todd, \u201cThe many facets of linear programming,\u201d Math. Program., vol.91, no.3, pp.417-436, 2002. 10.1007\/s101070100261","DOI":"10.1007\/s101070100261"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] O. Goldschmidt and D.S. Hochbaum, \u201cA polynomial algorithm for the k-cut problem for fixed k,\u201d Math. Oper. Res., vol.19, no.1, pp.24-37, Feb. 1994. 10.1287\/moor.19.1.24","DOI":"10.1287\/moor.19.1.24"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] H. Saran and V.V. Vazirani, \u201cFinding <i>k<\/i>-cuts within twice the optimal,\u201d SIAM J. Comput., vol.24, no.1, pp.101-108, Feb. 1995. 10.1137\/s0097539792251730","DOI":"10.1137\/S0097539792251730"},{"key":"24","unstructured":"[24] GNU, \u201cGNU Linear Programming Kit,\u201d http:\/\/www.gnu.org\/software\/glpk\/"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] I. Houidi, W. Louati, W.B. Ameur, and D. Zeghlache, \u201cVirtual network provisioning across multiple substrate networks,\u201d Computer Networks, vol.55, no.4, pp.1011-1023, 2011. 10.1016\/j.comnet.2010.12.011","DOI":"10.1016\/j.comnet.2010.12.011"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] S.R. Chowdhury, R. Ahmed, M.M.A. Khan, N. Shahriar, R. Boutaba, J. Mitra, and F. Zeng, \u201cDedicated protection for survivable virtual network embedding,\u201d IEEE Trans. Netw. Serv. Manag., vol.13, no.4, pp.913-926, 2016. 10.1109\/tnsm.2016.2574239","DOI":"10.1109\/TNSM.2016.2574239"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] Q. Hu, Y. Wang, and X. Cao, \u201cResolve the virtual network embedding problem: A column generation approach,\u201d 2013 Proc. IEEE INFOCOM, p.nil, April 2013. 10.1109\/infcom.2013.6566805","DOI":"10.1109\/INFCOM.2013.6566805"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] A. Jarray and A. Karmouch, \u201cDecomposition approaches for virtual network embedding with one-shot node and link mapping,\u201d IEEE\/ACM Trans. Netw., vol.23, no.3, pp.1012-1025, 2015. 10.1109\/tnet.2014.2312928","DOI":"10.1109\/TNET.2014.2312928"},{"key":"29","doi-asserted-by":"publisher","unstructured":"[29] R. Mijumbi, J. Serrat, J.L. Gorricho, and R. Boutaba, \u201cA path generation approach to embedding of virtual networks,\u201d IEEE Trans. Netw. Serv. Manag., vol.12, no.3, pp.334-348, Sept. 2015. 10.1109\/tnsm.2015.2459073","DOI":"10.1109\/TNSM.2015.2459073"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[30] L. Gong, H. Jiang, Y. Wang, and Z. Zhu, \u201cNovel location-constrained virtual network embedding lc-vne algorithms towards integrated node and link mapping,\u201d IEEE\/ACM Trans. Netw., vol.24, no.6, pp.3648-3661, 2016. 10.1109\/tnet.2016.2533625","DOI":"10.1109\/TNET.2016.2533625"},{"key":"31","doi-asserted-by":"publisher","unstructured":"[31] S. Su, Z. Zhang, A.X. Liu, X. Cheng, Y. Wang, and X. Zhao, \u201cEnergy-aware virtual network embedding,\u201d IEEE\/ACM Trans. Netw., vol.22, no.5, pp.1607-1620, 2014. 10.1109\/tnet.2013.2286156","DOI":"10.1109\/TNET.2013.2286156"},{"key":"32","doi-asserted-by":"crossref","unstructured":"[32] T.H. Lee, S. Tursunova, and T.S. Choi, \u201cGraph clustering based provisioning algorithm for virtual network embedding,\u201d Proc. IEEE NOMS, pp.1175-1178, April 2012. 10.1109\/noms.2012.6212045","DOI":"10.1109\/NOMS.2012.6212045"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] T. Ghazar and N. Samaan, \u201cHierarchical approach for efficient virtual network embedding based on exact subgraph matching,\u201d Proc. IEEE GLOBECOM, pp.1-6, Dec. 2011. 10.1109\/glocom.2011.6133500","DOI":"10.1109\/GLOCOM.2011.6133500"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] F. Yang, Z. kai Wang, J. ya Chen, and Y. jie Liu, \u201cVLB-VNE: A regionalized valiant load-balancing algorithm in virtual network mapping,\u201d Proc. IEEE WCNIS, pp.432-436, June 2010. 10.1109\/wcins.2010.5541814","DOI":"10.1109\/WCINS.2010.5541814"},{"key":"35","unstructured":"[35] IBM, \u201cCPLEX Optimizer,\u201d https:\/\/www.ibm.com\/analytics\/cplex-optimizer"},{"key":"36","unstructured":"[36] GUROBI, \u201cGurobi Optimizer,\u201d http:\/\/www.gurobi.com\/"},{"key":"37","doi-asserted-by":"crossref","unstructured":"[37] Y. Ye, Interior Point Algorithms: Theory and Analysis, John Wiley &amp; Sons, New York, NY, USA, 1997. 10.1002\/9781118032701","DOI":"10.1002\/9781118032701"},{"key":"38","unstructured":"[38] D.B. West, Introduction to Graph Theory, Prentice Hall, Upper Saddle River, 2000."}],"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_2019NRP0004\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T15:02:45Z","timestamp":1704898965000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E103.B\/4\/E103.B_2019NRP0004\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,1]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2019nrp0004","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]]}}}