Caching

In-network caching is one of the main pillars of the Named Data Networking (NDN) paradigm, where every Internet router, in the path between data sources and consumers, can cache incoming content packets. Multiple strategies have been designed for caching Internet of Things (IoT) data streamed by resource-constrained devices in edge domains and wireless sensor networks, while the benefits of IoT data caching at Internet-scale, including both edge and core network segments, have not been fully disclosed. In this work, we propose and analyse a novel probabilistic Internet-scale caching design for IoT data, which jointly accounts for the content popularity and lifetime. In the considered scenario, IoT contents are requested by remote consumers and delivered by crossing multiple edge and core network segments of the NDN-based future Internet. The proposal is composed of two distinct reactive caching strategies, a coordinated and an autonomous one, to be implemented in the edge and core domain, respectively. Achieved results show that the proposal outperforms state-of-the-art solutions by providing, among others, the highest cache hit ratio and the shortest number of hops. Such performances testify a lower pressure on energyconstrained devices and on the network infrastructure, overall contributing to the sustainability of the IoT ecosystem.

Named Data Networking (NDN) is a promising
Information-Centric future Internet architecture. Besides its rec-
ognized potentialities as a content retrieval solution in wired
domains, NDN has been also recently considered as an enabling
technology for the Internet of Things (IoT), thanks to its innova-
tive features like named-based routing and in-network caching.
In particular, the possibility of caching at intermediate nodes can
be especially useful to reduce the retrieval delay, and limit the
network traffic and the load on data producer. However, unlike
traditional Internet contents, IoT data are typically transient and
periodically refreshed by the producer. At the same time, unlike
Internet routers, IoT devices can be resource-constrained, with
limitations in terms of energy, storage and processing capabilities.
Therefore, caching algorithms designed for (intransient) Internet
traffic and Internet routers do not well suit IoT domains.
In this paper, we consider a wireless NDN-IoT network and
propose a novel distributed probabilistic caching strategy that
relies on the freshness of data and on potentially constrained
capabilities of devices (energy level and storage capacity). The
proposed solution has been evaluated through simulations with
ndnSIM and results show that it outperforms traditional NDN
caching mechanisms in terms of data retrieval and network
energy efficiency.

The popularity of the Mobile Database is increasing day by day as people need information even on the move in the fast changing world. This database technology permits employees using mobile devices to connect to their corporate networks, hoard the needed data, work in the disconnected mode and reconnect to the network to synchronize with the corporate database. In this scenario, the data is being moved closer to the applications in order to improve the performance and autonomy. This leads to many interesting problems in mobile database research and Mobile Database has become a fertile land for many researchers. In this paper a survey is presented on data and Transaction management in Mobile Databases from the year 2000 onwards. The survey focuses on the complete study on the various types of Architectures used in Mobile databases and Mobile Transaction Models. It also addresses the data management issues namely Replication and Caching strategies and the transaction management functionalities such as Concurrency Control and Commit protocols, Synchronization, Query Processing, Recovery and Security. It also provides Research Directions in Mobile databases.

