{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:46:12Z","timestamp":1725745572880},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1109\/icnp.2016.7784411","type":"proceedings-article","created":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T07:55:26Z","timestamp":1481961326000},"page":"1-10","source":"Crossref","is-referenced-by-count":8,"title":["Optimizing virtual backup allocation for middleboxes"],"prefix":"10.1109","author":[{"given":"Yossi","family":"Kanizo","sequence":"first","affiliation":[]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[]},{"given":"Itai","family":"Segall","sequence":"additional","affiliation":[]},{"given":"Jose","family":"Yallouz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"125","article-title":"The easiest hard problem: Number partitioning","author":"mertens","year":"2003","journal-title":"Computational Complexity and Statistical Physics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2523630"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2523635"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218511"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.06.003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INM.2015.7140281"},{"journal-title":"Network Functions Virtualization Introductory White Paper ETSI Darmstadt Germany October 2012 ”","year":"0","author":"chiosi","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1899928.1899932"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787501"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390233"},{"key":"ref8","article-title":"Practical and theoretical improvements for bipartite matching using the pseudoflow algorithm","author":"chandran","year":"2011","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"ref2","article-title":"Remus: High availability via asynchronous virtual machine replication","author":"cully","year":"2008","journal-title":"USENIX NSDI"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504737"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2314683"}],"event":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","start":{"date-parts":[[2016,11,8]]},"location":"Singapore","end":{"date-parts":[[2016,11,11]]}},"container-title":["2016 IEEE 24th International Conference on Network Protocols (ICNP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7774710\/7784399\/07784411.pdf?arnumber=7784411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T03:54:30Z","timestamp":1507002870000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7784411\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icnp.2016.7784411","relation":{},"subject":[],"published":{"date-parts":[[2016,11]]}}}