{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/80896"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/80896","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Dynamic Rate Controlled Input -Buffered Switch System With QoS","abstract":"In the dissertation, we propose a new scheduling algorithm, dynamic rate controlled input output (DRCIO), which addresses the scalability and the implementability for a highly distributed high speed router. We developed the algorithm based on a Washington University (WASU) high speed switch. We first review the relationship between the queuing mechanism and the scheduling algorithm. We discuss the importance of the proper queuing mechanism for a router to be scalable. And we explain the in detail the measurement based backlog estimation for the distributed packet scheduling algorithm. We show that the complexity of this method is O(1) to calculate the total backlog, which is a significant improvement as it normally takes O( V), where V is the number of flows in a router. We also review the risks of inaccuracy when we resort to this O( 1) method. To prove the robustness of the DRCIO, we review the operation of the DRCIO in several boundary conditions, and show that the algorithm is robust enough to recover from any boundary or erroneous conditions.","abstract_html":"In the dissertation, we propose a new scheduling algorithm, dynamic rate controlled input output (DRCIO), which addresses the scalability and the implementability for a highly distributed high speed router. We developed the algorithm based on a Washington University (WASU) high speed switch. We first review the relationship between the queuing mechanism and the scheduling algorithm. We discuss the importance of the proper queuing mechanism for a router to be scalable. And we explain the in detail the measurement based backlog estimation for the distributed packet scheduling algorithm. We show that the complexity of this method is O(1) to calculate the total backlog, which is a significant improvement as it normally takes O( V), where V is the number of flows in a router. We also review the risks of inaccuracy when we resort to this O( 1) method. To prove the robustness of the DRCIO, we review the operation of the DRCIO in several boundary conditions, and show that the algorithm is robust enough to recover from any boundary or erroneous conditions.","abstract_has_math":false,"creators":["Park, Sueng-Yong"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":["Steve (sung-Mo) Kong"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:08:42Z","date_published":"2015-09-25T20:08:42Z","updated_at":"2026-07-22T22:26:15Z","subjects":["Engineering, Electronics and Electrical"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3160938"],"render_values":[{"text":"(MiAaPQ)AAI3160938","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/80896","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Steve (sung-Mo) Kong"]},{"key":"dc:creator","label":"Author","values":["Park, Sueng-Yong"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:08:42Z","10000-01-01","2004"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"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":["Engineering, Electronics and Electrical"]}]},{"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/80896","(MiAaPQ)AAI3160938"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In the dissertation, we propose a new scheduling algorithm, dynamic rate controlled input output (DRCIO), which addresses the scalability and the implementability for a highly distributed high speed router. We developed the algorithm based on a Washington University (WASU) high speed switch. We first review the relationship between the queuing mechanism and the scheduling algorithm. We discuss the importance of the proper queuing mechanism for a router to be scalable. And we explain the in detail the measurement based backlog estimation for the distributed packet scheduling algorithm. We show that the complexity of this method is O(1) to calculate the total backlog, which is a significant improvement as it normally takes O( V), where V is the number of flows in a router. We also review the risks of inaccuracy when we resort to this O( 1) method. To prove the robustness of the DRCIO, we review the operation of the DRCIO in several boundary conditions, and show that the algorithm is robust enough to recover from any boundary or erroneous conditions.","Made available in DSpace on 2015-09-25T20:08:42Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3160938.pdf: 5472259 bytes, checksum: 80a275983ee91c45fad90eb3f40daa15 (MD5) Previous issue date: 2004","Embargo set by: Seth Robbins for item 82178 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","132 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004."]},{"key":"dc:title","label":"Title","values":["Dynamic Rate Controlled Input -Buffered Switch System With QoS"]}]}],"canonical_facts":{"dc:contributor":["Steve (sung-Mo) Kong"],"dc:creator":["Park, Sueng-Yong"],"dc:date":["2015-09-25T20:08:42Z","10000-01-01","2004"],"dc:description":["In the dissertation, we propose a new scheduling algorithm, dynamic rate controlled input output (DRCIO), which addresses the scalability and the implementability for a highly distributed high speed router. We developed the algorithm based on a Washington University (WASU) high speed switch. We first review the relationship between the queuing mechanism and the scheduling algorithm. We discuss the importance of the proper queuing mechanism for a router to be scalable. And we explain the in detail the measurement based backlog estimation for the distributed packet scheduling algorithm. We show that the complexity of this method is O(1) to calculate the total backlog, which is a significant improvement as it normally takes O( V), where V is the number of flows in a router. We also review the risks of inaccuracy when we resort to this O( 1) method. To prove the robustness of the DRCIO, we review the operation of the DRCIO in several boundary conditions, and show that the algorithm is robust enough to recover from any boundary or erroneous conditions.","Made available in DSpace on 2015-09-25T20:08:42Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3160938.pdf: 5472259 bytes, checksum: 80a275983ee91c45fad90eb3f40daa15 (MD5) Previous issue date: 2004","Embargo set by: Seth Robbins for item 82178 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","132 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004."],"dc:identifier":["http://hdl.handle.net/2142/80896","(MiAaPQ)AAI3160938"],"dc:language":["eng"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["Dynamic Rate Controlled Input -Buffered Switch System With QoS"],"dc:type":["text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:15Z"}