東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Scheduling Problems in Next Generation Computing Networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Scheduling Problems in Next Generation Computing Networks./
作者:	Sun, Jia He.
面頁冊數:	1 online resource (105 pages)
附註:	Source: Masters Abstracts International, Volume: 84-01.
Contained By:	Masters Abstracts International84-01.
標題:	Men. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29178517click for full text (PQDT)
ISBN:	9798835550098

Scheduling Problems in Next Generation Computing Networks.
Sun, Jia He.

Scheduling Problems in Next Generation Computing Networks. - 1 online resource (105 pages)

Source: Masters Abstracts International, Volume: 84-01.

Thesis (M.Sc.)--Queen's University (Canada), 2022.

Includes bibliographical references

With the development of the novel Internet of Things (IoT) ecosystem, the digital support required by emerging applications is a highly growing area of concern. The current network paradigm, cloud computing, is proving unable to adequately support the ever increasing computational and storage needs of the billions of edge devices in use. In recent years, several solutions have been put forward including two complementary computing paradigms: Multi-access Edge Computing (MEC) and fog computing. MEC and fog computing are both considered augments to cloud computing since they both conceptualize supplementary server layers to existing networks.This thesis addresses the emerging challenge of efficient task scheduling in both MEC and fog computing. Since traditional mathematical programming models are proven to be very difficult to solve optimally at large dimensions, another approach is needed to satisfy the time-sensitive needs of the dynamic environments of both MEC and fog computing. In this thesis, we propose several heuristics that are designed to provide good solutions while maintaining low complexity guarantees.The first problem examined in this thesis is how to fully utilize parked vehicles (PVs) as computational resources in vehicular networks under the MEC framework. We formulate a multi-objective task offloading problem that minimizes both task delay and wireless channel load. Then, a stable matching based heuristic is proposed and evaluated at various configurations of the vehicular environment.The second problem that we examine in thesis is how to fairly allocate resources in fog computing. Fairness in resource allocation is a highly desired quality because it not only increases the quality of service (QoS) for users but also maximizes the resource utilization in the system. This thesis adopts the Dominant Resource Fairness (DRF) scheme and applies it to a multi-resource, multi-server, and heterogeneous task environment. Furthermore, four different types of tasks are considered: ordered/unordered, splittable/unsplittable. Finally, three different low complexity heuristics are proposed to maximize fairness between users under the DRF scheme.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2023

Mode of access: World Wide Web

ISBN: 9798835550098Subjects--Topical Terms:

528322
Men.
Index Terms--Genre/Form:

542853
Electronic books.

Scheduling Problems in Next Generation Computing Networks.
LDR:03511nmm a2200409K 4500 001 2353186
005 20221214062818.5
006 m o d
007 cr mn ---uuuuu
008 241011s2022 xx obm 000 0 eng d
020 $a 9798835550098
035 $a (MiAaPQ)AAI29178517
035 $a (MiAaPQ)QueensUCan_197429980
035 $a AAI29178517
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Sun, Jia He. $3 3693528
245 1 0 $a Scheduling Problems in Next Generation Computing Networks.
264 0 $c 2022
300 $a 1 online resource (105 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 84-01.
500 $a Advisor: Choudhury, Salimur.
502 $a Thesis (M.Sc.)--Queen's University (Canada), 2022.
504 $a Includes bibliographical references
520 $a With the development of the novel Internet of Things (IoT) ecosystem, the digital support required by emerging applications is a highly growing area of concern. The current network paradigm, cloud computing, is proving unable to adequately support the ever increasing computational and storage needs of the billions of edge devices in use. In recent years, several solutions have been put forward including two complementary computing paradigms: Multi-access Edge Computing (MEC) and fog computing. MEC and fog computing are both considered augments to cloud computing since they both conceptualize supplementary server layers to existing networks.This thesis addresses the emerging challenge of efficient task scheduling in both MEC and fog computing. Since traditional mathematical programming models are proven to be very difficult to solve optimally at large dimensions, another approach is needed to satisfy the time-sensitive needs of the dynamic environments of both MEC and fog computing. In this thesis, we propose several heuristics that are designed to provide good solutions while maintaining low complexity guarantees.The first problem examined in this thesis is how to fully utilize parked vehicles (PVs) as computational resources in vehicular networks under the MEC framework. We formulate a multi-objective task offloading problem that minimizes both task delay and wireless channel load. Then, a stable matching based heuristic is proposed and evaluated at various configurations of the vehicular environment.The second problem that we examine in thesis is how to fairly allocate resources in fog computing. Fairness in resource allocation is a highly desired quality because it not only increases the quality of service (QoS) for users but also maximizes the resource utilization in the system. This thesis adopts the Dominant Resource Fairness (DRF) scheme and applies it to a multi-resource, multi-server, and heterogeneous task environment. Furthermore, four different types of tasks are considered: ordered/unordered, splittable/unsplittable. Finally, three different low complexity heuristics are proposed to maximize fairness between users under the DRF scheme.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2023
538 $a Mode of access: World Wide Web
650 4 $a Men. $3 528322
650 4 $a Scheduling. $3 750729
650 4 $a Applied mathematics. $3 2122814
650 4 $a Power. $3 518736
650 4 $a Optimization. $3 891104
650 4 $a Internet of Things. $3 3538511
650 4 $a Taxonomy. $3 3556303
650 4 $a Paradigms. $3 3560141
650 4 $a Algorithms. $3 536374
650 4 $a Women. $3 531755
650 4 $a Cloud computing. $3 1016782
650 4 $a Servers. $3 3220915
650 4 $a Vehicles. $3 2145288
650 4 $a Civil engineering. $3 860360
650 4 $a Computer science. $3 523869
650 4 $a Engineering. $3 586835
650 4 $a Mathematics. $3 515831
650 4 $a Transportation. $3 555912
650 4 $a Web studies. $3 2122754
655 7 $a Electronic books. $2 lcsh $3 542853
690 $a 0364
690 $a 0543
690 $a 0984
690 $a 0501
690 $a 0537
690 $a 0405
690 $a 0709
690 $a 0646
710 2 $a ProQuest Information and Learning Co. $3 783688
710 2 $a Queen's University (Canada). $3 1017786
773 0 $t Masters Abstracts International $g 84-01.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29178517 $z click for full text (PQDT)