<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Thu, 21 Aug 2008 15:09:57 BST</pubDate>


	<title>CiteULike: elsantosneto peer-to-peer</title>
	<description>CiteULike: elsantosneto peer-to-peer</description>


	<link>http://www.citeulike.org/user/elsantosneto/tag/peer-to-peer</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/elsantosneto/article/2759673"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/elsantosneto/article/1833518"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/elsantosneto/article/587876"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/elsantosneto/article/221323"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/elsantosneto/article/2759673">
    <title>Peer-to-Peer File Sharing for Mobile Devices</title>
    <link>http://www.citeulike.org/user/elsantosneto/article/2759673</link>
    <description>&lt;i&gt;Mobile Phone Programming (2007), pp. 311-324.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Summary. Peer-to-peer (P2P) file sharing is a relatively new addition to the growing list of mobile-based technologies. The advanced connectivity features and powerful hardware of new generation mobile devices facilitates the implementation of even the most complex P2P technologies. The characteristics of the P2P architecture, such as reliability, easy one-to-one communication, and extensible distribution of resources, make it one of the most suitable networking technologies for mobile systems. In this chapter, we give a summary of our experience in implementing the Gnutella and the BitTorrent file sharing technologies on a mobile platform. We examine the particular protocols and emphasize the points relevant to the mobile implementation.</description>
    <dc:title>Peer-to-Peer File Sharing for Mobile Devices</dc:title>

    <dc:creator>Imre Kelényi</dc:creator>
    <dc:creator>Gergely Csúcs</dc:creator>
    <dc:creator>Bertalan Forstner</dc:creator>
    <dc:creator>Hassan Charaf</dc:creator>
    <dc:identifier>doi:10.1007/978-1-4020-5969-8_15</dc:identifier>
    <dc:source>Mobile Phone Programming (2007), pp. 311-324.</dc:source>
    <dc:date>2008-05-06T03:39:14-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>Mobile Phone Programming</prism:publicationName>
    <prism:startingPage>311</prism:startingPage>
    <prism:endingPage>324</prism:endingPage>
    <prism:category>bittorrent</prism:category>
    <prism:category>mobile</prism:category>
    <prism:category>peer-to-peer</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/elsantosneto/article/1833518">
    <title>Automatic grid assembly by promoting collaboration in peer-to-peer grids</title>
    <link>http://www.citeulike.org/user/elsantosneto/article/1833518</link>
    <description>&lt;i&gt;Journal of Parallel and Distributed Computing, Vol. 67, No. 8. (August 2007), pp. 957-966.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Currently, most computational grids (systems allowing transparent sharing of computing resources across organizational boundaries) are assembled using human negotiation. This procedure does not scale well, and is too inflexible to allow for large open grids. Peer-to-peer (P2P) grids present an alternative way to build grids with many sites. However, to actually assemble a large grid, peers must have an incentive to provide resources to the system. In this paper we present an incentive mechanism called the Network of Favors, which makes it in the interest of each participating peer to contribute its spare resources. We show through simulations with up to 10,000 peers and experiments with software implementing the mechanism in a deployed system that the Network of Favors promotes collaboration in a simple, robust and scalable fashion. We also discuss experiences of using OurGrid, a grid based on this mechanism.</description>
    <dc:title>Automatic grid assembly by promoting collaboration in peer-to-peer grids</dc:title>

    <dc:creator>Nazareno Andrade</dc:creator>
    <dc:creator>Francisco Brasileiro</dc:creator>
    <dc:creator>Walfredo Cirne</dc:creator>
    <dc:creator>Miranda Mowbray</dc:creator>
    <dc:identifier>doi:10.1016/j.jpdc.2007.04.011</dc:identifier>
    <dc:source>Journal of Parallel and Distributed Computing, Vol. 67, No. 8. (August 2007), pp. 957-966.</dc:source>
    <dc:date>2007-10-29T00:06:01-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>Journal of Parallel and Distributed Computing</prism:publicationName>
    <prism:volume>67</prism:volume>
    <prism:number>8</prism:number>
    <prism:startingPage>957</prism:startingPage>
    <prism:endingPage>966</prism:endingPage>
    <prism:category>grids</prism:category>
    <prism:category>nof</prism:category>
    <prism:category>ourgrid</prism:category>
    <prism:category>peer-to-peer</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/elsantosneto/article/587876">
    <title>Pastiche: Making backup cheap and easy</title>
    <link>http://www.citeulike.org/user/elsantosneto/article/587876</link>
    <description>&lt;i&gt;(2002)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Backup is cumbersome and expensive. Individual users almost never back up their data, and backup is a significant cost in large organizations. This paper presents Pastiche, a simple and inexpensive backup system. Pastiche exploits excess disk capacity to perform peer-to-peer backup with no administrative costs. Each node minimizes storage overhead by selecting peers that share a significant amount of data. It is easy for common installations to find suitable peers, and peers with high overlap...</description>
    <dc:title>Pastiche: Making backup cheap and easy</dc:title>

    <dc:creator>L Cox</dc:creator>
    <dc:creator>B Noble</dc:creator>
    <dc:source>(2002)</dc:source>
    <dc:date>2006-04-16T00:28:33-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:category>backup</prism:category>
    <prism:category>peer-to-peer</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/elsantosneto/article/221323">
    <title>pStore: A secure peer-to-peer backup system</title>
    <link>http://www.citeulike.org/user/elsantosneto/article/221323</link>
    <description>&lt;i&gt;(2001)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In an effort to combine research in peer-to-peer systems with techniques for incremental backup systems, we propose pStore: a secure distributed backup system based on an adaptive peer-to-peer network. pStore exploits unused personal hard drive space attached to the Internet to provide the distributed redundancy needed for reliable and effective data backup. Experiments on a 30 node network show that 95% of the files in a 13 MB dataset can be retrieved even when 7 of the nodes have failed. On...</description>
    <dc:title>pStore: A secure peer-to-peer backup system</dc:title>

    <dc:creator>C Batten</dc:creator>
    <dc:creator>K Barr</dc:creator>
    <dc:creator>A Saraf</dc:creator>
    <dc:creator>S Treptin</dc:creator>
    <dc:source>(2001)</dc:source>
    <dc:date>2005-06-07T12:58:55-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:category>backup</prism:category>
    <prism:category>peer-to-peer</prism:category>
</item>



</rdf:RDF>

