Academic literature on the topic 'Link caching'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Link caching.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Link caching"
1
Yang, Hunster. "A Review of the Association Between Environmental Harshness, Neurogenesis and Caching Behaviour." STEM Fellowship Journal 5, no. 1 (December 1, 2019): 13–18. http://dx.doi.org/10.17975/sfj-2019-005.
Full textAbstract:
Memory is one of the most crucial cognitive functions in many organisms. It is highly implicated in everyday functioning and is an essential component for survival. Past research has revealed that spatial memory facilitates bird caching behaviours such as remembering the exact locations of their hidden food. However, there are many factors that alter the demands on memory and consequently impact the function of caching. Specifically, neurogenesis, the process of forming new neurons, has been shown to affect this behaviour. Likewise, environmental variables and selective pressures (i.e., severity of the environment) can also influence caching in birds. In this review, we present evidence for a link between environmental harshness, hippocampal neurogenesis, and caching behaviour in chickadees, with specific focus on work by Chancellor et al. [6]. Neurogenesis in chickadees may be a mechanism subject to selective pressures, in which chickadees from harsher environments have increased neurogenesis rates and consequently enhanced caching ability. However, there remain gaps in the understanding of how exactly hippocampal neurogenesis, environmental harshness, and caching behaviour interact, and future studies are needed to further explore this interaction and its implications.
2
Vettigli, Giuseppe, Mingyue Ji, Karthikeyan Shanmugam, Jaime Llorca, Antonia Tulino, and Giuseppe Caire. "Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks." Entropy 21, no. 3 (March 25, 2019): 324. http://dx.doi.org/10.3390/e21030324.
Full textAbstract:
Coded multicasting has been shown to be a promising approach to significantly improve the performance of content delivery networks with multiple caches downstream of a common multicast link. However, the schemes that have been shown to achieve order-optimal performance require content items to be partitioned into several packets that grows exponentially with the number of caches, leading to codes of exponential complexity that jeopardize their promising performance benefits. In this paper, we address this crucial performance-complexity tradeoff in a heterogeneous caching network setting, where edge caches with possibly different storage capacity collect multiple content requests that may follow distinct demand distributions. We extend the asymptotic (in the number of packets per file) analysis of shared link caching networks to heterogeneous network settings, and present novel coded multicast schemes, based on local graph coloring, that exhibit polynomial-time complexity in all the system parameters, while preserving the asymptotically proven multiplicative caching gain even for finite file packetization. We further demonstrate that the packetization order (the number of packets each file is split into) can be traded-off with the number of requests collected by each cache, while preserving the same multiplicative caching gain. Simulation results confirm the superiority of the proposed schemes and illustrate the interesting request aggregation vs. packetization order tradeoff within several practical settings. Our results provide a compelling step towards the practical achievability of the promising multiplicative caching gain in next generation access networks.
3
Sheraz, Muhammad, Shahryar Shafique, Sohail Imran, Muhammad Asif, Rizwan Ullah, Muhammad Ibrar, Andrzej Bartoszewicz, and Saleh Mobayen. "Mobility-Aware Data Caching to Improve D2D Communications in Heterogeneous Networks." Electronics 11, no. 21 (October 24, 2022): 3434. http://dx.doi.org/10.3390/electronics11213434.
Full textAbstract:
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.
4
Soleimani, Somayeh, and Xiaofeng Tao. "Cooperative Crossing Cache Placement in Cache-Enabled Device to Device-Aided Cellular Networks." Applied Sciences 8, no. 9 (September 7, 2018): 1578. http://dx.doi.org/10.3390/app8091578.
Full textAbstract:
In cache-enabled device-to-device (D2D) -aided cellular networks, the technique of caching contents in the cooperative crossing between base stations (BSs) and devices can significantly reduce core traffic and enhance network capacity. In this paper, we propose a scheme that establishes device availability, which indicates whether a cache-enabled device can handle the transmission of the desired content within the required sending time, called the delay, while achieving optimal probabilistic caching. We also investigate the impact of transmission device availability on the effectiveness of a scenario of cooperative crossing cache placement, where content delivery traffic can be offloaded from the local cache, a D2D transmitter’s cache via a D2D link, or else directly from a BS via a cellular link, in order to maximize the offloading probability. Further, we derive the cooperation content offloading strategy while considering successful content transmission by D2D transmitters or BSs to guarantee the delay, even though reducing the delay is not the focus of this study. Finally, the proposed problem is formulated. Owing to the non-convexity of the optimization problem, it can be rewritten as a minimization of the difference between the convex functions; thus, it can be solved by difference of convex (DC) programming using a low-complexity algorithm. Simulation results show that the proposed cache placement scheme improves the offloading probability by 13.5% and 23% compared to Most Popular Content (MPC) scheme, in which both BSs and devices cache the most popular content and Coop. BS/D2D caching scheme, in which each BS tier and user tier applies cooperative content caching separately.
5
Tang, Aimin, Sumit Roy, and Xudong Wang. "Coded Caching for Wireless Backhaul Networks With Unequal Link Rates." IEEE Transactions on Communications 66, no. 1 (January 2018): 1–13. http://dx.doi.org/10.1109/tcomm.2017.2746106.
Full text
6
Zolfaghari, Behrouz, Vikrant Singh, Brijesh Kumar Rai, Khodakhast Bibak, and Takeshi Koshiba. "Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis." Entropy 23, no. 11 (November 3, 2021): 1459. http://dx.doi.org/10.3390/e23111459.
Full textAbstract:
The idea behind network caching is to reduce network traffic during peak hours via transmitting frequently-requested content items to end users during off-peak hours. However, due to limited cache sizes and unpredictable access patterns, this might not totally eliminate the need for data transmission during peak hours. Coded caching was introduced to further reduce the peak hour traffic. The idea of coded caching is based on sending coded content which can be decoded in different ways by different users. This allows the server to service multiple requests by transmitting a single content item. Research works regarding coded caching traditionally adopt a simple network topology consisting of a single server, a single hub, a shared link connecting the server to the hub, and private links which connect the users to the hub. Building on the results of Sengupta et al. (IEEE Trans. Inf. Forensics Secur., 2015), we propose and evaluate a yet more complex system model that takes into consideration both throughput and security via combining the mentioned ideas. It is demonstrated that the achievable rates in the proposed model are within a constant multiplicative and additive gap with the minimum secure rates.
7
Sageer Karat, Nujoom, Anoop Thomas, and Balaji Sundar Rajan. "Optimal Linear Error Correcting Delivery Schemes for Two Optimal Coded Caching Schemes." Entropy 22, no. 7 (July 13, 2020): 766. http://dx.doi.org/10.3390/e22070766.
Full textAbstract:
For coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server, an optimal delivery scheme was proposed by Chen, Fan, and Letaief in 2016. This scheme is referred to as the CFL scheme. In this paper, an extension to the coded caching problem where the link between the server and the users is error prone, is considered. The closed form expressions for average rate and peak rate of error correcting delivery scheme are found for the CFL prefetching scheme using techniques from index coding. Using results from error correcting index coding, an optimal linear error correcting delivery scheme for caching problems employing the CFL prefetching is proposed. Another scheme that has lower sub-packetization requirement as compared to CFL scheme for the same cache memory size was considered by J. Gomez-Vilardebo in 2018. An optimal linear error correcting delivery scheme is also proposed for this scheme.
8
Chao, Yichao, Hong Ni, and Rui Han. "A Path Load-Aware Based Caching Strategy for Information-Centric Networking." Electronics 11, no. 19 (September 27, 2022): 3088. http://dx.doi.org/10.3390/electronics11193088.
Full textAbstract:
Ubiquitous in-network caching plays an important role in improving the efficiency of content access and distribution in Information-Centric Networks (ICN). Content placement strategies, which determine the location distribution of content replicas in the network, have a decisive impact on the performance of the cache system. Existing strategies primarily focus on pushing popular content to the network edge, aiming to improve the overall cache hit ratio while neglecting to effectively balance the traffic load between network links; this leads to insufficient utilization of network bandwidth resources and further excessive content delivery time and user QoE degradation. In this paper, a Path Load-Aware Based Caching strategy (PLABC) is proposed, in which content-related information and dynamic network-related information are comprehensively considered to make cache decisions. Specifically, the utility of caching the content at each on-path node is calculated according to the bandwidth consumption savings and the load level of the transmission path, and the node with the greatest utility value is selected as the caching node. Extensive simulations are conducted to compare the performance of PLABC with other state-of-the-art schemes by quantitative analysis. Simulation results validate the PLABC strategy’s effectiveness, especially in balancing link load and reducing content delivery time.
9
Alghamdi, Fatimah, Saoucene Mahfoudh, and Ahmed Barnawi. "A Novel Fog Computing Based Architecture to Improve the Performance in Content Delivery Networks." Wireless Communications and Mobile Computing 2019 (January 23, 2019): 1–13. http://dx.doi.org/10.1155/2019/7864094.
Full textAbstract:
Along with the continuing evolution of the Internet and its applications, Content Delivery Networks (CDNs) have become a hot topic with both opportunities and challenges. CDNs were mainly proposed to solve content availability and download time issues by delivering content through edge cache servers deployed around the world. In our previous work, we presented a novel CDN architecture based on a Fog computing environment as a promising solution for real-time applications. In such architecture, we proposed to use a name-based routing protocol following the Information Centric Networking (ICN) approach, with a popularity-based caching strategy to guarantee overall delivery performance. To validate our design principle, we have implemented the proposed Fog-based CDN architecture with its major protocol components and evaluated its performance, as shown through this article. On the one hand, we have extended the Optimized Link-State Routing (OLSR) protocol to be content aware (CA-OLSR), i.e., so that it uses content names as routing labels. Then, we have integrated CA-OLSR with the popularity-based caching strategy, which caches only the most popular content (MPC). On the other hand, we have considered two similar architectures for conducting performance comparative studies. The first is pure Fog-based CDN implemented by the original OLSR (IP-based routing) protocol along with the default caching strategy. The second is a classical cloud-based CDN implemented by the original OLSR. Through extensive simulation experiments, we have shown that our Fog-based CDN architecture outperforms the other compared architectures. CA-OLSR achieves the highest packet delivery ratio (PDR) and the lowest delay for all simulated numbers of connected users. Furthermore, the MPC caching strategy shows higher cache hit rates with fewer numbers of caching operations compared to the existing default caching strategy, which caches all the pass-by content.
10
Damaraju, Padmaleela, and M. Sesha Shayee. "LINK STABLE INTELLIGENT CACHING MULTIPATH AND MULTICAST ROUTING PROTOCOL FOR WSN." International Journal of Computer Sciences and Engineering 6, no. 10 (October 31, 2018): 365–72. http://dx.doi.org/10.26438/ijcse/v6i10.365372.
Full textDissertations / Theses on the topic "Link caching"
1
Deshayes, Dan, and Simon Sedvallsson. "Nätverksoptimering med öppen källkod : En studie om nätverksoptimering för sjöfarten." Thesis, Linnéuniversitetet, Sjöfartshögskolan (SJÖ), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-43379.
Full textAbstract:
Detta examensarbete handlar om hur datatrafik över en satellitlänk kan optimeras för att minska laddningstider och överförd datamängd. Syftet med studien är att undersöka i vilken omfattning datatrafik mellan fartyg och land via satellitlänk kan styras så att trafiken blir effektivare. Genom att använda DNS-mellanlagring, mellanlagring av webbsidor samt annonsblockering med pfSense som plattform har examensarbetet utfört experiment emot olika hemsidor och mätt laddningstid samt överförd datamängd. Resultatet visade att det fanns stora möjligheter att optimera nätverkstrafiken och de uppmätta resultaten visade på en minskning av datamängden med 94% och laddningstiderna med 67%.The thesis describes how network traffic transmitted via a satellite link can be optimized in order to reduce loading times and transmitted data. The purpose with this study has been to determine what methods are available to control and reduce the amount of data transmitted through a network and how this data is affected. By applying the practice of DNS caching, web caching and ad blocking with the use of pfSense as a platform the study has performed experiments targeting different web sites and measured the loading times and amount of transmitted data. The results showed good possibilities to optimize the network traffic and the measured values indicated a reduction of the network traffic of up to 94% and loading times with 67%.
2
Xu, Sanlin, and SanlinXu@yahoo com. "Mobility Metrics for Routing in MANETs." The Australian National University. Faculty of Engineering and Information Technology, 2007. http://thesis.anu.edu.au./public/adt-ANU20070621.212401.
Full textAbstract:
A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other preexisting network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost,
high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of
routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable
routes, while dealing with the primary obstacle caused by node mobility.
¶
In the first part, we have developed an analysis framework for mobility metrics in random mobility model. Unlike previous research, where the mobility metrics were mostly studied by simulations, we derive the analytical expressions of mobility
metrics, including link persistence, link duration, link availability, link residual time, link change rate and their path equivalents. We also show relationships between the different
metrics, where they exist. Such exact expressions constitute precise mathematical relationships between network connectivity and node mobility.
¶
We further validate our analysis framework in Random Walk Mobility
model (RWMM). Regarding constant or random variable node velocity, we construct the transition matrix of Markov Chain Model through the analysis of the PDF of node separation after one epoch. In addition, we present intuitive and simple expressions for the link residual time and link duration, for the RWMM, which relate them directly to the ratio between transmission range and node speed. We also illustrate the relationship between link change rate and link duration. Finally, simulation results for all mentioned mobility metrics are reported which match well the proposed analytical framework.
¶
In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. When on-demand routing employed, stale route cache
information and frequent new-route discovery in processes in MANETs generate considerable routing delay and overhead. This thesis proposes a practical route caching strategy to minimize routing delay and/or overhead by setting route cache timeout to a mobility metric, the expected path residual time. The strategy is independent of network traffic load and adapts to various
non-identical link duration distributions, so it is feasible to implement in a real-time route caching scheme. Calculated results
show that the routing delay achieved by the route caching scheme is only marginally more than the theoretically determined minimum. Simulation in NS-2 demonstrates that the end-to-end delay from DSR routing can be remarkably reduced by our caching scheme. By using overhead analysis model, we demonstrate that the minimum routing overhead can be achieved by increasing timeout to around twice the expected path residual time, without significant increase in routing delay.
¶
Apart from route cache, this thesis also addresses link cache strategy which has the potential to utilize route information more efficiently than a route cache scheme. Unlike some previous link cache schemes delete links at some fixed time after they enter the cache, we proposes using either the expected path duration or the link residual time as the link cache timeout. Simulation results in NS-2 show that both of the proposed link caching schemes can improve network performance in the DSR by reducing dropped data packets, latency and routing overhead, with the link residual time scheme out-performing the path duration scheme.
¶
To deal with large-scale MANETs, this thesis presents an adaptive k-hop clustering algorithm (AdpKHop), which selects clusterhead (CH) by our CH selection metrics. The proposed CH selection criteria enable that the chosen CHs are closer to the cluster centroid and more stable than other cluster members with respect to node mobility. By using merging threshold
which is based on the CH selection metric, 1-hop clusters can merge to k-hop clusters, where the size of each k-hop cluster adapts to the node mobility of the chosen CH. Moreover, we propose a routing overhead analysis model for k-hop clustering
algorithm, which is determined by a range of network parameters, such as link change rate (related to node mobility), node degree and cluster density. Through the overhead analysis, we show that an optimal k-hop cluster density does exist, which is
independent of node mobility. Therefore, the corresponding optimal
cluster merging threshold can be employed to efficiently organise k-hop clusters to achieve minimum routing overhead, which is highly desirable in large-scale networks.
¶
The work presented in this thesis provides a sound basis for future research on mobility analysis for mobile ad hoc networks, in aspects such as mobility metrics, caching strategies and k-hop clustering routing protocols.
3
Sparks, Matthew A. "A COMPREHENSIVE HDL MODEL OF A LINE ASSOCIATIVE REGISTER BASED ARCHITECTURE." UKnowledge, 2013. http://uknowledge.uky.edu/ece_etds/26.
Full textAbstract:
Modern processor architectures suffer from an ever increasing gap between processor and memory performance. The current memory-register model attempts to hide this gap by a system of cache memory. Line Associative Registers(LARs) are proposed as a new system to avoid the memory gap by pre-fetching and associative updating of both instructions and data. This thesis presents a fully LAR-based architecture, targeting a previously developed instruction set architecture. This architecture features an execution pipeline supporting SWAR operations, and a memory system supporting the associative behavior of LARs and lazy writeback to memory.
4
Ben, Hassine Nesrine. "Machine Learning for Network Resource Management." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLV061.
Full textAbstract:
Une exploitation intelligente des données qui circulent sur les réseaux pourrait entraîner une amélioration de la qualité d'expérience (QoE) des utilisateurs. Les techniques d'apprentissage automatique offrent des fonctionnalités multiples, ce qui permet d’optimiser l'utilisation des ressources réseau.Dans cette thèse, deux contextes d’application sont étudiés : les réseaux de capteurs sans fil (WSNs) et les réseaux de contenus (CDNs). Dans les WSNs, il s’agit de prédire la qualité des liens sans fil afin d’améliorer la qualité des routes et donc d’augmenter le taux de remise des paquets ce qui améliore la qualité de service offerte à l’utilisateur. Dans les CDNs, il s’agit de prédire la popularité des contenus vidéo afin de mettre en cache les contenus les plus populaires, au plus près des utilisateurs qui les demandent. Ceci contribue à réduire la latence pour satisfaire les requêtes des utilisateurs.Dans ce travail, nous avons orchestré des techniques d’apprentissage issues de deux domaines différents, à savoir les statistiques et le Machine Learning. Chaque technique est représentée par un expert dont les paramètres sont réglés suite à une analyse hors-ligne. Chaque expert est chargé de prédire la prochaine valeur de la métrique. Vu la variété des experts retenus et comme aucun d’entre eux ne domine toujours tous les autres, un deuxième niveau d’expertise est nécessaire pour fournir la meilleure prédiction. Ce deuxième niveau est représenté par un expert particulier, appelé forecaster. Le forecaster est chargé de fournir des prédictions à partir des prédictions fournies par un sous ensemble des meilleurs experts.Plusieurs méthodes d’identification de ce sous ensemble sont étudiées. Elles dépendent de la fonction de perte utilisée pour évaluer les prédictions des experts et du nombre k, représentant les k meilleurs experts. Les tâches d’apprentissage et de prédiction sont effectuées en-ligne sur des data sets réels issus d’un WSN déployé à Stanford et de YouTube pour le CDN. La méthodologie adoptée dans cette thèse s’applique à la prédiction de la prochaine valeur d’une série temporelle.Plus précisément, nous montrons comment dans le contexte WSN, la qualité des liens peut être évaluée par le Link Quality Indicator (LQI) et comment les experts Single Exponential Smoothing (SES) et Average Moving Window (AMW) peuvent prédire la prochaine valeur de LQI. Ces experts réagissent rapidement aux changements des valeurs LQI que ce soit lors d’une brusque baisse de la qualité du lien ou au contraire lors d’une forte augmentation de la qualité. Nous proposons deux forecasters, Exponential Weighted Average (EWA) et Best Expert (BE), et fournissons la combinaison Expert-Forecaster permettant de fournir la meilleure prédiction.Dans le contexte des CDNs, nous évaluons la popularité de chaque contenu vidéo par le nombre journalier de requêtes. Nous utilisons à la fois des experts statistiques (ARMA) et des experts issus du Machine Learning (DES, régression polynômiale). Nous introduisons également des forecasters qui diffèrent par rapport à l’horizon des observations utilisées pour la prédiction, la fonction de perte et le nombre d’experts utilisés. Ces prédictions permettent de décider quels contenus seront placés dans les caches proches des utilisateurs. L’efficacité de la technique de caching basée sur la prédiction de la popularité est évaluée en termes de hit ratio et d’update ratio. Nous mettons en évidence les apports de cette technique de caching par rapport à un algorithme de caching classique, Least Frequently Used (LFU).Cette thèse se termine par des recommandations concernant l’utilisation des techniques d’apprentissage en ligne et hors-ligne pour les réseaux (WSN, CDN). Au niveau des perspectives, nous proposons différentes applications où l’utilisation de ces techniques permettrait d’améliorer la qualité d’expérience des utilisateurs mobiles ou des utilisateurs des réseaux IoTAn intelligent exploitation of data carried on telecom networks could lead to a very significant improvement in the quality of experience (QoE) for the users. Machine Learning techniques offer multiple operating, which can help optimize the utilization of network resources.In this thesis, two contexts of application of the learning techniques are studied: Wireless Sensor Networks (WSNs) and Content Delivery Networks (CDNs). In WSNs, the question is how to predict the quality of the wireless links in order to improve the quality of the routes and thus increase the packet delivery rate, which enhances the quality of service offered to the user. In CDNs, it is a matter of predicting the popularity of videos in order to cache the most popular ones as close as possible to the users who request them, thereby reducing latency to fulfill user requests.In this work, we have drawn upon learning techniques from two different domains, namely statistics and Machine Learning. Each learning technique is represented by an expert whose parameters are tuned after an off-line analysis. Each expert is responsible for predicting the next metric value (i.e. popularity for videos in CDNs, quality of the wireless link for WSNs). The accuracy of the prediction is evaluated by a loss function, which must be minimized. Given the variety of experts selected, and since none of them always takes precedence over all the others, a second level of expertise is needed to provide the best prediction (the one that is the closest to the real value and thus minimizes a loss function). This second level is represented by a special expert, called a forecaster. The forecaster provides predictions based on values predicted by a subset of the best experts.Several methods are studied to identify this subset of best experts. They are based on the loss functions used to evaluate the experts' predictions and the value k, representing the k best experts. The learning and prediction tasks are performed on-line on real data sets from a real WSN deployed at Stanford, and from YouTube for the CDN. The methodology adopted in this thesis is applied to predicting the next value in a series of values.More precisely, we show how the quality of the links can be evaluated by the Link Quality Indicator (LQI) in the WSN context and how the Single Exponential Smoothing (SES) and Average Moving Window (AMW) experts can predict the next LQI value. These experts react quickly to changes in LQI values, whether it be a sudden drop in the quality of the link or a sharp increase in quality. We propose two forecasters, Exponential Weighted Average (EWA) and Best Expert (BE), as well as the Expert-Forecaster combination to provide better predictions.In the context of CDNs, we evaluate the popularity of each video by the number of requests for this video per day. We use both statistical experts (ARMA) and experts from the Machine Learning domain (e.g. DES, polynomial regression). These experts are evaluated according to different loss functions. We also introduce forecasters that differ in terms of the observation horizon used for prediction, loss function and number of experts selected for predictions. These predictions help decide which videos will be placed in the caches close to the users. The efficiency of the caching technique based on popularity prediction is evaluated in terms of hit rate and update rate. We highlight the contributions of this caching technique compared to a classical caching algorithm, Least Frequently Used (LFU).This thesis ends with recommendations for the use of online and offline learning techniques for networks (WSN, CDN). As perspectives, we propose different applications where the use of these techniques would improve the quality of experience for mobile users (cellular networks) or users of IoT (Internet of Things) networks, based, for instance, on Time Slotted Channel Hopping (TSCH)
5
Xu, Sanlin. "Mobility Metrics for Routing in MANETs." Phd thesis, 2007. http://hdl.handle.net/1885/49272.
Full textAbstract:
A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. ... ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. ...
Book chapters on the topic "Link caching"
1
Hassan, Mofeed M., René Speck, and Axel-Cyrille Ngonga Ngomo. "Using Caching for Local Link Discovery on Large Data Sets." In Engineering the Web in the Big Data Era, 344–54. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19890-3_22.
Full text
2
Shekhar, Shashi, and Hui Xiong. "Peer-to-Peer Caching for Spatial On-Line Analytical Processing." In Encyclopedia of GIS, 854. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_970.
Full text
3
Bhalekar, Aniruddha, and John Baras. "Cumulative Caching for Reduced User-Perceived Latency for WWW Transfers on Networks with Satellite Links." In Service Assurance with Partial and Intermittent Resources, 179–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27767-5_18.
Full text
4
Danalis, Antonis, and Evangelos Markatos. "Web Caching." In Enterprise Networking, 234–48. IGI Global, 2002. http://dx.doi.org/10.4018/978-1-930708-17-4.ch013.
Full textAbstract:
World Wide Web traffic increases at exponential rates saturating network links and web servers. By replicating popular web pages in strategic places on the Internet, web caching reduces core network traffic, reduces web server load, and improves the end-users’ perceived quality of service. In this paper we survey the area of web caching. We identify major research challenges and their solutions, as well as several commercial products that are being widely used.
5
Danalis, Antonios. "Web Caching." In Encyclopedia of Information Science and Technology, First Edition, 3048–53. IGI Global, 2005. http://dx.doi.org/10.4018/978-1-59140-553-5.ch542.
Full textAbstract:
The popularity of the World Wide Web has led to an exponential increase of the traffic generated by its users for over a decade. Such a growth, over such a long period of time, would have saturated both the content providers and the network links had Web caching not been efficiently deployed. Web caching can improve the overall performance of the World Wide Web in several ways, depending on the decisions made regarding the deployment of the corresponding caches. By placing caches in strategic positions, the core network traffic can be reduced, the load of a content provider can be scaled down, and the quality of service, as the users perceive it, can be improved. In this article we present an overview of the major design and implementation challenges in Web caching, as well as their solutions.
6
Vora, Abhinav, Zahir Tari, and Peter Bertok. "Predicate Based Caching for Large Scale Mobile Distributed On-line Applications." In Advances in Mobile Commerce Technologies, 112–35. IGI Global, 2003. http://dx.doi.org/10.4018/978-1-59140-052-3.ch006.
Full textAbstract:
Robust mobile middlewares are crucial for online applications as they provide solutions for the core issues of mobility, data interoperability, and security. This chapter describes our experience in designing such middlewares for one of the largest Australian transport companies (CMS Transport Systems). We focus on the design of a predicate-based caching technique for mobile object-based middlewares that optimises the performance of the mobile medium by better utilising the available bandwidth. Several caching techniques have been proposed to improve system and application performance. Such techniques, along with consistency control mechanisms, are used to reduce the communication load between clients and servers, which is particularly important in wireless networks. Caching techniques are generally classified as either ID-based or predicate-based. In this chapter we propose a predicate-based caching scheme, in which the predicates are used in combination with updates and are broadcast by servers in a set of appropriate messages called cache invalidation reports. Each report/message contains information about the data items that have been updated in the server during a given period. A function mapping the predicate into binary representation is defined for each attribute. Because not all updates are relevant to a cache, there is a matching algorithm for detecting relevancy between the cache predicate and the predicates in the cache invalidation reports. The predicate-based cache invalidation reports inform the client cache manager concisely about items that need to be refreshed and about those that need to be discarded, and ensure efficient bandwidth usage.
7
"Peer-to-Peer Caching for Spatial On-line Analytical Processing." In Encyclopedia of GIS, 1568. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-17885-1_100946.
Full text
8
Tabassum, Kahkashan, Asia Sultana, and Avula Damaodaram. "Ubiquitous, Mobile and Pervasive Services." In Strategic and Pragmatic E-Business, 203–16. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-1619-6.ch009.
Full textAbstract:
The growing demand for wireless technology and related applications has impelled companies to invest profoundly in a wide range of wireless products such as laptops, notebooks, cellular phones, etc., to meet needs of broad range of customers’ requirements while maintaining high efficiency and data integrity. The Mobile Customers (MC) should be able to access the desired information such as news, weather reports, traffic updates, financial information, stock prices, etc. whenever and wherever they desire, but it is possible that they may have inconsistent data as they are not physically connected to the servers and hence they maintain a local cache that stores some amount of data that has been sent by the server. They may also prefetch data from the server for caching, depending on history for future use. The cached data should be consistent with the data in the data server in order to correctly serve the user. The critical constraints of a mobile device like limited network bandwidth, low battery power and low processing power of mobile devices make them more susceptible to inconsistencies. Broadcasting is the natural method for disseminating information in media: namely, shared Ethernet, optical networks, short-range wireless and wireless links, including satellites. It has the highest priority to disseminate information on the wireless network. Multicasting supports an enormous range of applications within a network and is an effective method to guarantee scalability of bulk data transfer in wireless environment. In a Multicast scenario, a single source sends data items, which are then replicated within the network infrastructure to reach a large client population (group). Therefore, it can be used to guarantee scalability, reliable data dissemination, timely and consistent content distribution.
Conference papers on the topic "Link caching"
1
Cheng, Minquan, Dequan Liang, Kai Wan, Mingming Zhang, and Giuseppe Caire. "A Novel Transformation Approach of Shared-link Coded Caching Schemes for Multiaccess Networks." In 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2021. http://dx.doi.org/10.1109/isit45174.2021.9517891.
Full text
2
Kong, Jiahui, Lanlan Rui, Haoqiu Huang, and Xiaomei Wang. "Link congestion and lifetime based in-network caching scheme in Information Centric Networking." In 2017 International Conference on Computer, Information and Telecommunication Systems (CITS). IEEE, 2017. http://dx.doi.org/10.1109/cits.2017.8035289.
Full text
3
Cao, Daming, Deyao Zhang, Pengyao Chen, Nan Liu, Wei Kang, and Deniz Gunduz. "Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case." In 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437635.
Full text
4
Liu, Xin, Daru Pan, and Hui Song. "Device-to-Device Wireless Caching Network Link Scheduling Algorithm Based on Bipartite Graph." In 2019 IEEE International Conference on Smart Internet of Things (SmartIoT). IEEE, 2019. http://dx.doi.org/10.1109/smartiot.2019.00059.
Full text
5
Minsu Shin, Jun Suk Kim, Min Young Chung, and Young Min Kwon. "Sidehaul link management scheme for mobile contents caching environments in moving small-cell networks." In 2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, 2016. http://dx.doi.org/10.1109/icufn.2016.7536955.
Full text
6
Gregori, Maria, Jesus Gomez-Vilardebo, Javier Matamoros, and Deniz Gunduz. "Joint transmission and caching policy design for energy minimization in the wireless backhaul link." In 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282606.
Full text
7
de la Rosa, Eugenio M., John H. Hartman, and Terril Hurst. "Analysis of RBQ: a new cooperative web caching mechanism that adapts to link congestion." In ITCom 2003, edited by Robert D. van der Mei and Frank Huebner. SPIE, 2003. http://dx.doi.org/10.1117/12.510955.
Full text
8
Ma, Teng, Xin Chen, Libo Jiao, and Ying Chen. "Deep Reinforcement Learning-based Edge Caching and Multi-link Cooperative Communication in Internet-of-Vehicles." In 2021 17th International Conference on Mobility, Sensing and Networking (MSN). IEEE, 2021. http://dx.doi.org/10.1109/msn53354.2021.00088.
Full text
9
Tang, Aimin, Yao Liu, and Xudong Wang. "Exploiting Joint-Cache-Channel Coding for Decentralized Coded Caching With Heterogeneous Link Rates and Cache Sizes." In 2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). IEEE, 2021. http://dx.doi.org/10.1109/pimrc50174.2021.9569686.
Full text
10
Waters, Daniel James, and Jianjun Zhang. "SOHO Network Performance Optimization via Local Caching with the Presence of a Main Bottleneck, the Accessing WAN Link." In 2011 IEEE 11th International Conference on Computer and Information Technology (CIT). IEEE, 2011. http://dx.doi.org/10.1109/cit.2011.40.
Full textReports on the topic "Link caching"
1
DeMarle, David, and Andrew Bauer. In situ visualization with temporal caching. Engineer Research and Development Center (U.S.), January 2022. http://dx.doi.org/10.21079/11681/43042.
Full textAbstract:
In situ visualization is a technique in which plots and other visual analyses are performed in tandem with numerical simulation processes in order to better utilize HPC machine resources. Especially with unattended exploratory engineering simulation analyses, events may occur during the run, which justify supplemental processing. Sometimes though, when the events do occur, the phenomena of interest includes the physics that precipitated the events and this may be the key insight into understanding the phenomena that is being simulated. In situ temporal caching is the temporary storing of produced data in memory for possible later analysis including time varying visualization. The later analysis and visualization still occurs during the simulation run but not until after the significant events have been detected. In this article, we demonstrate how temporal caching can be used with in-line in situ visualization to reduce simulation run-time while still capturing essential simulation results.