<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-21T00:04:16Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/44239" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/44239</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Hajek, Bruce</dc:contributor>
          <dc:creator>Yang, James</dc:creator>
          <dc:date>2013-05-24T21:55:14Z</dc:date>
          <dc:date>2013-05-24T21:55:14Z</dc:date>
          <dc:date>2013-05</dc:date>
          <dc:date>2013-05-24T21:55:14Z</dc:date>
          <dc:date>2013-05</dc:date>
          <dc:description>We study the content placement problem for cache delivery video-on-demand systems under static random network topologies with fixed heavy-tailed video demand. The performance measure is the amount of server load; we wish to minimize the total download rate for all users from the server and maximize the rate from caches. Our approach reduces the analysis for multiple videos to consideration of decoupled systems with only a single video. For each placement policy, insights gained from the single video analysis carry back to the original multiple video content placement problem. Finally, we propose a hybrid placement technique that achieves near optimal performance with less complexity.</dc:description>
          <dc:description>Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-04-11T15:06:03Z
Item was in collections:
University of Illinois Theses &amp; Dissertations (ID: 1)
No. of bitstreams: 11
thesisrefs.bib: 42762 bytes, checksum: 8d01385cafe3be1738b79221d92b15b3 (MD5)
conclusion.tex: 1321 bytes, checksum: d9b85c7436f4c73650d3405ccbf058f4 (MD5)
relatedwork.tex: 4358 bytes, checksum: 7cbbf521fd13a50ace76cc7fb208084c (MD5)
multiplevideoplacement.tex: 15635 bytes, checksum: 6ea360cace49b616aa3b8e399312127f (MD5)
singlevideocomparison.tex: 4697 bytes, checksum: 99422dfb9e8ab3479e12590855e46208 (MD5)
singlevideoanalysis.tex: 20347 bytes, checksum: 3494bdff20d99602b689b32f4f1c1e40 (MD5)
modelsandassump.tex: 6807 bytes, checksum: 337199f2814c71900e5fd5fa9f11cd08 (MD5)
intro.tex: 3632 bytes, checksum: 8bd63e7fe1cd1c94faa1b46ef38a0e89 (MD5)
abs.tex: 692 bytes, checksum: 6cd6bc2a31567077f5bf74e129cb9446 (MD5)
ecethesis.tex: 5371 bytes, checksum: 9872d0b0eb25c05d6cf32a7516921d51 (MD5)
Yang_James.pdf: 372404 bytes, checksum: 20116d5b435959ba900805672db2b655 (MD5)</dc:description>
          <dc:description>Made available in DSpace on 2013-05-24T21:55:14Z (GMT). No. of bitstreams: 12
James_Yang.pdf: 372404 bytes, checksum: 20116d5b435959ba900805672db2b655 (MD5)
thesisrefs.bib: 42762 bytes, checksum: 8d01385cafe3be1738b79221d92b15b3 (MD5)
conclusion.tex: 1321 bytes, checksum: d9b85c7436f4c73650d3405ccbf058f4 (MD5)
relatedwork.tex: 4358 bytes, checksum: 7cbbf521fd13a50ace76cc7fb208084c (MD5)
multiplevideoplacement.tex: 15635 bytes, checksum: 6ea360cace49b616aa3b8e399312127f (MD5)
singlevideocomparison.tex: 4697 bytes, checksum: 99422dfb9e8ab3479e12590855e46208 (MD5)
singlevideoanalysis.tex: 20347 bytes, checksum: 3494bdff20d99602b689b32f4f1c1e40 (MD5)
modelsandassump.tex: 6807 bytes, checksum: 337199f2814c71900e5fd5fa9f11cd08 (MD5)
intro.tex: 3632 bytes, checksum: 8bd63e7fe1cd1c94faa1b46ef38a0e89 (MD5)
abs.tex: 692 bytes, checksum: 6cd6bc2a31567077f5bf74e129cb9446 (MD5)
ecethesis.tex: 5371 bytes, checksum: 9872d0b0eb25c05d6cf32a7516921d51 (MD5)
license.txt: 4059 bytes, checksum: 49e75ed42f895344f269fff33d867d53 (MD5)</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/44239</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2013 James Yang</dc:rights>
          <dc:subject>Cache delivery</dc:subject>
          <dc:subject>Video-on-demand (VoD)</dc:subject>
          <dc:subject>Peer-to-peer (P2P)</dc:subject>
          <dc:subject>random network topology</dc:subject>
          <dc:subject>Content placement</dc:subject>
          <dc:subject>Adaptive placement</dc:subject>
          <dc:subject>Fractional storage</dc:subject>
          <dc:subject>Integer relaxation</dc:subject>
          <dc:subject>Hybrid placement</dc:subject>
          <dc:subject>Single video analysis</dc:subject>
          <dc:subject>Multiple video analysis</dc:subject>
          <dc:subject>Decoupled systems</dc:subject>
          <dc:subject>Primal-dual algorithm</dc:subject>
          <dc:subject>General algorithm</dc:subject>
          <dc:subject>Maximum distance separable (MDS) codes</dc:subject>
          <dc:title>Single video performance analysis for video-on-demand systems</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical &amp; Computer Eng</department>
            <departmentCode>1933</departmentCode>
            <discipline>Electrical &amp; Computer Engr</discipline>
            <disciplineCode>1200</disciplineCode>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
            <program>MS:Electr &amp; Computer Eng-UIUC</program>
            <programCode>10KS1200MS</programCode>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
