{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/24267"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/24267","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Topology-aware optimal task allocation framework for mission critical environment: Centralized and decentralized approaches","abstract":"A Mission Critical Environment (MCE) consists of error-prone, highly variable, and highly rate limited communication channels. Paradoxically, this environment substantially increases the need to perform Optimal Task Allocation (OTA), while at the same time making it much harder to perform OTA efficiently. To perform OTA in MCE, in this thesis, I have proposed two novel automated algorithms. The first algorithm is called Centralized Optimal Task Allocation Algorithm (COTAA), where I consider OTA for publish/subscribe-based MCE since it has unique characteristics such as high level publish/subscribe node and task differentiation and high scalability. I also propose an architectural framework and communication protocols emphasizing the unique challenges of MCE. I adopt well known Hungarian Algorithm and Rectangular Assignment Algorithm to solve the OTA problem in polynomial time. The second algorithm is called Decentralized Optimal Task Allocation Algorithm (DOTAA) which exploits the concept of application-layer Distributed Hash Table (DHT) to perform OTA in MCE. Through simulations, I evaluate the performance of both COTAA and DOTAA for multiple mission critical scenarios. The results indicate that both COTAA and DOTAA achieve the goal of OTA in highly dynamic MCEs, with low processing time and communication overhead.","abstract_html":"A Mission Critical Environment (MCE) consists of error-prone, highly variable, and highly rate limited communication channels. Paradoxically, this environment substantially increases the need to perform Optimal Task Allocation (OTA), while at the same time making it much harder to perform OTA efficiently. To perform OTA in MCE, in this thesis, I have proposed two novel automated algorithms. The first algorithm is called Centralized Optimal Task Allocation Algorithm (COTAA), where I consider OTA for publish/subscribe-based MCE since it has unique characteristics such as high level publish/subscribe node and task differentiation and high scalability. I also propose an architectural framework and communication protocols emphasizing the unique challenges of MCE. I adopt well known Hungarian Algorithm and Rectangular Assignment Algorithm to solve the OTA problem in polynomial time. The second algorithm is called Decentralized Optimal Task Allocation Algorithm (DOTAA) which exploits the concept of application-layer Distributed Hash Table (DHT) to perform OTA in MCE. Through simulations, I evaluate the performance of both COTAA and DOTAA for multiple mission critical scenarios. The results indicate that both COTAA and DOTAA achieve the goal of OTA in highly dynamic MCEs, with low processing time and communication overhead.","abstract_has_math":false,"creators":["Ahmed, Shameem"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Nahrstedt, Klara"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-25T15:05:47Z","date_published":"2011-05-25T15:05:47Z","updated_at":"2026-07-22T22:25:24Z","subjects":["Mission Critical Environment","Optimal Task Allocation","Centralized Optimal Task Allocation Algorithm (COTAA)","Decentralized Optimal Task Allocation Algorithm (DOTAA)"],"languages":["en"],"rights":["Copyright 2011 Shameem Ahmed"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/24267","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":["Ahmed, Shameem"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-25T15:05:47Z","2011-05"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"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":["Mission Critical Environment","Optimal Task Allocation","Centralized Optimal Task Allocation Algorithm (COTAA)","Decentralized Optimal Task Allocation Algorithm (DOTAA)"]}]},{"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 Shameem Ahmed"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/24267"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A Mission Critical Environment (MCE) consists of error-prone, highly variable, and highly rate limited communication channels. Paradoxically, this environment substantially increases the need to perform Optimal Task Allocation (OTA), while at the same time making it much harder to perform OTA efficiently. To perform OTA in MCE, in this thesis, I have proposed two novel automated algorithms. The first algorithm is called Centralized Optimal Task Allocation Algorithm (COTAA), where I consider OTA for publish/subscribe-based MCE since it has unique characteristics such as high level publish/subscribe node and task differentiation and high scalability. I also propose an architectural framework and communication protocols emphasizing the unique challenges of MCE. I adopt well known Hungarian Algorithm and Rectangular Assignment Algorithm to solve the OTA problem in polynomial time. The second algorithm is called Decentralized Optimal Task Allocation Algorithm (DOTAA) which exploits the concept of application-layer Distributed Hash Table (DHT) to perform OTA in MCE. Through simulations, I evaluate the performance of both COTAA and DOTAA for multiple mission critical scenarios. The results indicate that both COTAA and DOTAA achieve the goal of OTA in highly dynamic MCEs, with low processing time and communication overhead.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-04-27T18:52:22Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Ahmed_Shameem.docx: 2594953 bytes, checksum: 63207ae18abc962b0f013ad552818c36 (MD5) Ahmed_Shameem.pdf: 2490992 bytes, checksum: e37dcd078c9ca8de4015060d9b4bd960 (MD5)","Made available in DSpace on 2011-05-25T15:05:47Z (GMT). No. of bitstreams: 3 Ahmed_Shameem.pdf: 2490992 bytes, checksum: e37dcd078c9ca8de4015060d9b4bd960 (MD5) license.txt: 4061 bytes, checksum: 069c434d4dc70d4fd8ca848f6915299e (MD5) Ahmed_Shameem.docx: 2594953 bytes, checksum: 63207ae18abc962b0f013ad552818c36 (MD5)"]},{"key":"dc:title","label":"Title","values":["Topology-aware optimal task allocation framework for mission critical environment: Centralized and decentralized approaches"]}]}],"canonical_facts":{"dc:contributor":["Nahrstedt, Klara"],"dc:creator":["Ahmed, Shameem"],"dc:date":["2011-05-25T15:05:47Z","2011-05"],"dc:description":["A Mission Critical Environment (MCE) consists of error-prone, highly variable, and highly rate limited communication channels. Paradoxically, this environment substantially increases the need to perform Optimal Task Allocation (OTA), while at the same time making it much harder to perform OTA efficiently. To perform OTA in MCE, in this thesis, I have proposed two novel automated algorithms. The first algorithm is called Centralized Optimal Task Allocation Algorithm (COTAA), where I consider OTA for publish/subscribe-based MCE since it has unique characteristics such as high level publish/subscribe node and task differentiation and high scalability. I also propose an architectural framework and communication protocols emphasizing the unique challenges of MCE. I adopt well known Hungarian Algorithm and Rectangular Assignment Algorithm to solve the OTA problem in polynomial time. The second algorithm is called Decentralized Optimal Task Allocation Algorithm (DOTAA) which exploits the concept of application-layer Distributed Hash Table (DHT) to perform OTA in MCE. Through simulations, I evaluate the performance of both COTAA and DOTAA for multiple mission critical scenarios. The results indicate that both COTAA and DOTAA achieve the goal of OTA in highly dynamic MCEs, with low processing time and communication overhead.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-04-27T18:52:22Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Ahmed_Shameem.docx: 2594953 bytes, checksum: 63207ae18abc962b0f013ad552818c36 (MD5) Ahmed_Shameem.pdf: 2490992 bytes, checksum: e37dcd078c9ca8de4015060d9b4bd960 (MD5)","Made available in DSpace on 2011-05-25T15:05:47Z (GMT). No. of bitstreams: 3 Ahmed_Shameem.pdf: 2490992 bytes, checksum: e37dcd078c9ca8de4015060d9b4bd960 (MD5) license.txt: 4061 bytes, checksum: 069c434d4dc70d4fd8ca848f6915299e (MD5) Ahmed_Shameem.docx: 2594953 bytes, checksum: 63207ae18abc962b0f013ad552818c36 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/24267"],"dc:language":["en"],"dc:rights":["Copyright 2011 Shameem Ahmed"],"dc:subject":["Mission Critical Environment","Optimal Task Allocation","Centralized Optimal Task Allocation Algorithm (COTAA)","Decentralized Optimal Task Allocation Algorithm (DOTAA)"],"dc:title":["Topology-aware optimal task allocation framework for mission critical environment: Centralized and decentralized approaches"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:24Z"}