<?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:33 BST</pubDate>


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


	<link>http://www.citeulike.org/user/p2pstreaming/tag/optimization</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/2795182"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/2755265"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/2755122"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/383455"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/695313"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/670709"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/334075"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/334065"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/334002"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333987"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333978"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333977"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333973"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333972"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333971"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333968"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333933"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333894"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333893"/>

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


<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/2795182">
    <title>Rate-Distortion Optimization of Rate Control for H.264 With Adaptive Initial Quantization Parameter Determination</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/2795182</link>
    <description>&lt;i&gt;Circuits and Systems for Video Technology, IEEE Transactions on, Vol. 18, No. 1. (2008), pp. 140-144.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;A rate-distortion (R-D) optimization rate control (RC) algorithm with adaptive initialization is presented for H.264. First, a linear distortion-quantization (D-Q) model is introduced and thus a close-form solution is developed to derive optimal quantization parameters (Q&#60;sub&#62;p&#60;/sub&#62;)for encoding each macroblock. Then we exploit to determine the initial Q&#60;sub&#62;p&#60;/sub&#62; efficiently and adaptively according to the content of video sequences. The experimental results demonstrate that the proposed algorithm can achieve better R-D performance than that of other two RC algorithms including the algorithm JVT-G012 which is the current recommended RC scheme implemented in the H.264 reference software JM9.5.</description>
    <dc:title>Rate-Distortion Optimization of Rate Control for H.264 With Adaptive Initial Quantization Parameter Determination</dc:title>

    <dc:creator>Hanli Wang</dc:creator>
    <dc:creator>Sam Kwong</dc:creator>
    <dc:identifier>doi:10.1109/TCSVT.2007.913757</dc:identifier>
    <dc:source>Circuits and Systems for Video Technology, IEEE Transactions on, Vol. 18, No. 1. (2008), pp. 140-144.</dc:source>
    <dc:date>2008-05-13T14:35:48-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:publicationName>Circuits and Systems for Video Technology, IEEE Transactions on</prism:publicationName>
    <prism:volume>18</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>140</prism:startingPage>
    <prism:endingPage>144</prism:endingPage>
    <prism:category>control</prism:category>
    <prism:category>distortion</prism:category>
    <prism:category>h264</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>quantization</prism:category>
    <prism:category>rate</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/2755265">
    <title>Rate-distortion optimized streaming of packetized media</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/2755265</link>
    <description>&lt;i&gt;Multimedia, IEEE Transactions on, Vol. 8, No. 2. (2006), pp. 390-404.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper addresses the problem of streaming packetized media over a lossy packet network in a rate-distortion optimized way. We show that although the data units in a media presentation generally depend on each other according to a directed acyclic graph, the problem of rate-distortion optimized streaming of an entire presentation can be reduced to the problem of error-cost optimized transmission of an isolated data unit. We show how to solve the latter problem in a variety of scenarios, including the important common scenario of sender-driven streaming with feedback over a best-effort network, which we couch in the framework of Markov decision processes. We derive a fast practical algorithm for nearly optimal streaming in this scenario, and we derive a general purpose iterative descent algorithm for locally optimal streaming in arbitrary scenarios. Experimental results show that systems based on our algorithms have steady-state gains of 2-6 dB or more over systems that are not rate-distortion optimized. Furthermore, our systems essentially achieve the best possible performance: the operational distortion-rate function of the source at the capacity of the packet erasure channel.</description>
    <dc:title>Rate-distortion optimized streaming of packetized media</dc:title>

    <dc:creator>PA Chou</dc:creator>
    <dc:creator>Zhourong Miao</dc:creator>
    <dc:identifier>doi:10.1109/TMM.2005.864313</dc:identifier>
    <dc:source>Multimedia, IEEE Transactions on, Vol. 8, No. 2. (2006), pp. 390-404.</dc:source>
    <dc:date>2008-05-05T05:43:21-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Multimedia, IEEE Transactions on</prism:publicationName>
    <prism:volume>8</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>390</prism:startingPage>
    <prism:endingPage>404</prism:endingPage>
    <prism:category>distortion</prism:category>
    <prism:category>optimization</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:publicationYear>2006</prism:publicationYear>
    <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/383455">
    <title>On quality of service optimization with discrete QoS options</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/383455</link>
    <description>&lt;i&gt;Real-Time Technology and Applications Symposium, 1999. Proceedings of the Fifth IEEE (1999), pp. 276-286.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We present a QoS management framework that enables us to quantitatively measure QoS, and to analytically plan and allocate resources. In this model, end users' quality preferences are considered when system resources are apportional across multiple applications such that the net utility that accrues to the end-users is maximized. We previously worked with continuous QoS dimensions, and assumed that the utility gained by improvements along a QoS dimension were always representable by concave functions. In this paper we relax both assumptions. One, we support discrete QoS operating points. Two, we make no assumptions about the concavity of the utility functions. Using these as the basis, we tackle the problem of maximizing system utility by allocating a single finite resource to satisfy the QoS requirements of multiple applications along multiple QoS dimensions. We present two near-optimal algorithms to solve this problem. The first yields an allocation within a known bounded distance from the optimal solution, and the second yields an allocation whose distance from the optimal solution can be explicitly controlled by the QoS manager, We compare the run-times of these near-optimal algorithms and their solution quality relative to the optimal allocation, which in turn is computed using dynamic programming. These detailed evaluations provide practical insight into which of these algorithms can be used online in real-time systems</description>
    <dc:title>On quality of service optimization with discrete QoS options</dc:title>

    <dc:creator>Chen Lee</dc:creator>
    <dc:creator>J Lehoezky</dc:creator>
    <dc:creator>R Rajkumar</dc:creator>
    <dc:creator>D Siewiorek</dc:creator>
    <dc:source>Real-Time Technology and Applications Symposium, 1999. Proceedings of the Fifth IEEE (1999), pp. 276-286.</dc:source>
    <dc:date>2005-11-08T07:28:16-00:00</dc:date>
    <prism:publicationYear>1999</prism:publicationYear>
    <prism:publicationName>Real-Time Technology and Applications Symposium, 1999. Proceedings of the Fifth IEEE</prism:publicationName>
    <prism:startingPage>276</prism:startingPage>
    <prism:endingPage>286</prism:endingPage>
    <prism:category>discrete</prism:category>
    <prism:category>of</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>quality</prism:category>
    <prism:category>service</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:publicationYear>2005</prism:publicationYear>
    <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/670709">
    <title>Time-aware utility-based QoS optimization</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/670709</link>
    <description>&lt;i&gt;Euromicro Conference on Real-Time Systems (2003), pp. 83-92.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper presents a time-aware admission control and resource allocation scheme in the context of a future generation mobile network. The quality levels (and their respective utility) of the different connections are specified using discrete resource-utility (R-U) functions. The scheme uses these R-U functions for allocating and reallocating bandwidth to connections, aiming to maximize the accumulated utility of the system. However, different applications react differently to resource reallocations Therefore at each allocation timepoint we take into account the following factors: the age of the connection, a drop (disconnection) penalty and the sensitiveness to reallocation frequency. Finally, we show the superior performance of our approach compared to a recent adaptive bandwidth allocation scheme.</description>
    <dc:title>Time-aware utility-based QoS optimization</dc:title>

    <dc:creator>C Curescu</dc:creator>
    <dc:creator>S Nadjm-Tehrani</dc:creator>
    <dc:source>Euromicro Conference on Real-Time Systems (2003), pp. 83-92.</dc:source>
    <dc:date>2006-05-25T23:25:29-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:publicationName>Euromicro Conference on Real-Time Systems</prism:publicationName>
    <prism:startingPage>83</prism:startingPage>
    <prism:endingPage>92</prism:endingPage>
    <prism:category>optimization</prism:category>
    <prism:category>qos</prism:category>
    <prism:category>time</prism:category>
    <prism:category>utility</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/334075">
    <title>A Game Theoretic Framework for Bandwidth Allocation and Pricing in Broadband Networks</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/334075</link>
    <description>&lt;i&gt;IEEE/ACM Trans. on Networking, Vol. 8, No. 5. (October 2000), pp. 667-678.&lt;/i&gt;</description>
    <dc:title>A Game Theoretic Framework for Bandwidth Allocation and Pricing in Broadband Networks</dc:title>

    <dc:creator>H Yaiche</dc:creator>
    <dc:creator>RR Mazumdar</dc:creator>
    <dc:creator>C Rosenberg</dc:creator>
    <dc:source>IEEE/ACM Trans. on Networking, Vol. 8, No. 5. (October 2000), pp. 667-678.</dc:source>
    <dc:date>2005-09-28T16:28:00-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:publicationName>IEEE/ACM Trans. on Networking</prism:publicationName>
    <prism:volume>8</prism:volume>
    <prism:number>5</prism:number>
    <prism:startingPage>667</prism:startingPage>
    <prism:endingPage>678</prism:endingPage>
    <prism:category>allocation</prism:category>
    <prism:category>game</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>pricing</prism:category>
    <prism:category>resource</prism:category>
    <prism:category>theory</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/334065">
    <title>Can Shortest-path Routing and TCP Maximize Utility</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/334065</link>
    <description>&lt;i&gt;(2003)&lt;/i&gt;</description>
    <dc:title>Can Shortest-path Routing and TCP Maximize Utility</dc:title>

    <dc:creator>J Wang</dc:creator>
    <dc:creator>L Li</dc:creator>
    <dc:creator>S Low</dc:creator>
    <dc:creator>J Doyle</dc:creator>
    <dc:source>(2003)</dc:source>
    <dc:date>2005-09-28T16:27:59-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:category>optimization</prism:category>
    <prism:category>routing</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/334002">
    <title>Downlink Resource Allocation and Pricing for Wireless Networks</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/334002</link>
    <description>&lt;i&gt;(June 2002), pp. 23-27.&lt;/i&gt;</description>
    <dc:title>Downlink Resource Allocation and Pricing for Wireless Networks</dc:title>

    <dc:creator>P Marbach</dc:creator>
    <dc:creator>R Berry</dc:creator>
    <dc:source>(June 2002), pp. 23-27.</dc:source>
    <dc:date>2005-09-28T16:27:47-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:startingPage>23</prism:startingPage>
    <prism:endingPage>27</prism:endingPage>
    <prism:category>allocation</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>resource</prism:category>
    <prism:category>wireless</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333987">
    <title>Utility-based rate control in the Internet for elastic traffic</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333987</link>
    <description>&lt;i&gt;IEEE/ACM Trans. on Networking, Vol. 10, No. 2. (2002)&lt;/i&gt;</description>
    <dc:title>Utility-based rate control in the Internet for elastic traffic</dc:title>

    <dc:creator>RJ La</dc:creator>
    <dc:creator>V Anantharam</dc:creator>
    <dc:source>IEEE/ACM Trans. on Networking, Vol. 10, No. 2. (2002)</dc:source>
    <dc:date>2005-09-28T16:27:43-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:publicationName>IEEE/ACM Trans. on Networking</prism:publicationName>
    <prism:volume>{10}</prism:volume>
    <prism:number>{2}</prism:number>
    <prism:category>congestion</prism:category>
    <prism:category>control</prism:category>
    <prism:category>nonlinear</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>programming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333978">
    <title>Rate Control in Communication Networks: Shadow prices, Proportional Fairness and Stability</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333978</link>
    <description>&lt;i&gt;Journal of the Operational Research Society, Vol. 49 (1998)&lt;/i&gt;</description>
    <dc:title>Rate Control in Communication Networks: Shadow prices, Proportional Fairness and Stability</dc:title>

    <dc:creator>FP Kelly</dc:creator>
    <dc:creator>AK Maulloo</dc:creator>
    <dc:creator>DKH Tan</dc:creator>
    <dc:source>Journal of the Operational Research Society, Vol. 49 (1998)</dc:source>
    <dc:date>2005-09-28T16:27:42-00:00</dc:date>
    <prism:publicationYear>1998</prism:publicationYear>
    <prism:publicationName>Journal of the Operational Research Society</prism:publicationName>
    <prism:volume>{49}</prism:volume>
    <prism:category>congestion</prism:category>
    <prism:category>control</prism:category>
    <prism:category>nonlinear</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>pricing</prism:category>
    <prism:category>programming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333977">
    <title>Charging and Rate Control for Elastic Traffic</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333977</link>
    <description>&lt;i&gt;European Trans. on Telecommunications, Vol. 8 (1997)&lt;/i&gt;</description>
    <dc:title>Charging and Rate Control for Elastic Traffic</dc:title>

    <dc:creator>FP Kelly</dc:creator>
    <dc:source>European Trans. on Telecommunications, Vol. 8 (1997)</dc:source>
    <dc:date>2005-09-28T16:27:42-00:00</dc:date>
    <prism:publicationYear>1997</prism:publicationYear>
    <prism:publicationName>European Trans. on Telecommunications</prism:publicationName>
    <prism:volume>{8}</prism:volume>
    <prism:category>congestion</prism:category>
    <prism:category>control</prism:category>
    <prism:category>nonlinear</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>pricing</prism:category>
    <prism:category>programming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333973">
    <title>Optimization Based Rate Control for Multirate Multicast Sessions</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333973</link>
    <description>&lt;i&gt;(2001)&lt;/i&gt;</description>
    <dc:title>Optimization Based Rate Control for Multirate Multicast Sessions</dc:title>

    <dc:creator>K Kar</dc:creator>
    <dc:creator>S Sarkar</dc:creator>
    <dc:creator>L Tassiulas</dc:creator>
    <dc:source>(2001)</dc:source>
    <dc:date>2005-09-28T16:27:42-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:category>allocation</prism:category>
    <prism:category>multicast</prism:category>
    <prism:category>nonlinear</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>programming</prism:category>
    <prism:category>resource</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333972">
    <title>A Simple Rate Control Algorithm for Maximizing Total User Utility</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333972</link>
    <description>&lt;i&gt;(2001)&lt;/i&gt;</description>
    <dc:title>A Simple Rate Control Algorithm for Maximizing Total User Utility</dc:title>

    <dc:creator>K Kar</dc:creator>
    <dc:creator>S Sarkar</dc:creator>
    <dc:creator>L Tassiulas</dc:creator>
    <dc:source>(2001)</dc:source>
    <dc:date>2005-09-28T16:27:42-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:category>congestion</prism:category>
    <prism:category>control</prism:category>
    <prism:category>nonlinear</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>programming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333971">
    <title>A Low-Overhead Rate Control Algorithms for Maximizing Aggregate Receiver Utility for Multirate Multicast Sessions</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333971</link>
    <description>&lt;i&gt;(2001)&lt;/i&gt;</description>
    <dc:title>A Low-Overhead Rate Control Algorithms for Maximizing Aggregate Receiver Utility for Multirate Multicast Sessions</dc:title>

    <dc:creator>K Kar</dc:creator>
    <dc:creator>S Sarkar</dc:creator>
    <dc:creator>L Tassiulas</dc:creator>
    <dc:source>(2001)</dc:source>
    <dc:date>2005-09-28T16:27:42-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:category>congestion</prism:category>
    <prism:category>control</prism:category>
    <prism:category>multicast</prism:category>
    <prism:category>nonlinear</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>programming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333968">
    <title>QoS and Fairness Constrained Convex Optimization of Resource Allocation for Wireless Cellular and Ad Hoc Networks</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333968</link>
    <description>&lt;i&gt;(June 2002), pp. 477-486.&lt;/i&gt;</description>
    <dc:title>QoS and Fairness Constrained Convex Optimization of Resource Allocation for Wireless Cellular and Ad Hoc Networks</dc:title>

    <dc:creator>D Julian</dc:creator>
    <dc:creator>M Chiang</dc:creator>
    <dc:creator>D O'Neill</dc:creator>
    <dc:creator>S Boyd</dc:creator>
    <dc:source>(June 2002), pp. 477-486.</dc:source>
    <dc:date>2005-09-28T16:27:42-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:startingPage>477</prism:startingPage>
    <prism:endingPage>486</prism:endingPage>
    <prism:category>ad</prism:category>
    <prism:category>allocation</prism:category>
    <prism:category>hoc</prism:category>
    <prism:category>network</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>resource</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333933">
    <title>Control and Optimization Methods in Communication Network Problems</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333933</link>
    <description>&lt;i&gt;IEEE Transactions on Automatic Control, Vol. 34, No. 9. (1989)&lt;/i&gt;</description>
    <dc:title>Control and Optimization Methods in Communication Network Problems</dc:title>

    <dc:creator>A Ephremides</dc:creator>
    <dc:creator>S Verdu</dc:creator>
    <dc:source>IEEE Transactions on Automatic Control, Vol. 34, No. 9. (1989)</dc:source>
    <dc:date>2005-09-28T16:27:35-00:00</dc:date>
    <prism:publicationYear>1989</prism:publicationYear>
    <prism:publicationName>IEEE Transactions on Automatic Control</prism:publicationName>
    <prism:volume>34</prism:volume>
    <prism:number>9</prism:number>
    <prism:category>communication</prism:category>
    <prism:category>control</prism:category>
    <prism:category>network</prism:category>
    <prism:category>optimization</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333894">
    <title>Parallel and Distributed Computation</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333894</link>
    <description>&lt;i&gt;(1989)&lt;/i&gt;</description>
    <dc:title>Parallel and Distributed Computation</dc:title>

    <dc:creator>D Bertsekas</dc:creator>
    <dc:creator>J Tsitsiklis</dc:creator>
    <dc:source>(1989)</dc:source>
    <dc:date>2005-09-28T16:27:21-00:00</dc:date>
    <prism:publicationYear>1989</prism:publicationYear>
    <prism:publisher>Prentice-Hall</prism:publisher>
    <prism:category>optimization</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333893">
    <title>Nonlinear Programming</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333893</link>
    <description>&lt;i&gt;(1999)&lt;/i&gt;</description>
    <dc:title>Nonlinear Programming</dc:title>

    <dc:creator>D Bertsekas</dc:creator>
    <dc:source>(1999)</dc:source>
    <dc:date>2005-09-28T16:27:21-00:00</dc:date>
    <prism:publicationYear>1999</prism:publicationYear>
    <prism:publisher>Athena Scientific</prism:publisher>
    <prism:category>nonlinear</prism:category>
    <prism:category>optimization</prism:category>
    <prism:category>programming</prism:category>
</item>



</rdf:RDF>

