Estimating The Size Of Peer-To-Peer Networks Using Lambert's W Function, Grid Computing, pp.61-72, 2008. ,
DOI : 10.1007/978-0-387-09457-1_6
The sybil attack, IPTPS '01: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pp.251-260, 2002. ,
On random graphs. I. Publ, Math. Debrecen, vol.6, pp.290-297, 1959. ,
Lightweight probabilistic broadcast, ACM Trans. Comput. Syst, vol.21, pp.341-374, 2003. ,
Beyond simulation: Large-scale distributed emulation of p2p protocols USENIX Association, 4th Workshop on Cyber Security Experimentation and Test, 2011. ,
R5N: Randomized recursive routing for restricted-route networks, 2011 5th International Conference on Network and System Security, 2011. ,
DOI : 10.1109/ICNSS.2011.6060022
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.6773
Efficient and Secure Decentralized Network Size Estimation, 2011. ,
DOI : 10.1007/978-3-642-30045-5_23
URL : https://hal.archives-ouvertes.fr/hal-01531109
Gossip-based aggregation in large dynamic networks, ACM Transactions on Computer Systems, vol.23, issue.3, pp.219-252, 2005. ,
DOI : 10.1145/1082469.1082470
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.8747
An Efficient Heuristic Procedure for Partitioning Graphs. The Bell system technical journal, pp.291-307, 1970. ,
DOI : 10.1002/j.1538-7305.1970.tb01770.x
Network Failure Detection and Graph Connectivity, SIAM Journal on Computing, vol.38, issue.4, pp.1330-1346, 2008. ,
DOI : 10.1137/070697793
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.3430
Decentralized Schemes for Size Estimation in Large and Dynamic Groups, Fourth IEEE International Symposium on Network Computing and Applications, pp.41-48, 2005. ,
DOI : 10.1109/NCA.2005.15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.6603
Viceroy, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.183-192, 2002. ,
DOI : 10.1145/571825.571857
Parameterized graph separation problems, Theoretical Computer Science, vol.351, issue.3, pp.394-406, 2006. ,
DOI : 10.1016/j.tcs.2005.10.007
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.9011
Peer counting and sampling in overlay networks, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.123-132, 2006. ,
DOI : 10.1145/1146381.1146402
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric, 1st International Workshop on Peer-to Peer Systems, pp.53-65, 2002. ,
DOI : 10.1007/3-540-45748-8_5
Peer to peer size estimation in large and dynamic networks: A comparative study, 2006 15th IEEE International Conference on High Performance Distributed Computing, pp.7-17, 2006. ,
DOI : 10.1109/HPDC.2006.1652131
Adapting blackhat approaches to increase the resilience of whitehat application scenarios, 2010. ,
Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, pp.329-350, 2001. ,
Puzzles in p2p systems, 8th CaberNet Radicals Workshop, Corsica, 2003. ,
A practical approach to network size estimation for structured overlays, Proceedings of the 3rd International Workshop on Self-Organizing Systems, IWSOS '08, pp.71-83, 2008. ,