{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81602"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81602","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Alternate Routing Protocols for Bridged Networks","abstract":"The work in this dissertation aims at enhancing the provision of QoS in bridged networks by introducing two alternate routing protocols. We design a novel bridge protocol that can forward frames on paths that are provably shorter than the paths that the standard provides. This protocol is called the Spanning Tree Alternate Routing (STAR) Bridge Protocol. STAR bridge protocol is backward compatible, which means that bridges in a bridged network can be incrementally upgraded instead of being replaced all at once. The complexity of the STAR protocol is comparable to existing mechanisms. To allow a system administrator to identify where to upgrade legacy bridges to be STAR bridges, we devise a placement strategy for STAR bridges. We formulate the performance gain and devise an algorithm that computes the locations for legacy bridges replacement that maximizes performance gain. To provide path differentiation in a bridged network, we devise a protocol called the Prioritized Enhanced Alternate Routing Load-balancing (PEARL) Protocol. The PEARL protocol can work with any bridge protocol that provides shorter path information to forward frames according to their priorities. We introduce a flexible and adjustable function for making forwarding decisions. We identify the properties of the function that are necessary to ensure frames of higher priority will never be forwarded on a path which is longer than a frame of lower priority will be forwarded on. As the function is simple, our PEARL protocol does not increase the computation, storage requirement, and storage overhead of the standard protocol.","abstract_html":"The work in this dissertation aims at enhancing the provision of QoS in bridged networks by introducing two alternate routing protocols. We design a novel bridge protocol that can forward frames on paths that are provably shorter than the paths that the standard provides. This protocol is called the Spanning Tree Alternate Routing (STAR) Bridge Protocol. STAR bridge protocol is backward compatible, which means that bridges in a bridged network can be incrementally upgraded instead of being replaced all at once. The complexity of the STAR protocol is comparable to existing mechanisms. To allow a system administrator to identify where to upgrade legacy bridges to be STAR bridges, we devise a placement strategy for STAR bridges. We formulate the performance gain and devise an algorithm that computes the locations for legacy bridges replacement that maximizes performance gain. To provide path differentiation in a bridged network, we devise a protocol called the Prioritized Enhanced Alternate Routing Load-balancing (PEARL) Protocol. The PEARL protocol can work with any bridge protocol that provides shorter path information to forward frames according to their priorities. We introduce a flexible and adjustable function for making forwarding decisions. We identify the properties of the function that are necessary to ensure frames of higher priority will never be forwarded on a path which is longer than a frame of lower priority will be forwarded on. As the function is simple, our PEARL protocol does not increase the computation, storage requirement, and storage overhead of the standard protocol.","abstract_has_math":false,"creators":["Lui, King-Shan"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Nahrstedt, Klara"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:26Z","date_published":"2015-09-25T20:19:26Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3044165"],"render_values":[{"text":"(MiAaPQ)AAI3044165","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81602","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nahrstedt, Klara"]},{"key":"dc:creator","label":"Author","values":["Lui, King-Shan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:26Z","10000-01-01","2002"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81602","(MiAaPQ)AAI3044165"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The work in this dissertation aims at enhancing the provision of QoS in bridged networks by introducing two alternate routing protocols. We design a novel bridge protocol that can forward frames on paths that are provably shorter than the paths that the standard provides. This protocol is called the Spanning Tree Alternate Routing (STAR) Bridge Protocol. STAR bridge protocol is backward compatible, which means that bridges in a bridged network can be incrementally upgraded instead of being replaced all at once. The complexity of the STAR protocol is comparable to existing mechanisms. To allow a system administrator to identify where to upgrade legacy bridges to be STAR bridges, we devise a placement strategy for STAR bridges. We formulate the performance gain and devise an algorithm that computes the locations for legacy bridges replacement that maximizes performance gain. To provide path differentiation in a bridged network, we devise a protocol called the Prioritized Enhanced Alternate Routing Load-balancing (PEARL) Protocol. The PEARL protocol can work with any bridge protocol that provides shorter path information to forward frames according to their priorities. We introduce a flexible and adjustable function for making forwarding decisions. We identify the properties of the function that are necessary to ensure frames of higher priority will never be forwarded on a path which is longer than a frame of lower priority will be forwarded on. As the function is simple, our PEARL protocol does not increase the computation, storage requirement, and storage overhead of the standard protocol.","Made available in DSpace on 2015-09-25T20:19:26Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3044165.pdf: 4618967 bytes, checksum: 8d1d977fc7527079be0bcea5031b7147 (MD5) Previous issue date: 2002","Embargo set by: Seth Robbins for item 82883 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","110 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002."]},{"key":"dc:title","label":"Title","values":["Alternate Routing Protocols for Bridged Networks"]}]}],"canonical_facts":{"dc:contributor":["Nahrstedt, Klara"],"dc:creator":["Lui, King-Shan"],"dc:date":["2015-09-25T20:19:26Z","10000-01-01","2002"],"dc:description":["The work in this dissertation aims at enhancing the provision of QoS in bridged networks by introducing two alternate routing protocols. We design a novel bridge protocol that can forward frames on paths that are provably shorter than the paths that the standard provides. This protocol is called the Spanning Tree Alternate Routing (STAR) Bridge Protocol. STAR bridge protocol is backward compatible, which means that bridges in a bridged network can be incrementally upgraded instead of being replaced all at once. The complexity of the STAR protocol is comparable to existing mechanisms. To allow a system administrator to identify where to upgrade legacy bridges to be STAR bridges, we devise a placement strategy for STAR bridges. We formulate the performance gain and devise an algorithm that computes the locations for legacy bridges replacement that maximizes performance gain. To provide path differentiation in a bridged network, we devise a protocol called the Prioritized Enhanced Alternate Routing Load-balancing (PEARL) Protocol. The PEARL protocol can work with any bridge protocol that provides shorter path information to forward frames according to their priorities. We introduce a flexible and adjustable function for making forwarding decisions. We identify the properties of the function that are necessary to ensure frames of higher priority will never be forwarded on a path which is longer than a frame of lower priority will be forwarded on. As the function is simple, our PEARL protocol does not increase the computation, storage requirement, and storage overhead of the standard protocol.","Made available in DSpace on 2015-09-25T20:19:26Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3044165.pdf: 4618967 bytes, checksum: 8d1d977fc7527079be0bcea5031b7147 (MD5) Previous issue date: 2002","Embargo set by: Seth Robbins for item 82883 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","110 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002."],"dc:identifier":["http://hdl.handle.net/2142/81602","(MiAaPQ)AAI3044165"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Alternate Routing Protocols for Bridged Networks"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}