DocumentCode
3063251
Title
JSChord: A Peer-to-Peer System to Achieve Max Throughput
Author
Shao, Yifeng ; Hong, Feng ; Li, Minglu
Author_Institution
Shanghai Jiao Tong University
fYear
2005
fDate
05-08 Dec. 2005
Firstpage
395
Lastpage
399
Abstract
The variance of job size is a significant factor for designing peer-to-peer system which leads to the born of JSChord(Job Size based Chord). JSChord is a peerto- peer overlay constructed on Chord aimed to exploit the variance of job size. The fundamental idea of JSChord is to group several Chord rings together to distribute the jobs according to their size. JSChord has achieved better performance than Chord with its special routing algorithm as shown in the simulation.
Keywords
Application software; Computer applications; Computer science; Design engineering; Distributed computing; Peer to peer computing; Probability distribution; Routing; Throughput; Time sharing computer systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on
Print_ISBN
0-7695-2405-2
Type
conf
DOI
10.1109/PDCAT.2005.159
Filename
1578942
Link To Document