Search

This paper presents an in-depth review of software-defined named data networking (SD-NDN), a transformative approach in network architectures poised to deliver substantial benefits. By addressing the limitations inherent in traditional host-centric network architectures, SD-NDN offers improvements in network performance, scalability, and efficiency. The paper commences with an overview of named data networking (NDN) and software-defined networking (SDN), the two fundamental building blocks of SD-NDN. It then explores the specifics of integrating NDN with SDN, illustrating examples of various SD-NDN models. These models are designed to leverage SDN for NDN routing, caching, and forwarding. The paper concludes by proposing potential strategies for further integration of SDN and NDN and some open research questions. These proposed strategies aim to stimulate further exploration and innovation in the field of SD-NDN. [ABSTRACT FROM AUTHOR]

Unlike conventional CPU caches, non-datapath caches, such as host-side flash caches which are extensively used as storage caches, have distinct requirements. While every cache miss results in a cache update in a conventional cache, non-datapath caches allow for the flexibility of selective caching, i.e., the option of not having to update the cache on each miss. We propose a new, generalized, bimodal caching algorithm, Fear Of Missing Out (FOMO), for managing non-datapath caches. Being generalized has the benefit of allowing any datapath cache replacement policy, such as LRU, ARC, or LIRS, to be augmented by FOMO to make these datapath caching algorithms better suited for non-datapath caches. Operating in two states, FOMO is selective—it selectively disables cache insertion and replacement depending on the learned behavior of the workload. FOMO is lightweight and tracks inexpensive metrics in order to identify these workload behaviors effectively. FOMO is evaluated using three different cache replacement policies against the current state-of-the-art non-datapath caching algorithms, using five different storage system workload repositories (totaling 176 workloads) for six different cache size configurations, each sized as a percentage of each workload's footprint. Our extensive experimental analysis reveals that FOMO can improve upon other non-datapath caching algorithms across a range of production storage workloads, while also reducing the write rate. [ABSTRACT FROM AUTHOR]

The rapid development of 5G/6G and AI enables an environment of Internet of Everything (IoE) which can support millions of connected mobile devices and applications to operate smoothly at high speed and low delay. However, these massive devices will lead to explosive traffic growth, which in turn cause great burden for the data transmission and content delivery. This challenge can be eased by sinking some critical content from cloud to edge. In this case, how to determine the critical content, where to sink and how to access the content correctly and efficiently become new challenges. This work focuses on establishing a highly efficient content delivery framework in the IoE environment. In particular, the IoE environment is re-constructed as an end-edge-cloud collaborative system, in which the concept of digital twin is applied to promote the collaboration. Based on the digital asset obtained by digital twin from end users, a content popularity prediction scheme is firstly proposed to decide the critical content by using the Temporal Pattern Attention (TPA) enabled Long Short-Term Memory (LSTM) model. Then, the prediction results are input for the proposed caching scheme to decide where to sink the critical content by using the Reinforce Learning (RL) technology. Finally, a collaborative routing scheme is proposed to determine the way to access the content with the objective of minimizing overhead. The experimental results indicate that the proposed schemes outperform the state-of-the-art benchmarks in terms of the caching hit rate, the average throughput, the successful content delivery rate and the average routing overhead.

In the mobile edge computing (MEC) environment, the edge caching can provide the timely data response service for the intelligent scenarios. However, due to the limited storage capacity of edge nodes and the malicious node behavior, the question of how to select the cached contents and realize the decentralized security data caching faces challenges. In this paper, a blockchain-based decentralized and proactive caching strategy is proposed in an MEC environment to address this problem. The novelty is that the blockchain was adopted in an MEC environment with a proactive caching strategy based on node utility, and the corresponding optimization problem was built. The blockchain was adopted to build a secure and reliable service environment. The employed methodology is that the optimal caching strategy was achieved based on the linear relaxation technology and the interior point method. Additionally, in a content caching system, there is a trade-off between cache space and node utility, and the caching strategy was proposed to solve this problem. There was also a trade-off between the consensus process delay of blockchain and the caching latency of content. An offline consensus authentication method was adopted to reduce the influence of the consensus process delay on the content caching. The key finding was that the proposed algorithm can reduce latency and can ensure the security data caching in an IoT environment. Finally, the simulation experiment showed that the proposed algorithm can achieve up to 49.32%, 43.11%, and 34.85% improvements on the cache hit rate, the average content response latency, and the average system utility, respectively, compared to the random content caching algorithm, and it achieved up to 9.67%, 8.11%, and 5.95% increases, successively, compared to the greedy content caching algorithm. [ABSTRACT FROM AUTHOR]

The named data vehicular sensor network (NDVSN) has become an increasingly important area of research because of the increasing demand for data transmission in vehicular networks. In such networks, ensuring the quality of service (QoS) of data transmission is essential. The NDVSN is a mobile ad hoc network that uses vehicles equipped with sensors to collect and disseminate data. QoS is critical in vehicular networks, as the data transmission must be reliable, efficient, and timely to support various applications. This paper proposes a QoS-aware forwarding and caching algorithm for NDVSNs, called QWLCPM (QoS-aware Forwarding and Caching using Weighted Linear Combination and Proximity Method). QWLCPM utilizes a weighted linear combination and proximity method to determine stable nodes and the best next-hop forwarding path based on various metrics, including priority, signal strength, vehicle speed, global positioning system data, and vehicle ID. Additionally, it incorporates a weighted linear combination method for the caching mechanism to store frequently accessed data based on zone ID, stability, and priority. The performance of QWLCPM is evaluated through simulations and compared with other forwarding and caching algorithms. QWLCPM's efficacy stems from its holistic decision-making process, incorporating spatial and temporal elements for efficient cache management. Zone-based caching, showcased in different scenarios, enhances content delivery by utilizing stable nodes. QWLCPM's proximity considerations significantly improve cache hits, reduce delay, and optimize hop count, especially in scenarios with sparse traffic. Additionally, its priority-based caching mechanism enhances hit ratios and content diversity, emphasizing QWLCPM's substantial network-improvement potential in vehicular environments. These findings suggest that QWLCPM has the potential to greatly enhance QoS in NDVSNs and serve as a promising solution for future vehicular sensor networks. Future research could focus on refining the details of its implementation, scalability in larger networks, and conducting real-world trials to validate its performance under dynamic conditions. [ABSTRACT FROM AUTHOR]

Caching plays an important role in reducing latency and increasing the overall performance of fog computing systems. With the rise of the Internet of Things (IoT) and edge computing, fog computing has become an essential paradigm for addressing the challenges related to latency-sensitive and bandwidth-intensive applications. The integration of Information-Centric Networking (ICN) and Fog Computing (ICN-Fog) has emerged as a promising solution for meeting the demands of low-latency and high-throughput applications in rapidly growing IoT devices. A step was taken by ICN-Fog to reduce latency and achieve higher data communication and information gathering for fog computing. Using Artificial Intelligence (AI) methods, the Firefly Optimization Technique was introduced as an effective optimization algorithm to enhance the caching technique. In this study, we aim to improve several performance metrics, such as the cache hit ratio, internal link load, and average query duration. To achieve these enhancements, we propose a unique solution inspired by the Firefly Optimization Technique. This technique applies to the ICN-Fog caching model, which was utilized to intelligently determine cache placement and network topology adaptations. CloudSim was employed to execute a simulation of the proposed strategy. The results of the experiments suggest that the Multi-Objective Firefly Algorithm (MOFA) outperforms the compared algorithms in terms of both efficiency and effectiveness in identifying the optimal caching technique.

