DocumentCode :
2218728
Title :
Efficient massive sharing of content among peers
Author :
Triantaffflou, P. ; Xiruhaki, Chryssani ; Koubarakis, Manolis
Author_Institution :
Dept. of Electron. & Comput. Eng., Tech. Univ. of Crete, Chania, Greece
fYear :
2002
fDate :
2002
Firstpage :
681
Lastpage :
685
Abstract :
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request response times. This is a formidable challenge, given the requirement to respect the autonomy of peers, their heterogeneity in terms of processing and storage capacities, their different content contributions, the huge system scale, and the dynamic system environment. Our approach exploits the semantic categorization of published documents and constructs clusters of peers. We provide a formal formulation for the problem of load balancing in our setting and prove that it is NP-complete. We also present a greedy polynomial time algorithm that achieves nearly optimal load balancing as shown by our experimental results.
Keywords :
distributed processing; resource allocation; content contributions; dynamic system environment; global load balancing; greedy polynomial time algorithm; high performance peer-to-peer content sharing systems; huge system scale; nearly optimal load balancing; published documents; semantic categorization; short user-request response times; Centralized control; Computer applications; Delay; Design engineering; Distributed computing; High performance computing; Internet; Load management; Peer to peer computing; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems Workshops, 2002. Proceedings. 22nd International Conference on
Print_ISBN :
0-7695-1588-6
Type :
conf
DOI :
10.1109/ICDCSW.2002.1030847
Filename :
1030847
Link To Document :
بازگشت