{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:53:18Z","timestamp":1782834798249,"version":"3.54.5"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319492582","type":"print"},{"value":"9783319492599","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49259-9_11","type":"book-chapter","created":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T21:11:34Z","timestamp":1478034694000},"page":"131-147","source":"Crossref","is-referenced-by-count":12,"title":["On-Line Path Computation and Function Placement in SDNs"],"prefix":"10.1007","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moti","family":"Medina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boaz","family":"Patt-Shamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,11,3]]},"reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing, machine scheduling. J. ACM 44(3), 486\u2013504 (1997)","journal-title":"J. ACM"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: Proceedings of the 34th IEEE Annual Symposium on Foundations of Computer Science, pp. 32\u201340 (1993)","DOI":"10.1109\/SFCS.1993.366884"},{"issue":"3","key":"11_CR3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1006\/jcss.1999.1662","volume":"62","author":"B Awerbuch","year":"2001","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S., Waarts, O.: Competitive routing of virtual circuits with unknown duration. J. Comput. Syst. Sci. 62(3), 385\u2013397 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.S.: Improved bounds for online routing and packing via a primal-dual approach. In: 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 293\u2013304 (2006)","DOI":"10.1109\/FOCS.2006.39"},{"issue":"2","key":"11_CR5","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1287\/moor.1080.0363","volume":"34","author":"N Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.S.: Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2), 270\u2013286 (2009)","journal-title":"Math. Oper. Res."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, R., Lewin-Eytan, L., Naor, J.S., Raz, D.: Near optimal placement of virtual network functions. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 1346\u20131354, April 2015","DOI":"10.1109\/INFOCOM.2015.7218511"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-38016-7_3","volume-title":"Approximation and Online Algorithms","author":"G Even","year":"2013","unstructured":"Even, G., Medina, M.: Online multi-commodity flow with high demands. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 16\u201329. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38016-7_3"},{"key":"11_CR8","unstructured":"Even, G., Medina, M., Schaffrath, G., Schmid, S.: Competitive, deterministic embeddings of virtual networks. Theoret. Comput. Sci. 496, 184\u2013194 (2013). Distributed Computing and Networking (ICDCN 2012)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Even, G., Rost, M., Schmid, S.: An approximation algorithm for path computation and function placement in sdns. Appeared in SIROCCO (2016)","DOI":"10.1007\/978-3-319-48314-6_24"},{"key":"11_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Pearson, Boston (2006)","edition":"3"},{"key":"11_CR11","unstructured":"Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. Ph.D. thesis, Massachusetts Institute of Technology (1996)"},{"issue":"1","key":"11_CR12","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., Verissimo, E.P., Rothenberg, C.E., Azodolmolky, S., Uhlig, S.: Software-defined networking: a comprehensive survey. Proc. IEEE 103(1), 14\u201376 (2015)","journal-title":"Proc. IEEE"},{"issue":"2","key":"11_CR13","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Soul\u00e9, R., Basu, S., Kleinberg, R., Sirer, E.G., Foster, N.: Managing the network with merlin. In: Proceedings of the 12th ACM Workshop on Hot Topics in Networks, p. 24. ACM (2013)","DOI":"10.1145\/2535771.2535792"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Soul\u00e9, R., Basu, S., Marandi, P.J., Pedone, F., Kleinberg, R., Sirer, E.G., Foster, N.: Merlin: a language for provisioning network resources. In: Proceedings of the 10th ACM International Conference on emerging Networking Experiments and Technologies, pp. 213\u2013226. ACM (2014)","DOI":"10.1145\/2674005.2674989"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49259-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:34:37Z","timestamp":1498343677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49259-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319492582","9783319492599"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49259-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}