<?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-22T21:48:33Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81348" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81348</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>Giles, James Ryan</dc:creator>
          <dc:date>2015-09-25T20:10:41Z</dc:date>
          <dc:date>2015-09-25T20:10:41Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2000</dc:date>
          <dc:date>2000</dc:date>
          <dc:description>Jammers which have quantized batch departures at regular intervals are shown to perform well. Batch inputs at regular intervals perform well for maximum delay constrained or maximum buffer size constrained jammers, while batch inputs with batch arrival times chosen at random perform well for average delay constrained jammers.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:10:41Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
9990004.pdf: 4888098 bytes, checksum: 2a062a91376597cc3d485daa761aa4d7 (MD5)
  Previous issue date: 2000</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82629
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>102 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81348</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI9990004</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>An Information-Theoretic and Game-Theoretic Study of Timing Channels</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>
