Resource allocation in peer-to-peer networks

@article{Grothoff2003ResourceAI,
  title={Resource allocation in peer-to-peer networks},
  author={Christian Grothoff},
  journal={Wirtschaftsinformatik},
  year={2003},
  volume={45},
  pages={285-292}
}
  • C. Grothoff
  • Published 1 June 2003
  • Computer Science
  • Wirtschaftsinformatik
Resource allocation in peer-to-peer networks — An excess-based economic model This paper describes economic aspects of GNUnet, a peer-to-peer framework for anonymous distributed file-sharing. GNUnet is decentralized; all nodes are equal peers. In particular, there are no trusted entities in the network. This paper describes an economic model to perform resource allocation and defend against malicious participants in this context. The approach presented does not use credentials or payments… 
Fairness in Peer-to-Peer Networks
TLDR
A distributed resource allocation algorithm where peers control the service rate to its neighbours and ensures some form of fairness is proposed, based on the congestion pricing principle known from IP networks.
Bandwidth Trading in Unstructured P2P Content Distribution Networks
  • K. Eger, U. Killat
  • Computer Science, Business
    Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06)
  • 2006
TLDR
This work proposes two new trading schemes, which are based on pricing, one uses explicit price information whereas the other scheme uses the download rates from other peers as the price, and compares them with BitTorrent in simulations of static and dynamic networks.
ABIDE: A Bid-Based Economic Incentive Model for Enticing Non-cooperative Peers in Mobile-P2P Networks
TLDR
ABIDE is indeed effective in increasing the number of service-providers in M-P2P networks, thereby improving query response times and data availability, and the main contributions of ABIDE are effective data sharing among the peers.
Using heuristics to improve service portfolio selection in P2P grids
TLDR
The main contributions of this work are the use of heuristics to improve the average profit of peers and a study on the impact of some system characteristics on the heuristic behavior.
On the impact of choice in multi-service P2P grids
TLDR
It is shown that the received utility is strongly dependent of the offered services and how much different sets of offered services impact in the peer's utility.
Top-k query processing in mobile-P2P networks using economic incentive schemes
TLDR
The E-Top system for the efficient processing of top-k queries in mobile ad hoc peer to peer (M-P2P) networks using economic incentive schemes ETK and ETK+ is proposed and extended to propose a peer group-based economic incentive scheme ETG.
A Budget-Based Cost-Effective Incentive Model
TLDR
Simulations demonstrate that this budget-based incentive mechanism yields faster average download times and higher mean download rates compared with the tit-for-tat mechanism.
Smarter Heuristics for Business-Driven Services Selection in Multi-services P2P Grids
TLDR
A hill-climbing approach is used to design smarter heuristics that can provide more profitable selections, when compared to previously proposed ones, and can outperform the latter in as much as 281% in the most favourable settings when resources are plentiful.
When can an autonomous reputation scheme discourage free-riding in a peer-to-peer system?
TLDR
It is shown with simulations that for representative cases, a very simple autonomous reputation scheme works nearly as well at discouraging free-riding as an ideal reputation scheme.
...
...

References

SHOWING 1-10 OF 15 REFERENCES
A reputation-based approach for choosing reliable resources in peer-to-peer networks
TLDR
This work proposes a self-regulating system where the P2P network is used to implement a robust reputation mechanism, and a distributed polling algorithm by which resource requestors can assess the reliability of a resource offered by a participant before initiating the download.
Crowds: anonymity for Web transactions
TLDR
The design, implementation, security, performance, and scalability of the Crowds system for protecting users' anonymity on the world-wide-web are described and degrees of anonymity as an important tool for describing and proving anonymity properties are introduced.
P/sup 5/ : a protocol for scalable anonymous communication
TLDR
A novel feature of P/sup 5/ is that it allows individual participants to trade-off degree of anonymity for communication efficiency, and hence can be used to scalably implement large anonymous groups.
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
TLDR
Key peer-to-peer pioneers take us beyond the headlines and hype and show how the technology is changing the way the authors communicate and exchange information.
Efficient Sharing of Encrypted Data
TLDR
The main idea advocated in this paper is that simple cryptographic techniques are sufficient to engineer an efficient data encoding that can make it significantly harder to selectively censor information.
An analysis of using reflectors for distributed denial-of-service attacks
TLDR
This paper argues in conclusion in support of "reverse ITRACE" [Ba00] and for the utility of packet traceback techniques that work even for low volume flows, such as SPIE.
Free Riding on Gnutella
TLDR
It is argued that free riding leads to degradation of the system performance and adds vulnerability to the system, and copyright issues might become moot compared to the possible collapse of such systems.
Publius: a robust, tamper-evident, censorship-resistant web publishing system
TLDR
This work describes a system that has the property that it is very difficult for any adversary to censor or modify the content, and the identity of the publisher is protected once the content is posted.
gap - Practical Anonymous Networking
This paper describes how anonymity is achieved in gnunet, a framework for anonymous distributed and secure networking.
PayWord and MicroMint: Two Simple Micropayment Schemes
TLDR
Ve presents two simple micropayment schemes, "PayWord" and :'MicroMint," for making small purchases over the Internet, using hash operations instead whenever possible to minimize the number of public-key operations required per payment.
...
...