The state of peer-to-peer simulators and simulations

被引:58
作者
Naicken, S. [1 ]
Livingston, B. [1 ]
Basu, A. [1 ]
Rodhetbhai, S. [1 ]
Wakeman, I. [1 ]
Chalmers, D. [1 ]
机构
[1] Univ Sussex, Dept Informat, Brighton BN1 9RH, E Sussex, England
关键词
design; experimentation; measurement; performance; peer-to-peer; simulator evaluation; simulator usage;
D O I
10.1145/1232919.1232932
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we discuss the current situation with respect to simulation usage. in P2P research, testing the available P2P simulators against a proposed set of requirements, and surveying over 280 papers to discover what simulators are already being used. We found that no simulator currently meets all cur requirements, and that simulation results are generally reported in the literature in a fashion that precludes any reproduction of results. We hope that this paper will give rise to further discussion and knowledge sharing among those of the P2P and network simulation research communities, so that a simulator that meets the needs of rigorous P2P research can be developed.
引用
收藏
页码:95 / 98
页数:4
相关论文
共 13 条
[1]   On the credibility of manet simulations [J].
Andel, Todd R. ;
Yasinsac, Alec .
COMPUTER, 2006, 39 (07) :48-+
[2]  
[Anonymous], NOSSDAV P NEW YORK N
[3]  
Dabek F, 2003, P IPTPS, V58
[4]  
FELDMAN M, 2003, 1 WORKSH EC PEER PEE
[5]  
García P, 2005, LECT NOTES COMPUT SC, V3437, P123
[6]  
ITO A, 2006, P 2006 ACM S APPL CO
[7]  
Kurkowski S., 2005, SIGMOBILE MOBILE COM, V9, P50, DOI DOI 10.1145/1096166.1096174
[8]   Data-centric storage in sensornets with GHT, a geographic hash table [J].
Ratnasamy, S ;
Karp, B ;
Shenker, S ;
Estrin, D ;
Govindan, R ;
Yin, L ;
Yu, F .
MOBILE NETWORKS & APPLICATIONS, 2003, 8 (04) :427-442
[9]  
SETTON E, 2005, P ACM WORKSH ADV PEE, P39, DOI DOI 10.1145/1099384.1099390
[10]   Chord: A scalable peer-to-peer lookup protocol for Internet applications [J].
Stoica, I ;
Morris, R ;
Liben-Nowell, D ;
Karger, DR ;
Kaashoek, MF ;
Dabek, F ;
Balakrishnan, H .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (01) :17-32