Abstract | ||
---|---|---|
One of the main issues in peer-to-peer file-sharing services is to ensure balanced transfers of data among peers. For instance, the popular eMule file-sharing client interface implements techniques based on a credit system and time modifiers, in order to guarantee a fair degree of contribution/reward, e.g., to prevent leeching. However, fixed heuristic modifiers may not be able to guarantee a fair treatment for every peer participating in the service. This paper introduces an optimized strategy to compute modifiers in order to promote cooperation among peers, while guaranteeing a suitable degree of fairness. Simulations are provided to compare the proposed mechanism to the standard one adopted by the popular eMule client interface. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1016/j.comcom.2008.04.005 | Computer Communications |
Keywords | Field | DocType |
p2p,Optimization,File-sharing,eMule,Credit system | Heuristic,Peer-to-peer,Data transmission,Computer science,Computer network,Equity (finance),File sharing | Journal |
Volume | Issue | ISSN |
31 | 16 | Computer Communications |
Citations | PageRank | References |
4 | 0.45 | 7 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
L. Caviglione | 1 | 241 | 30.89 |
Cristiano Cervellera | 2 | 226 | 23.63 |
Franco Davoli | 3 | 687 | 68.66 |
Filippo Aldo Grassia | 4 | 4 | 0.45 |