The ancient Maya expressed their highly developed and complex ideological and cosmological systems through diverse methods. The Maya conveyed these beliefs through a range of symbols and various ritual practices. Imagery on ceramics and other media, as well as written texts, also indicate that many cultural traditions, such as the Maya creation story and the myth of the hero twins, were shared across broad temporal and spatial landscapes (Sharer and Traxler 2006). The methods used to express these ideologies, however, differed from region to region, in contrast to other shared Pan-Maya ideologies and symbolic systems. This ritual variation is principally observed in burial practices, architectural styles, and settlement configuration (Ashmore and Sabloff 2002; Becker 2004; Pendergast 1990).
Ritual caching activity was a Pan-Lowland Maya tradition (Coe and Houston 2015). The ritual caching of objects, particularly offerings containing eccentric chert and obsidian lithics, was a common Lowland manifestation of the complex ideologies of the ancient Maya. The wide variety of eccentric forms suggest that these ritual implements further served to communicate elements of ancient Maya ideology through ritual expression. It appears, however, that distinct styles of eccentric caching practices existed from region to region. Regional variation is evident in the context of cache deposition, as well as in the forms of eccentrics used in these caches. Factors influencing the production, morphology, and use of eccentric lithics may reflect differences in social function of cache, as well as differential access to raw materials or distinct collectives of craftspeople.
My thesis presents a methodological and theoretical framework, within which I will investigate ancient Maya ritual caching of chert and obsidian eccentrics. Specifically, I will focus on eccentric caches recovered from sites in the Upper Belize Valley, with an emphasis on data from the major polity of Xunantunich. I examine forms and contexts of eccentric lithic caches from these sites. Using these data, I explore the eccentric caching traditions of the major and minor centers in the Belize Valley. I then use this comparative data to compare local traditions with other regions within the Central and Southern Maya Lowlands to determine whether the caching of eccentrics can yield information on regional differences in ritual behavior.

Decisive progress in 5G mobile technology, fueled by a rapid proliferation of computation-hungry and delay-sensitive services, puts economic pressure on the research community to rethink the fundamentals of underlying networking architectures. Along these lines, the first half of this article offers a first-hand tutorial on the most recent advances in content-centric networking, emerging user applications, as well as
enabling system architectures. We establish that while significant progress has been made along the individual vectors of  communications, caching, and computing, together with some promising steps in proposing hybrid functionalities, the ultimate synergy behind a fully integrated solution is not nearly well understood. Against this background, the second half of this work carefully brings into perspective additional important factors, such as user mobility patterns, aggressive application requirements, and associated operator deployment capabilities, to conduct comprehensive system-level analysis. Furthermore, supported by a full-fledged practical trial on a
live cellular network, our systematic findings reveal the most dominant factors in converged 5G-grade communications, caching, and computing
layouts, as well as indicate the natural optimization points for system operators to leverage the maximum available benefits.

Sensor nodes in Wireless Sensor Networks (WSNs) are battery-powered devices that consume energy during data transmission and processing. One of the most critical tasks in a sensor network is dealing with reliable end-to-end transmissions and optimizing the power consumption. WSNs are error prone due to the constrained nature of the nodes and the interference with other wireless technologies such as Wifi and Bluetooth. One possible way to minimize this problem is caching the data. Data caching is one technique of improving the performance of a transport protocol. Since a typical data transmission consumes more energy than processing in a sensor network, the use of caching enables quick access to data. Therefore, caching, if used efficiently, could reduce overall network traffic and hence bandwidth can be optimally utilized. Unfortunately, a systematic analysis of caching in WSNs was until now lacking. Given that WSNs are expected to play an important role in Machine Type Communications (MTC) and Internet of Things (IoT), the authors believe that now is time to collect the results of years of research on this important topic. This paper presents a comprehensive survey on the state-of-the-art cache-based transport protocols in wireless sensor networks. We classify the transport protocols by presenting a thematic taxonomy of the current cache management mechanisms in wireless sensor networks. Moreover, the critical aspects of the existing cache-ware schemes in sensor networks are analyzed to determine the strengths and weaknesses of such protocols. The similarities and differences of the transport protocols based on the important parameters, such as cache insertion/replacement policy, cache size requirement, cache location, cache partition, and cache decision are investigated in this paper. In addition to that, we discuss open research issues and challenges of cache-based transport protocols in wireless sensor networks. We strongly believe that this study can serve as a basis so that future implementations can choose the combination of caching mechanisms that best fits their target application scenario.

