On the self-organization of a hybrid peer-to-peer system

Journal of Network and Computer Applications

Volumn 33, Issue 2, 2010, Pages 183-202

  Joung, Yuh Jzer ^a   Lin, Zhang Wen ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b Acer Inc   (Taiwan)

Author keywords

Hybrid overlay; Overlay construction; P2P; Structured overlay; Unstructured overlay

Indexed keywords

DECENTRALIZED ALGORITHMS; DYNAMIC ENVIRONMENTS; EFFICIENT ROUTING; EXISTING METHOD; FILE SHARING; GLOBAL KNOWLEDGE; HUMAN INTERVENTION; MAINTENANCE COST; OVERLAY CONSTRUCTION; OVERLAY TOPOLOGIES; PEER-TO-PEER SYSTEM; SELF-ORGANIZATIONS; STRUCTURED OVERLAYS; TARGET OBJECT; UNSTRUCTURED OVERLAYS;

CLIENT SERVER COMPUTER SYSTEMS; COST REDUCTION; GATEWAYS (COMPUTER NETWORKS); HYBRID SYSTEMS;

MAINTENANCE;

EID: 75149171756     PISSN: 10848045     EISSN: 10958592     Source Type: Journal    
DOI: 10.1016/j.jnca.2009.08.002     Document Type: Article

References (28)

1. Andersen D., Balakrishnan H., Kaashoek F., and Morris R. Resilient overlay networks. Proceedings of the eighteenth ACM symposium on operating systems principles (2001), ACM Press 131-145
2. Andrzejak A., and Xu Z. Scalable efficient range queries for grid information services. Proceedings of second international conference on peer-to-peer computing (2002), IEEE Computer Society 33-40
3. Chawathe Y., Ratnasamy S., Breslau L., Lanham N., and Shenker S. Making Gnutella-like P2P systems scalable. Proceedings of the 2003 conference on applications technologies architectures and protocols for computer communications (SIGCOMM) (2003), ACM Press 407-418
4. Cheng A.-H., and Joung Y.-J. Probabilistic file indexing and searching in unstructured peer-to-peer networks. Computer Networks 50 1 (2006) 106-127
5. Chung F.R.K., and Graham R.L. Erdos on graphs: his legacy of unsolved problems (1998), AK Peters, Ltd.
6. Ganesan P., Gummadi K., and Garcia-Molina H. Canon in G major: designing DHTs with hierarchical structure. Proceedings of the twenty-fourth international conference on distributed computing systems (2004), IEEE Computer Society 263-272
7. Garcés-Erice L., Biersack E.W., Ross K.W., Felber P.A., and Urvoy-Keller G. Hierarchical P2P systems. Proceedings of the ninth European conference on parallel processing science (Euro-Par). Lecture notes in computer science, vol. 2790 (2003), Springer, Berlin 1230-1239
8. 2: a two-layer chord for reducing maintenance overhead via heterogeneity. Computer Networks 51 3 (2007) 712-731
9. Kermarrec A.-M., Massouliè L., and Ganesh A.J. Probabilistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed Systems 14 3 (2003) 248-258
10. Kostoulas D, Psaltoulis D, Gupta I, Birman K, Demers A. Decentralized schemes for size estimation in large and dynamic groups. In: Proceeding of the 4th IEEE international symposium on network computing and applications (IEEE NCA), July 2005: p. 41-8.
11. Liben-Nowell D., Balakrishnan H., and Karger D.R. Analysis of the evolution of peer-to-peer systems. Proceedings of the twenty-first annual symposium on principles of distributed computing (2002), ACM Press 233-242
12. Liben-Nowell D., Balakrishnan H., and Karger D.R. Observations on the dynamic evolution of peer-to-peer networks. Proceedings of the first international workshop on peer-to-peer systems. Lecture notes in computer science, vol. 2429 (2002), Springer, Berlin 22-33
13. Loo BT, Huebsch R, Stoica I, Hellerstein JM. The case for a hybrid P2P search infrastructure. In: Proceedings of the 3rd international workshop on peer-to-peer systems, February 2004: p. 141-50.
14. Lu E.J.-L., Huang Y.-F., and Lu S.-C. Ml-chord: a multi-layered p2p resource sharing model. Journal of Network and Computer Applications 32 3 (2009) 578-588
15. Lv Q., Cao P., Cohen E., Li K., and Shenker S. Search and replication in unstructured peer-to-peer networks. Proceedings of the sixteenth international conference on supercomputing (2002), ACM Press 84-95
16. Malkhi D., Naor M., and Ratajczak D. Viceroy: a scalable and dynamic emulation of the butterfly. Proceedings of the twenty-first annual symposium on principles of distributed computing (2002), ACM Press 183-192
17. Maymounkov P., and Mazières D. Kademlia: a peer-to-peer information system based on the XOR metric. Proceedings of the first international workshop on peer-to-peer systems. Lecture notes in computer science, vol. 2429 (2002), Springer, Berlin 53-65
18. Mizrak A.T., Cheng Y., Kumar V., and Savage S. Structured superpeers: leveraging heterogeneity to provide constant-time lookup. Proceedings of the third IEEE workshop on internet applications (WIAPP) (2003), IEEE Computer Society 104-111
19. Ratnasamy S., Francis P., Handley M., Karp R., and Shenker S. A scalable content-addressable network. Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM) (2001), ACM Press 161-172
20. Reynolds P., and Vahdat A. Efficient peer-to-peer keyword searching. Proceedings of the international middleware conference (middleware). Lecture notes in computer science, vol. 2672 (2003), Springer, Berlin 21-40
21. Saroiu S, Gummadi PK, Gribble SD. A measurement study of peer-to-peer file sharing systems. In: Proceedings of the 2002 multimedia computing and networking. The International Society of Optical Engineering; January 2002.
22. Singh A., and Liu L. A hybrid topology architecture for P2P systems. Proceedings of the international conference on computer communications and networks (2004), IEEE Computer Society 475-480
23. Stoica I., Morris R., Karger D.R., Kaashoek M.F., and Balakrishnan H. Chord: a scalable peer-to-peer lookup service for Internet applications. Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM) (2001), ACM Press 149-160
24. Tian R., Xiong Y., Zhang Q., Li B., Zhao B.Y., and Li X. Hybrid overlay structure based on random walks. Proceedings of the fourth international workshop on peer-to-peer systems (2005), Springer, Berlin 152-162
25. Xu Z, Mahalingam M, Karlsson M. Turning heterogeneity into an advantage in overlay routing. In: Proceedings of twenty-second annual joint conference of the IEEE computer and communications societies (INFOCOM), March 30-April 3, 2003. p. 1499-509.
26. Yang B., and Garcia-Molina H. Improving search in peer-to-peer systems. Proceedings of the twenty-second international conference on distributed computing systems (2002), IEEE Computer Society 5-14
27. Zhang X.Y., Zhang Q., Zhang Z., Song G., and Zhu W. A construction of locality-aware overlay network: mOverlay and its performance. IEEE Journal on Selected Areas in Communications 22 1 (2004) 18-28
28. Zhao B.Y., Duan Y., Huang L., Joseph A.D., and Kubiatowicz J.D. Brocade: landmark routing on overlay networks. Proceedings of the first international workshop on peer-to-peer systems. Lecture notes in computer science, vol. 2429 (2002), Springer, Berlin 34-44