<?xml version="1.0" encoding="UTF-8"?>
<XML><RECORDS>
<RECORD>
	<REFERENCE_TYPE>0</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Igor Margasinski</AUTHOR>
		<AUTHOR>Michal Pioro</AUTHOR>
	</AUTHORS>
	<YEAR>2008</YEAR>
	<TITLE>Low-Latency Parallel Transport in Anonymous Peer-to-Peer Overlays</TITLE>
	<SECONDARY_AUTHORS>
		<SECONDARY_AUTHOR>N. Akar, et al.</SECONDARY_AUTHOR>
	</SECONDARY_AUTHORS>
	<SECONDARY_TITLE>IP Operations and Management</SECONDARY_TITLE>
	<PUBLISHER>Springer Berlin / Heidelberg</PUBLISHER>
	<VOLUME>LNCS 5275</VOLUME>
	<PAGES>127-141</PAGES>
	<TERTIARY_TITLE>Lecture Notes in Computer Science</TERTIARY_TITLE>
	<DATE>12/2008</DATE>
	<ISBN>978-3-540-87356-3</ISBN>
	<KEYWORDS>
		<KEYWORD>Communication</KEYWORD>
		<KEYWORD>system</KEYWORD>
		<KEYWORD>traffic,</KEYWORD>
		<KEYWORD>communication</KEYWORD>
		<KEYWORD>system</KEYWORD>
		<KEYWORD>security,</KEYWORD>
		<KEYWORD>privacy,</KEYWORD>
		<KEYWORD>peer-to-peer</KEYWORD>
		<KEYWORD>overlays,</KEYWORD>
		<KEYWORD>overlay</KEYWORD>
		<KEYWORD>networks</KEYWORD>
		<KEYWORD>management</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>The paper presents a design and discusses configuration aspects of an overlay transport protocol based on an idea of the peer-to-peer direct and anonymous distribution overlay (P2PRIV). We estimate a secure configuration of the protocol and examine a correlation between the P2PRIV's anonymous path lengths and latency. An increase of the path lengths speaks strongly in favor of the parallel solution&acirc;€™s anonymity, as in classical cascade networks. In the paper we evaluate the new protocol in a scope of a trade-off between anonymity and traffic performance and show that the presented solution allows effectively increasing anonymity with relatively low impact on anonymous transport latency.</ABSTRACT>
	<URL>http://p2priv.org/pub/p2priv-transport-ipom2008.pdf</URL>
</RECORD>
</RECORDS></XML>