New memory technologies are blurring the previously distinctive performance characteristics of adjacent layers in the memory hierarchy. No longer are such layers orders of magnitude different in request latency or capacity. Beyond the traditional single-layer view of caching, we now must re-cast the problem as a data placement challenge: which data should be cached in faster memory if it could instead be served directly from slower memory? We present Chopt, an offline algorithm for data placement across multiple tiers of memory with asymmetric read and write costs. We show that Chopt is optimal and can therefore serve as the upper bound of performance gain for any data placement algorithm. We also demonstrate an approximation of Chopt which makes its execution time for long traces practical using spatial sampling of requests incurring a small 0.2% average error on representative workloads at a sampling ratio of 1%. Our evaluation of Chopt on more than 30 production traces and benchmarks shows that optimal data placement decisions could improve average request latency by 8.2%-44.8% when compared with the long-established gold standard: Belady and Mattson's offline, evict-farthest-in-the-future optimal algorithms. Our results identify substantial improvement opportunities for future online memory management research.

Reliability of data transport in wireless sensor networks is critical in the presence of high packet loss level either due to link contentions or buffer congestions. Mechanisms such as intermediate caching and congestion control can enhance the reliability performance of transport protocols in the event of packet loss. However, these two mechanisms are designed independently for most cache-based transport protocols. In this paper, we developed a new reliable transport protocol with a cache-aware congestion control mechanism called RT-CaCC. RT-CaCC utilizes cache management policies such as cache insertion, cache elimination, and cache size allocation to mitigate packet losses in the network while maximizing cache utilization and bandwidth allocation. The protocol was evaluated in network topologies with different packet loss scenarios. Results showed that RT-CaCC obtained an average of 15%-38% improvement gain compared with baseline protocols. In addition, RT-CaCC consistently outperformed other cache-based transport protocols like distributed TCP caching and end-to-end reliable and congestion aware transport layer protocol in terms of cache utilization, end-to-end delay, and fairness metrics. Finally, the comparison between simulation and analytical results showed that there is an almost perfect match with the difference between curve points never exceeding 14% of the analytical cost.

This article introduces a novel family of decentralised caching policies for wireless networks, referred to as spatial multi-LRU. Based on these, cache inventories are updated in a way that provides content diversity to users that are covered by, and thus have access to, more than one station. Two variations are proposed, the multi-LRU-One and-All, which differ in the number of replicas inserted in the involved edge caches. Che-like approximations are proposed to accurately predict their hit probability under the Independent Reference Model (IRM). For IRM traffic multi-LRU-One outper-forms multi-LRU-All, whereas when the traffic exhibits temporal locality the-All variation can perform better.

To improve the performance of web database access for regular users, we have developed a client caching agent, referred to as a personal assistant. In addition to caching strategies based on data characteristics and user specification, the personal assistant dynamically prefetches information based on previously monitored user access patterns. It is part of an overall multi-layered caching scheme where cache coherency is ensured through cooperation with a server-side database caching agent. The personal assistant has been implemented in Java and integrated into the web architecture for the OMS Pro database management system.

Research paper: https://beatsigner.com/publications/a-personal-assistant-for-web-database-caching.pdf

When an organization spends CAC (Cost of Acquisition) to acquire a potential customer through various channels, all it takes is the LTV (Life Time Value) of the customer to decide the future of the upcoming company and its growth initiatives. Ideally, we would expect the LTV > CAC for the business to thrive and grow or acquire a more extensive user base for future anticipated growth. However, when the customers have unlimited choices at their fingertips to choose from, it becomes imperative to design the product for a better user experience and latency compared to the competitor. The paper looks at various design approaches to latency and how the technology landscape is changing around latencies.

Data caching and congestion control are two strategies that can enhance the transport reliability in constrained Wireless Sensor Networks. However, these two mechanisms are designed independently for most transport protocols developed for WSN. This work developed a new cache-aware congestion control mechanism for reliable transport. RT-CaCC utilizes cache management policies such as cache insertion, cache elimination and cache size to mitigate packet losses in the network while maximizing cache utilization and resource allocation. It uses two cache management policies for packet loss detection: implicit notifications and expiration of timeout. In addition, it utilizes congestion avoidance using cache-aware rate control mechanism employing transmission window limit as a function of cache size. Results showed that the RT-CaCC obtained significant improvement gain in terms of cache utilization , end-to-end delay and throughput performance specifically during high level of packet loss in the network.

