<?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:54:13Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/69582" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/69582</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</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:subject>Computer Science</dc:subject>
          <dc:contributor>Reed, Daniel</dc:contributor>
          <dc:creator>Kim, Chong Kwon</dc:creator>
          <dc:date>2014-12-15T19:25:58Z</dc:date>
          <dc:date>2014-12-15T19:25:58Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>1987</dc:date>
          <dc:date>1987</dc:date>
          <dc:description>Voice, data, and video traffic share the same transmission and switching facilities in integrated switching networks. Because resources are dynamically shared, integrated switching can support heterogeneous traffic cost effectively. In addition, integrated switching is flexible and access transparent. However, integrated networks have more dynamic traffic fluctuations than packet or circuit switching networks. Hence, it is necessary to use efficient routing algorithms to fully achieve the potential advantage of integrated switching.</dc:description>
          <dc:description>Five existing packet routing algorithms were selected for our performance study: NRCC, random, shortest queue, delta, and priority queue routing. In addition, a new hybrid technique called hybrid weighted routing was developed and included in this study. In hybrid weighted routing, local nodes adjust the credit (weight) given to global and local information.</dc:description>
          <dc:description>Results from packet switching network simulation and integrated network simulation indicated the superiority of hybrid weighted routing. Especially, in a movable boundary integrated network, hybrid weighted routing supported a larger fraction of traffic, while still maintaining smaller packet delay. A further study indicated the feasibility of using a unified routing algorithm for both packet and circuit traffic. A circuit routing algorithm based on hybrid weighted routing reduced call blocking probability significantly without degrading the performance of packet traffic. Finally, the above observations were confirmed by simulation on a hypercube, a message passing parallel processing machine.</dc:description>
          <dc:description>Made available in DSpace on 2014-12-15T19:25:58Z (GMT). No. of bitstreams: 1
8803086.pdf: 4356933 bytes, checksum: 68189392267f2ba5d704d2ab7794e358 (MD5)
  Previous issue date: 1987</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 69748
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>142 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/69582</dc:identifier>
          <dc:identifier>(UMI)AAI8803086</dc:identifier>
          <dc:title>Integrated Switching Networks: A Performance Study</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
