Towards Efficient Simulation of Large Scale P2P Networks
Tobias Hoßfeld, Andreas Binzenhöfer, Daniel Schlosser, Kolja Eger, Jens O. Oberender, Ivan Dedinski, Gerald Kunzmann · 2005
The algorithms and methods of the Peer-to-Peer (P2P) technology are often applied to networks and services with a demand for scalability. In contrast to traditional client/server architectures, an arbitrary large number of users, called peers, may participate in the network and use the service without losing any performance. In order to evaluate quantitatively and qualitatively such P2P services and their corresponding networks, different possibilities like analytical apporaches or simulative techniques can be used to improve the implementation of a simulation in general. This task is even more important for large scale P2P networks due to the number of peers, the state space of the P2P network, and the interactions and relationships between peers and states.