Optimizing resources allocation for fog computing-based internet of things networks to reduce latency cost

Message:
Article Type:
Research/Original Article (بدون رتبه معتبر)
Abstract:

Growing popularity of smart devices and 5G Internet, loT technology has also developed. The increase in the number of smart objects has led to an increase in data volumes and computational loads on a large scale. For this reason, cloud computing is used as a solution for this amount of data. However, given the importance of service quality, the cloud computing solution may not be responsive to latency-sensitive requests. Allocating resources in cloudy computing also reduces the cost of latency. Dynamic programming has been used due to the large number of requests and problem constraints. The proposed method reduces the cost of latency for loT requests. In this study, the proposed system modeling and algorithms were implemented for four cases. In these cases, two proposed methods have been the contribution of this research that these proposed algorithms have seen a significant reduction in the total latency cost. But as expected, the backward algorithm had a better response than the forward algorithm.

Language:
Persian
Published:
Journal of Computational Economics, Volume:1 Issue: 3, 2022
Pages:
99 to 112
magiran.com/p2498376  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!