{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:15:27Z","timestamp":1730272527702,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1109\/iscc.2009.5202231","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:08:22Z","timestamp":1251112102000},"page":"128-134","source":"Crossref","is-referenced-by-count":0,"title":["PeerStar: An attractive alternative to existing peer-to-peer topologies"],"prefix":"10.1109","author":[{"given":"H.","family":"Shafiei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"Aghazadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Khonsari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ould-Khaoua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Super star A new optimally fault tolerant network","year":"1990","author":"sur","key":"19"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/71.262586"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/71.262593"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/12.45203"},{"key":"16","first-page":"393","article-title":"the star graph: an attractive alternative to the n-cube","author":"akers","year":"1987","journal-title":"Proc Int l Conf Parallel Processing"},{"key":"13","first-page":"167","article-title":"broose: a practical distributed hash table based on the de bruijn topology","author":"gai","year":"2004","journal-title":"Proc of the International Conference on Peer-to-Peer Computing"},{"key":"14","first-page":"1677","article-title":"fissione: a scalable constant degree and low congestion dht scheme based on kautz graphs","volume":"3","author":"li","year":"2005","journal-title":"Proc of IEEE INFOCOM"},{"key":"11","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-540-45172-3_9","article-title":"koorde: a simple degree-optimal distributed hash table","author":"kaashoek","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"key":"12","first-page":"65","article-title":"d2b: a de bruijn based contentaddressable network","volume":"355","author":"fraigniaud","year":"2006","journal-title":"Journal of Theoretical"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780626"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.1991.183999"},{"key":"22","first-page":"349","article-title":"network resilience of star graphs: a comparative analysis","author":"najjar","year":"1991","journal-title":"Proc of annual conference on Computer Science"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3174"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/12.247843"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/12.641930"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/71.640011"},{"journal-title":"PeerSim","year":"0","key":"27"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.857072"},{"key":"2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TNET.2002.808407","article-title":"chord: a scalable peer-to-peer lookup protocol for internet applications","volume":"11","author":"stoica","year":"2002","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.01.004"},{"year":"0","key":"1"},{"key":"7","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","article-title":"pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems","volume":"2218","author":"rowstron","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2005.1610546"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/777417.777421"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.101"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818805"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571857"}],"event":{"name":"2009 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2009,7,5]]},"location":"Sousse","end":{"date-parts":[[2009,7,8]]}},"container-title":["2009 IEEE Symposium on Computers and Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179146\/5202209\/05202231.pdf?arnumber=5202231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T23:56:39Z","timestamp":1553817399000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5202231\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/iscc.2009.5202231","relation":{},"subject":[],"published":{"date-parts":[[2009,7]]}}}