{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T07:12:53Z","timestamp":1725693173351},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/infocom.2019.8737645","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:35:56Z","timestamp":1560818156000},"page":"2035-2043","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Representations of a Traffic Distribution in Switch Memories"],"prefix":"10.1109","author":[{"given":"Yaniv","family":"Sadeh","sequence":"first","affiliation":[]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[]},{"given":"Arye","family":"Barkan","sequence":"additional","affiliation":[]},{"given":"Yossi","family":"Kanizo","sequence":"additional","affiliation":[]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062046"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749256"},{"journal-title":"The Encyclopedia of Integer Sequences","year":"1995","author":"sloane","key":"ref12"},{"key":"ref13","article-title":"Techniques for the synthesis of multiprocessor tasksets","author":"emberson","year":"2010","journal-title":"Watershed"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592803"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2992"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836091"},{"key":"ref5","article-title":"Openflow-based server load balancing gone wild","author":"wang","year":"2011","journal-title":"USENIX hot'Ice"},{"key":"ref8","first-page":"2011","author":"appelman","year":"2012","journal-title":"Performance Analysis of Openflow Hardware"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210412"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486026"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","start":{"date-parts":[[2019,4,29]]},"location":"Paris, France","end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8732929\/8737365\/08737645.pdf?arnumber=8737645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:15:01Z","timestamp":1657854901000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8737645\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/infocom.2019.8737645","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}