The task of gathering data from nodes within mobile ad hoc wireless sensor networks presents an enduring challenge. Conventional strategies employ customized routing protocols tailored to these environments, with research focused on refining them for improved efficiency in terms of throughput and energy utilization. However, these elements are interconnected, and enhancements in one often come at the expense of the other. An alternative data collection approach involves the use of unmanned aerial vehicles (UAVs). In contrast to traditional methods, UAVs directly collect data from mobile nodes, bypassing the need for routing. While existing research predominantly addresses static nodes, this paper proposes an evolutionary based, innovative path selection approach based on future position prediction of caching enabled mobile ad hoc wireless sensor network nodes for UAV data collection, aimed at maximizing node encounters and gathering the most valuable information in a single trip. The proposed technique is evaluated for different movement models and parameter configurations.

Caching technology is essential for enhancing content transmission rates and reducing data transmission delays in heterogeneous networks, making it a crucial component of the Internet of Things (IoT). However, during data transmission and caching model training, the security of information is destroyed by untrusted third parties. In addition, the flexibility of storage locations presents another bottleneck in heterogeneous network caching technology. Deep learning (DL) is an important method for improving caching performance due to its powerful learning capabilities. Nonetheless, the DL process is vulnerable to various attacks, including white-box and black-box attacks, disclosing private information. Therefore, this study proposes a DL-based caching framework aimed to enhance security in heterogeneous networks based on differential privacy-preserving technology. Moreover, we utilize a boosting integrated method to improve caching accuracy. Simulated experiments demonstrate that the proposed framework ensures security and accuracy in the heterogeneous network caching process, outperforming existing solutions.

The deployment of 5G has exposed capacity constraints in realizing the key vision of the Internet of Everything (IoE). Therefore, the researchers are exploring potentials of Digital Twin Network (DTN) in wireless networks. DTN is a novel technology to create virtual replicas of physical environment for testing, optimizing, and managing wireless networks. The integration of Artificial Intelligence (AI) and DTN appears to be a promising approach to address communication systems by providing an efficient environment for testing and improving AI models before deployment in real networks for effective network management, optimal resource allocation, and precise behavior prediction. Therefore, AI-enabled DTN in 6G represents a compelling avenue to address multifaceted challenges faced by wireless networks. In this comprehensive work, we offer a holistic survey that delves into the state-of-the-art approaches for AI-enabled DTNs in 6G. Firstly, we discuss the evolution of wireless networks and concept of AI-enabled DTN in 6G. Secondly, we discuss the role of AI-enabled DTN in 6G and driving advancements in fundamental components of 6G including resource allocation, caching, data offloading, and data security. Thirdly, we conduct a detailed discussion on key enabling technologies for realizing the capabilities of AI-enabled DTN in 6G. Fourthly, several applications of AI-enabled DTN in 6G are discussed for the practical relevance and significance in various industries such as smart cities, healthcare, and transportation etc. Finally, we provide lessons learned and highlight existing challenges and research directions to embark on further research efforts in the realm of AI-enabled DTN in 6G.

Vehicular Edge Computing (VEC) technology holds great promise, but also poses significant challenges to the limited computing power of in-vehicle devices and the capacity of Roadside Units (RSUs). At the same time, the highly mobile nature of vehicles and the frequent changes in the content of requests from vehicles make it critical to offload applications to edge servers and to effectively predict and cache the most popular content, so that the most popular content can be cached in advance in the RSU. And also considering protecting the privacy of vehicle user vehicular users (VUs), traditional data-sharing methods may not be suitable for this work, so we use an asynchronous Federated learning (FL) approach to update the global model in time and at the same time can protect the personal privacy of VUs. Unlike the traditional synchronous FL, asynchronous FL no longer needs to wait for all vehicles to finish training and uploading local models before updating the global model, which avoids the problem of long training time. In this paper, we propose an in-vehicle edge computing caching scheme based on asynchronous federated learning and deep reinforcement learning(AFLR), which prefetches possible popular contents in advance and caches them in the edge nodes or vehicle nodes according to the vehicle’s location and moving direction while reducing the latency of the content requests. After extensive experimental comparisons, the AFLR scheme outperforms other benchmark caching schemes.

Data caching is a promising technique to alleviate the data traffic burden from the backhaul and minimize data access delay. However, the cache capacity constraint poses a significant challenge to obtaining content through the cache resource that degrades the caching performance. In this paper, we propose a novel two-tier caching mechanism for data caching on mobile user equipment (UE) and the small base station (SBS) level in ultra-dense 6G heterogeneous networks for reducing data access failure via cache resources. The two-tier caching enables users to retrieve their desired content from cache resources through device-to-device (D2D) communications from neighboring users or the serving SBS. The cache-enabled UE exploits millimeter-wave (mmWave)-based D2D communications, utilizing line-of-sight (LoS) links for high-speed data transmission to content-demanding mobile UE within a limited connection time. In the event of D2D communication failures, a dual-mode hybrid system, combining mmWave and microwave μ Wave technologies, is utilized to ensure effective data transmission between the SBS and UE to fulfill users' data demands. In the proposed framework. the data transmission speed is optimized through mmWave signals in line-of-sight (LoS) conditions. In non-LoS scenarios, the system switches to μ Wave mode for obstacle-penetrating signal transmission. Subsequently, we propose a reinforcement learning (RL) approach to optimize cache decisions through the approximation of the Q action-value function. The proposed technique undergoes iterative learning, adapting to dynamic network conditions to enhance the content placement policy and minimize delay. Extensive simulations demonstrate the efficiency of our proposed approach in significantly reducing network delay compared with benchmark schemes. [ABSTRACT FROM AUTHOR]

The responsiveness of a web application with minimum latency time and maximum web pages loading speed is determined by its overall performance. When dealing with a large number of users and amount of data, the performance of web applications is significantly affected by ways of data processing, storage and access. This paper identifies the significance of data caching process to speed up access to relational database. The study examines approaches to improve the performance of web applications through the joint use of MySQL relational database management system (DBMS) and Redis NoSQL DBMS. The practical part of the study presents a description of a web application built based on Java and Spring Boot framework. The paper proposes the implementation of the caching strategies that take into account the principles of aspect-oriented programming. Made experiments on performance testing of the developed web application with and without caching are presented. The presented results of the study allowed us to conclude that it is possible to improve the performance of web applications by the optimal use of caching strategies when performing database queries. [ABSTRACT FROM AUTHOR]