In the last couple of years, Information Centric Networking (ICN) has gained momentum as increasing number of patches for various issues (like mobility, security, availability etc.) have transformed TCP/IP into a complex and delicate network architecture. Among many core functionalities of ICN, pervasive in-network caching has potential to play an indispensable role in ameliorating the overall network performance. The paper thus aims to empirically evaluate the performance of some of the existing in-network caching techniques and also proposes a new caching technique. More specifically, in the first part of the paper, it is empirically proven that off-path caching performs the best, as compared to on-path and edge caching in terms of hit rate, average retrieval delay, cache diversity and external traffic over expensive links. In second part of the paper, EDOP caching has been proposed as hybrid caching strategy that couples effectively off-path caching with edge caching. The results exhibit that EDOP caching effects significant improvement in average retrieval delay for the top most popular contents while inducing marginal trade-off in other relevant performance metrics.

With more than 75 billions of objects connected by 2025, Internet of Things (IoT) is the catalyst for the digital revolution, contributing to the generation of big amounts of (tran-sient) data, which calls into question the storage and processing performance of the conventional cloud. Moving storage resources at the edge can reduce the data retrieval latency and save core network resources, albeit the actual performance depends on the selected caching policy. Existing edge caching strategies mainly account for the content popularity as crucial decision metric and do not consider the transient feature of IoT data. In this paper, we design a caching orchestration mechanism, deployed as a network application on top of a software-defined networking Controller in charge of the edge infrastructure, which accounts for the nodes' storage capabilities, the network links' available bandwidth, and the IoT data lifetime and popularity. The policy decides which IoT contents have to be cached and in which node of a distributed edge deployment with limited storage resources, with the ultimate aim of minimizing the data retrieval latency. We formulate the optimal content placement through an Integer Linear Programming (ILP) problem and propose a heuristic algorithm to solve it. Results show that the proposal outperforms the considered benchmark solutions in terms of latency and cache hit probability, under all the considered simulation settings.

Hoarding or caching behaviour is a widely-used paradigm for examining a range of cognitive processes in birds, such as social cognition and spatial memory. However, much is still unknown about how caching develops in young birds, especially in the wild. Studying the ontogeny of caching in the wild will help researchers to identify the mechanisms that shape this advantageous foraging strategy. We examined the ontogeny of food caching behaviour in a wild New Zealand passerine, the North Island robin (Petroica longipes). For 12-weeks following fledging, we observed 34 juveniles to examine the development of caching and cache retrieval. Additionally, we compared the caching behaviour of juveniles at 12 weeks post-fledging to 35 adult robins to determine whether juveniles had developed adult-like caching behaviour by this age. Juveniles began caching mealworms shortly after achieving foraging independency. Multivariate analyses revealed that caching rate increased and handling time decreased with increasing age. Juveniles spontaneously began retrieving caches as soon as they had begun to cache and their retrieval rates then remained constant throughout their ensuing development. Likewise, the number of sites used by juveniles did not change with age. Juvenile sex, caregiver sex and the duration of post-fledging parental care did not influence the development of caching, cache retrieval, the number of cache sites used and the time juveniles spent handling mealworms. At 12 weeks post-fledging, juveniles demonstrated levels of caching, cache retrieval and cache site usage that were comparable to adults. However, juvenile prey handling time was still longer than adults. The spontaneous emergence of cache retrieval and the consistency in the number of cache sites used throughout development suggests that these aspects of caching in North Island robins are likely to be innate, but that age and experience have an important role in the development of adult caching behaviours.

