Analyzing Peer to Peer Communication Through Agent-Based Simulation

This paper analyzes the characteristics of a peer-to-peer communications network through agent-based simulation. The extended BA (Balabasi and Abert) model was used as the concept model for this simulation. In developing this model, we have focused on the following two issues: (i) characteristics of agent and contents, and (ii) agent decision rules regarding sending, receiving and searching contents. The simulator processes communications among the agents and uncovers emerging social behavior. Assuming parameters of this generic scenario, the simulation results show that the network possesses scale-free and small-world properties.

[1]  Ginestra Bianconi,et al.  Competition and multiscaling in evolving networks , 2001 .

[2]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  Toru Ishida,et al.  Community Computing and Support Systems , 1999, Lecture Notes in Computer Science.

[5]  Noshir S. Contractor,et al.  IKNOW: A Tool to Assist and Study the Creation, Maintenance, and Dissolution of Knowledge Networks , 1998, Community Computing and Support Systems.

[6]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[7]  V. Eguíluz,et al.  Highly clustered scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.