{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T00:06:30Z","timestamp":1756339590914,"version":"3.44.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"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,6]]},"DOI":"10.1109\/iwqos.2011.5931242","type":"proceedings-article","created":{"date-parts":[[2011,6,29]],"date-time":"2011-06-29T15:15:44Z","timestamp":1309360544000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["On long-term social relationships in peer-to-peer systems"],"prefix":"10.1109","author":[{"given":"Haiyang","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computing Science, Simon Fraser University, British Columbia, Canada"}]},{"given":"Feng","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computing Science, Simon Fraser University, British Columbia, Canada"}]},{"given":"Jiangchuan","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computing Science, Simon Fraser University, British Columbia, Canada"}]}],"member":"263","reference":[{"year":"0","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2010.5510917"},{"key":"ref12","article-title":"One hop Reputations for Peer to Peer File Sharing Workloads","author":"piatek","year":"2008","journal-title":"Proc USENIX NSD"},{"key":"ref13","article-title":"The Failure of Possion Arriveal,&#x201D; Tech, Rep. School of Computing Science, Simon Fraser University, 2010","author":"wang","year":"2010","journal-title":"School of Computing Science Simon Fraser University Tech Rep"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1530","DOI":"10.1109\/TIT.2010.2103757","article-title":"Trace Representation and Linear Complexity of Binary eth Power Residue Sequences of Period p","volume":"57","author":"dai","year":"2011","journal-title":"Proceedings of the IEEE Transactions on Information Theory"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1109\/TC.1976.1674569","article-title":"Unified Matrix Treatment of the Fast Walsh-Hadamard Transform","volume":"c 25","author":"fino","year":"2006","journal-title":"Proceedings of the IEEE Transactions on Computers"},{"year":"0","key":"ref16"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1145\/1030194.1015508","article-title":"Modeling and Performance Analysis of Bit Torrent-Like Peer-to-Peer Networks","author":"qiu","year":"2004","journal-title":"Proc ACM Sigcomm"},{"key":"ref18","article-title":"Incentives Build Robustness in BitTorrent","author":"cohen","year":"2003","journal-title":"Workshop on Economics of Peer-to-Peer Systems"},{"key":"ref19","article-title":"The Evolution of Cooperation","author":"axelrod","year":"1985","journal-title":"Basic Books"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062028"},{"key":"ref27","article-title":"Strange Bedfellows: Community Identification in BitTorrent","author":"choffnes","year":"2010","journal-title":"Proc USENIX IPTPS"},{"key":"ref3","article-title":"BitTorrent Darknets","author":"dhungel","year":"2010","journal-title":"Proc IEEE InfoCom"},{"year":"0","key":"ref6"},{"key":"ref5","first-page":"74","article-title":"Classification of Random Binary Sequences Using Walsh-Fourier Analysis","volume":"13","author":"fino","year":"1971","journal-title":"Proceedings of the IEEE Transactions on Electromagnetic Compatibility EMC"},{"key":"ref8","article-title":"Do Incentives Build Robustness in BitTorrent?","author":"piatek","year":"2007","journal-title":"Proc USENIX NSDI"},{"year":"0","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1080192.1080198"},{"year":"0","key":"ref9"},{"key":"ref1","article-title":"Free Riding in BitTorrent is Cheap","author":"locher","year":"2006","journal-title":"Proc ACM HotNets"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.328"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934933"},{"key":"ref21","article-title":"BitTorrent-like File Sharing Protocol Design","author":"fan","year":"2006","journal-title":"Proc ICNP"},{"key":"ref24","article-title":"Public and Private BitTorrent Communities: A measurement Study","author":"meulpolder","year":"2010","journal-title":"Proc USENIX IPTPS"},{"key":"ref23","article-title":"Exploiting BitTorrent for fun (but not profit)","author":"liogkas","year":"2006","journal-title":"Proc USENIX IPTPS"},{"key":"ref26","article-title":"One hop Reputations for Peer to Peer File Sharing Workloads","author":"piatek","year":"2008","journal-title":"Proc USENIX NSDI"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1330107.1330113"}],"event":{"name":"2011 IEEE 19th International Workshop on Quality of Service (IWQoS)","start":{"date-parts":[[2011,6,6]]},"location":"San Jose, CA, USA","end":{"date-parts":[[2011,6,7]]}},"container-title":["2011 IEEE Nineteenth IEEE International Workshop on Quality of Service"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888726\/5931241\/05931242.pdf?arnumber=5931242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T18:25:05Z","timestamp":1756319105000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5931242\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/iwqos.2011.5931242","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}