Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://earchive.tpu.ru/handle/11683/64865
Название: Osmotic Computing-based Service Migration and Resource Scheduling in Mobile Augmented Reality Networks (MARN)
Авторы: Sharma, Vishal
Dzhayakodi (Jayakody) Arachshiladzh, Dushanta Nalin Kumara
Qaraqe, Marwa
Ключевые слова: осмотическая теория; дополненная реальность; сервисы; osmotic computing; edge-computing; augmented reality; resource scheduling; service migrations
Дата публикации: 2020
Издатель: Elsevier Science Publishing Company Inc.
Библиографическое описание: Sharma, Vishal. Osmotic Computing-based Service Migration and Resource Scheduling in Mobile Augmented Reality Networks (MARN) / V. Sharma, D. N. K. Dzhayakodi (Jayakody) Arachshiladzh, M. Qaraqe // Future Generation Computer Systems. — 2020. — Vol. 102. — [P. 723-737].
Аннотация: Resources and services between the servers in Mobile Augmented Reality Networks (MARN) are tedious to manage. These networks comprise users possessing Augmented Reality (AR)-Virtual Reality (VR) applications. Low latency, robustness, and tolerance are the key requirements of these networks, which can be attained by using near-user solutions such as edge computing. However, management of services and scheduling them to near-user servers in an integrated environment of edge and public/private infrastructure are complex tasks. These require an optimal solution, which can be obtained by using “Osmotic Computing”, that has been recently proposed as a paradigm for the integration of edge and public/private cloud. This paper uses osmotic computing for effectively migrating and scheduling the services between the servers of the different layers. The paper also presents the details on various components that are used for applying osmotic computing to a network followed by core applications, types, service classification, migration, and scheduling through the rules of osmotic game formulated for its operations. The evaluations are conducted on 100,000 requests and the proposed approach shows significant performance with the probability of the error being 0.1 at 55.72% conservation of the energy and memory resources for the entire network despite the increasing number of users. The proposed approach also satisfies the conditions of the joint optimization functions presented in the system model and demonstrates that the system holds true even with varying users, thus, proving its robustness and tolerance against the number of users.
URI: http://earchive.tpu.ru/handle/11683/64865
Располагается в коллекциях:Репринты научных публикаций

Файлы этого ресурса:
Файл Описание РазмерФормат 
reprint-nw-33956.pdf1,78 MBAdobe PDFПросмотреть/Открыть


Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.