The IoT encompasses objects, sensors, and everyday items not typically considered computers. IoT devices are subject to severe energy, memory, and computation power constraints. Employing NDN for the IoT is a recent approach to accommodate these issues. To gain a deeper insight into how different network parameters affect energy consumption, analyzing a range of parameters using hyperparameter optimization seems reasonable. The experiments from this work's ndnSIM-based hyperparameter setup indicate that the data packet size has the most significant impact on energy consumption, followed by the caching scheme, caching strategy, and finally, the forwarding strategy. The energy footprint of these parameters is orders of magnitude apart. Surprisingly, the packet request sequence influences the caching parameters' energy footprint more than the graph size and topology. Regarding energy consumption, the results indicate that data compression may be more relevant than expected, and caching may be more significant than the forwarding strategy. The framework for ndnSIM developed in this work can be used to simulate NDN networks more efficiently. Furthermore, the work presents a valuable basis for further research on the effect of specific parameter combinations not examined before. [ABSTRACT FROM AUTHOR]

The rapid development of artificial intelligence has pushed the Internet of Things (IoT) into a new stage. Facing with the explosive growth of data and the higher quality of service required by users, edge computing and caching are regarded as promising solutions. However, the resources in edge nodes (ENs) are not inexhaustible. In this paper, we propose an incentive-aware blockchain-assisted intelligent edge caching and computation offloading scheme for IoT, which is dedicated to providing a secure and intelligent solution for collaborative ENs in resource optimization and controls. Specifically, we jointly optimize offloading and caching decisions as well as computing and communication resources allocation to minimize the total cost for tasks completion in the EN. Furthermore, a blockchain incentive and contribution co-aware federated deep reinforcement learning algorithm is designed to solve this optimization problem. In this algorithm, we construct an incentive-aware blockchain-assisted collaboration mechanism which operates during local training, with the aim to strengthen the willingness of ENs to participate in collaboration with security guarantee. Meanwhile, a contribution-based federated aggregation method is developed, in which the aggregation weights of EN gradients are based on their contributions, thereby improving the training effect. Finally, compared with other baseline schemes, the numerical results prove that our scheme has an efficient optimization utility of resources with significant advantages in total cost reduction and caching performance.

The massive growth of diversified smart devices and continuous data generation poses a challenge to communication architectures. To deal with this problem, communication networks consider fog computing as one of promising technologies that can improve overall communication performance. It brings on-demand services proximate to the end devices and delivers the requested data in a short time. Fog computing faces several issues such as latency, bandwidth, and link utilization due to limited resources and the high processing demands of end devices. To this end, fog caching plays an imperative role in addressing data dissemination issues. This study provides a comprehensive discussion of fog computing, Internet of Things (IoTs) and the critical issues related to data security and dissemination in fog computing. Moreover, we determine the fog-based caching schemes and contribute to deal with the existing issues of fog computing. Besides, this paper presents a number of caching schemes with their contributions, benefits, and challenges to overcome the problems and limitations of fog computing. We also identify machine learning-based approaches for cache security and management in fog computing, as well as several prospective future research directions in caching, fog computing, and machine learning.

This paper presents an in-depth review of software-defined named data networking (SD-NDN), a transformative approach in network architectures poised to deliver substantial benefits. By addressing the limitations inherent in traditional host-centric network architectures, SD-NDN offers improvements in network performance, scalability, and efficiency. The paper commences with an overview of named data networking (NDN) and software-defined networking (SDN), the two fundamental building blocks of SD-NDN. It then explores the specifics of integrating NDN with SDN, illustrating examples of various SD-NDN models. These models are designed to leverage SDN for NDN routing, caching, and forwarding. The paper concludes by proposing potential strategies for further integration of SDN and NDN and some open research questions. These proposed strategies aim to stimulate further exploration and innovation in the field of SD-NDN.

Unlike conventional CPU caches, non-datapath caches, such as host-side flash caches which are extensively used as storage caches, have distinct requirements. While every cache miss results in a cache update in a conventional cache, non-datapath caches allow for the flexibility of selective caching, i.e., the option of not having to update the cache on each miss. We propose a new, generalized, bimodal caching algorithm, Fear Of Missing Out (FOMO), for managing non-datapath caches. Being generalized has the benefit of allowing any datapath cache replacement policy, such as LRU, ARC, or LIRS, to be augmented by FOMO to make these datapath caching algorithms better suited for non-datapath caches. Operating in two states, FOMO is selective—it selectively disables cache insertion and replacement depending on the learned behavior of the workload. FOMO is lightweight and tracks inexpensive metrics in order to identify these workload behaviors effectively. FOMO is evaluated using three different cache replacement policies against the current state-of-the-art non-datapath caching algorithms, using five different storage system workload repositories (totaling 176 workloads) for six different cache size configurations, each sized as a percentage of each workload’s footprint. Our extensive experimental analysis reveals that FOMO can improve upon other non-datapath caching algorithms across a range of production storage workloads, while also reducing the write rate.

One of the research directions in Internet of Things (IoT) is the field of Context Management Platforms (CMPs) which is a specific type of IoT middleware. CMPs provide horizontal connectivity between vertically oriented IoT silos resulting in a noticeable difference in how IoT data streams are processed. As these context data exchanges can be monetised, there is a need to model and predict the context metrics and operational costs of this exchange to provide relevant and timely context in a large-scale IoT ecosystem. In this paper, we argue that caching all transient context information to satisfy this necessity requires large amounts of computational and network resources, resulting in tremendous operational costs. Using Service Level Agreements (SLAs) between the context providers, CMP, and context consumers, where the level of service imperfection is quantified and linked to the associated costs, we show that it is possible to find efficient caching and prefetching strategies to minimize the context management cost. So, this paper proposes a novel method to find the optimal rate of IoT data prefetching and caching. We show the main context caching strategies and the proposed mathematical models, then discuss how a correctly chosen proactive caching strategy and configurations can help to maximise the profit of CMP operation when multiple SLAs are defined. Our model is accurate up to 0.0016 in Root Mean Square Percentage Error against our simulation results when estimating the profits to the system. We also show our model is valid using the t-test value tending to 0 for all the experimental scenarios. [ABSTRACT FROM AUTHOR]