Consistent data delivery in constrained networks such as wireless sensor networks (WSN), which has a significant role in Internet of Things (IoT), is vital due to the high probability of packet loss, not only because of the unreliable channel but also from link and buffer congestions. Thus, a reliable transport protocol should be used. Data caching at intermediate nodes is one way of improving the reliability performance of transport protocols in WSNs. However, it is not yet known up to what extent data caching alone can alleviate congestion in WSNs. This study investigates and analyses how a cache-based transport protocol, that has no congestion control mechanism and has a fixed transmission window, performs under congestion states. The transport protocol, called DTSN, is evaluated under link and buffer congestion states and the optimal performance is determined in terms of goodput, transmission cost and cache hit metrics. The results of our analysis reveal that intermediate caching was able to perform significantly during congestions in WSN. However, the amount of traffic being sent and intermediate node's cache memory should be taken into account. The optimum caching performance during link contentions is reached at higher transmission window and cache size values, while for buffer congestions, it is achieved at lower transmission window but higher cache size values, respectively. These values obtained can guarantee optimum usage of cache while ensuring congestion avoidance. In addition, the correlation that is established can serve as a basis for developing congestion window management for transport protocols in WSN that employ data caching.

Humans and other animals often favour immediate gratification over long-term gain. Primates, including humans, appear more willing to wait for rewards than other animals, such as rats or pigeons. Another group displaying impressive patience are the corvids, which possess large brains and show sophisticated cognitive abilities. Here, we assess intertemporal choice in one corvid species, the Western scrub-jay (Aphelocoma californica). These birds cache food for future consumption and respond flexibly to future needs. Cache-theft and cache-degradation are time-dependent processes in scrub-jay ecology that might necessitate sensitivity to delays between caching and retrieval. We adopt a caching paradigm with delays of up to 49 h. Across two experiments we find no evidence of a preference for earlier recovery. We highlight the possibility that, although scrub-jays can discriminate between the present and the future, they may not understand how far into the future an event will occur.

Among the distinctive features of the Named Data Networking (NDN) paradigm, in-network caching plays a crucial role in improving data delivery performance. At the network edge, the benefits of in-network caching can be remarkable in terms of reduced network traffic and user-perceived access latency. Multiple strategies have been designed for caching static Internet contents in NDN routers, while less attention has been devoted to transient Internet of Things (IoT) data, which expire after a certain amount of time. In this work, we introduce a novel distributed and autonomous caching strategy where NDN nodes take decisions by considering the popularity of IoT data and their lifetime. The target is to cache the most popular data with the highest residual lifetime in order to maximize the cache hit ratio at the edge. Performance evaluation assessed with the ndnSIM network simulator shows that the proposed solution outperforms existing schemes available in the literature by guaranteeing, among others, the highest cache hit ratio and the shortest content retrieval time.

—The current internet architecture is inefficient in fulfilling the demands of newly emerging internet applications. To address this issue, several over-the-top application-level solutions have been employed, making the overall architecture very complex. Information-centric-networking (ICN) architecture has emerged as a promising alternative solution. The ICN architecture decou-ples the content from the host at the network level and supports the temporary storage of content in an in-network cache. Fundamentally , the ICN can be considered a multisource, multicast content-delivery solution. Because of the benefits of network coding in multicasting scenarios and proven benefits in distributed storage networks, the network coding is apt for the ICN architecture. In this study, we propose a solvable linear network-coding scheme for the ICN architecture. We also propose a practical implementation of the network-coding scheme for the ICN, particularly for the content-centric network (CCN) architecture, which is termed the coded CCN. The performance results show that the network-coding scheme improves the performance of the CCN and significantly reduces the network traffic and average download delay.

