{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/42168"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/42168","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Routing and scheduling for cloud service data centers","abstract":"In recent years, an increasing variety of dynamic-content web services, such as search, social networking and on-line commerce, have been moved to the Cloud service data centers. One of the features offered by Cloud data centers is on-demand service. To achieve this, current Cloud data centers are designed with an excess of provision for highly dynamic work load. Problems with such design include low server throughput and lack of scalability, which are considered as very important challenges for attaining system efficiency. This research aims to develop novel algorithms for the Cloud data center to achieve good performance while maintaining cost and energy efficiency. In general, Cloud service data centers consist of the front-end and back-end systems. To ensure a good level of service performance, neither the front-end nor back-end system should be neglected at the design of a Cloud data center. This study investigates features and challenges for Cloud service data centers. For the front-end system, the distributed design of load balancers is highly favored for achieving scalability. A novel algorithm is proposed for large-scale load balancing with distributed dispatchers. Both analysis and simulation show the advantage of the proposed algorithm over the state of the art. In the back-end system, intensive data processing is required to search, analyze and mine the vast amount of data. Cluster computing systems, like MapReduce and Hadoop, have provided an efficient platform for large scale computation. This research studies the data locality problem for cluster computing systems, which significantly affects system throughput and job completion time. In particular, a new task assignment algorithm is proposed and shown to significantly outperform the current implementation.","abstract_html":"In recent years, an increasing variety of dynamic-content web services, such as search, social networking and on-line commerce, have been moved to the Cloud service data centers. One of the features offered by Cloud data centers is on-demand service. To achieve this, current Cloud data centers are designed with an excess of provision for highly dynamic work load. Problems with such design include low server throughput and lack of scalability, which are considered as very important challenges for attaining system efficiency. This research aims to develop novel algorithms for the Cloud data center to achieve good performance while maintaining cost and energy efficiency. In general, Cloud service data centers consist of the front-end and back-end systems. To ensure a good level of service performance, neither the front-end nor back-end system should be neglected at the design of a Cloud data center. This study investigates features and challenges for Cloud service data centers. For the front-end system, the distributed design of load balancers is highly favored for achieving scalability. A novel algorithm is proposed for large-scale load balancing with distributed dispatchers. Both analysis and simulation show the advantage of the proposed algorithm over the state of the art. In the back-end system, intensive data processing is required to search, analyze and mine the vast amount of data. Cluster computing systems, like MapReduce and Hadoop, have provided an efficient platform for large scale computation. This research studies the data locality problem for cluster computing systems, which significantly affects system throughput and job completion time. In particular, a new task assignment algorithm is proposed and shown to significantly outperform the current implementation.","abstract_has_math":false,"creators":["Xie, Qiaomin"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Lu, Yi"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-02-03T19:18:07Z","date_published":"2013-02-03T19:18:07Z","updated_at":"2026-07-22T22:25:31Z","subjects":["Cloud service data center","load balancing","queueing analysis","task assignment","data locality"],"languages":["en"],"rights":["Copyright 2012 Qiaomin Xie"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/42168","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Lu, Yi"]},{"key":"dc:creator","label":"Author","values":["Xie, Qiaomin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2013-02-03T19:18:07Z","2015-02-03T11:00:49Z","2012-12"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"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":["Cloud service data center","load balancing","queueing analysis","task assignment","data locality"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2012 Qiaomin Xie"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/42168"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In recent years, an increasing variety of dynamic-content web services, such as search, social networking and on-line commerce, have been moved to the Cloud service data centers. One of the features offered by Cloud data centers is on-demand service. To achieve this, current Cloud data centers are designed with an excess of provision for highly dynamic work load. Problems with such design include low server throughput and lack of scalability, which are considered as very important challenges for attaining system efficiency. This research aims to develop novel algorithms for the Cloud data center to achieve good performance while maintaining cost and energy efficiency. In general, Cloud service data centers consist of the front-end and back-end systems. To ensure a good level of service performance, neither the front-end nor back-end system should be neglected at the design of a Cloud data center. This study investigates features and challenges for Cloud service data centers. For the front-end system, the distributed design of load balancers is highly favored for achieving scalability. A novel algorithm is proposed for large-scale load balancing with distributed dispatchers. Both analysis and simulation show the advantage of the proposed algorithm over the state of the art. In the back-end system, intensive data processing is required to search, analyze and mine the vast amount of data. Cluster computing systems, like MapReduce and Hadoop, have provided an efficient platform for large scale computation. This research studies the data locality problem for cluster computing systems, which significantly affects system throughput and job completion time. In particular, a new task assignment algorithm is proposed and shown to significantly outperform the current implementation.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-11-27T23:03:18Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Xie_Qiaomin.pdf: 471021 bytes, checksum: 4a9800f77de3017324b11910867369e2 (MD5)","Made available in DSpace on 2013-02-03T19:18:07Z (GMT). No. of bitstreams: 2 Qiaomin_Xie.pdf: 471024 bytes, checksum: 812a2ec6d61814add9a0869aead32ad8 (MD5) license.txt: 4058 bytes, checksum: 28c821955a951c02ae39e3963b67ae5b (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Seth Robbins (srobbins@illinois.edu) on 2013-02-03T19:19:06Z Item is restricted until 2015-02-03T19:18:53Z","Restriction data tranferred 2014-07-01T11:12:01-05:00 Original Data Group with Access UIUC Users [automated] Release Date: 2015-02-03 13:18:53 UTC Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 42115 on 2015-02-03T11:00:49Z."]},{"key":"dc:title","label":"Title","values":["Routing and scheduling for cloud service data centers"]}]}],"canonical_facts":{"dc:contributor":["Lu, Yi"],"dc:creator":["Xie, Qiaomin"],"dc:date":["2013-02-03T19:18:07Z","2015-02-03T11:00:49Z","2012-12"],"dc:description":["In recent years, an increasing variety of dynamic-content web services, such as search, social networking and on-line commerce, have been moved to the Cloud service data centers. One of the features offered by Cloud data centers is on-demand service. To achieve this, current Cloud data centers are designed with an excess of provision for highly dynamic work load. Problems with such design include low server throughput and lack of scalability, which are considered as very important challenges for attaining system efficiency. This research aims to develop novel algorithms for the Cloud data center to achieve good performance while maintaining cost and energy efficiency. In general, Cloud service data centers consist of the front-end and back-end systems. To ensure a good level of service performance, neither the front-end nor back-end system should be neglected at the design of a Cloud data center. This study investigates features and challenges for Cloud service data centers. For the front-end system, the distributed design of load balancers is highly favored for achieving scalability. A novel algorithm is proposed for large-scale load balancing with distributed dispatchers. Both analysis and simulation show the advantage of the proposed algorithm over the state of the art. In the back-end system, intensive data processing is required to search, analyze and mine the vast amount of data. Cluster computing systems, like MapReduce and Hadoop, have provided an efficient platform for large scale computation. This research studies the data locality problem for cluster computing systems, which significantly affects system throughput and job completion time. In particular, a new task assignment algorithm is proposed and shown to significantly outperform the current implementation.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-11-27T23:03:18Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Xie_Qiaomin.pdf: 471021 bytes, checksum: 4a9800f77de3017324b11910867369e2 (MD5)","Made available in DSpace on 2013-02-03T19:18:07Z (GMT). No. of bitstreams: 2 Qiaomin_Xie.pdf: 471024 bytes, checksum: 812a2ec6d61814add9a0869aead32ad8 (MD5) license.txt: 4058 bytes, checksum: 28c821955a951c02ae39e3963b67ae5b (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Seth Robbins (srobbins@illinois.edu) on 2013-02-03T19:19:06Z Item is restricted until 2015-02-03T19:18:53Z","Restriction data tranferred 2014-07-01T11:12:01-05:00 Original Data Group with Access UIUC Users [automated] Release Date: 2015-02-03 13:18:53 UTC Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 42115 on 2015-02-03T11:00:49Z."],"dc:identifier":["http://hdl.handle.net/2142/42168"],"dc:language":["en"],"dc:rights":["Copyright 2012 Qiaomin Xie"],"dc:subject":["Cloud service data center","load balancing","queueing analysis","task assignment","data locality"],"dc:title":["Routing and scheduling for cloud service data centers"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:31Z"}