An Information-Centric Network (ICN) provides a promising paradigm for the upcoming internet architecture, which will struggle with steady growth in data and changes in accessmodels.Various ICN architectures have been designed, including Named Data Networking (NDN), which is designed around content delivery instead of hosts. As data is the central part of the network. Therefore, NDN was developed to get rid of the dependency on IP addresses and provide content effectively. Mobility is one of the major research dimensions for this upcoming internet architecture. Some research has been carried out to solve the mobility issues, but it still has problems like handover delay and packet loss ratio during real-time video streaming in the case of consumer and producer mobility. To solve this issue, an efficient hierarchical Cluster Base Proactive Caching for Device Mobility Management (CB-PC-DMM) in NDN Vehicular Networks (NDN-VN) is proposed, through which the consumer receives the contents proactively after handover during the mobility of the consumer. When a consumer moves to the next destination, a handover interest is sent to the connected router, then the router multicasts the consumer's desired data packet to the next hop of neighboring routers. Thus, once the handover process is completed, consumers can easily get the content to the newly connected router. A CB-PCDMM in NDN-VN is proposed that improves the packet delivery ratio and reduces the handover delay aswell as cluster overhead. Moreover, the intra and inter-domain handover handling procedures in CB-PC-DMM for NDN-VN have been described. For the validation of our proposed scheme, MATLAB simulations are conducted. The simulation results show that our proposed scheme reduces the handover delay and increases the consumer's interest satisfaction ratio. The proposed scheme is compared with the existing stateof-the-art schemes, and the total percentage of handover delays is decreased by up to 0.1632%, 0.3267%, 2.3437%, 2.3255%, and 3.7313% at the mobility speeds of 5 m/s, 10 m/s, 15 m/s, 20 m/s, and 25 m/s, and the efficiency of the packet delivery ratio is improved by up to 1.2048%, 5.0632%, 6.4935%, 6.943%, and 8.4507%. Furthermore, the simulation results of our proposed scheme show better efficiency in terms of Packet Delivery Ratio (PDR) from 0.071 to 0.077 and a decrease in the handover delay from 0.1334 to 0.129. [ABSTRACT FROM AUTHOR]

In the mobile edge computing (MEC) environment, the edge caching can provide the timely data response service for the intelligent scenarios. However, due to the limited storage capacity of edge nodes and the malicious node behavior, the question of how to select the cached contents and realize the decentralized security data caching faces challenges. In this paper, a blockchain-based decentralized and proactive caching strategy is proposed in an MEC environment to address this problem. The novelty is that the blockchain was adopted in an MEC environment with a proactive caching strategy based on node utility, and the corresponding optimization problem was built. The blockchain was adopted to build a secure and reliable service environment. The employed methodology is that the optimal caching strategy was achieved based on the linear relaxation technology and the interior point method. Additionally, in a content caching system, there is a trade-off between cache space and node utility, and the caching strategy was proposed to solve this problem. There was also a trade-off between the consensus process delay of blockchain and the caching latency of content. An offline consensus authentication method was adopted to reduce the influence of the consensus process delay on the content caching. The key finding was that the proposed algorithm can reduce latency and can ensure the security data caching in an IoT environment. Finally, the simulation experiment showed that the proposed algorithm can achieve up to 49.32%, 43.11%, and 34.85% improvements on the cache hit rate, the average content response latency, and the average system utility, respectively, compared to the random content caching algorithm, and it achieved up to 9.67%, 8.11%, and 5.95% increases, successively, compared to the greedy content caching algorithm.

Caching is an essential component of Named Data Networking (NDN), enabling efficient and scalable content distribution for future networks. The caching strategy regulates content distribution by deciding which network nodes are most suited to store duplicates of popular data. Hence, cache placement decisions are crucial to the NDN cache strategy. According to a prior study, caching decisions should consider the availability of cache storage for each node, the network's structure, and the content's popularity. However, all those criteria are not considered simultaneously in the decision-making process. Ignoring critical criteria can lead to destructive and ineffective decisions. Multi-criteria decision-making (MCDM) improves NDN efficiency in caching decisions. This paper introduces C3CPS, a novel caching placement strategy based on MCDM using CoCoSo and CRITIC weighting method for enhanced content distribution. C3CPS considers five criteria, including two related to the network topologies, two related to cache storage, and the popularity of the content. Then, C3CPS examines these criteria with the CRITIC method to determine the weight of each criterion and the CoCoSo method to determine the optimal cache node. The ICARUS simulator validates C3CPS. The results show that the C3CPS outperforms other alternative caching techniques on cache hit rate, latency, and path stretch.

Dynamic Adaptive Streaming over HTTP (DASH) has prevailed as the dominant way of video transmission over the Internet. This technology is based on receiving small sequential video segments from a server. However, one challenge that has not been adequately examined is the obtainment of video segments in a way that serves both the needs of the network and the improvement in the Quality of Experience (QoE) of the users. One effective way to achieve this is to implement and study caching and DASH technologies together. This paper investigates this issue by simulating a network with multiple video servers and a video client. It then implements both the peer-to-many communications in the context of adaptive video streaming and the video server caching algorithm based on proposed criteria that improve the status of the network and/or the user. Specifically, we investigate the scenario of delivering DASH-based content with the help of an intermediate server, apart from a main server, to demonstrate possible caching benefits for different sizes of intermediate storage servers. Extensive experimentation using emulation reveals the interplay and delicate balance between caching and DASH, guiding such network design decisions. A general tendency found is that, as the available buffer size increases, the video playback quality increases to some extent. However, at the same time, this improvement is linked to the random cache selection algorithm. [ABSTRACT FROM AUTHOR]

Named Data Networking (NDN) is considered the future of Internet architecture, providing a realistic solution for data delivery using a caching module in an Internet of Things (IoT) based environment. However, a major challenge of the caching module is data redundancy, which decreases the overall caching performance by caching similar data at numerous locations in an NDN-based IoT scenario. Moreover, the latency and stretch are maximized due to high redundant caching operations. Several attempts have been made by the research community to provide an enhanced solution to overcome such issues. However, the caching module still requires efficient enhancement. This study provides critical insights into earlier caching strategies. To solve the problems of these caching strategies, an enhanced caching strategy is proposed, named Priority-based Content Popularity-Aware (PCPA) Caching Strategy, which is evaluated by comparing its performance with some of the novel NDN-based IoT caching strategies. The proposed caching strategy outperforms the comparing strategies in terms of latency, hop count, cache hit ratio and energy consumption.

One of the important ultimatums in enhancing the fifth generation (5G) network’s capacity is the performance limit due to spectrum occupancy. The mmWave technology overlay on 5G heterogeneous network (HetNet) and caching the contents are proposed as the solutions to this problem. By reducing the backhaul links occupancy, increasing the access link utilization and caching, the impact of spectrum occupancy problem can be minimized. In our earlier work, differential Quality of Service (QoS) was provisioned by managing the cache and backhaul resources using machine learning techniques. In this work, an integrated solution combining content, cache and user management is proposed to maximize network utilization and QoS. The problem of effective utilization of the network at the same time ensuring the QoS for users are solved as a multi objective optimization problem with the aid of hybrid meta heuristics with complementary exploration and exploitation capability. The user association to base station is made adaptive to load and cache hit ratio at the base station. By increasing the content proximity to the users, the load of backhaul links is minimized. Through these integrated management strategies, the proposed solution is able to provide higher QoS compared to existing works in terms of reduction in packet drop by 6%, reduction in delay by 39%, increase in network throughput by 8% and a consistent cache hit ratio more than 85%.

