{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:14:12Z","timestamp":1761401652912,"version":"3.44.0"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"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":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1109\/tnet.2013.2260867","type":"journal-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T14:02:52Z","timestamp":1370959372000},"page":"636-646","source":"Crossref","is-referenced-by-count":15,"title":["Cost-Effective Resource Allocation of Overlay Routing Relay Nodes"],"prefix":"10.1109","volume":"22","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":"Department of Computer Science, Technion, Israel Institue of Technology, Haifa, 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":"Proc HotNets-I"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2007433"},{"key":"ref13","first-page":"1587","article-title":"On the placement of Web server replicas","volume":"3","author":"qiu","year":"2001","journal-title":"Proc IEEE InfoCom"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916684"},{"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":"Ann Discrete Math"},{"journal-title":"?Border gateway protocol 4 ?","year":"1995","author":"rekhter","key":"ref18"},{"key":"ref19","article-title":"Scalable router configuration for the Internet","author":"alaettinoglu","year":"1996","journal-title":"Proc IEEE IC3N"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.234"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.09.012"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2622"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/40.748796"},{"key":"ref6","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 ACM Sigcomm"},{"journal-title":"?ITU-T recommendation G 114 ?","year":"1993","author":"itu","key":"ref29"},{"key":"ref5","first-page":"2180","article-title":"The extent of as path inflation by routing policies","volume":"3","author":"gao","year":"2002","journal-title":"Proc IEEE Globecom"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/863969.863970"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(97)00160-6"},{"key":"ref2","first-page":"131","article-title":"Resilient overlay networks","author":"andersen","year":"2001","journal-title":"Proc 18th ACM SOSP"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916262"},{"journal-title":"?Overlay TCP Multi-hop overlay transport for high throughput transfers in the Internet ?","year":"2005","author":"pucha","key":"ref1"},{"key":"ref20","article-title":"Interconnection, peering and settlement","volume":"2","author":"huston","year":"1999","journal-title":"Internet Protocol J"},{"key":"ref22","first-page":"547","article-title":"Inherently safe backup routing with BGP","author":"gao","year":"2001","journal-title":"Proc IEEE InfoCom"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"journal-title":"?Internet Routing Registry ?","year":"0","key":"ref24"},{"journal-title":"?University of Oregon Route Views project ?","year":"0","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096546"},{"journal-title":"?DIMES?Distributed Internet Measurements and Simulations ?","year":"0","key":"ref25"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/6799946\/06529198.pdf?arnumber=6529198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T01:08:30Z","timestamp":1755911310000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6529198\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":29,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2013.2260867","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2014,4]]}}}