{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:50:48Z","timestamp":1742385048203,"version":"3.40.1"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642259586"},{"type":"electronic","value":"9783642259593"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25959-3_8","type":"book-chapter","created":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T19:50:29Z","timestamp":1325447429000},"page":"106-121","source":"Crossref","is-referenced-by-count":19,"title":["Competitive and Deterministic Embeddings of Virtual Networks"],"prefix":"10.1007","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Medina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregor","family":"Schaffrath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S., Yeung, R.: Network information flow. IEEE Transactions on Information Theory\u00a046(4), 1204\u20131216 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"8_CR2","unstructured":"Andersen, D.: Theoretical approaches to node assignment (2009), http:\/\/www.cs.cmu.edu\/dga\/papers\/andersenassignabstract.html"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Arora, D., Bienkowski, M., Feldmann, A., Schaffrath, G., Schmid, S.: Online strategies for intra and inter provider service migration in virtual networks. In: Proc. Principles, Systems and Applications of IP Telecommunications, IPTComm (2011)","DOI":"10.1145\/2124436.2124449"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y.: Competitive multicast routing. Wirel. Netw.\u00a01 (1995)","DOI":"10.1007\/BF01196262"},{"key":"8_CR5","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: Proc. IEEE FOCS (1993)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/11561071_44","volume-title":"Algorithms \u2013 ESA 2005","author":"Y. Azar","year":"2005","unstructured":"Azar, Y., Zachut, R.: Packet Routing and Information Gathering in Lines, Rings and Trees. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 484\u2013495. Springer, Heidelberg (2005)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Bansal, N., Lee, K.-W., Nagarajan, V., Zafer, M.: Minimum congestion mapping in a cloud. In: Proc. ACM PODC, pp. 267\u2013276 (2011)","DOI":"10.1145\/1993806.1993854"},{"key":"8_CR8","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.S.: Improved bounds for online routing and packing via a primal-dual approach. In: Proc. IEEE FOCS (2006)","DOI":"10.1109\/FOCS.2006.39"},{"issue":"2-3","key":"8_CR10","first-page":"99","volume":"3","author":"N. Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.S.: The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science\u00a03(2-3), 99\u2013263 (2009)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","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.\u00a034(2), 270\u2013286 (2009)","journal-title":"Math. Oper. Res."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: An improved LP-based approximation for Steiner tree. In: Proc. ACM STOC, pp. 583\u2013592 (2010)","DOI":"10.1145\/1806689.1806769"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/net.20165","volume":"50","author":"C. Chekuri","year":"2007","unstructured":"Chekuri, C., Shepherd, F.B., Oriolo, G., Scutell\u00e1, M.G.: Hardness of robust network design. Netw.\u00a050(1), 50\u201354 (2007)","journal-title":"Netw."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Chowdhury, N.M., Boutaba, R.: A survey of network virtualization. Computer Networks (2009)","DOI":"10.1016\/j.comnet.2009.10.017"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Duffield, N., Goyal, P., Greenberg, A., Mishra, P., Ramakrishnan, K., van der Merive, J.: A flexible model for resource management in virtual private networks. In: Proc. SIGCOMM. ACM (1999)","DOI":"10.1145\/316188.316209"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Grandoni, F.: An improved approximation algorithm for virtual private network design. In: Proc. ACM SODA (2005)","DOI":"10.1007\/11523468_93"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Erlebach, T., Ruegg, M.: Optimal bandwidth reservation in hose-model VPNs with multi-path routing. In: Proc. IEEE INFOCOM, pp. 2275\u20132282 (2004)","DOI":"10.1109\/INFCOM.2004.1354650"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Fan, J., Ammar, M.H.: Dynamic topology configuration in service overlay networks: A study of reconfiguration policies. In: Proc. IEEE INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.139"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/jagm.1997.0866","volume":"24","author":"J.A. Fingerhut","year":"1997","unstructured":"Fingerhut, J.A., Suri, S., Turner, J.S.: Designing least-cost nonblocking broadband networks. J. Algorithms\u00a024(2), 287\u2013309 (1997)","journal-title":"J. Algorithms"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-642-14165-2_42","volume-title":"Automata, Languages and Programming","author":"F. Grandoni","year":"2010","unstructured":"Grandoni, F., Rothvo\u00df, T.: Network Design Via Core Detouring for Problems without a Core. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 490\u2013502. Springer, Heidelberg (2010)"},{"key":"8_CR21","unstructured":"Grewal, K., Budhiraja, S.: Performance evaluation of on-line hose model VPN provisioning algorithm. Advances in Computer Vision and Information Technology (2008)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proc. ACM STOC, pp. 365\u2013372 (2003)","DOI":"10.1145\/780542.780597"},{"issue":"6","key":"8_CR23","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.orl.2005.09.005","volume":"34","author":"G. Italiano","year":"2006","unstructured":"Italiano, G., Leonardi, S., Oriolo, G.: Design of trees in the hose model: the balanced case. Operations Research Letters\u00a034(6), 601\u2013606 (2006)","journal-title":"Operations Research Letters"},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica\u00a021(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"8_CR25","unstructured":"Juttner, A., Szabo, I., Szentesi, A.: On bandwidth efficiency of the hose resource management model in virtual private networks. In: Proc. IEEE INFOCOM (2003)"},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P. Klein","year":"1995","unstructured":"Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms\u00a019(1), 104\u2013115 (1995)","journal-title":"J. Algorithms"},{"issue":"4","key":"8_CR27","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1109\/TNET.2003.815302","volume":"11","author":"M. Kodialam","year":"2003","unstructured":"Kodialam, M., Lakshman, T., Sengupta, S.: Online multicast routing with bandwidth guarantees: a new approach using multicast network flow. IEEE\/ACM Transactions on Networking (TON)\u00a011(4), 676\u2013686 (2003)","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Kumar, A., Rastogi, R., Silberschatz, A., Yener, B.: Algorithms for provisioning virtual private networks in the hose model. IEEE\/ACM Trans. Netw.\u00a010(4) (2002)","DOI":"10.1109\/TNET.2002.802141"},{"issue":"4","key":"8_CR29","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s11235-006-6724-2","volume":"31","author":"Y. Liu","year":"2006","unstructured":"Liu, Y., Sun, Y., Chen, M.: MTRA: An on-line hose-model VPN provisioning algorithm. Telecommunication Systems\u00a031(4), 379\u2013398 (2006)","journal-title":"Telecommunication Systems"},{"key":"8_CR30","unstructured":"Schaffrath, G., Schmid, S., Feldmann, A.: Generalized and resource-efficient VNet embeddings with migrations. In: ArXiv Technical Report 1012.4066 (2010)"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Schaffrath, G., Werle, C., Papadimitriou, P., Feldmann, A., Bless, R., Greenhalgh, A., Wundsam, A., Kind, M., Maennel, O., Mathy, L.: Network virtualization architecture: Proposal and initial prototype. In: Proc. ACM VISA, pp. 63\u201372. ACM (2009)","DOI":"10.1145\/1592648.1592659"},{"issue":"1","key":"8_CR32","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(99)00192-9","volume":"235","author":"V.V. Vazirani","year":"2000","unstructured":"Vazirani, V.V.: Recent results on approximating the Steiner tree problem and its generalizations. Theor. Comput. Sci.\u00a0235(1), 205\u2013216 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Young, N.: Sequential and parallel algorithms for mixed packing and covering. In: Proc. 42nd IEEE FOCS (2001)","DOI":"10.1109\/SFCS.2001.959930"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Ammar, M.H.: Algorithms for assigning substrate network resources to virtual network components. In: Proc. IEEE\u00a0 INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.322"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25959-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T09:52:32Z","timestamp":1742205152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25959-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642259586","9783642259593"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25959-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}