Efficient content caching is essential to address the explosive growth of multimedia contents and most works on content cache placement have been proposed mainly based on the popularity of content. Since the priority of content is also an important attribute of content, we consider both popularity and priority of content together for content caching in information-centric networking (ICN). We define weighted delivery cost of content as content delivery cost multiplied by a weighted sum of popularity and priority of the content. Then, we formulate optimized content cache placement problem to minimize weighted content delivery cost for all content requests in a hierarchical network architecture with multi-access edge computing (MEC) and software-defined networking (SDN) controller. Average quality of experience (QoE), i.e., average content delivery cost, for contents with each priority is imposed as constraint. The number of content requests is predicted based on seq2seq long short-term memory (LSTM) model in MECs and this is delivered to SDN controller. Then, SDN controller obtains predicted popularity of contents and decides content placement in MECs and core routers by solving the content cache placement optimization problem based on binary particle swarm optimization (BPSO). Performance of the proposed content caching scheme is compared with conventional popularity-based, popularity prediction-based, and popularity prediction-based optimization schemes, from the aspect of QoE satisfaction ratio, average cost, weighted average cost, total cost, and weighted total cost. Numerical results show the effectiveness of the proposed scheme at caching content with high priority efficiently, at the expense of caching content with low priority.

Driven by the urgent requirement of ubiquitous and reliable coverage for global users, the low earth orbit (LEO) satellite network has attracted numerous attentions from the academic and industry circles. By deploying multi-access edge computing (MEC) servers in LEO satellites, computation offloading and content caching services can be provided for remote Internet-of-Things (IoT) devices without proximal servers. In this paper, the joint optimization of computation offloading, radio resource allocation and caching placement in LEO satellite MEC networks are investigated. The problem is formulated to minimize the total delay of all ground IoT devices while ensuring the energy, computing and caching constraints. To solve this mixed-integer and non-convex problem, a Lagrange dual decomposition (LDD)-based algorithm is proposed to obtain the closed-form optimal solution. Then, a heuristic algorithm is proposed to further reduce the computation complexity. Numerical results validate that both algorithms are effective compared to the optimal exhaustive search, the full local computing and the full MEC methods. Besides, the offloading ratio and the average delay of all IoT devices with different numbers and computing capacities of devices and satellites are also demonstrated.

Data caching is a promising technique to alleviate the data traffic burden from the backhaul and minimize data access delay. However, the cache capacity constraint poses a significant challenge to obtaining content through the cache resource that degrades the caching performance. In this paper, we propose a novel two-tier caching mechanism for data caching on mobile user equipment (UE) and the small base station (SBS) level in ultra-dense 6G heterogeneous networks for reducing data access failure via cache resources. The two-tier caching enables users to retrieve their desired content from cache resources through device-to-device (D2D) communications from neighboring users or the serving SBS. The cache-enabled UE exploits millimeter-wave (mmWave)-based D2D communications, utilizing line-of-sight (LoS) links for high-speed data transmission to content-demanding mobile UE within a limited connection time. In the event of D2D communication failures, a dual-mode hybrid system, combining mmWave and microwave μWave technologies, is utilized to ensure effective data transmission between the SBS and UE to fulfill users’ data demands. In the proposed framework. the data transmission speed is optimized through mmWave signals in line-of-sight (LoS) conditions. In non-LoS scenarios, the system switches to μWave mode for obstacle-penetrating signal transmission. Subsequently, we propose a reinforcement learning (RL) approach to optimize cache decisions through the approximation of the Q action-value function. The proposed technique undergoes iterative learning, adapting to dynamic network conditions to enhance the content placement policy and minimize delay. Extensive simulations demonstrate the efficiency of our proposed approach in significantly reducing network delay compared with benchmark schemes.

The IoT encompasses objects, sensors, and everyday items not typically considered computers. IoT devices are subject to severe energy, memory, and computation power constraints. Employing NDN for the IoT is a recent approach to accommodate these issues. To gain a deeper insight into how different network parameters affect energy consumption, analyzing a range of parameters using hyperparameter optimization seems reasonable. The experiments from this work’s ndnSIM-based hyperparameter setup indicate that the data packet size has the most significant impact on energy consumption, followed by the caching scheme, caching strategy, and finally, the forwarding strategy. The energy footprint of these parameters is orders of magnitude apart. Surprisingly, the packet request sequence influences the caching parameters’ energy footprint more than the graph size and topology. Regarding energy consumption, the results indicate that data compression may be more relevant than expected, and caching may be more significant than the forwarding strategy. The framework for ndnSIM developed in this work can be used to simulate NDN networks more efficiently. Furthermore, the work presents a valuable basis for further research on the effect of specific parameter combinations not examined before.

In the rain forests of Hainan, China, two species of squirrel create grooves on the surface of smooth nuts so that they can wedge them in the forks between branches.

Data is growing quickly due to a significant increase in social media applications. Today, billions of people use an enormous amount of data to access the Internet. The backbone network experiences a substantial load as a result of an increase in users. Users in the same region or company frequently ask for similar material, especially on social media platforms. The subsequent request for the same content can be satisfied from the edge if stored in proximity to the user. Applications that require relatively low latency can use Content Delivery Network (CDN) technology to meet their requirements. An edge and the data center constitute the CDN architecture. To fulfill requests from the edge and minimize the impact on the network, the requested content can be buffered closer to the user device. Which content should be kept on the edge is the primary concern. The cache policy has been optimized using various conventional and unconventional methods, but they have yet to include the timestamp beside a video request. The 24-h content request pattern was obtained from publicly available datasets. The popularity of a video is influenced by the time of day, as shown by a time-based video profile. We present a cache optimization method based on a time-based pattern of requests. The problem is described as a cache hit ratio maximization problem emphasizing a relevance score and machine learning model accuracy. A model predicts the video to be cached in the next time stamp, and the relevance score identifies the video to be removed from the cache. Afterwards, we gather the logs and generate the content requests using an extracted video request pattern. These logs are pre-processed to create a dataset divided into three-time slots per day. A Long short-term memory (LSTM) model is trained on this dataset to forecast the video at the next time interval. The proposed optimized caching policy is evaluated on our CDN architecture deployed on the Korean Advanced Research Network (KOREN) infrastructure. Our findings demonstrate how adding time-based request patterns impacts the system by increasing the cache hit rate. To show the effectiveness of the proposed model, we compare the results with state-of-the-art techniques. [ABSTRACT FROM AUTHOR]