Ability of caching the contents is one of the most important feature of an Information Centric Networking (ICN) node. By managing the cache space intelligently we can improve network’s performance and increase users’ Quality of Experience (QoE). Moreover, scalable video streaming in ICN is envisioned to be very beneficial as well as a challenging issue. In this paper, we are proposing a mechanism for cache management and request forwarding policies for scalable video streaming in ICN. Our proposed cache decision policy ensures to cache the base layer of a scalable video near to the users, which is mandatory layer for decoding any SVC encoded video and is needed by all the users with any data-rate budget, and consequently cache the higher layers in the upper nodes in the CCN/ICN within a specific RTT range. Furthermore, our intelligent cache decision cover fairness by considering router’s cache capacity (inside the RTT range) and at the same time giving more priority to the nodes that are nearer to the users. A limited cooperative request forwarding mechanism, which is the part of our proposal, plays a role to improve users’ QoE by providing the popular requested contents quickly. We have intensively simulated our proposed cache management and request forwarding scheme. The simulation results show that our proposed solution outperforms the current cache management schemes and improve the cache utilization. Also our proposed scheme decrease the traffic flowing inside the network by eliminating the request flooding and providing the requested contents from the nearby location to the users. The proposed scheme provides video faster to the users, specially the mandatory base layer is provided very quickly to the users.

We present FLIC, a distributed software data caching framework for fogs that reduces network traffic and latency. FLIC is targeted toward city-scale deployments of cooperative IoT devices in which each node gathers and shares data with surrounding devices. As machine learning and other data processing techniques that require large volumes of training data are ported to low-cost and low-power IoT systems, we expect that data analysis will be moved away from the cloud. Separation from the cloud will reduce reliance on power-hungry centralized cloud-based infrastructure. However, city-scale deployments of cooperative IoT devices often connect to the Internet with cellular service, in which service charges are proportional to network usage. IoT system architects must be clever in order to keep costs down in these scenarios. To reduce the network bandwidth required to operate city-scale deployments of cooperative IoT systems, FLIC implements a distributed cache on the IoT nodes in the fo...

Data caching and congestion control are two strategies that can enhance the transport reliability in constrained Wireless Sensor Networks. However, these two mechanisms are designed independently for most transport protocols developed for WSN. This work developed a new cache-aware congestion control mechanism for reliable transport. RT-CaCC utilizes cache management policies such as cache insertion, cache elimination and cache size to mitigate packet losses in the network while maximizing cache utilization and resource allocation. It uses two cache management policies for packet loss detection: implicit notifications and expiration of timeout. In addition, it utilizes congestion avoidance using cache-aware rate control mechanism employing transmission window limit as a function of cache size. Results showed that the RT-CaCC obtained significant improvement gain in terms of cache utilization , end-to-end delay and throughput performance specifically during high level of packet loss i...

Existing architecture of Internet is IP-centric, having capability to cope with the needs of the Internet users. Due to the recent advancements and emerging technologies, a need to have ubiquitous connectivity has become the primary focus. Increasing demands for location-independent content raised the requirement of a new architecture and hence it became a research challenge. Content Centric Networking (CCN) paradigm emerges as an alternative to IP-centric model and is based on name-based forwarding and in-network data caching. It is likely to address certain challenges that have not been solved by IP-based protocols in wireless networks. Three important factors that require significant research related to CCN are mobility, security, and caching. While a number of studies have been conducted on CCN and its proposed technologies, none of the studies target all three significant research directions in a single article, to the best of our knowledge. This paper is an attempt to discuss the three factors together within context of each other. In this paper, we discuss and analyze basics of CCN principles with distributed properties of caching, mobility, and secure access control. Different comparisons are made to examine the strengths and weaknesses of each aforementioned aspect in detail. The final discussion aims to identify the open research challenges and some future trends for CCN deployment on a large scale.

