Presentation 2005-04-21
A Study on Pure P2P Network Size Estimation Method
Daiki HACHISUKA, Satoshi OHZAHATA, Konosuke KAWASHIMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) P2P applications rapidly increase their users with spreading of high performance personal computer connecting to broadband Internet. P2P applications have different architecture from the classical server-client based computing application. Winny is one of the most popular pure P2P file exchange application in Japan. In the Pure P2P architecture, there is no network administrator. This feature make difficult to administrate the users and no one knows the number of the users. This paper presents a size estimation method for Winny network with combination of measurement analysis and computer simulation experiments.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Size Estimation / Peer-to-Peer / Winny / Traffic Measurement / Computer Simulation
Paper # NS2005-1
Date of Issue

Conference Information
Committee NS
Conference Date 2005/4/14(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Network Systems(NS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Study on Pure P2P Network Size Estimation Method
Sub Title (in English)
Keyword(1) Size Estimation
Keyword(2) Peer-to-Peer
Keyword(3) Winny
Keyword(4) Traffic Measurement
Keyword(5) Computer Simulation
1st Author's Name Daiki HACHISUKA
1st Author's Affiliation Tokyo University of Agriculture and Technology()
2nd Author's Name Satoshi OHZAHATA
2nd Author's Affiliation Symbiotic Science and Technology, Tokyo University of Agriculture and Technology
3rd Author's Name Konosuke KAWASHIMA
3rd Author's Affiliation Symbiotic Science and Technology, Tokyo University of Agriculture and Technology
Date 2005-04-21
Paper # NS2005-1
Volume (vol) vol.105
Number (no) 12
Page pp.pp.-
#Pages 4
Date of Issue