Behavioral plasticity can be described as the ability to adjust behavior depending on environmental information. We used a food-storing (caching) paradigm, during which individuals either ate or cached food under different conditions, to investigate whether they could adjust their caching behavior when observed by conspecifics and heterospecifics and which social cues they used to elicit these behavioral changes. We examined the location and number of caches made by two corvid species differing in sociality: highly social pinyon jays (Gymnorhinus cyanocephalus) and less social Clark's nutcrackers (Nucifraga columbiana). Although pinyon jays cached a similar amount of food across conditions, they allocated significantly more caches to areas less accessible to the observer. Nutcrackers, however, significantly reduced the number of seeds cached when another nutcracker was present in comparison to when they cached alone. Both species relied on different social cues to elicit re-caching: pinyon jays responded to the amount of time the observer spent close to the caching locations, whereas nutcrackers responded to the amount of time the observer spent pilfering their caches. The differences in cache protection behaviors and the social cues eliciting them may be explained by the species' social organization. Pinyon jays may only adjust their caching behavior when necessary, as they are often surrounded by other individuals. Being less social, Clark's nutcrackers reduce their caching when observed, as they have more opportunities to cache alone and may resort to additional cache protection when experiencing pilferage. Overall, our results provide insight into understanding how pressures associated with the social environment may influence foraging behaviors. Significance statement: To maximize resources, Corvidae will hide food for later consumption and seek out the hidden food of others. These birds also subvert this ecological game of "hide-and-seek" by re-hiding food that other birds know about. We demonstrate that two corvid species initiate "hide-and-seek" in response to different social information. Social pinyon jays re-hide their food after another bird approaches their hiding spots, a proactive response suited for species living in groups, in which attributing food theft to a specific individual may be difficult. Less-social Clark's nutcrackers re-hide food only after seeing another bird steal from them, a reactive response suited for species that typically have more opportunities for privacy when hiding food. We demonstrate corvids adapt to the risk posed by birds "seeking" their food, though which behaviors of the seeker are deemed risky differ between species and are shown to align with ecological demands. [ABSTRACT FROM AUTHOR]

The speedy advancement in wireless communication technologies provides considerable development to enable smart cities with applications such as Intelligent Transport Systems (ITS) and the Internet of Medical Things (IoMT). Blockchain is an emerging technology that provides a secure and distributed data storage mechanism useful for smart city applications. The full nodes in the Blockchain contain a record of all the transactions and data blocks of the Blockchain users. As the number of full nodes is less and the number of Blockchain users is high, there is a huge load on the full nodes for accessing and verifying the data by the Blockchain users. Efficient hardware caching techniques are needed to decrease the data access delay. In this paper, we implement different caching techniques on the Field-Programmable Gate Array (FPGA) Network Interface Card (NIC) and analyze their performance for the key-value store caching in the Blockchain. We design the 2-way and 4-way caching techniques on Block Random-Access Memory (BRAM) and compare them with the conventional direct-mapped caching technique in terms of cache hits and cache misses. The improvements in the hit ratio of the 2-way set-associative cache technique with respect to the direct-mapped cache technique for 10 K, 25 K, and 50 K addresses are 0.8%, 0.77%, and 1.67%, respectively. On the other hand, for the same sets of addresses, the hit rate improvement of the 4-way set-associative cache technique with respect to the direct-mapped cache technique is 0.92%, 2.01%, and 2.4%, respectively. The improvements in hit rate for large data sets show that 2-way and 4-way set-associative cache techniques perform better than the direct-mapped cache technique for caching systems. [ABSTRACT FROM AUTHOR]

We consider a setting where applications, such as websites or games, need causal access to objects available in geo-replicated cloud data stores. Common ways of implementing causal consistency involve hiding objects while waiting for their dependencies or waiting for server replicas to synchronize. To minimize delays and retrieve objects faster, applications may try to reach different server replicas at once. This entails a cost because providers charge for each reading request, including reading misses where the causal copy of the object is unavailable. Therefore, latency and cost are conflicting goals, which we control by selecting where to read and when. We formulate this challenge as a multi-criteria optimization problem and propose five non-dominated reading strategies, four of which are Pareto optimal, in a setting constrained to two server replicas. We validate these solutions on the following real cloud storage services: AWS S3, DynamoDB and MongoDB. Savings of as much as 50% on reading costs, with no significant or even a positive impact on latency, demonstrate that both clients and cloud providers could benefit from richer services compatible with these retrieval strategies. [ABSTRACT FROM AUTHOR]

High-speed internet has boosted clients' traffic needs. Content caching on mobile edge computing (MEC) servers reduces traffic and latency. Caching with MEC faces difficulties such as user mobility, limited storage, varying user preferences, and rising video streaming needs. The current content caching techniques consider user mobility and content popularity to improve the experience. However, no present solution addresses user preferences and mobility, affecting caching decisions. We propose mobility- and user-preferences-aware caching for MEC. Using time series, the proposed system finds mobility patterns and groups nearby trajectories. Using cosine similarity and CF, we predict and cache user-requested content. CF predicts the popularity of grouped-based content to improve the cache hit ratio and reduce delay compared to baseline techniques. [ABSTRACT FROM AUTHOR]

The tremendous growth in the internet of things (IoT) technology has provided great support for e-healthcare applications. The remote health monitoring of patients at home is gaining popularity with the increase in design of number of IoT enabled wearable devices. The secure and efficient health data retrieval during continuous uploading of huge data on network is a challenge. In addition, another challenge exists due to limited resources available with IoT device to proceed efficient data retrieval. On the other hand, the edge cloud in edge computing technology provide abundant resources to its devices for various computations, storage and processing. The integration of IoT with edge would solve the resource constraint issue. However, efficient retrieval of health data from large pool of data would still be an issue due to IP based solutions offered by IoT. The Named Data Networking (NDN) is a promising solution for efficient delivery of data based on its name based content searching. This paper proposed NDN communication based secure remote healthcare monitoring framework by integrating IoT with edge computing where security to the each individual content is provided through hashing and encryption mechanism. The performance of the proposed framework is evaluated against its companion in Icarus simulator. The results proved the efficiency of our framework for content retrieval delay and cost associated in accessing the required data.

One of the research directions in Internet of Things (IoT) is the field of Context Management Platforms (CMPs) which is a specific type of IoT middleware. CMPs provide horizontal connectivity between vertically oriented IoT silos resulting in a noticeable difference in how IoT data streams are processed. As these context data exchanges can be monetised, there is a need to model and predict the context metrics and operational costs of this exchange to provide relevant and timely context in a large-scale IoT ecosystem. In this paper, we argue that caching all transient context information to satisfy this necessity requires large amounts of computational and network resources, resulting in tremendous operational costs. Using Service Level Agreements (SLAs) between the context providers, CMP, and context consumers, where the level of service imperfection is quantified and linked to the associated costs, we show that it is possible to find efficient caching and prefetching strategies to minimize the context management cost. So, this paper proposes a novel method to find the optimal rate of IoT data prefetching and caching. We show the main context caching strategies and the proposed mathematical models, then discuss how a correctly chosen proactive caching strategy and configurations can help to maximise the profit of CMP operation when multiple SLAs are defined. Our model is accurate up to 0.0016 in Root Mean Square Percentage Error against our simulation results when estimating the profits to the system. We also show our model is valid using the t-test value tending to 0 for all the experimental scenarios.