Method of broadcasting is the well known operation that is used for providing support to different computing protocols in cloud computing. Attaining energy efficiency is one of the prominent challenges, that is quite significant in the scheduling process that is used in cloud computing as, there are fixed limits that have to be met by the system. In this research paper, we are particularly focusing on the cloud server maintenance and scheduling process and to do so, we are using the interactive broadcasting energy efficient computing technique along with the cloud computing server. Additionally, the remote host machines used for cloud services are dissipating more power and with that they are consuming more and more energy. The effect of the power consumption is one of the main factors for determining the cost of the computing resources. With the idea of using the avoidance technology for assigning the data center resources that dynamically depend on the application demands and supports the cloud computing with the optimization of the servers in use. 1. INTRODUCTION Cloud computing is included in one of the fastest growing technologies used for the purpose of computing these days. Normally when it comes to cloud computing the models that includes are; Software-as-Service, Infrastructure-as Service and Platform-as-Service. The main focus is about allocating the data and computing it over a scalable information center of the network. Cloud Computing is one of the technology that relies on the allocation of the computing resources rather than relying on local servers and applications. The main purpose behind the designing of the computing technique is to perform efficient cost estimation, application hosting and substance storage. The main properties of the cloud computing technology include: a. Supplying the services to end users quickly using interface on Internet. b. Assigning and organizing the physical resources effectively as well as rapidly. c. Confirming the role of on demand distribution. d. Dealing with a huge quantity of requests and examining needs accordingly. Cloud computing has been attracting a lot of researchers since last couple of years and is still a great area of research for the keen researchers. Along with the increase in demand and enhancement in the

—The paper presents risk-neutral and risk-averse caching policies that can be deployed in a femtocell network with limited storage capacity to reduce the time delay of servicing content requests. The caching policies use a forecasting algorithm to estimate the cumulative distribution function of content requests based on the content features. Given the cumulative distribution function, a mixed-integer linear program is used to compute where to cache content in the femtocell network. The caching policies account for the uncertainty associated with estimating the content requests using the coherent Conditional Value-at-Risk (CVaR) measure. For a large number of content, a risk-neutral caching policy is constructed that accounts for both the content features and routing protocol that only requires the evaluation of a unimodular linear program. Using data from YouTube (comprising 25,000 videos) and the NS-3 simulator, the caching policies reduce the delay of retrieving content in femtocell networks compared with industry standard caching policies. Specifically, a 6% reduction in delay is achieved by accounting for the uncertainty, and a 60% reduction in delay is achieved if both the uncertainty and femtocell routing protocol are accounted for compared to the risk-neutral caching policy that neglects the routing protocol.

In-network caching has evidently emerged as an indispensable core functionality of ICN. Of the various types of caching techniques, off-path caching turns out to be a potential technique. With a view to improve the performance of hash-based off-path caching, the aim of the paper is to ensure profitable, economic and selective placement of caches such that the final cache allocation tends to reduce simultaneously average retrieval delay and maximum internal link-stress. To achieve the same, we propose simple yet elegant heuristic algorithm to strategically identify and exclude the bad node-positions for placement of caches. More specifically, for a given topology, the algorithm computes cost (in terms of delay) for all the nodes and prepares a cost based descending ordered list of nodes. Further, iteratively, increasing number of nodes, in sequence, from the cost-based ordered list of nodes are debarred from caching thereby resulting in family of solutions. A solution represents a selective cache allocation map corresponding to the number of debarred nodes. Moreover, every iterative solution reduces average retrieval delay and seeks opportunistic reduction in maximum internal linkstress. Comparing the solutions graphically would enable network operators to finally select (as per desire) one cache allocation map for a given network topology for hash-based off-path caching. In a way, the selected cache allocation map for the considered topology implies that it is better to place the caches at the core of the network as compared to edge.

DESCRIPTION Information dissemination as the main objective of setting up the Internet has seen different folds to improve its course. Information centric networking (ICN) has been introduced with the aim of curtailing some future challenges posed at the traditional Internet in the nearest future. ICN advantage of caching chunks of information on path and off-path of the network stands the paradigm out as an alternative shift from host centric network to name centric. ICN caching approach can thereby significantly reduce amount of times a host is visited. Bloom Filter with its advantage of fast searching and false positivity characteristics are seen as form of message retrieval practice to improve interest serving on the network. This paper analyzed the advantages of vending and adopting Bloom Filters and Muxing as research directions to minimize excessive bandwidth consumption, lesser delays, prompt delivery of information, higher throughput and the ability to share information fro...

