{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/20981"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/20981","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Scheduling real-time messages in packet-switched networks","abstract":"In a real-time network, it is not practical to have one centralized scheduler manage all the network resources, e.g., the transmission links and buffer space. Instead, each node has its own scheduler which manages the various resources at that node. In an ideal case, the schedulers are completely independent, and the well-known scheduling and analysis techniques developed for single-node systems can be used, thus greatly simplifying the real-time network design. However the use of independent schedulers may lead to buffer overruns or missed deadlines and hence, network failure. This thesis addresses the problems that arise in scheduling real-time messages in a packet-switched network that has multiple schedulers and has limited buffer space. In our development of the schedulers and the mechanisms for synchronization between the schedulers, we address the following issues: the complexity of the scheduler, the complexity of the synchronization mechanism, the scheme for admission control, the achievable utilization of the network, the ability of the scheduler to meet diverse real-time requests, and the robustness of the scheduler under unpredictable conditions such as temporary overload.","abstract_html":"In a real-time network, it is not practical to have one centralized scheduler manage all the network resources, e.g., the transmission links and buffer space. Instead, each node has its own scheduler which manages the various resources at that node. In an ideal case, the schedulers are completely independent, and the well-known scheduling and analysis techniques developed for single-node systems can be used, thus greatly simplifying the real-time network design. However the use of independent schedulers may lead to buffer overruns or missed deadlines and hence, network failure. This thesis addresses the problems that arise in scheduling real-time messages in a packet-switched network that has multiple schedulers and has limited buffer space. In our development of the schedulers and the mechanisms for synchronization between the schedulers, we address the following issues: the complexity of the scheduler, the complexity of the synchronization mechanism, the scheme for admission control, the achievable utilization of the network, the ability of the scheduler to meet diverse real-time requests, and the robustness of the scheduler under unpredictable conditions such as temporary overload.","abstract_has_math":false,"creators":["Philp, Ian Ramsay"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Liu, Jane W.S."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T12:54:52Z","date_published":"2011-05-07T12:54:52Z","updated_at":"2026-07-22T22:25:17Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1996 Philp, Ian Ramsay"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["9780591255201","AAI9717327","(UMI)AAI9717327"],"render_values":[{"text":"9780591255201","href":null,"code":true},{"text":"AAI9717327","href":null,"code":true},{"text":"(UMI)AAI9717327","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/20981","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Liu, Jane W.S."]},{"key":"dc:creator","label":"Author","values":["Philp, Ian Ramsay"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:54:52Z","10000-01-01","1996"]},{"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"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1996 Philp, Ian Ramsay"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["9780591255201","AAI9717327","(UMI)AAI9717327","http://hdl.handle.net/2142/20981"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In a real-time network, it is not practical to have one centralized scheduler manage all the network resources, e.g., the transmission links and buffer space. Instead, each node has its own scheduler which manages the various resources at that node. In an ideal case, the schedulers are completely independent, and the well-known scheduling and analysis techniques developed for single-node systems can be used, thus greatly simplifying the real-time network design. However the use of independent schedulers may lead to buffer overruns or missed deadlines and hence, network failure. This thesis addresses the problems that arise in scheduling real-time messages in a packet-switched network that has multiple schedulers and has limited buffer space. In our development of the schedulers and the mechanisms for synchronization between the schedulers, we address the following issues: the complexity of the scheduler, the complexity of the synchronization mechanism, the scheme for admission control, the achievable utilization of the network, the ability of the scheduler to meet diverse real-time requests, and the robustness of the scheduler under unpredictable conditions such as temporary overload.","Made available in DSpace on 2011-05-07T12:54:52Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9717327.pdf: 4737292 bytes, checksum: d14b08de2b556c77894b6203181e4d1a (MD5) Previous issue date: 1996","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:47:40Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:21:32-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Scheduling real-time messages in packet-switched networks"]}]}],"canonical_facts":{"dc:contributor":["Liu, Jane W.S."],"dc:creator":["Philp, Ian Ramsay"],"dc:date":["2011-05-07T12:54:52Z","10000-01-01","1996"],"dc:description":["In a real-time network, it is not practical to have one centralized scheduler manage all the network resources, e.g., the transmission links and buffer space. Instead, each node has its own scheduler which manages the various resources at that node. In an ideal case, the schedulers are completely independent, and the well-known scheduling and analysis techniques developed for single-node systems can be used, thus greatly simplifying the real-time network design. However the use of independent schedulers may lead to buffer overruns or missed deadlines and hence, network failure. This thesis addresses the problems that arise in scheduling real-time messages in a packet-switched network that has multiple schedulers and has limited buffer space. In our development of the schedulers and the mechanisms for synchronization between the schedulers, we address the following issues: the complexity of the scheduler, the complexity of the synchronization mechanism, the scheme for admission control, the achievable utilization of the network, the ability of the scheduler to meet diverse real-time requests, and the robustness of the scheduler under unpredictable conditions such as temporary overload.","Made available in DSpace on 2011-05-07T12:54:52Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9717327.pdf: 4737292 bytes, checksum: d14b08de2b556c77894b6203181e4d1a (MD5) Previous issue date: 1996","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:47:40Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:21:32-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["9780591255201","AAI9717327","(UMI)AAI9717327","http://hdl.handle.net/2142/20981"],"dc:language":["eng"],"dc:rights":["Copyright 1996 Philp, Ian Ramsay"],"dc:subject":["Computer Science"],"dc:title":["Scheduling real-time messages in packet-switched 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:25:17Z"}