User Equipment (UE) is equipped with limited cache resources that can be utilized to offload data traffic through device-to-device (D2D) communications. Data caching at a UE level has the potential to significantly alleviate data traffic burden from the backhaul link. Moreover, in wireless networks, users exhibit mobility that poses serious challenges to successful data transmission via D2D communications due to intermittent connectivity among users. Users' mobility can be exploited to efficiently cache contents by observing connectivity patterns among users. Therefore, it is crucial to develop an efficient data caching mechanism for UE while taking into account users' mobility patterns. In this work, we propose a mobility-aware data caching approach to enhance data offloading via D2D communication. First, we model users' connectivity patterns. Then, contents are cached in UE' cache resources based on users' data preferences. In addition, we also take into account signal-to-interference and noise ratio (SINR) requirements of the users. Hence, our proposed caching mechanism exploits connectivity patterns of users to perform data placement based on users' own demands and neighboring users to enhance data offloading via cache resources. We performed extensive simulations to investigate the performance of our proposed mobility-aware data caching mechanism. The performance of our proposed caching mechanism is compared to most deployed data caching mechanisms, while taking into account the dynamic nature of the wireless channel and the interference experienced by the users. From the obtained results, it is evident that our proposed approach achieves 14%, 16%, and 11% higher data offloading gain than the least frequently used, the Zipf-based probabilistic, and the random caching schemes in case of an increasing number of users, cache capacity, and number of contents, respectively. Moreover, we also analyzed cache hit rates, and our proposed scheme achieves 8% and 5% higher cache hit rate than the least frequently used, the Zipf-based probabilistic, and the random caching schemes in case of an increasing number of contents and cache capacity, respectively. Hence, our proposed caching mechanism brings significant improvement in data sharing via D2D communications. [ABSTRACT FROM AUTHOR]

