<?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">

	<title>CiteULike: p2pstreaming's peer-to-peer</title>
	<description>CiteULike: p2pstreaming's peer-to-peer</description>


	<link>http://www.citeulike.org/user/p2pstreaming/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/p2pstreaming/article/2776603"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/2755122"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/1325689"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/695313"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/514996"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/606077"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/588825"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/334025"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333947"/>

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


<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/2776603">
    <title>Low-delay peer-to-peer streaming using scalable video coding</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/2776603</link>
    <description>&lt;i&gt;Packet Video 2007 (2007), pp. 173-181.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Peer-to-peer (P2P) networks represent a valuable architecture for streaming video over the Internet. In these systems, users contribute their resources to relay the media to others and no dedicated infrastructure is required. In order to ensure a low end-to-end delay, P2P overlay networks are often organized as a set of complementary multicast trees. The source of the stream multiplexes the data on top of these trees and the routing of packets is statically defined. In this scenario, the reliability of the overlay links is critical for the performance of the system since temporary link failure or network congestion can cause a significant disruption of the end-user quality. The novel Scalable Video Coding (SVC) standard enables efficient usage of the network capacity by allowing intermediate high capacity nodes in the overlay network to dynamically extract layers from the scalable bit stream to serve less capable peers. On the other hand, SVC incurs a certain loss in terms of coding efficiency with respect to H.264/AVC single-layer coding. We propose a simple model that allows to evaluate the trade-off of using a scalable codec with respect to single-layer coding, given the distribution of the receivers&#38;#x2019; capacities in an error-free network. We also report experimental results obtained by using SVC on top of a real-time implementation of the Stanford Peer-to-Peer Multicast (SPPM) protocol that clearly show the benefits of a prioritization mechanism to react to network congestion.</description>
    <dc:title>Low-delay peer-to-peer streaming using scalable video coding</dc:title>

    <dc:creator>Pierpaolo Baccichet</dc:creator>
    <dc:creator>Thomas Schierl</dc:creator>
    <dc:creator>Thomas Wiegand</dc:creator>
    <dc:creator>Bernd Girod</dc:creator>
    <dc:identifier>doi:10.1109/PACKET.2007.4397039</dc:identifier>
    <dc:source>Packet Video 2007 (2007), pp. 173-181.</dc:source>
    <dc:date>2008-05-09T20:50:52-00:00</dc:date>
    <prism:publicationName>Packet Video 2007</prism:publicationName>
    <prism:startingPage>173</prism:startingPage>
    <prism:endingPage>181</prism:endingPage>
    <prism:category>delay</prism:category>
    <prism:category>peer-to-peer</prism:category>
    <prism:category>scalable</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/2755122">
    <title>Congestion-Distortion Optimized Peer-to-Peer Video Streaming</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/2755122</link>
    <description>&lt;i&gt;Image Processing, 2006 IEEE International Conference on (2006), pp. 721-724.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In live peer-to-peer streaming, a video stream is transmitted to a large population of viewers, through the use of the uplink bandwidth of participating peers. This approach overcomes the cost of large-scale deployment of such services. An essential problem of this type of system is to limit the incurred congestion. In particular, overwhelming the uplink of some peers would create a large increase in the latency of the system and make this application less compelling. In this work we focus on limiting the congestion in a peer-to-peer network where multiple multicast trees are used to distribute video to a large set of receivers. We present the idea of congestion-distortion optimized streaming which aims at maximizing decoded video quality while limiting network congestion. We describe how this type of media scheduling maintains high video quality even for low latencies, and extend its usage to the peer-to-peer scenario. Experiments over a simulated network of 300 peers illustrate the benefits of the suggested approach</description>
    <dc:title>Congestion-Distortion Optimized Peer-to-Peer Video Streaming</dc:title>

    <dc:creator>E Setton</dc:creator>
    <dc:creator>Jeonghun Noh</dc:creator>
    <dc:creator>B Girod</dc:creator>
    <dc:identifier>doi:10.1109/ICIP.2006.312442</dc:identifier>
    <dc:source>Image Processing, 2006 IEEE International Conference on (2006), pp. 721-724.</dc:source>
    <dc:date>2008-05-05T04:31:51-00:00</dc:date>
    <prism:publicationName>Image Processing, 2006 IEEE International Conference on</prism:publicationName>
    <prism:startingPage>721</prism:startingPage>
    <prism:endingPage>724</prism:endingPage>
    <prism:category>distortion</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>peer-to-peer</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/1325689">
    <title>Building low-diameter P2P networks</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/1325689</link>
    <description>&lt;i&gt;Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on (2001), pp. 492-499.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. There is no dichotomy between a central server and distributed clients. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and fragmentation into disconnected pieces separated by choke-points with inadequate bandwidth. The authors propose a simple scheme for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. It does so with no global knowledge of all the nodes in the network. In the most common P2P application to date (search), these properties are important.</description>
    <dc:title>Building low-diameter P2P networks</dc:title>

    <dc:creator>G Pandurangan</dc:creator>
    <dc:creator>P Raghavan</dc:creator>
    <dc:creator>E Upfal</dc:creator>
    <dc:source>Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on (2001), pp. 492-499.</dc:source>
    <dc:date>2007-05-24T19:13:13-00:00</dc:date>
    <prism:publicationName>Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on</prism:publicationName>
    <prism:startingPage>492</prism:startingPage>
    <prism:endingPage>499</prism:endingPage>
    <prism:category>diameter</prism:category>
    <prism:category>peer-to-peer</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/695313">
    <title>Optimizing transmission time of scalable coded images in peer-to-peer networks</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/695313</link>
    <description>&lt;i&gt;Multimedia Systems, Vol. 10, No. 5. (2005), pp. 413-421.&lt;/i&gt;</description>
    <dc:title>Optimizing transmission time of scalable coded images in peer-to-peer networks</dc:title>

    <dc:creator>Xiao Su</dc:creator>
    <dc:creator>Rod Fatoohi</dc:creator>
    <dc:creator>Tao Wang</dc:creator>
    <dc:identifier>doi:10.1007/s00530-005-0170-y</dc:identifier>
    <dc:source>Multimedia Systems, Vol. 10, No. 5. (2005), pp. 413-421.</dc:source>
    <dc:date>2006-06-13T23:09:39-00:00</dc:date>
    <prism:publicationName>Multimedia Systems</prism:publicationName>
    <prism:volume>10</prism:volume>
    <prism:number>5</prism:number>
    <prism:startingPage>413</prism:startingPage>
    <prism:endingPage>421</prism:endingPage>
    <prism:category>optimization</prism:category>
    <prism:category>peer-to-peer</prism:category>
    <prism:category>scalable</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/514996">
    <title>Denial-of-service resilience in peer-to-peer file sharing systems</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/514996</link>
    <description>&lt;i&gt;Vol. 33, No. 1. (June 2005), pp. 38-49.&lt;/i&gt;</description>
    <dc:title>Denial-of-service resilience in peer-to-peer file sharing systems</dc:title>

    <dc:creator>D Dumitriu</dc:creator>
    <dc:creator>E Knightly</dc:creator>
    <dc:creator>A Kuzmanovic</dc:creator>
    <dc:creator>I Stoica</dc:creator>
    <dc:creator>W Zwaenepoel</dc:creator>
    <dc:identifier>doi:10.1145/1064212.1064218</dc:identifier>
    <dc:source>Vol. 33, No. 1. (June 2005), pp. 38-49.</dc:source>
    <dc:date>2006-02-21T16:14:21-00:00</dc:date>
    <prism:issn>0163-5999</prism:issn>
    <prism:volume>33</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>38</prism:startingPage>
    <prism:endingPage>49</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>attack</prism:category>
    <prism:category>denial-of-service</prism:category>
    <prism:category>peer-to-peer</prism:category>
    <prism:category>resilience</prism:category>
    <prism:category>security</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/606077">
    <title>AnySee: Peer-to-Peer Live Streaming</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/606077</link>
    <description>&lt;i&gt;(April 2006)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Efficient and scalable live-streaming overlay construction has become a hot topic recently. In order to improve the performance metrics, such as startup delay, source-to-end delay, and playback continuity, most previous studies focused on intra-overlay optimization. Such approaches have drawbacks including low resource utilization, high startup and source-to-end delay, and unreasonable resource assignment in global P2P networks. Anysee is a peer-to-peer live streaming system and adopts an inter-overlay optimization scheme, in which resources can join multiple overlays, so as to (1) improve global resource utilization and distribute traffic to all physical links evenly; (2) assign resources based on their locality and delay; (3) guarantee streaming service quality by using the nearest peers, even when such peers might belong to different overlays; and (4) balance the load among the group members. We compare the performance of our design with existing approaches based on comprehensive trace driven simulations. Results show that AnySee outperforms previous schemes in resource utilization and the QoS of streaming services. AnySee has been implemented as an Internet based live streaming system, and was successfully released in the summer of 2004 in CERNET of China. Over 60,000 users enjoy massive entertainment programs, including TV programs, movies, and academic conferences. Statistics prove that this design is scalable and robust, and we believe that the wide deployment of AnySee will soon benefit many more Internet users.</description>
    <dc:title>AnySee: Peer-to-Peer Live Streaming</dc:title>

    <dc:creator>Xiaofei Liao</dc:creator>
    <dc:creator>Hai Jin</dc:creator>
    <dc:creator>Yunhao Liu</dc:creator>
    <dc:creator>Lionel Ni</dc:creator>
    <dc:creator>Dafu Deng</dc:creator>
    <dc:source>(April 2006)</dc:source>
    <dc:date>2006-04-29T03:27:33-00:00</dc:date>
    <prism:category>live</prism:category>
    <prism:category>peer-to-peer</prism:category>
    <prism:category>streaming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/588825">
    <title>Coupon replication systems</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/588825</link>
    <description>&lt;i&gt;Vol. 33, No. 1. (June 2005), pp. 2-13.&lt;/i&gt;</description>
    <dc:title>Coupon replication systems</dc:title>

    <dc:creator>Laurent</dc:creator>
    <dc:identifier>doi:10.1145/1064212.1064215</dc:identifier>
    <dc:source>Vol. 33, No. 1. (June 2005), pp. 2-13.</dc:source>
    <dc:date>2006-04-17T16:39:27-00:00</dc:date>
    <prism:issn>0163-5999</prism:issn>
    <prism:volume>33</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>2</prism:startingPage>
    <prism:endingPage>13</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>bittorrent</prism:category>
    <prism:category>peer-to-peer</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/334025">
    <title>Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/334025</link>
    <description>&lt;i&gt;(2004)&lt;/i&gt;</description>
    <dc:title>Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks</dc:title>

    <dc:creator>D Qiu</dc:creator>
    <dc:creator>R Srikant</dc:creator>
    <dc:source>(2004)</dc:source>
    <dc:date>2005-09-28T16:27:50-00:00</dc:date>
    <prism:category>bittorrent</prism:category>
    <prism:category>peer-to-peer</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333947">
    <title>CollectCast: A Peer-to-Peer Service for Media Streaming</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333947</link>
    <description>&lt;i&gt;ACM Multimedia Systems Journal (2005)&lt;/i&gt;</description>
    <dc:title>CollectCast: A Peer-to-Peer Service for Media Streaming</dc:title>

    <dc:creator>M Hefeeda</dc:creator>
    <dc:creator>D Xu</dc:creator>
    <dc:creator>A Habib</dc:creator>
    <dc:creator>B Bhargava</dc:creator>
    <dc:creator>Boyan Botev</dc:creator>
    <dc:source>ACM Multimedia Systems Journal (2005)</dc:source>
    <dc:date>2005-09-28T16:27:39-00:00</dc:date>
    <prism:publicationName>ACM Multimedia Systems Journal</prism:publicationName>
    <prism:category>media</prism:category>
    <prism:category>peer-to-peer</prism:category>
    <prism:category>streaming</prism:category>
</item>



</rdf:RDF>