The scalability of routing protocols has been a prominent topic to increasing the lifetime of a mobile ad hoc network. One of the underlying features behind scalable protocols is the localised nature of path maintenance. However, nodes’ data communications are excluded, despite being the main purpose of the routing protocols. SAMPCAN is a novel caching technique that can be applied to numerous applications of the client-server interaction model for an optimised storage and transmission of data. SAMPCAN uses a subsampling method that can be applied to two data types, mainly (1) XML document, and (2) Image. This novel method promotes the locality of nodes cooperation and interactions to fulfil requests of neighbouring nodes. In this paper, the application of SAMPCAN is discussed for the scalability and increased lifetime of mobile ad hoc networks.

Web applications are the main source of information exchange of businesses over the globe. The main problem over the globe about the web applications is the service of the particular server. As a server has its own capacity to handle some amount of particular clients, there is always a possibility the number of Clients may get increased, at this time most of servers are unable to respond. This paper gives a purposed solution for Servers to handle more clients even when its capacity exceeds without scaling it horizontally that is (without increasing hardware). Management of clients requests on a web Server is managed In order to increase the capacity on a server and hence it gets capable to handle more clients. Architecture for scaling web servers is uses application level scaling which makes it flexible to be applied on any other servers.

On-going revolution in ever-improving wireless communication enforces the necessity of a self configuring,
rapidly deployable and infrastructure less network. MANET is such an autonomous wireless network that meets the requirements. At the same time MANET’s random behavior and absence of any central intelligence to gather unambiguous knowledge about user contexts complexes QoS maintenance and hampers proper utilization of network resources resulting into unnecessary handovers. In past, few policy driven handover approaches have been proposed for MANET but none of them explores a comprehensive
policy design. Therefore in this paper we propose an adaptive and optimized policy based handover mechanism which is based on explicitly designed policies like load balancing, service discovery and next hop selection .Efficient procedures for these policies are also explored .This work predicts the high time of handover need on the basis of application specific needs of individual freely roaming mobile nodes, avoiding unnecessary handovers and provides efficient handover procedure with optimized resource
consumption, reduced latency and interruption time.

Ubiquitous in-network caching is one of the key aspects of information-centric networking (ICN) which has recently received widespread research interest. In one of the key relevant proposals known as Networking Named Content (NNC), the premise is that leveraging in-network caching to store content in every node it traverses along the delivery path can enhance content delivery. We question such indiscriminate universal caching strategy and investigate whether caching less can actually achieve more. Specifically, we investigate if caching only in a subset of node(s) along the content delivery path can achieve better performance in terms of cache and server hit rates. In this paper, we first study the behavior of NNC’s ubiquitous caching and observe that even naïve random caching at one intermediate node within the delivery path can achieve similar and, under certain conditions, even better caching gain. We propose a centrality-based caching algorithm by exploiting the concept of (ego network) betweenness centrality to improve the caching gain and eliminate the uncertainty in the performance of the simplistic random caching strategy. Our results suggest that our solution can consistently achieve better gain across both synthetic and real network topologies that have different structural properties.

To improve the performance of internet database services for regular users, the Internet OMS framework was extended by the personal assistant, a middle layer caching agent. On the one hand, the user can explicitly define queries to be permanently cached, on the other hand, the personal assistant monitors all user actions and prefetches the data most likely to be used in the near future from the database agent into his local persistent cache. Cache consistency is ensured through cooperation between the personal assistant’s caches and the database agent. The usage of the personal assistant’s caching framework will increase the overall cache hit rate and therefore reduce response times, e.g. over slower network connections.

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 ...