{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/29821"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/29821","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Supporting delay guarantees over unreliable wireless channels","abstract":"Many emerging applications of networks require delay guarantees for packet deliveries. It is particularly challenging to provide services for these applications over wireless channels, since wireless transmissions are usually unreliable. In this dissertation, we provide a theory that formulates and addresses the problem of serving flows with delay guarantees over unreliable wireless channels. The core of this theory is an analytical model that jointly considers several practical aspects of flows with delay guarantees: traffic patterns, per-packet delay bounds, throughput requirements, and channel reliabilities. The model can also address fading channels and the usage of rate adaptation. Based on this model, we obtain solutions for three important mechanisms: admission control, packet scheduling, and utility maximization. In addition, we address the scenario of broadcasting flows with delay constraints and incorporate various network coding mechanisms. We also extend models used in the real-time system literature and discuss the scheduling problem for a multimedia server.","abstract_html":"Many emerging applications of networks require delay guarantees for packet deliveries. It is particularly challenging to provide services for these applications over wireless channels, since wireless transmissions are usually unreliable. In this dissertation, we provide a theory that formulates and addresses the problem of serving flows with delay guarantees over unreliable wireless channels. The core of this theory is an analytical model that jointly considers several practical aspects of flows with delay guarantees: traffic patterns, per-packet delay bounds, throughput requirements, and channel reliabilities. The model can also address fading channels and the usage of rate adaptation. Based on this model, we obtain solutions for three important mechanisms: admission control, packet scheduling, and utility maximization. In addition, we address the scenario of broadcasting flows with delay constraints and incorporate various network coding mechanisms. We also extend models used in the real-time system literature and discuss the scheduling problem for a multimedia server.","abstract_has_math":false,"creators":["Hou, I-Hong"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kumar, P.R.","Abdelzaher, Tarek F.","Nahrstedt, Klara","Srikant, Rayadurgam","Walrand, Jean"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-02-06T20:19:30Z","date_published":"2012-02-06T20:19:30Z","updated_at":"2026-07-22T22:25:29Z","subjects":["Wireless Networks","Delays","Scheduling","Admission Control","Utility Maximization","Broadcast","Network Coding"],"languages":["en"],"rights":["Copyright 2011 I-Hong Hou"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/29821","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kumar, P.R.","Abdelzaher, Tarek F.","Nahrstedt, Klara","Srikant, Rayadurgam","Walrand, Jean"]},{"key":"dc:creator","label":"Author","values":["Hou, I-Hong"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-02-06T20:19:30Z","2011-12"]},{"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":["Wireless Networks","Delays","Scheduling","Admission Control","Utility Maximization","Broadcast","Network Coding"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2011 I-Hong Hou"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/29821"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Many emerging applications of networks require delay guarantees for packet deliveries. It is particularly challenging to provide services for these applications over wireless channels, since wireless transmissions are usually unreliable. In this dissertation, we provide a theory that formulates and addresses the problem of serving flows with delay guarantees over unreliable wireless channels. The core of this theory is an analytical model that jointly considers several practical aspects of flows with delay guarantees: traffic patterns, per-packet delay bounds, throughput requirements, and channel reliabilities. The model can also address fading channels and the usage of rate adaptation. Based on this model, we obtain solutions for three important mechanisms: admission control, packet scheduling, and utility maximization. In addition, we address the scenario of broadcasting flows with delay constraints and incorporate various network coding mechanisms. We also extend models used in the real-time system literature and discuss the scheduling problem for a multimedia server.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-09-02T19:43:21Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Hou_I-Hong.pdf: 779960 bytes, checksum: 4f6976c2213ab8cc4ae42f5760613c0f (MD5)","Made available in DSpace on 2012-02-06T20:19:30Z (GMT). No. of bitstreams: 2 Hou_I-Hong.pdf: 779960 bytes, checksum: 4f6976c2213ab8cc4ae42f5760613c0f (MD5) license.txt: 4055 bytes, checksum: 6b337dec859b3419646939ea512d6264 (MD5)"]},{"key":"dc:title","label":"Title","values":["Supporting delay guarantees over unreliable wireless channels"]}]}],"canonical_facts":{"dc:contributor":["Kumar, P.R.","Abdelzaher, Tarek F.","Nahrstedt, Klara","Srikant, Rayadurgam","Walrand, Jean"],"dc:creator":["Hou, I-Hong"],"dc:date":["2012-02-06T20:19:30Z","2011-12"],"dc:description":["Many emerging applications of networks require delay guarantees for packet deliveries. It is particularly challenging to provide services for these applications over wireless channels, since wireless transmissions are usually unreliable. In this dissertation, we provide a theory that formulates and addresses the problem of serving flows with delay guarantees over unreliable wireless channels. The core of this theory is an analytical model that jointly considers several practical aspects of flows with delay guarantees: traffic patterns, per-packet delay bounds, throughput requirements, and channel reliabilities. The model can also address fading channels and the usage of rate adaptation. Based on this model, we obtain solutions for three important mechanisms: admission control, packet scheduling, and utility maximization. In addition, we address the scenario of broadcasting flows with delay constraints and incorporate various network coding mechanisms. We also extend models used in the real-time system literature and discuss the scheduling problem for a multimedia server.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-09-02T19:43:21Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Hou_I-Hong.pdf: 779960 bytes, checksum: 4f6976c2213ab8cc4ae42f5760613c0f (MD5)","Made available in DSpace on 2012-02-06T20:19:30Z (GMT). No. of bitstreams: 2 Hou_I-Hong.pdf: 779960 bytes, checksum: 4f6976c2213ab8cc4ae42f5760613c0f (MD5) license.txt: 4055 bytes, checksum: 6b337dec859b3419646939ea512d6264 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/29821"],"dc:language":["en"],"dc:rights":["Copyright 2011 I-Hong Hou"],"dc:subject":["Wireless Networks","Delays","Scheduling","Admission Control","Utility Maximization","Broadcast","Network Coding"],"dc:title":["Supporting delay guarantees over unreliable wireless channels"],"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:29Z"}