{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T00:01:14Z","timestamp":1755993674387,"version":"3.44.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5935174","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T10:59:10Z","timestamp":1310036350000},"page":"3236-3244","source":"Crossref","is-referenced-by-count":5,"title":["Cost effective resource allocation of overlay routing relay nodes"],"prefix":"10.1109","author":[{"given":"Rami","family":"Cohen","sequence":"first","affiliation":[{"name":"IBM Research - Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Raz","sequence":"additional","affiliation":[{"name":"Computer Science Department, Technion, IIT, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.178"},{"key":"ref11","article-title":"Efficient and Robust Routing of Highly Variable Traffic","author":"kodialam","year":"2004","journal-title":"HotNets -II"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2007433"},{"key":"ref13","article-title":"On the placement of web server replicas","author":"qiu","year":"2001","journal-title":"Proceedings of IEEE Infocom"},{"key":"ref14","article-title":"Constrained mirror placement on the internet","author":"cronin","year":"2001","journal-title":"Proceedings of IEEE Infocom"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref17","first-page":"27","article-title":"A local-ratio theorem for approximating the weighted vertex cover problem","volume":"25","author":"bar-yehuda","year":"1985","journal-title":"Annals of Discrete Mathematics"},{"key":"ref18","article-title":"Border gateway protocol 4","author":"rekhter","year":"1995","journal-title":"RFC 1771"},{"key":"ref19","article-title":"Scalable router configuration for the internet","author":"alaettinoglu","year":"1996","journal-title":"Proc of IEEE IC3N"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.09.012"},{"key":"ref28","article-title":"Routing policy specification language (rpsl)","author":"alaettinoglu","year":"1999","journal-title":"Internet RFC 2622"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/40.748796"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096546"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(97)00160-6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.234"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/316194.316233","article-title":"The end-to-end effects of internet path selection","author":"savage","year":"1999","journal-title":"Proc of ACM SIGCOMM"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916262"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/863969.863970"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502048"},{"key":"ref1","article-title":"Overlay tcp: Multi-hop overlay transport for high throughput transfers in the internet","author":"pucha","year":"2005","journal-title":"Tech Rep"},{"key":"ref9","article-title":"The extent of as path inflation by routing policies","author":"gao","year":"2002","journal-title":"IEEE Global Internet Symposium"},{"key":"ref20","article-title":"Interconnection, peering and settlement","author":"huston","year":"1999","journal-title":"Proc of INET"},{"key":"ref22","first-page":"547","article-title":"Inherently safe backup routing with bgp","author":"gao","year":"2001"},{"key":"ref21","first-page":"681","article-title":"Stable internet routing without global coordination","volume":"9","author":"gao","year":"2001"},{"year":"0","key":"ref24","article-title":"University of oregon route views projects"},{"key":"ref23","article-title":"ITU-T Recommendation G.114","author":"itu","year":"1993","journal-title":"International Telecommunication Union Tech Rep"},{"year":"0","key":"ref26","article-title":"Dimes ? distributed internet measurements and simulations"},{"year":"0","key":"ref25","article-title":"Internet routing registry"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","start":{"date-parts":[[2011,4,10]]},"location":"Shanghai, China","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05935174.pdf?arnumber=5935174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:10:38Z","timestamp":1755907838000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5935174\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5935174","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}