On Traffic Performance Measures for Anonymous P2P Networks
September 29th, 2008
| Publication Type | Conference Proceedings | |
| Year of Publication | 2008 | |
| Authors | Margasinski, I.; Pioro, M. | |
| Conference Name | The Fifth Polish-German Teletraffic Symposium (PGTS'08) | |
| Pagination | 129-138 | |
| Conference Start Date | 06/10/2008 | |
| Publisher | Logos Verlag Berlin | |
| Conference Location | Technische Universität Berlin, Germany | |
| Editor | A. Feldmann, et al. | |
| ISBN Number | 978-3-8325-2047-2 | |
| Key Words | Communication system traffic; traffic modeling; anonymous peer-to-peer networks | |
| Abstract | The modeling of anonymous systems is mostly aimed at the evaluation of the level of provided anonymity. However, the utility of anonymity solutions depends not only on their security, but also on necessary traffic overheads. In this paper, we have proposed an empirical, traffic performance model for anonymous P2P networks. We based our research on a well known information entropy measurement model for an estimate of secure configuration of anonymous forwarding path lengths. Then, we proposed a simulation-based methodology for an evaluation of latency and dynamics of the selected configurations. As an example we used the classical system called CROWDS. We evaluate traffic performance of CROWDS and show that the empirical analysis of the system has been analogous to results obtained analytically for representative boundary conditions. | |
| Full Text |  | |
| Export | Tagged XML BibTex |
- Login to post comments