{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:13Z","timestamp":1750306033673,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T00:00:00Z","timestamp":1515024000000},"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":["SIGBED Rev."],"published-print":{"date-parts":[[2018,1,4]]},"abstract":"<jats:p>Cloud computing technology provides the means to share physical resources among multiple users and data center tenants by exposing them as virtual resources. There is a strong industrial drive to use similar technology and concepts to provide timing sensitive services. One such is virtual networking services, so called services chains, which consist of several interconnected virtual network functions. This allows for the capacity to be scaled up and down by adding or removing virtual resources. In this work, we develop a model of a service chain and pose the dynamic allocation of resources as an optimization problem. We design and present a set of strategies to allot virtual network nodes in an optimal fashion subject to latency and buffer constraints.<\/jats:p>","DOI":"10.1145\/3177803.3177810","type":"journal-article","created":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T16:27:31Z","timestamp":1515083251000},"page":"39-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Cost minimization of network services with buffer and end-to-end deadline constraints"],"prefix":"10.1145","volume":"14","author":[{"given":"Victor","family":"Millnert","sequence":"first","affiliation":[{"name":"Lund University, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Bini","sequence":"additional","affiliation":[{"name":"Scuola Superiore Sant'Anna, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Eker","sequence":"additional","affiliation":[{"name":"Ericsson Research, Sweden and Lund University, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,1,4]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"ETSI \"Network Functions Virtualization (NFV) \" https:\/\/portal.etsi.org\/nfv\/nfv_white_paper.pdf October 2012.  ETSI \"Network Functions Virtualization (NFV) \" https:\/\/portal.etsi.org\/nfv\/nfv_white_paper.pdf October 2012."},{"key":"e_1_2_1_2_1","unstructured":"ETSI \"Network Functions Virtualization (NFV); Use Cases \" October 2013.  ETSI \"Network Functions Virtualization (NFV); Use Cases \" October 2013."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522716"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391238"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2015.33"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01088593"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/EMRTS.2003.1212721"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.04.002"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1994.342714"},{"key":"e_1_2_1_10_1","unstructured":"S. Jiang \"A decoupled scheduling approach for distributed real-time embedded automotive systems \" in Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium 2006 pp. 191--198.  S. Jiang \"A decoupled scheduling approach for distributed real-time embedded automotive systems \" in Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium 2006 pp. 191--198."},{"key":"e_1_2_1_11_1","volume-title":"USA","author":"Serreli N.","year":"2009","unstructured":"N. Serreli , G. Lipari , and E. Bini , \" Deadline assignment for component-based analysis of real-time transactions,\" in 2nd Workshop on Compositional Real-Time Systems, Washington, DC , USA , Dec. 2009 . N. Serreli, G. Lipari, and E. Bini, \"Deadline assignment for component-based analysis of real-time transactions,\" in 2nd Workshop on Compositional Real-Time Systems, Washington, DC, USA, Dec. 2009."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2010.17"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2349494"},{"key":"e_1_2_1_14_1","first-page":"109","volume-title":"Rennes","author":"Rahni A.","year":"2008","unstructured":"A. Rahni , E. Grolleau , and M. Richard , \" Feasibility analysis of non-concrete real-time transactions with edf assignment priority,\" in Proceedings of the 16-th conference on Real-Time and Network Systems , Rennes , France , Oct. 2008 , pp. 109 -- 117 . A. Rahni, E. Grolleau, and M. Richard, \"Feasibility analysis of non-concrete real-time transactions with edf assignment priority,\" in Proceedings of the 16-th conference on Real-Time and Network Systems, Rennes, France, Oct. 2008, pp. 109--117."},{"key":"e_1_2_1_15_1","volume-title":"Queueing Systems","author":"Kleinrock L.","year":"1975","unstructured":"L. Kleinrock , Queueing Systems . John Wiley & Sons , 1975 . L. Kleinrock, Queueing Systems. John Wiley & Sons, 1975."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/EMRTS.2004.1311001"},{"key":"e_1_2_1_17_1","volume-title":"Synchronization and linearity","author":"Baccelli F.","year":"1992","unstructured":"F. Baccelli , G. Cohen , G. J. Olsder , and J.-P. Quadrat , Synchronization and linearity . Wiley New York , 1992 , vol. 3 . F. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat, Synchronization and linearity. Wiley New York, 1992, vol. 3."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61109"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.234856"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45318-0"},{"key":"e_1_2_1_21_1","first-page":"486","volume-title":"Automation and Test in Europe Conference and Exposition","author":"Chakraborty S.","year":"2005","unstructured":"S. Chakraborty and L. Thiele , \" A new task model for streaming applications and its schedulability analysis,\" in Design , Automation and Test in Europe Conference and Exposition , Mar. 2005 , pp. 486 -- 491 . S. Chakraborty and L. Thiele, \"A new task model for streaming applications and its schedulability analysis,\" in Design, Automation and Test in Europe Conference and Exposition, Mar. 2005, pp. 486--491."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/EWSDN.2015.63"},{"key":"e_1_2_1_23_1","first-page":"11","volume-title":"Cost minimization of network services with buffer and end-to-end deadline constraints","author":"Millnert V.","year":"2016","unstructured":"V. Millnert , J. Eker , and E. Bini , \" Cost minimization of network services with buffer and end-to-end deadline constraints ,\" p. 11 , 09 2016 . [Online]. Available: https:\/\/lup.lub.lu.se\/search\/publication\/8c7b837e-bca3-4375-bb9d-28ce6bbc889a V. Millnert, J. Eker, and E. Bini, \"Cost minimization of network services with buffer and end-to-end deadline constraints,\" p. 11, 09 2016. [Online]. Available: https:\/\/lup.lub.lu.se\/search\/publication\/8c7b837e-bca3-4375-bb9d-28ce6bbc889a"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICAC.2016.28"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177803.3177810","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3177803.3177810","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:02:54Z","timestamp":1750215774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177803.3177810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,4]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,1,4]]}},"alternative-id":["10.1145\/3177803.3177810"],"URL":"https:\/\/doi.org\/10.1145\/3177803.3177810","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2018,1,4]]},"assertion":[{"value":"2018-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}