{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:32Z","timestamp":1750308752975,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p>In this paper, we consider the fairness issue of BT and tackle the problem with a general framework using proactive topology adaptations. The topology formed possesses a special link-level homogeneity property with each peer having the same capacity per out-degree value. Such property guarantees that each directional link has the same uploading bandwidth. Together with the Tit-for-Tat policy, peers upload and download at the same rate over each connection and therefore achieve fairness.<\/jats:p>","DOI":"10.1145\/1215956.1215962","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:52:18Z","timestamp":1175802738000},"page":"9-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Media overlay construction via a Markov chain Monte Carlo method"],"prefix":"10.1145","volume":"34","author":[{"given":"Hao","family":"Luan","sequence":"first","affiliation":[{"name":"ECE, H.K.U.S.T., Clear Water Bay, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny H. K.","family":"Tsang","sequence":"additional","affiliation":[{"name":"ECE, H.K.U.S.T., Clear Water Bay, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kin Wah","family":"Kwong","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,12]]},"reference":[{"volume-title":"Proceedings of IEEE HPSR 2005","author":"Kwong D. H. K.","key":"e_1_2_1_1_1","unstructured":"K. W. Kwong , D. H. K. Tsang , \"On the Relationship of Node Capacity Distribution and P2 P Topology Formation \". In Proceedings of IEEE HPSR 2005 K. W. Kwong, D. H. K. Tsang, \"On the Relationship of Node Capacity Distribution and P2P Topology Formation\". In Proceedings of IEEE HPSR 2005"},{"volume-title":"Proceedings of IEEE Infocom 2004","author":"Yang G.","key":"e_1_2_1_2_1","unstructured":"X. Yang and G. de Veciana , \"Service capacity in peer-to-peer networks \", In Proceedings of IEEE Infocom 2004 X. Yang and G. de Veciana, \"Service capacity in peer-to-peer networks\", In Proceedings of IEEE Infocom 2004"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015508"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"A. R. Bharambe C. Herley and V. N. Padmanabhan \"Analyzing and Improving BitTorrent Performance \" In Proceedings of IEEE Infocom 2006  A. R. Bharambe C. Herley and V. N. Padmanabhan \"Analyzing and Improving BitTorrent Performance \" In Proceedings of IEEE Infocom 2006","DOI":"10.1109\/INFOCOM.2006.328"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2006.320217"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"K. W. Kwong D. H. K. Tsang \"Application-aware Topology Formation Algorithm for Peer-to-Peer Networks\" Submitted 2006  K. W. Kwong D. H. K. Tsang \"Application-aware Topology Formation Algorithm for Peer-to-Peer Networks\" Submitted 2006","DOI":"10.1109\/ICC.2007.21"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1215956.1215962","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1215956.1215962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:22Z","timestamp":1750278142000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1215956.1215962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1145\/1215956.1215962"],"URL":"https:\/\/doi.org\/10.1145\/1215956.1215962","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2006,12]]},"assertion":[{"value":"2006-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}