{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:09:32Z","timestamp":1648667372341},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2004,9]]},"abstract":"<jats:p> Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some serious challenges. In this paper, we propose an Efficient Clustered Super-Peer P2P architecture (ECSP) to overcome the scalability and efficiency problems of existing unstructured P2P system. With ECSP, peers are grouped into clusters according to their topological proximity, and super-peers are selected from regular peers to act as cluster leaders and service providers. These super-peers are also connected to each other, forming a backbone overlay network operating as a distinct, yet integrated, application. To maintain the dynamically adaptive overlay network and to manage the routing on it, we propose an application level broadcasting protocol: Efa. Applying only a small amount of information about the topology of a network, Efa is as simple as flooding, a conventional method used in unstructured P2P systems. By eliminating many duplicated messages, Efa is much more efficient and scalable than flooding, and furthermore, it is completely decentralized and self-organized. Our experimental results prove that ESCP architecture, combined with the super-peer backbone protocol, can generate impressive levels of performance and scalability. <\/jats:p>","DOI":"10.1142\/s0219265904001179","type":"journal-article","created":{"date-parts":[[2004,10,12]],"date-time":"2004-10-12T07:05:51Z","timestamp":1097564751000},"page":"279-298","source":"Crossref","is-referenced-by-count":8,"title":["AN EFFICIENT CLUSTERED ARCHITECTURE FOR P2P NETWORKS"],"prefix":"10.1142","volume":"05","author":[{"given":"JUAN","family":"LI","sequence":"first","affiliation":[{"name":"Computer Science Department, University of British Columbia, 2366 Main Mall, Vancouver, B.C., Canada V6T 1Z4, Canada"}]},{"given":"SON","family":"VUONG","sequence":"additional","affiliation":[{"name":"Computer Science Department, University of British Columbia, 2366 Main Mall, Vancouver, B.C., Canada V6T 1Z4, Canada"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume":"64","author":"Adamic L. A.","journal-title":"Phys. Rev. E"},{"key":"rf2","first-page":"509","author":"Barbasi A. L.","journal-title":"Science"},{"key":"rf5","author":"Lv Q.","journal-title":"Sigmetrics"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265904001179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:47:47Z","timestamp":1565185667000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265904001179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":3,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1142\/S0219265904001179"],"URL":"https:\/\/doi.org\/10.1142\/s0219265904001179","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}