<?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-22T20:11:50Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81211" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81211</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>Andrew A. Chien</dc:contributor>
          <dc:creator>Kim, Jae H.</dc:creator>
          <dc:date>2015-09-25T20:10:04Z</dc:date>
          <dc:date>2015-09-25T20:10:04Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>1997</dc:date>
          <dc:date>1997</dc:date>
          <dc:description>Based on the lessons learned from the study of ALU-biasing arbitration, we present a novel, cost-effective queueing and scheduling algorithm, called Rotating Combined Queueing (RCQ), which can efficiently support a range of service guarantees including deterministic delay bounds and bandwidth guarantees in multicomputer networks. We evaluate the quality of service that RCQ networks can provide and compare it to those of existing algorithms. Hardware costs for their implementations are also compared. Our results show that the suggested scheme overcomes limitations of the ServerNet approach and provides comparable quality of services to existing complicated approaches at much lower runtime overhead and implementation complexity.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:10:04Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
9812653.pdf: 10916186 bytes, checksum: 530706edf1d2c51e8e6bbe901feae97d (MD5)
  Previous issue date: 1997</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82492
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>222 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81211</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI9812653</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Bandwidth and Latency Guarantees in Low-Cost, High-Performance Networks</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>
