|
ABSTRACT
A peer-to-peer architectural model defines an overlay network topology and a routing strategy. If these aspects are tied together by a deterministic logical model, we say that the architecture is structured. Otherwise, we say it is unstructured. Based on these assumptions, in recent years many complex P2P architectural models have been defined, their performance evaluation being carried out mainly by means of simulative tools. However, there is an emerging need for a general-purpose tool, enabling large-scale overlay network simulations, yet also providing ready-to-use complex building blocks. The widely known PeerSim simulator addresses the first issue quite effectively, although it appears quite limited with respect to several important aspects, i. e. churn modeling. In this paper we propose P2PAM as a PeerSim enhancement providing a rather complete framework for peer-to-peer architectural modeling. P2PAM effectiveness is demonstrated by showing how it has been used to rapidly develop simulations of two interesting systems, namely JXTA and HALO.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
R. Albert and A. Barabási. Statistical mechanics for complex networks. Reviews of Modern Physics, 74(1):47--97, January 2002.
|
| |
2
|
M. Amoretti, M. Reggiani, F. Zanichelli, and G. Conte. Peer: an Architectural Pattern Enabling Resource Sharing in Virtual Organizations. In The 12th Pattern Languages of Programs (PLoP) 2005, Monticello, Illinois, USA, September 2005.
|
| |
3
|
|
| |
4
|
A. Barabási and R. Albert. Emergence of Scaling in Random Networks. Science, 286(5439):509--512, October 1999.
|
| |
5
|
A. Barabási, R. Albert, and H. Jeong. Mean-field theory for scale-free random networks. Physica A, 272(1--2):173--187, October 1999.
|
| |
6
|
P. Baran. Introduction to Distributed Communications Network. Technical report, RAND Corporation, Aug. 1964.
|
| |
7
|
B. Bollobás. Random Graphs. Academic Press, 1985.
|
| |
8
|
K. L. Calvert, M. B. Doar, and E. W. Zegura. Modeling internet topology. IEEE Communications Magazine, 35(6):160--163, June 1997.
|
| |
9
|
R. Cohen and S. Havlin. Scale-free networks are ultrasmall. PHYS. REV. LETT, 90:058701, 2003.
|
| |
10
|
S. Dorogovtsev and J. Mendes. Evolution of networks. Advances in Physics, 51:1079, 2002.
|
| |
11
|
T. M. Gil, F. Kaashoek, J. Li, R. Morris, and J. Stribling. p2psim: a simulator for peer-to-peer (p2p) protocols. http://pdos.csail.mit.edu/p2psim/.
|
| |
12
|
M. Jelasity, A. Montresor, G. Jesi, and S. Voulgaris. PeerSim: A Peer-to-Peer Simulator. http://peersim.sourceforge.net, 2004.
|
 |
13
|
Qin Lv , Pei Cao , Edith Cohen , Kai Li , Scott Shenker, Search and replication in unstructured peer-to-peer networks, Proceedings of the 16th international conference on Supercomputing, June 22-26, 2002, New York, New York, USA
[doi> 10.1145/514191.514206]
|
| |
14
|
|
 |
15
|
|
| |
16
|
K. Shudo, Y. Tanaka, and S. Sekiguchi. An overlay construction toolkit. http://overlayweaver.sourceforge.net.
|
| |
17
|
|
| |
18
|
The Berkeley Multimedia Research Center. OTcl - object tcl extensions. http://bmrc.berkeley.edu/research/cmt/cmtdoc/otcl/.
|
| |
19
|
B. Traversat, A. Arora, M. Abdelaziz, M. Duigou, C. Haywood, J. Hugly, E. Poyoul, and B. Yeager. Project JXTA 2.0 Super-Peer Virtual Network. Technical report, Sun Microsystems, May 2003.
|
| |
20
|
University of California Information Sciences Institute. NS-2 network simulator. http://nsnam.isi.edu/nsnam/index.php.
|
| |
21
|
University Rovira i Virgili. Planetsim project. http://planet.urv.es/trac/planetsim.
|
| |
22
|
B. M. Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9):1617--1622, December 1988.
|
|