Queries are the coronary heart of analytics. Without them, there may be no analytics. Data evaluation is assisting the business enterprise to make the very last choices on client developments and predictions and the queries could be massive and take a lot time to execute at the cluster. This task could assist queries to execute on distinctive systems primarily based totally at the configuration and cache the reaction for destiny reference through the use of a database. The task enables clients to research the information quicker and they could use it similarly for making the decision. In Enterprize information is important. In companies, Decisions are to be made through the massive extent of information. We cannot save the big extent of information in Relational databases and we can`t replace it due to the fact it's far vertical Scala. But Here Hadoop in HDFS is horizontal Scala and it shops a massive extent of information in a dispensed manner. Our task enables in shifting information from Relational databases like MySQL to Hadoop and it'll be accessed through the Java Database Connectivity (JDBC). The accessed information might be transformed to the JavaScript item notation (JSON) layout through the use of the Gson library. The transformed JSON layout might be saved in a database for destiny use. [ABSTRACT FROM AUTHOR]

Reproduction is an energetically expensive activity for both sexes. However, if males and females differ in their annual timing of reproduction, such that peak investment for one sex occurs during a more resource-limited period, there is an opportunity for sex-specific selection to act on the acquisition of energetic resources. Both male and female North American red squirrels (Tamiasciurus hudsonicus) cache conifer cones, although males typically have larger caches than females. Peak energetic investment in reproduction occurs for males during the mating season in winter and early spring (when squirrels rely almost exclusively on cached resources) and for females during lactation (which can align with fresh food availability). We provide evidence that suggests sex differences in cache size are likely driven by a stronger positive connection between cached resources and components of fitness for males than for females. Specifically, males with larger caches have greater siring success than males with smaller caches, whereas for females, only early breeding females experience a positive effect of cache size on the number of recruits produced. We also show that males sire pups and females give birth earlier in the year if they have larger caches compared with squirrels of the same sex with smaller caches. Sexual selection can thus extend beyond traits directly connected to mating behavior, and can act on traits related to acquiring resources needed to fuel reproduction that are expressed months or years in advance of breeding efforts. Significance statement: The timing and energetic requirements of reproduction are often different for males and females which could drive different life history strategies between the sexes. Red squirrels in the southwest Yukon, Canada cache white spruce cones in autumn, which serve as their primary food source until fresh food becomes available during summer. We measured the size of squirrel caches and subsequently monitored their reproduction to test whether the influence of stored food differs for males and females. We confirmed that males have larger caches than females and show that this is likely driven by a stronger positive association of cache size and components of fitness for males than for females. These findings highlight that the strength of selection can differ on the homologous traits of males and females leading to sex-specific extended phenotypes. [ABSTRACT FROM AUTHOR]

This paper studies the problem of optimal cache placement to maximize the offloading probability in a device-to-device (D2D) enabled cellular network with small base stations (SBSs). Different from most existing works, we consider unequal users’ equipment (UE) cache memory sizes and all wireless links are modeled as Nakagami- $m$ fading. User preference for each UE and global popularity for SBS, as well as the higher priority of content request from neighboring UEs vs. SBS, are the main factors that make the problem formulation of our work different from that of existing works. It is assumed that each UE caches its desired content with the order of searching its cache, neighboring UEs’ cache via D2D communications, and its serving SBS’ cache. A close to optimal low complexity heuristic cache placement policy is proposed and it is shown that its performance reaches the optimal caching strategy.

Cache-enabled Fog radio access network (F-RAN) is a promising technology to alleviate the traffic congestion and boost the contents delivery success rate. The efficiency of disseminating the cached contents in F-RAN can be boosted by enabling multicast service at the fog access points (F-APs). This paper proposes a joint random caching and multicasting optimization scheme for wireless backhauled F-RAN. Using tools from stochastic geometry, the expression of the successful transmission probability (STP) is derived by carefully analyzing the different types of serving F-APs and interferers. Then, a closed-form expression of the asymptotic STP in the high SNR region is derived to reduce the complexity. The joint caching and multicasting optimization problem is formulated to maximize the STP. The optimization problem is complex and non-convex in general. A novel projected cuckoo search algorithm (PCSA) is proposed to obtain the optimal content placement that maximizes the STP. The numerical simulation results show that PCSA outperforms the original cuckoo search algorithm (CSA) and the proposed asymptotically joint caching and multicasting scheme outperforms the benchmark caching schemes by up to 15% higher STPs.

This paper considers Low Earth Orbit (LEO) satellite- and cache-assisted unmanned aerial vehicle (UAV) communications for content delivery in terrestrial networks, which shows great potential for next-generation systems to provide ubiquitous connectivity and high capacity. Specifically, caching is provided by the UAV to reduce backhaul congestion, and the LEO satellite supports the UAV’s backhaul link. In this context, we aim to maximize the minimum achievable throughput per ground user (GU) by jointly optimizing cache placement, the UAV’s resource allocation, and trajectory while cache capacity and flight time are limited. The formulated problem is challenging to solve directly due to its non-convexity and combinatorial nature. To find a solution, the problem is decomposed into three sub-problems: (1) cache placement optimization with fixed UAV resources and trajectory, followed by (2) the UAV resources optimization with fixed cache placement vector and trajectory, and finally, (3) we optimize the UAV trajectory with fixed cache placement and UAV resources. Based on the solutions of sub-problems, an efficient alternating algorithm is proposed utilizing the block coordinate descent (BCD) and successive convex approximation (SCA) methods. Simulation results show that the max-min throughput and total achievable throughput enhancement can be achieved by applying our proposed algorithm instead of other benchmark schemes.

Highly immersive content in the form of extended reality (XR) is attracting attention as an alternative to conventional video services such as YouTube and Facebook. Many galleries and museums already offer online virtual reality (VR) tours where users are free to choose the spot they want to move to, beyond merely looking around. Although the ease of implementation, this key-spot hopping is still far from giving the real feeling of walking. Meanwhile, in recent volumetric or light-field-based studies, view rendering that supports free and continuous viewpoint movements has been attempted. With online services in mind, however, the high data volume and computational complexity are a big obstacle to practical applications. Path-walking VR, the target system of this paper, can be a good compromise, where the viewer can enjoy the virtual space while walking along the route. The interactive path-walking VR service is entry-level immersive video, but streaming over the network is still challenging. One of the main problems to be tackled is that the movement patterns of viewers need to be reflected in the streaming strategy to improve the quality of experience. Unlike unidirectional video, the movement of the viewer determines which images and how many images should be transmitted. This paper proposes schemes to reduce streaming delays by reflecting the viewer’s movement characteristics. It is differentiated from existing studies for omnidirectional video in that the proposed schemes control not only image quality but also view update rate. The first is a caching strategy which takes advantage of the geometrical locality of the virtual space that the viewer will soon reach a position close to the current position. This not only reduces the communication delay from the server, but also decreases the burden of server-side request handling. The second scheme uses the relationship between the viewer’s speed and the field of vision. The image quality is adjusted according to the viewer’s speed and head direction. Experimental results show that the proposed schemes achieve stable viewer’s experience by considering walking characteristics in virtual space. It is expected that the results of this paper will provide insight to those who design interactive streaming systems for immersive media applications.

Effective networking over wireless media has become extremely essential today as communication between massive Internet of things (IoT) devices is on an increase, thereby leading to a limited spectrum resource for utilisation. Specifically, for healthcare infrastructure in a remote or critical situation, providing uninterrupted communication between the macro base station and IoT devices or user nodes is imperative. However, owing to their limited spectral capacity, unmanned aerial vehicles (UAVs)-based networks can provide an efficient solution and utilise both licensed and unlicensed bands for communication among users or devices. In this paper, our focus is on cache-enabled cognitive networking for secondary users (SUs) that accredits precise communication delivery for critical healthcare systems that are performed by the cognitive UAV (CUAV). In addition, we develop a caching strategy wherein a CUAV is capable of caching relevant information from high-power (HP) and moderate-power (MP) devices in its local and cloud storage by applying a non-orthogonal multiple-access method. In the downlink scenario, the CUAV proactively transmits the requested HP and MP information to the designated SUs considering this entire model over two states, namely effectual state and interference state, which we can realise by any presence or absence of interference. To maximise this system’s energy efficiency, we formulate an optimisation problem to minimise the transmission power and satisfy the target performance in terms of throughput for SUs. We solve the optimisation issue using the Lagrangian approach and the Karush-Kuhn-Tucker conditions. In all simulations, the energy efficiency during the effectual state renders an average performance of approximately 400% better than that of the interference state.

All Information-Centric Networking (ICN) architectures proposed to date aim at connecting users to content directly, rather than connecting clients to servers. Surprisingly, however, although content caching is an integral of any information-Centric Network, limited work has been reported on information-centric management of caches in the context of an ICN. Indeed, approaches to cache management in networks of caches have focused on network connectivity rather than proximity to content.We introduce the Network-oriented Information-centric Centrality for Efficiency (NICE) as a new metric for cache management in information-centric networks. We propose a method to compute information-centric centrality that scales with the number of caches in a network rather than the num- ber of content objects, which is many orders of magnitude larger. Furthermore, it can be pre-processed off-line and ahead of time. We apply the NICE metric to a content replacement policy in caches, and show that a content replacement based on NICE exhibits better performances than LRU and other policies based on topology-oriented de nitions of centrality.

The demand for multimedia services is growing day by day in vehicular ad hoc networks (VANETs), resulting in high spectral usage and network congestion. Non-orthogonal multiple access (NOMA) is a promising wireless communication technique to solve the problems related to spectral efficiency effectively. The index coding (IC) is a powerful method to improve spectral utilization, where a sender aims to satisfy the needs of multiple receivers with a minimum number of transmissions. By combining these two approaches, in this work, we propose a novel technique called index coded NOMA (IC-NOMA), where we apply NOMA techniques on index coded data to reduce the number of transmissions further. This work shows that the IC-NOMA system demands a specific design for index codes to reap the advantages of NOMA. We have done the feasibility analysis of the proposed method in a general scenario and proposed an index code design to integrate IC over NOMA for the best efficiency. Through detailed analytical studies it is validated that the proposed transmission system provides improved spectral efficiency and power saving compared to conventional IC systems. [ABSTRACT FROM AUTHOR]

Stragglers (i.e., nodes with slow performance) are prevalent and incur performance instability in large-scale storage systems, yet it is challenging to detect stragglers in practice. We make a case by showing how erasure-coded caching provides robust straggler tolerance without relying on timely and accurate straggler detection, while incurring limited redundancy overhead in caching. We first analytically motivate that caching only parity blocks can achieve effective straggler tolerance. To this end, we present POCache , a parity-only caching design that provides robust straggler tolerance. To limit the erasure coding overhead, POCache slices blocks into smaller subblocks and parallelizes the coding operations at the subblock level. It further adopts a configurable straggler-aware cache algorithm (CSAC) that takes into account both file access popularity and straggler estimation to decide which parity blocks should be cached. CSAC enables POCache to configure various cache admission and eviction algorithms with straggler awareness and supports cache prefetching. We implement a POCache prototype atop Hadoop 3.1 HDFS, while preserving the performance and functionalities of normal HDFS operations. Extensive experiments on both local and Amazon EC2 clusters show that in the presence of stragglers, POCache can reduce the read latency by up to 87.9% compared to vanilla HDFS. • POCache applies parity-only caching to achieve robust straggler tolerance. • Mathematical analysis shows the effectiveness of caching only parity blocks. • We design a configurable straggler-aware cache algorithm for POCache. • We implement a POCache prototype atop Hadoop 3.1 HDFS. • We evaluate POCache on both local and Amazon EC2 clusters. [ABSTRACT FROM AUTHOR]

We define a procedure for canonicalising SPARQL 1.1 queries. Specifically, given two input queries that return the same solutions modulo variable names over any RDF graph (which we call congruent queries), the canonicalisation procedure aims to rewrite both input queries to a syntactically canonical query that likewise returns the same results modulo variable renaming. The use-cases for such canonicalisation include caching, optimisation, redundancy elimination, question answering, and more besides. To begin, we formally define the semantics of the SPARQL 1.1 language, including features often overlooked in the literature. We then propose a canonicalisation procedure based on mapping a SPARQL query to an RDF graph, applying algebraic rewritings, removing redundancy, and then using canonical labelling techniques to produce a canonical form. Unfortunately a full canonicalisation procedure for SPARQL 1.1 queries would be undecidable. We rather propose a procedure that we prove to be sound and complete for a decidable fragment of monotone queries under both set and bag semantics, and that is sound but incomplete in the case of the full SPARQL 1.1 query language. Although the worst case of the procedure is super-exponential, our experiments show that it is efficient for real-world queries, and that such difficult cases are rare. [ABSTRACT FROM AUTHOR]