<?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-20T19:38:48Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/80883" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/80883</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>Meyn, Sean P.</dc:contributor>
          <dc:creator>Pandit, Charuhas Pravin</dc:creator>
          <dc:date>2015-09-25T20:08:38Z</dc:date>
          <dc:date>2015-09-25T20:08:38Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2004</dc:date>
          <dc:date>2004</dc:date>
          <dc:description>The goal in the admission control problem considered here is to choose a suitable algorithm for admitting or rejecting sources on the basis of on-line measurements of packet statistics, in order to keep a certain overflow probability below a pre-specified threshold. The theory of extremal distributions developed in this thesis is applied to the design of robust algorithms for measurement-based admission control. In addition, models are developed for the evolution of flows and packets in the admission control system, and performance evaluation of the proposed algorithms is carried out through both simulations and analysis. Results show that the robust algorithms minimize the overflow probability among all moment-consistent algorithms.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:08:38Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3153394.pdf: 5422653 bytes, checksum: 3f2f22f1d3fc9eea038ef39a7b65b627 (MD5)
  Previous issue date: 2004</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82165
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>104 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/80883</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3153394</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Engineering, Electronics and Electrical</dc:subject>
          <dc:title>Robust Statistical Modeling Based on Moment Classes, With Applications to Admission Control, Large Deviations and Hypothesis Testing</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical Engineering</department>
            <discipline>Electrical Engineering</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
