{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T18:15:12Z","timestamp":1769278512038,"version":"3.49.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/icin.2018.8401618","type":"proceedings-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T00:06:37Z","timestamp":1530576397000},"page":"1-8","source":"Crossref","is-referenced-by-count":25,"title":["Energy-efficient path allocation heuristic for service function chaining"],"prefix":"10.1109","author":[{"given":"Mohammad M.","family":"Tajiki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Salsano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Shojafar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Chiaraviglio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behzad","family":"Akbari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1","author":"rost","year":"2016","journal-title":"Service chain and virtual network embeddings Approximations using randomized rounding"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195719"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2668470"},{"key":"ref13","author":"grant","year":"2008","journal-title":"CVX MATLAB Software for Disciplined Convex Programming"},{"key":"ref14","year":"0","journal-title":"Abilene Network"},{"key":"ref15","author":"tajiki","year":"0","journal-title":"Joint Energy Efficient and QoS-aware Path Allocation and VNF Placement for Service Function Chaining (extended version)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/NFV-SDN.2016.7919482"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2017.02.011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICIN.2017.7899429"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/NFV-SDN.2016.7919472"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/978-3-319-48314-6_24","article-title":"An Approximation Algorithm for Path Computation and Function Placement in SDNs","author":"even","year":"2016","journal-title":"International Colloquium on structural information and communication complexity"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CNSM.2015.7367338"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.1600219RP"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00155"},{"key":"ref9","first-page":"1","author":"ghaznavi","year":"2016","journal-title":"Service function chaining simplified"}],"event":{"name":"2018 21st Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)","location":"Paris","start":{"date-parts":[[2018,2,19]]},"end":{"date-parts":[[2018,2,22]]}},"container-title":["2018 21st Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8392644\/8401570\/08401618.pdf?arnumber=8401618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T13:29:08Z","timestamp":1643203748000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8401618\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icin.2018.8401618","relation":{},"subject":[],"published":{"date-parts":[[2018,2]]}}}