{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T17:26:40Z","timestamp":1778347600530,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,11]]},"DOI":"10.1145\/3397166.3409149","type":"proceedings-article","created":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T02:02:42Z","timestamp":1602122562000},"page":"131-140","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Approximation algorithms for data-intensive service chain embedding"],"prefix":"10.1145","author":[{"given":"Konstantinos","family":"Poularakis","sequence":"first","affiliation":[{"name":"Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaime","family":"Llorca","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonia M.","family":"Tulino","sequence":"additional","affiliation":[{"name":"University of Napoli Federico II & New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leandros","family":"Tassiulas","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342509.2342513"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2682318"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.09.001"},{"key":"e_1_3_2_1_4_1","volume-title":"IEEE Network","author":"Elbamby M.S.","year":"2018"},{"key":"e_1_3_2_1_5_1","volume-title":"NGMN Alliance","author":"Hornes A.","year":"2018"},{"key":"e_1_3_2_1_6_1","volume-title":"IFIP Networking","author":"Rost M.","year":"2018"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2815318"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2880992"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2018.00044"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"J. Xu L. Chen P. Zhou \"Joint Service Caching and Task Offloading for Mobile Edge Computing in Dense Networks\" IEEE Infocom 2018.  J. Xu L. Chen P. Zhou \"Joint Service Caching and Task Offloading for Mobile Edge Computing in Dense Networks\" IEEE Infocom 2018.","DOI":"10.1109\/INFOCOM.2018.8485977"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"K. Poularakis J. Llorca A. Tulino I. Taylor L. Tassiulas \"Joint Service Placement and Request Routing in Multi-cell Mobile Edge Computing Networks\" IEEE Infocom 2019.  K. Poularakis J. Llorca A. Tulino I. Taylor L. Tassiulas \"Joint Service Placement and Request Routing in Multi-cell Mobile Edge Computing Networks\" IEEE Infocom 2019.","DOI":"10.1109\/INFOCOM.2019.8737385"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2884835"},{"key":"e_1_3_2_1_13_1","first-page":"46","article-title":"A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling","author":"Liu Mengxue","year":"2019","journal-title":"INFOCOM"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"R. Cohen L. Lewin-Eytan J. S. Naor D. Raz \"Near Optimal Placement of Virtual Network Functions\" IEEE Infocom 2015  R. Cohen L. Lewin-Eytan J. S. Naor D. Raz \"Near Optimal Placement of Virtual Network Functions\" IEEE Infocom 2015","DOI":"10.1109\/INFOCOM.2015.7218511"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2815441"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2815436"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"B. Addis D. Belabed M. Bouet S. Secci \"Virtual Network Functions Placement and Routing Optimization\" Cloudnet 2015.  B. Addis D. Belabed M. Bouet S. Secci \"Virtual Network Functions Placement and Routing Optimization\" Cloudnet 2015.","DOI":"10.1109\/CloudNet.2015.7335301"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2621398"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/tnsm.2017.2711610"},{"key":"e_1_3_2_1_20_1","article-title":"Traffic-aware and Energy Efficient VNF Placement for Service Chaining: Joint Sampling and Matching Approach","author":"Ren N.H.","year":"2017","journal-title":"IEEE Trans. Services Computing"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2890631"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/080715421"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"S. Borst V. Gupta A. Walid \"Distributed Caching Algorithms for Content Distribution Networks\" IEEE Infocom 2010.  S. Borst V. Gupta A. Walid \"Distributed Caching Algorithms for Content Distribution Networks\" IEEE Infocom 2010.","DOI":"10.1109\/INFCOM.2010.5461964"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_26_1","unstructured":"https:\/\/cloud.google.com\/compute\/disks-image-pricing  https:\/\/cloud.google.com\/compute\/disks-image-pricing"},{"key":"e_1_3_2_1_27_1","unstructured":"https:\/\/rominirani.com\/google-cloud-functions-tutorial-pricing-9cc6dc47f7c0  https:\/\/rominirani.com\/google-cloud-functions-tutorial-pricing-9cc6dc47f7c0"},{"key":"e_1_3_2_1_28_1","unstructured":"https:\/\/cloud.google.com\/compute\/network-pricing  https:\/\/cloud.google.com\/compute\/network-pricing"},{"key":"e_1_3_2_1_29_1","unstructured":"https:\/\/www.dropbox.com\/s\/foya5jmchwxxdst\/mobihoc20.m?dl=0  https:\/\/www.dropbox.com\/s\/foya5jmchwxxdst\/mobihoc20.m?dl=0"}],"event":{"name":"Mobihoc '20: The Twenty-first ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","location":"Virtual Event USA","acronym":"Mobihoc '20","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"]},"container-title":["Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397166.3409149","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397166.3409149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:25Z","timestamp":1750200085000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397166.3409149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,11]]},"references-count":29,"alternative-id":["10.1145\/3397166.3409149","10.1145\/3397166"],"URL":"https:\/\/doi.org\/10.1145\/3397166.3409149","relation":{},"subject":[],"published":{"date-parts":[[2020,10,11]]},"assertion":[{"value":"2020-10-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}