Open Access Open Access  Restricted Access Subscription or Fee Access

Empirical Study of Peer to Peer Network Simulators

Kaushik H. Raviya, Prashant M. Jadav, C.K. Bhensdadia


Peer-to-Peer (P2P) systems have become an important part of the internet; millions of users have been attracted to use their structure and services. A P2P system can be defined as a distributed network architecture, whereby participants share a part of their own hardware resources such as processing power, storage capacity, or network bandwidth. The service or content provided by the P2P network is accessible by other peers directly, without passing intermediary entities. A simulation is an attempt to model a system in order to study it scientifically. Simulator tools are widely used for investigating overlay networks and peer-to-peer (P2P) applications. Simulating P2P overlay networks is a common problem for researchers and developers because P2P systems can consist of million of nodes and they are dynamic in nature. So simulation for such a large dynamic network is difficult due to technical constraints even on the most powerful machines. In this paper we focus on survey and comparison of different P2P simulators by taking some important criteria viz., architecture, usability, scalability, programming language support and overlay supports into consideration.


Peer to Peer (P2P), Protocol, Simulators, Structured, Unstructured

Full Text:



“P2Psim: A Simulator for Peer-to-Peer (P2P) Protocols,” 2005, accessed 30-April-2006,[Online].Available:

Ion Stoica, R. Morris et al., "Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications," IEEE/ACM Trans. Net., vol. 11, no. 1, 2003, pp. 17-32.

J. Li, J. Stribling, R. Morris, and M. Kaashoek, “Bandwidth-Efficient Management of DHT Routing Tables,” Proceedings of the 2nd NSDI, 2005.

M. Kaashoek and D. Karger, “Koorde: A Simple Degree-Optimal Distributed Hash Table,” Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS 03), 2003.

Gupta, K. Birman, P. Linga, A. Demers, and R. van Renesse, “Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead,” Group, vol. 30, pp. 23.

B. Y. Zhao et al., "Tapestry: A Resilient Global-Scale Overlay for Service Deployment," IEEE JSAC, vol. 22, no. 1, Jan. 2004, pp. 41-53.

P. Maymounkov and D. Mazieres, “Kademlia: A Peer-to-Peer Information System Based on the XOR Metric,” Proceedings of the 1stInternational Workshop on Peer-to-Peer Systems (IPTPS ‟02), vol. 258, 2002,pp. 263.

“PeerSim P2P Simulator”, May-2006, Available:

“BISON: Biology-Inspired Techniques for Self-Organization in Dynamic Networks.” Available:

A. Rowstron and P. Druschel "Pastry: Scalable, decentralized object location and routing for large- scale peer-to-peer systems", Nov 2001.

Manku. G., Bawa. M., and Raghavan. P., “Symphony: Distributed Hashing in a Small World”, Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003, pp. 127–140.

Pedro García, Carles Pairot, Rubén Mondéjar, Jordi Pujol, Helio Tejedor, and Robert Rallo. “PlanetSim: A New Overlay Network Simulation Framework”.

K. Shudo, “Overlay Weaver,” 2006, accessed 01-May-2006. Available: .

“DHTSim,” accessed 01-May-2006. Available: Baumgart, Bernhard Heep, Stephan Krause,“OverSim: A Flexible Overlay Network Simulation Framework”

OverSim: The Overlay Simulation Framework. Available:

Chawathe. Y., Ratnasamy. S., Breslau. L., Lanham. N. and Shenker. S., Making “gnutella-like P2P systems scalable”, ACM, SIGCOMM ‟2003, pp. 407– 418.

Nyik San Ting, Ralph Deters Department of Computer Science.” 3LS - A Peer-to-Peer Network Simulator.”

W. Yang and N. Abu-Ghazaleh, “GPS: A General Peer-to-Peer Simulator and its Use for Modeling BitTorrent,” Mascots , 2005 , pp. 425–434.

S. Joseph, “NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks,” Proceedings of the International Workshop on Peer-to-Peer Computing, 2002.

“NeuroGrid,” May 2006. Available:

S. Joseph, “An Extendible Open Source P2P Simulator,” P2P Journal, 2003, pp. 1–15.

Clarke, O. Sandberg, B. Wiley, and T. Hong, “Freenet: A Distributed Anonymous Information Storage and Retrieval System,” Workshop on Design Issues in Anonymity and Unobservability, vol. 320, 2000.

“The Annotated Gnutella Protocol Specification v0.4.” Available: T. Schlosser and S. D. Kamvar, “Simulating a File Sharing P2P Network,” Stanford University, Tech. Rep., 2002.

S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina, “The Eigentrust Algorithm for Reputation Management in P2P Networks,” in WWW ‟03: Proceedings of the 12th International Conference on World Wide Web. New York, NY, USA: ACM Press, 2003, pp. 640–651.

T. Condie, S. D. Kamvar, and H. Garcia-Molina, “Adaptive Peer-to-Peer Topologies,” in Peer-to-Peer Computing. IEEE Computer Society, 2004, pp. 53–62.

NS-2, Available :

P2PSim, Avilable :

REAL Network Simulator, Available:

VINT Project, Available:

OMNeT++, Available:

Gnutellasim, Available:

TJ Giuli and M. Baker., “Narses: A Scalable, Flow-Based Network Simulator.” Technical Report cs.PF/0211024, Computer Science Department, Stanford University, Stanford, CA, USA, Nov 2002.

N. Ting, ”A Generic Peer-to-Peer Network Simulator”, Proceedings of the 2002-2003 Grad Symposiun, Computer Science Department, University of Saskatchewan, April 2003.

Mark Baker and Rahim Lakhoo “,Peer-to-Peer Simulators” ,May 2007.

Stephen Naicken, Anirban Basu, Barnaby Livingston and Sethalat Rodhetbhai , “A Survey of Peer-to-Peer Network Simulators”.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.