{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T10:48:09Z","timestamp":1673002089834},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/tnet.2011.2129528","type":"journal-article","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T20:22:36Z","timestamp":1302294156000},"page":"1624-1637","source":"Crossref","is-referenced-by-count":5,"title":["Selfish Overlay Network Creation and Maintenance"],"prefix":"10.1109","volume":"19","author":[{"given":"Georgios","family":"Smaragdakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Laoutaris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Lekakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azer","family":"Bestavros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John W.","family":"Byers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mema","family":"Roussopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"165","article-title":"A bounded-degree network formation game","author":"laoutaris","year":"2008","journal-title":"Proc ACM PODC"},{"key":"ref38","author":"smaragdakis","year":"2009","journal-title":"Overlay network creation and maintenance with selfish users"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1882"},{"key":"ref32","author":"mirchandani","year":"1990","journal-title":"Discrete Location Theory"},{"key":"ref31","author":"osborne","year":"1994","journal-title":"A Course in Game Theory"},{"key":"ref30","first-page":"297","article-title":"Analyzing multiple file downloading in BitTorrent","author":"tian","year":"2006","journal-title":"Proc ICPP"},{"key":"ref37","first-page":"771","article-title":"<formula formulatype=\"inline\"> <tex Notation=\"TeX\">$\\epsilon$<\/tex><\/formula>-approximations with minimum packing constraint violation","author":"lin","year":"1992","journal-title":"Proc ACM STOC"},{"key":"ref36","first-page":"2","article-title":"Primal-dual approximation algorithms for metric facility location and <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex> <\/formula>-median problems","author":"jain","year":"1999","journal-title":"Proc IEEE FOCS"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1100"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.48"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2006.320196"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498539"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1544012.1544018"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.64"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872088"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281142"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073833"},{"key":"ref24","article-title":"Improving reliability of selfish overlay networks","author":"rocha","year":"2006","journal-title":"Proc WWW"},{"key":"ref23","first-page":"1329","article-title":"Characterizing selfishly constructed overlay routing networks","volume":"2","author":"chun","year":"2004","journal-title":"Proc IEEE InfoCom"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.01.005"},{"key":"ref25","author":"archer","year":"2000","journal-title":"Inapproximability of the asymmetric facility location and -median problems"},{"key":"ref50","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","article-title":"Worst-case equilibria","author":"koutsoupias","year":"1999","journal-title":"Proc STACS"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.57"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.61"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1273445.1273449"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.23"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945473"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2007434"},{"key":"ref40","first-page":"346","article-title":"BRITE: An approach to universal topology generation","author":"medina","year":"2001","journal-title":"Proc IEEE MASCOT"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1341431.1341442"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1403002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863974"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988788"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/570810.570812"},{"key":"ref19","article-title":"Network coordinates in the wild","author":"ledlie","year":"2007","journal-title":"Proc USENIX\/ACM NSDI"},{"key":"ref4","first-page":"131","article-title":"Resilient overlay networks","author":"andersen","year":"2001","journal-title":"Proc ACM SOSP"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/40.748796"},{"key":"ref6","first-page":"14","article-title":"Reliability and security in the CoDeeN content distribution network","author":"wang","year":"2004","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1252853"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"ref7","article-title":"Incentives build robustness in BitTorrent","author":"cohen","year":"2003","journal-title":"Proc 1st Workshop Econ Peer-to-Peer Syst"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2003-00095-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945474"},{"key":"ref46","first-page":"306","article-title":"Comparison of public end-to-end bandwidth estimation tools on high-speed links","author":"shriram","year":"2005","journal-title":"Proc PAM"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354512"},{"key":"ref48","author":"deo","year":"1994","journal-title":"Graph Theory with Applications to Engineering and Computer Science"},{"key":"ref47","article-title":"pathChirp: Efficient available bandwidth estimation for network paths","author":"ribeiro","year":"2003","journal-title":"Proc PAM"},{"key":"ref42","first-page":"43","article-title":"Toward a measurement-based geographic location service","author":"ziviani","year":"2004","journal-title":"Proc PAM"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barabsi","year":"1999","journal-title":"Science"},{"key":"ref44","first-page":"10","article-title":"Handling churn in a DHT","author":"rhea","year":"2004","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159931"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/6104251\/05746552.pdf?arnumber=5746552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:50:12Z","timestamp":1633909812000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5746552\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":54,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2011.2129528","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}