<?xml version="1.0" encoding="UTF-8"?>
<XML><RECORDS>
<RECORD>
	<REFERENCE_TYPE>31</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Igor Margasinski</AUTHOR>
		<AUTHOR>Michal Pioro</AUTHOR>
	</AUTHORS>
	<YEAR>2008</YEAR>
	<TITLE>On Traffic Performance Measures for Anonymous P2P Networks</TITLE>
	<SECONDARY_AUTHORS>
		<SECONDARY_AUTHOR>A. Feldmann, et al.</SECONDARY_AUTHOR>
	</SECONDARY_AUTHORS>
	<SECONDARY_TITLE>The Fifth Polish-German Teletraffic Symposium (PGTS'08)</SECONDARY_TITLE>
	<PLACE_PUBLISHED>Technische Universität Berlin, Germany</PLACE_PUBLISHED>
	<PUBLISHER>Logos Verlag Berlin</PUBLISHER>
	<PAGES>129-138</PAGES>
	<DATE>06/10/2008</DATE>
	<ISBN>978-3-8325-2047-2</ISBN>
	<KEYWORDS>
		<KEYWORD>Communication</KEYWORD>
		<KEYWORD>system</KEYWORD>
		<KEYWORD>traffic,</KEYWORD>
		<KEYWORD>traffic</KEYWORD>
		<KEYWORD>modeling,</KEYWORD>
		<KEYWORD>anonymous</KEYWORD>
		<KEYWORD>peer-to-peer</KEYWORD>
		<KEYWORD>networks</KEYWORD>
	</KEYWORDS>
	<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.</ABSTRACT>
	<URL>http://p2priv.org/pub/on-traffic-performance-measures-anon-p2p-pgts2008.pdf</URL>
</RECORD>
</RECORDS></XML>