Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/16511
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Radhika, M | - |
dc.contributor.author | Jayavadivel, R | - |
dc.contributor.author | Prabhu, M Ramkumar | - |
dc.contributor.author | Kumar, Vijay | - |
dc.contributor.author | Pardey, Minal A | - |
dc.contributor.author | Anil Kumar, N | - |
dc.date.accessioned | 2024-08-29T05:41:22Z | - |
dc.date.available | 2024-08-29T05:41:22Z | - |
dc.date.issued | 2023 | - |
dc.identifier.citation | pp. 351-356 | en_US |
dc.identifier.isbn | 9798350371406 | - |
dc.identifier.issn | 2640-074X | - |
dc.identifier.uri | https://doi.org/10.1109/ICIIP61524.2023.10537632 | - |
dc.identifier.uri | https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/16511 | - |
dc.description.abstract | Efficient content delivery in fog computing networks is crucial for reducing the internet access points and long-distance cloud network traffic. Optimizing route analysis for forwarding content using cache is a difficult task because fog networks are dynamic and the need to minimize computation and source overhead. In this study, we discourse the route research problem in fog computing networks with an optimised technique called Enhanced Teaching Learning Optimisation (ETLO). The ETLO algorithm is made to reflect system conditions as accurately as possible and achieve optimal coverage while minimizing the number of iterations and resource overhead. Through extensive simulations and comparisons with existing Teaching Learning Based Optimization (TLBO) and Simulated Annealing (SA) algorithms, we demonstrate that ETLO outperforms TLBO in terms of memory overhead and network size needed to distribute material to far-off places. Moreover, ETLO exhibits better execution time, memory overhead, and scalability with respect to network size compared to SA. The analysis reveals that the moderation rate plays a critical part in determining the amount of memory and execution time, with an inverse proportional relationship. The average memory usage of ETLO is found to be 0.186% less than TLBO, while TLBO performs slightly better in execution time. Thereby, the proposed ETLO algorithm significantly enhances the efficiency of content delivery in fog computing networks, leading to an optimized and resource-efficient routing process. The findings underscore the potential of ETLO in improving network performance and content caching strategies, thereby contributing to the advancement of fog computing technologies. © 2023 IEEE. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Proceedings of the IEEE International Conference Image Information Processing | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.subject | Content Caching Strategies And Network Performance | en_US |
dc.subject | Efficiency Improvement | en_US |
dc.subject | Network Scalability | en_US |
dc.subject | Remote Content Delivery | en_US |
dc.title | Efficient Route Analysis and Content Delivery In Iot-Fog Networks with Etlo | en_US |
dc.type | Article | en_US |
Appears in Collections: | Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.