<?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>Sat, 19 Jul 2008 04:36:42 BST</pubDate>


	<title>CiteULike: p2pstreaming's Srikant</title>
	<description>CiteULike: p2pstreaming's Srikant</description>


	<link>http://www.citeulike.org/user/p2pstreaming/author/Srikant</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/780556"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/334025"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333985"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333984"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333891"/>

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


<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/780556">
    <title>Modeling and performance analysis of BitTorrent-like peer-to-peer networks</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/780556</link>
    <description>&lt;i&gt;(2004), pp. 367-378.&lt;/i&gt;</description>
    <dc:title>Modeling and performance analysis of BitTorrent-like peer-to-peer networks</dc:title>

    <dc:creator>Dongyu Qiu</dc:creator>
    <dc:creator>R Srikant</dc:creator>
    <dc:identifier>doi:10.1145/1015467.1015508</dc:identifier>
    <dc:source>(2004), pp. 367-378.</dc:source>
    <dc:date>2006-07-31T02:56:39-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:startingPage>367</prism:startingPage>
    <prism:endingPage>378</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>modeling</prism:category>
    <prism:category>p2p</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:publicationYear>2004</prism:publicationYear>
    <prism:category>bittorrent</prism:category>
    <prism:category>peer-to-peer</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333985">
    <title>End-to-End Congestion Control: Utility Functions, Random Losses and ECN Marks</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333985</link>
    <description>&lt;i&gt;(2000)&lt;/i&gt;</description>
    <dc:title>End-to-End Congestion Control: Utility Functions, Random Losses and ECN Marks</dc:title>

    <dc:creator>S Kunniyur</dc:creator>
    <dc:creator>R Srikant</dc:creator>
    <dc:source>(2000)</dc:source>
    <dc:date>2005-09-28T16:27:43-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:category>congestion</prism:category>
    <prism:category>control</prism:category>
    <prism:category>nonlinear</prism:category>
    <prism:category>pricing</prism:category>
    <prism:category>programming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333984">
    <title>A Time-Scale Decomposition Approach to Adaptive ECN Marking</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333984</link>
    <description>&lt;i&gt;IEEE Tran. on Automatic Control (June 2002)&lt;/i&gt;</description>
    <dc:title>A Time-Scale Decomposition Approach to Adaptive ECN Marking</dc:title>

    <dc:creator>S Kunniyur</dc:creator>
    <dc:creator>R Srikant</dc:creator>
    <dc:source>IEEE Tran. on Automatic Control (June 2002)</dc:source>
    <dc:date>2005-09-28T16:27:43-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:publicationName>IEEE Tran. on Automatic Control</prism:publicationName>
    <prism:category>allocation</prism:category>
    <prism:category>aqm</prism:category>
    <prism:category>congestion</prism:category>
    <prism:category>control</prism:category>
    <prism:category>nonlinear</prism:category>
    <prism:category>pricing</prism:category>
    <prism:category>programming</prism:category>
    <prism:category>resource</prism:category>
    <prism:category>theory</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333891">
    <title>A Stackelberg Network Game with a Large Number of Followers</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333891</link>
    <description>&lt;i&gt;J. Optimization Theory and Applications, Vol. 115, No. 3. (December 2002), pp. 479-490.&lt;/i&gt;</description>
    <dc:title>A Stackelberg Network Game with a Large Number of Followers</dc:title>

    <dc:creator>T Basar</dc:creator>
    <dc:creator>R Srikant</dc:creator>
    <dc:source>J. Optimization Theory and Applications, Vol. 115, No. 3. (December 2002), pp. 479-490.</dc:source>
    <dc:date>2005-09-28T16:27:20-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:publicationName>J. Optimization Theory and Applications</prism:publicationName>
    <prism:volume>115</prism:volume>
    <prism:number>3</prism:number>
    <prism:startingPage>479</prism:startingPage>
    <prism:endingPage>490</prism:endingPage>
    <prism:category>game</prism:category>
    <prism:category>theory</prism:category>
</item>



</rdf:RDF>

