{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:42:52Z","timestamp":1720201372871},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,7,23]],"date-time":"2017-07-23T00:00:00Z","timestamp":1500768000000},"content-version":"vor","delay-in-days":1483,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1016\/j.tcs.2012.10.036","type":"journal-article","created":{"date-parts":[[2012,10,31]],"date-time":"2012-10-31T04:15:31Z","timestamp":1351656931000},"page":"184-194","source":"Crossref","is-referenced-by-count":18,"special_numbering":"C","title":["Competitive and deterministic embeddings of virtual networks"],"prefix":"10.1016","volume":"496","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[]},{"given":"Moti","family":"Medina","sequence":"additional","affiliation":[]},{"given":"Gregor","family":"Schaffrath","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.tcs.2012.10.036_br000005","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","article-title":"Network information flow","volume":"46","author":"Ahlswede","year":"2000","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.tcs.2012.10.036_br000010","unstructured":"D. Andersen, Theoretical approaches to node assignment, http:\/\/www.cs.cmu.edu\/~dga\/papers\/andersenassignabstract.html, 2002."},{"issue":"3","key":"10.1016\/j.tcs.2012.10.036_br000015","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","article-title":"On-line routing of virtual circuits with applications to load balancing and machine scheduling","volume":"44","author":"Aspnes","year":"1997","journal-title":"Journal of the ACM (JACM)"},{"key":"10.1016\/j.tcs.2012.10.036_br000020","first-page":"1","article-title":"Competitive multicast routing","author":"Awerbuch","year":"1995","journal-title":"Wireless Networks"},{"key":"10.1016\/j.tcs.2012.10.036_br000025","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, S. Plotkin, Throughput-competitive on-line routing, in: Proc. IEEE FOCS, 1993.","DOI":"10.1109\/SFCS.1993.366884"},{"issue":"3","key":"10.1016\/j.tcs.2012.10.036_br000030","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1006\/jcss.1999.1662","article-title":"Competitive routing of virtual circuits with unknown duration","volume":"62","author":"Awerbuch","year":"2001","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.tcs.2012.10.036_br000035","doi-asserted-by":"crossref","unstructured":"Y. Azar, R. Zachut, Packet routing and information gathering in lines, rings and trees, in: Proc. ESA, 2005, pp. 484\u2013495.","DOI":"10.1007\/11561071_44"},{"key":"10.1016\/j.tcs.2012.10.036_br000040","doi-asserted-by":"crossref","unstructured":"N. Bansal, K.-W. Lee, V. Nagarajan, M. Zafer, Minimum congestion mapping in a cloud, in: Proc. ACM PODC, 2011, pp. 267\u2013276.","DOI":"10.1145\/1993806.1993854"},{"key":"10.1016\/j.tcs.2012.10.036_br000045","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/j.tcs.2012.10.036_br000050","doi-asserted-by":"crossref","unstructured":"N. Buchbinder, J.S. Naor, Improved bounds for online routing and packing via a primal\u2013dual approach, in: Proc. IEEE FOCS, 2006.","DOI":"10.1109\/FOCS.2006.39"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2012.10.036_br000055","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1561\/0400000024","article-title":"The design of competitive online algorithms via a primal\u2013dual approach","volume":"3","author":"Buchbinder","year":"2009","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"issue":"2","key":"10.1016\/j.tcs.2012.10.036_br000060","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1287\/moor.1080.0363","article-title":"Online primal\u2013dual algorithms for covering and packing","volume":"34","author":"Buchbinder","year":"2009","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.tcs.2012.10.036_br000065","doi-asserted-by":"crossref","unstructured":"J. Byrka, F. Grandoni, T. Rothvo\u00df, L. Sanit\u00e0, An improved LP-based approximation for Steiner tree, in: Proc. ACM STOC, 2010, pp. 583\u2013592.","DOI":"10.1145\/1806689.1806769"},{"issue":"1","key":"10.1016\/j.tcs.2012.10.036_br000070","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.20165","article-title":"Hardness of robust network design","volume":"50","author":"Chekuri","year":"2007","journal-title":"Networks"},{"key":"10.1016\/j.tcs.2012.10.036_br000075","article-title":"A survey of network virtualization","author":"Chowdhury","year":"2009","journal-title":"Computer Networks"},{"key":"10.1016\/j.tcs.2012.10.036_br000080","series-title":"Proc. SIGCOMM","article-title":"A flexible model for resource management in virtual private networks","author":"Duffield","year":"1999"},{"key":"10.1016\/j.tcs.2012.10.036_br000085","doi-asserted-by":"crossref","unstructured":"F. Eisenbrand, F. Grandoni, An improved approximation algorithm for virtual private network design, in: Proc. ACM SODA, 2005.","DOI":"10.1007\/11523468_93"},{"key":"10.1016\/j.tcs.2012.10.036_br000090","doi-asserted-by":"crossref","unstructured":"T. Erlebach, M. Ruegg, Optimal bandwidth reservation in hose-model VPNs with multi-path routing, in: Proc. IEEE INFOCOM, 2004, pp. 2275\u20132282.","DOI":"10.1109\/INFCOM.2004.1354650"},{"key":"10.1016\/j.tcs.2012.10.036_br000095","unstructured":"G. Even, M. Medina, Online multi-commodity flow with high demands. Manuscript (see: www.eng.tau.ac.il\/~medinamo)."},{"key":"10.1016\/j.tcs.2012.10.036_br000100","doi-asserted-by":"crossref","unstructured":"J. Fan, M.H. Ammar, 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":"10.1016\/j.tcs.2012.10.036_br000105","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/jagm.1997.0866","article-title":"Designing least-cost nonblocking broadband networks","volume":"24","author":"Fingerhut","year":"1997","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.tcs.2012.10.036_br000110","doi-asserted-by":"crossref","unstructured":"F. Grandoni, T. Rothvoss, Network design via core detouring for problems without a core, in: Proc. ICALP, 2010.","DOI":"10.1007\/978-3-642-14165-2_42"},{"key":"10.1016\/j.tcs.2012.10.036_br000115","article-title":"Performance evaluation of on-line hose model VPN provisioning algorithm","author":"Grewal","year":"2008","journal-title":"Advances in Computer Vision and Information Technology"},{"key":"10.1016\/j.tcs.2012.10.036_br000120","doi-asserted-by":"crossref","unstructured":"A. Gupta, A. Kumar, T. Roughgarden, Simpler and better approximation algorithms for network design, in: Proc. ACM STOC, 2003, pp. 365\u2013372.","DOI":"10.1145\/780542.780597"},{"issue":"6","key":"10.1016\/j.tcs.2012.10.036_br000125","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/j.orl.2005.09.005","article-title":"Design of trees in the hose model: the balanced case","volume":"34","author":"Italiano","year":"2006","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.tcs.2012.10.036_br000130","doi-asserted-by":"crossref","unstructured":"A. Juttner, I. Szabo, A. Szentesi, On bandwidth efficiency of the hose resource management model in virtual private networks, in: Proc. IEEE INFOCOM, 2003.","DOI":"10.1109\/INFCOM.2003.1208690"},{"issue":"1","key":"10.1016\/j.tcs.2012.10.036_br000135","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1006\/jagm.1995.1029","article-title":"A nearly best-possible approximation algorithm for node-weighted Steiner trees","volume":"19","author":"Klein","year":"1995","journal-title":"Journal of Algorithms"},{"issue":"4","key":"10.1016\/j.tcs.2012.10.036_br000140","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TNET.2003.815302","article-title":"Online multicast routing with bandwidth guarantees: a new approach using multicast network flow","volume":"11","author":"Kodialam","year":"2003","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"issue":"4","key":"10.1016\/j.tcs.2012.10.036_br000145","doi-asserted-by":"crossref","DOI":"10.1109\/TNET.2002.802141","article-title":"Algorithms for provisioning virtual private networks in the hose model","volume":"10","author":"Kumar","year":"2002","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"4","key":"10.1016\/j.tcs.2012.10.036_br000150","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s11235-006-6724-2","article-title":"MTRA: an on-line hose-model VPN provisioning algorithm","volume":"31","author":"Liu","year":"2006","journal-title":"Telecommunication Systems"},{"key":"10.1016\/j.tcs.2012.10.036_br000155","series-title":"Proc. ACM VISA","first-page":"63","article-title":"Network virtualization architecture: proposal and initial prototype","author":"Schaffrath","year":"2009"},{"issue":"1","key":"10.1016\/j.tcs.2012.10.036_br000160","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0304-3975(99)00192-9","article-title":"Recent results on approximating the Steiner tree problem and its generalizations","volume":"235","author":"Vazirani","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2012.10.036_br000165","doi-asserted-by":"crossref","unstructured":"N. Young, Sequential and parallel algorithms for mixed packing and covering, in: Proc. 42nd IEEE FOCS, 2001.","DOI":"10.1109\/SFCS.2001.959930"},{"key":"10.1016\/j.tcs.2012.10.036_br000170","doi-asserted-by":"crossref","unstructured":"Y. Zhu, M.H. Ammar, Algorithms for assigning substrate network resources to virtual network components, in: Proc. IEEE INFOCOM, 2006.","DOI":"10.1109\/INFOCOM.2006.322"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512009577?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512009577?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T23:52:52Z","timestamp":1562284372000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397512009577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":34,"alternative-id":["S0304397512009577"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.tcs.2012.10.036","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}
