<?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-22T06:28:10Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81303" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81303</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>Upamanyu Madhow</dc:contributor>
          <dc:creator>Chaskar, Hemant Madhusudan</dc:creator>
          <dc:date>2015-09-25T20:10:27Z</dc:date>
          <dc:date>2015-09-25T20:10:27Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>1999</dc:date>
          <dc:date>1999</dc:date>
          <dc:description>The goal in the second part of the thesis is the alleviation of a potential processing bottleneck encountered in packet scheduling in high-speed wireline networks. The scheduler should be designed to provide minimum-bandwidth and delay guarantees, and fair sharing of excess bandwidth. In the state-of-the-art schedulers, based on the weighted fair queuing (WFQ) paradigm, packets are assigned (transmission sequence) tags based on the bandwidth shares of the connections. In order to relieve the processing burden due to tag computation and sorting, variants of weighted round robin (WRR) scheduling paradigm are proposed in this thesis. Contrary to conventional thinking, it is shown that, for networks with fixed packet lengths, such WRR schemes can guarantee the same desirable properties as different WFQ schemes.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:10:27Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
9952986.pdf: 5400920 bytes, checksum: eabe90835830519d90ef109e514b5750 (MD5)
  Previous issue date: 1999</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82584
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>89 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81303</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI9952986</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Engineering, Electronics and Electrical</dc:subject>
          <dc:title>Quality of Service Provisioning in Wireless and High-Speed 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>
