{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T05:39:43Z","timestamp":1725946783113},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319748740"},{"type":"electronic","value":"9783319748757"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74875-7_3","type":"book-chapter","created":{"date-parts":[[2018,1,27]],"date-time":"2018-01-27T06:42:30Z","timestamp":1517035350000},"page":"27-40","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Service Chain Placement in SDNs"],"prefix":"10.1007","author":[{"given":"Gilad","family":"Kutiel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,28]]},"reference":[{"key":"3_CR1","unstructured":"Brown, G.: Service Chaining in Carrier Networks. Heavy Reading (2015)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Cohen, R., Lewin-Eytan, L., Naor, J., Raz, D.: Near optimal placement of virtual network functions. In: 34th IEEE Conference on Computer Communications, pp. 1346\u20131354 (2015)","DOI":"10.1109\/INFOCOM.2015.7218511"},{"key":"3_CR3","unstructured":"ETSI: Network Functions Virtualisation: An Introduction, Benefits, Enablers, Challenges & Call for Action, October 2012"},{"key":"3_CR4","unstructured":"ETSI: Network Functions Virtualisation (NFV); Ecosystem; Report on SDN Usage in NFV Architectual Framework, December 2015"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-319-49259-9_11","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"G Even","year":"2016","unstructured":"Even, G., Medina, M., Patt-Shamir, B.: On-line path computation and function placement in SDNs. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 131\u2013147. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_11"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-319-48314-6_24","volume-title":"Structural Information and Communication Complexity","author":"G Even","year":"2016","unstructured":"Even, G., Rost, M., Schmid, S.: An approximation algorithm for path computation and function placement in SDNs. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 374\u2013390. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48314-6_24"},{"key":"3_CR7","volume-title":"Algorithmic Combinatorics","author":"S Even","year":"1973","unstructured":"Even, S.: Algorithmic Combinatorics. Macmillan Inc., New York (1973)"},{"key":"3_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Gember-Jacobson, A., Viswanathan, R., Prakash, C., Grandl, R., Khalid, J., Das, S., Akella, A.: OpenNF: enabling innovation in network function control. In: ACM SIGCOMM, pp. 163\u2013174 (2014)","DOI":"10.1145\/2619239.2626313"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Hartert, R., Vissicchio, S., Schaus, P., Bonaventure, O., Filsfils, C., Telkamp, T., Fran\u00e7ois, P.: A declarative and expressive approach to control forwarding paths in carrier-grade networks. In: ACM SIGCOMM, pp. 15\u201328 (2015)","DOI":"10.1145\/2829988.2787495"},{"issue":"1","key":"3_CR11","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/JPROC.2014.2371999","volume":"103","author":"D Kreutz","year":"2015","unstructured":"Kreutz, D., Ramos, F.M.V., Ver\u00edssimo, P.J.E., Rothenberg, C.E., Azodolmolky, S., Uhlig, S.: Software-defined networking: a comprehensive survey. Proc. IEEE 103(1), 14\u201376 (2015)","journal-title":"Proc. IEEE"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-25258-2_8","volume-title":"Structural Information and Communication Complexity","author":"T Lukovszki","year":"2015","unstructured":"Lukovszki, T., Schmid, S.: Online admission control and embedding of service chains. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 104\u2013118. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25258-2_8"},{"key":"3_CR13","unstructured":"Rost, M., Schmid, S.: Service chain and virtual network embeddings: Approximations using randomized rounding. Technical report abs\/1604.02180, CoRR (2016)"},{"issue":"2","key":"3_CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/356689.356692","volume":"9","author":"R Sedgewick","year":"1977","unstructured":"Sedgewick, R.: Permutation generation methods. ACM Comput. Surv. 9(2), 137\u2013164 (1977)","journal-title":"ACM Comput. Surv."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Soul\u00e9, R., Basu, S., Marandi, P.J., Pedone, F., Kleinberg, R.D., Sirer, E.G., Foster, N.: Merlin: a language for provisioning network resources. In: 10th ACM International on Conference on emerging Networking Experiments and Technologies, pp. 213\u2013226 (2014)","DOI":"10.1145\/2674005.2674989"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74875-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T21:43:50Z","timestamp":1570657430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-74875-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319748740","9783319748757"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74875-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}