{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd2-1136"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd2-1136","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"A Dynamic Routing Algorithm for High Traffic Networks","abstract":"This thesis proposes a new distributed, dynamic routing approach for communication networks involving high traffic. In such a network, load factor {amount of traffic) plays a key role in deciding the optimum path for sending a message from one node to another. A more practical method to estimate the load factor is proposed. The network is divided into several virtual areas and monitors are assigned to each area. The monitors keep track of area and network loads. Routing decisions are based on: load factors of relevant areas; urgency of the message; and the distance from the sending node to the receiving node. The routing technique proposed in this thesis reduced the time required, reduced network overflow, and realistically estimated the load factor. Our technique also utilizes the network capacity to near maximum when a critical message is delivered.","abstract_html":"This thesis proposes a new distributed, dynamic routing approach for communication networks involving high traffic. In such a network, load factor {amount of traffic) plays a key role in deciding the optimum path for sending a message from one node to another. A more practical method to estimate the load factor is proposed. The network is divided into several virtual areas and monitors are assigned to each area. The monitors keep track of area and network loads. Routing decisions are based on: load factors of relevant areas; urgency of the message; and the distance from the sending node to the receiving node. The routing technique proposed in this thesis reduced the time required, reduced network overflow, and realistically estimated the load factor. Our technique also utilizes the network capacity to near maximum when a critical message is delivered.","abstract_has_math":false,"creators":["Pampati, Sreedhar"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - University Access Only","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Bin Cong"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:03:18Z","subjects":["Computer Sciences","Physical Sciences and Mathematics"],"languages":["English"],"rights":[],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd2/132","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd2/132","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://openprairie.sdstate.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopenprairie.sdstate.edu%3Aetd2-1136","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bin Cong"]},{"key":"dc:creator","label":"Author","values":["Pampati, Sreedhar"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2021-11-08T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["1995-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - University Access Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Sciences","Physical Sciences and Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd2/132"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis proposes a new distributed, dynamic routing approach for communication networks involving high traffic. In such a network, load factor {amount of traffic) plays a key role in deciding the optimum path for sending a message from one node to another. A more practical method to estimate the load factor is proposed. The network is divided into several virtual areas and monitors are assigned to each area. The monitors keep track of area and network loads. Routing decisions are based on: load factors of relevant areas; urgency of the message; and the distance from the sending node to the receiving node. The routing technique proposed in this thesis reduced the time required, reduced network overflow, and realistically estimated the load factor. Our technique also utilizes the network capacity to near maximum when a critical message is delivered."]},{"key":"dc:title","label":"Title","values":["A Dynamic Routing Algorithm for High Traffic Networks"]}]}],"canonical_facts":{"dc:contributor":["Bin Cong"],"dc:creator":["Pampati, Sreedhar"],"dc:date.available":["2021-11-08T08:00:00Z"],"dc:date.created":["1995-01-01T08:00:00Z"],"dc:description.abstract":["This thesis proposes a new distributed, dynamic routing approach for communication networks involving high traffic. In such a network, load factor {amount of traffic) plays a key role in deciding the optimum path for sending a message from one node to another. A more practical method to estimate the load factor is proposed. The network is divided into several virtual areas and monitors are assigned to each area. The monitors keep track of area and network loads. Routing decisions are based on: load factors of relevant areas; urgency of the message; and the distance from the sending node to the receiving node. The routing technique proposed in this thesis reduced the time required, reduced network overflow, and realistically estimated the load factor. Our technique also utilizes the network capacity to near maximum when a critical message is delivered."],"dc:identifier":["https://openprairie.sdstate.edu/etd2/132"],"dc:language":["English"],"dc:rights":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Computer Sciences","Physical Sciences and Mathematics"],"dc:title":["A Dynamic Routing Algorithm for High Traffic Networks"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis - University Access Only"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T09:03:18Z"}