東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Towards Dynamic Vehicular Clouds.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Towards Dynamic Vehicular Clouds./
作者:	Ghazizadeh, Aida.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2020,
面頁冊數:	151 p.
附註:	Source: Dissertations Abstracts International, Volume: 82-04, Section: B.
Contained By:	Dissertations Abstracts International82-04B.
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28092690
ISBN:	9798678109866

Towards Dynamic Vehicular Clouds.
Ghazizadeh, Aida.

Towards Dynamic Vehicular Clouds. - Ann Arbor : ProQuest Dissertations & Theses, 2020 - 151 p.

Source: Dissertations Abstracts International, Volume: 82-04, Section: B.

Thesis (Ph.D.)--Old Dominion University, 2020.

This item must not be sold to any third party vendors.

Motivated by the success of the conventional cloud computing, Vehicular Clouds were introduced as a group of vehicles whose corporate computing, sensing, communication, and physical resources can be coordinated and dynamically allocated to authorized users. One of the attributes that set Vehicular Clouds apart from conventional clouds is resource volatility. As vehicles enter and leave the cloud, new computing resources become available while others depart, creating a volatile environment where the task of reasoning about fundamental performance metrics becomes very challenging. The goal of this thesis is to design an architecture and model for a dynamic Vehicular Cloud built on top of moving vehicles on highways. We present our envisioned architecture for dynamic Vehicular Cloud, consisting of vehicles moving on the highways and multiple communication stations installed along the highway, and investigate the feasibility of such systems. The dynamic Vehicular Cloud is based on two-way communications between vehicles and the stations. We provide a communication protocol for vehicle-to-infrastructure communications enabling a dynamic Vehicular Cloud. We explain the structure of the proposed protocol in detail and then provide analytical predictions and simulation results to investigate the accuracy of our design and predictions. Just as in conventional clouds, job completion time ranks high among the fundamental quantitative performance figures of merit. In general, predicting job completion time requires full knowledge of the probability distributions of the intervening random variables. More often than not, however, the datacenter manager does not know these distribution functions. Instead, using accumulated empirical data, she may be able to estimate the first moments of these random variables. Yet, getting a handle on the expected job completion time is a very important problem that must be addressed. With this in mind, another contribution of this thesis is to offer easy-to-compute approximations of job completion time in a dynamic Vehicular Cloud involving vehicles on a highway. We assume estimates of the first moment of the time it takes the job to execute without any overhead attributable to the working of the Vehicular Cloud. A comprehensive set of simulations have shown that our approximations are very accurate. As mentioned, a major difference between the conventional cloud and the Vehicular Cloud is the availability of the computational nodes. The vehicles, which are the Vehicular Cloud's computational resources, arrive and depart at random times, and as a result, this characteristic may cause failure in executing jobs and interruptions in the ongoing services. To handle these interruptions, once a vehicle is ready to leave the Vehicular Cloud, if the vehicle is running a job, the job and all intermediate data stored by the departing vehicle must be migrated to an available vehicle in the Vehicular Cloud.

ISBN: 9798678109866Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

Cloud Computing

Towards Dynamic Vehicular Clouds.
LDR:04170nmm a2200397 4500 001 2344592
005 20220531064602.5
008 241004s2020 ||||||||||||||||| ||eng d
020 $a 9798678109866
035 $a (MiAaPQ)AAI28092690
035 $a AAI28092690
040 $a MiAaPQ $c MiAaPQ
100 1 $a Ghazizadeh, Aida. $0 (orcid)0000-0002-3379-2599 $3 3683378
245 1 0 $a Towards Dynamic Vehicular Clouds.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2020
300 $a 151 p.
500 $a Source: Dissertations Abstracts International, Volume: 82-04, Section: B.
500 $a Advisor: Olariu, Stephan.
502 $a Thesis (Ph.D.)--Old Dominion University, 2020.
506 $a This item must not be sold to any third party vendors.
520 $a Motivated by the success of the conventional cloud computing, Vehicular Clouds were introduced as a group of vehicles whose corporate computing, sensing, communication, and physical resources can be coordinated and dynamically allocated to authorized users. One of the attributes that set Vehicular Clouds apart from conventional clouds is resource volatility. As vehicles enter and leave the cloud, new computing resources become available while others depart, creating a volatile environment where the task of reasoning about fundamental performance metrics becomes very challenging. The goal of this thesis is to design an architecture and model for a dynamic Vehicular Cloud built on top of moving vehicles on highways. We present our envisioned architecture for dynamic Vehicular Cloud, consisting of vehicles moving on the highways and multiple communication stations installed along the highway, and investigate the feasibility of such systems. The dynamic Vehicular Cloud is based on two-way communications between vehicles and the stations. We provide a communication protocol for vehicle-to-infrastructure communications enabling a dynamic Vehicular Cloud. We explain the structure of the proposed protocol in detail and then provide analytical predictions and simulation results to investigate the accuracy of our design and predictions. Just as in conventional clouds, job completion time ranks high among the fundamental quantitative performance figures of merit. In general, predicting job completion time requires full knowledge of the probability distributions of the intervening random variables. More often than not, however, the datacenter manager does not know these distribution functions. Instead, using accumulated empirical data, she may be able to estimate the first moments of these random variables. Yet, getting a handle on the expected job completion time is a very important problem that must be addressed. With this in mind, another contribution of this thesis is to offer easy-to-compute approximations of job completion time in a dynamic Vehicular Cloud involving vehicles on a highway. We assume estimates of the first moment of the time it takes the job to execute without any overhead attributable to the working of the Vehicular Cloud. A comprehensive set of simulations have shown that our approximations are very accurate. As mentioned, a major difference between the conventional cloud and the Vehicular Cloud is the availability of the computational nodes. The vehicles, which are the Vehicular Cloud's computational resources, arrive and depart at random times, and as a result, this characteristic may cause failure in executing jobs and interruptions in the ongoing services. To handle these interruptions, once a vehicle is ready to leave the Vehicular Cloud, if the vehicle is running a job, the job and all intermediate data stored by the departing vehicle must be migrated to an available vehicle in the Vehicular Cloud.
590 $a School code: 0418.
650 4 $a Computer science. $3 523869
650 4 $a Automotive engineering. $3 2181195
650 4 $a Information technology. $3 532993
650 4 $a Transportation. $3 555912
653 $a Cloud Computing
653 $a Edge Computing
653 $a Intelligent Transportation Systems
653 $a Internet of Vehicles
653 $a Vehicular Ad-hoc Networks
653 $a Vehicular Cloud
690 $a 0984
690 $a 0489
690 $a 0709
690 $a 0540
710 2 $a Old Dominion University. $b Computer Science. $3 3280020
773 0 $t Dissertations Abstracts International $g 82-04B.
790 $a 0418
791 $a Ph.D.
792 $a 2020
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28092690