Articoli di riviste sul tema "Caching Dynamic Data"
Segui questo link per vedere altri tipi di pubblicazioni sul tema: Caching Dynamic Data.
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 articoli di riviste per l'attività di ricerca sul tema "Caching Dynamic Data".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.
1
Park, Seongsoo, Minseop Jeong e Hwansoo Han. "CCA: Cost-Capacity-Aware Caching for In-Memory Data Analytics Frameworks". Sensors 21, n. 7 (26 marzo 2021): 2321. http://dx.doi.org/10.3390/s21072321.
Testo completoAbstract (sommario):
To process data from IoTs and wearable devices, analysis tasks are often offloaded to the cloud. As the amount of sensing data ever increases, optimizing the data analytics frameworks is critical to the performance of processing sensed data. A key approach to speed up the performance of data analytics frameworks in the cloud is caching intermediate data, which is used repeatedly in iterative computations. Existing analytics engines implement caching with various approaches. Some use run-time mechanisms with dynamic profiling and others rely on programmers to decide data to cache. Even though caching discipline has been investigated long enough in computer system research, recent data analytics frameworks still leave a room to optimize. As sophisticated caching should consider complex execution contexts such as cache capacity, size of data to cache, victims to evict, etc., no general solution often exists for data analytics frameworks. In this paper, we propose an application-specific cost-capacity-aware caching scheme for in-memory data analytics frameworks. We use a cost model, built from multiple representative inputs, and an execution flow analysis, extracted from DAG schedule, to select primary candidates to cache among intermediate data. After the caching candidate is determined, the optimal caching is automatically selected during execution even if the programmers no longer manually determine the caching for the intermediate data. We implemented our scheme in Apache Spark and experimentally evaluated our scheme on HiBench benchmarks. Compared to the caching decisions in the original benchmarks, our scheme increases the performance by 27% on sufficient cache memory and by 11% on insufficient cache memory, respectively.
2
Kumar, Prashant, Naveen Chauhan, LK Awasthi e Narottam Chand. "Enhancing Data Availability in MANETs with Cooperative Caching". International Journal of Mobile Computing and Multimedia Communications 3, n. 4 (ottobre 2011): 53–66. http://dx.doi.org/10.4018/jmcmc.2011100104.
Testo completoAbstract (sommario):
Mobile Adhoc Networks (MANETs) are very popular solutions where network infrastructure installation is not possible. In MANETs, nodes are mobile, and due to this mobility, topology of the network changes rapidly. This dynamic topology reduces the data availability in MANETs. Cooperative caching provides an attractive solution for this problem. In this paper, a new cooperative caching algorithm, ProCoCa, is proposed. This algorithm is based on a proactive approach. Each node will be associated with a zone and the data of leaving node will be cached. The authors simulate the algorithm on OMNET++ simulator, and simulation results show that ProCoCa improves the data availability as well as overall performance of the network.
3
Yovita, Leanna Vidya, e Nana Rachmana Syambas. "Caching on Named Data Network: a Survey and Future Research". International Journal of Electrical and Computer Engineering (IJECE) 8, n. 6 (1 dicembre 2018): 4456. http://dx.doi.org/10.11591/ijece.v8i6.pp4456-4466.
Testo completoAbstract (sommario):
The IP-based system cause inefficient content delivery process. This inefficiency was attempted to be solved with the Content Distribution Network. A replica server is located in a particular location, usually on the edge router that is closest to the user. The user’s request will be served from that replica server. However, caching on Content Distribution Network is inflexible. This system is difficult to support mobility and conditions of dynamic content demand from consumers. We need to shift the paradigm to content-centric. In Named Data Network, data can be placed on the content store on routersthat are closest to the consumer. Caching on Named Data Network must be able to store content dynamically. It should be selectively select content that is eligible to be stored or deleted from the content storage based on certain considerations, e.g. the popularity of content in the local area. This survey paper explains the development of caching techniques on Named Data Network that are classified into main points. The brief explanation of advantages and disadvantages are presented to make it easy to understand. Finally, proposed the open challenge related to the caching mechanism to improve NDN performance.
4
Wang, Xiaohui, Kehe Wu e Fei Chen. "Smart Caching Based on Mobile Agent of Power WebGIS Platform". Scientific World Journal 2013 (2013): 1–8. http://dx.doi.org/10.1155/2013/757182.
Testo completoAbstract (sommario):
Power information construction is developing towards intensive, platform, distributed direction with the expansion of power grid and improvement of information technology. In order to meet the trend, power WebGIS was designed and developed. In this paper, we first discuss the architecture and functionality of power WebGIS, and then we study caching technology in detail, which contains dynamic display cache model, caching structure based on mobile agent, and cache data model. We have designed experiments of different data capacity to contrast performance between WebGIS with the proposed caching model and traditional WebGIS. The experimental results showed that, with the same hardware environment, the response time of WebGIS with and without caching model increased as data capacity growing, while the larger the data was, the higher the performance of WebGIS with proposed caching model improved.
5
Raghunathan, A., e K. Murugesan. "Performance-Enhanced Caching Scheme for Web Clusters for Dynamic Content". International Journal of Business Data Communications and Networking 7, n. 3 (luglio 2011): 16–36. http://dx.doi.org/10.4018/jbdcn.2011070102.
Testo completoAbstract (sommario):
In order to improve the QoS of applications, clusters of web servers are increasingly used in web services. Caching helps improve performance in web servers, but is largely exploited only for static web content. With more web applications using backend databases today, caching of dynamic content has a crucial role in web performance. This paper presents a set of cache management schemes for handling dynamic data in web clusters by sharing cached contents. These schemes use either automatic or expiry-based cache validation, and work with any type of request distribution. The techniques improve response by utilizing the caches efficiently and reducing redundant database accesses by web servers while ensuring cache consistency. The authors present caching schemes for both horizontal and vertical cluster architectures. Simulations show an appreciable performance rise in response times of queries in clustered web servers.
6
Kumar, Prashant, Naveen Chauhan, LK Awasthi e Narottam Chand. "Cooperative Cache Replacement Policy for MANETs". International Journal of Advanced Pervasive and Ubiquitous Computing 6, n. 2 (aprile 2014): 36–47. http://dx.doi.org/10.4018/ijapuc.2014040103.
Testo completoAbstract (sommario):
Mobile Adhoc Networks (MANETs) are autonomously structured multi-hop wireless links in peer to peer fashion without aid of any infrastructure network. In MANETs network topology is dynamic, as nodes are mobile. Due to this dynamic topology and multi-hop environment data availability in MANETs is low. Caching of frequently accessed data in ad hoc networks is a potential technique that can improve the data access, performance and availability. While caching the new data items, it is very important which data item is to be removed, as in MANETs the data is not stored only on behalf of caching node but interest of the vicinity is also considered. In this paper the authors presented a new cache replacement policy for MANETs. This policy is based on multi-parameter value called SAT. We simulate the proposed work on OMNET++ and the simulation results shows that proposed replacement policy helps to improve the data availability in network.
7
Li, Ru, e Meiju Yu. "A caching strategy based on dynamic popularity for named data networking". International Journal of Information Technology and Management 19, n. 4 (2020): 305. http://dx.doi.org/10.1504/ijitm.2020.10028767.
Testo completo
8
Yu, Meiju, e Ru Li. "A caching strategy based on dynamic popularity for named data networking". International Journal of Information Technology and Management 19, n. 4 (2020): 305. http://dx.doi.org/10.1504/ijitm.2020.110238.
Testo completo
9
Liu, Jinjiang, Yihua Lan, Jingjing Liang, Quanzhou Cheng, Chih-Cheng Hung, Chao Yin e Jiadong Sun. "An Efficient Schema for Cloud Systems Based on SSD Cache Technology". Mathematical Problems in Engineering 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/109781.
Testo completoAbstract (sommario):
Traditional caching strategy is mainly based on the memory cache, taking read-write speed as its ultimate goal. However, with the emergence of SSD, the design ideas of traditional cache are no longer applicable. Considering the read-write characteristics and times limit of erasing, the characteristics of SSD are taken into account as far as possible at the same time of designing caching strategy. In this paper, the flexible and adaptive cache strategy based on SSD is proposed, called FAC, which gives full consideration to the characteristics of SSD itself, combines traditional caching strategy design ideas, and then maximizes the role SSD has played. The core mechanism is based on the dynamic adjustment capabilities of access patterns and the efficient selection algorithm of hot data. We have developed dynamical adjust section hot data algorithm, DASH in short, to adjust the read-write area capacity to suit the current usage scenario dynamically. The experimental results show that both read and write performance of caching strategy based on SSD have improved a lot, especially for read performance. Compared with traditional caching strategy, the technique can be used in engineering to reduce write times to SSD and prolong its service life without lowering read-write performance.
10
Ji, Jiequ, Kun Zhu, Ran Wang, Bing Chen e Chen Dai. "Energy Efficient Caching in Backhaul-Aware Cellular Networks with Dynamic Content Popularity". Wireless Communications and Mobile Computing 2018 (2018): 1–12. http://dx.doi.org/10.1155/2018/7532049.
Testo completoAbstract (sommario):
Caching popular contents at base stations (BSs) has been regarded as an effective approach to alleviate the backhaul load and to improve the quality of service. To meet the explosive data traffic demand and to save energy consumption, energy efficiency (EE) has become an extremely important performance index for the 5th generation (5G) cellular networks. In general, there are two ways for improving the EE for caching, that is, improving the cache-hit rate and optimizing the cache size. In this work, we investigate the energy efficient caching problem in backhaul-aware cellular networks jointly considering these two approaches. Note that most existing works are based on the assumption that the content catalog and popularity are static. However, in practice, content popularity is dynamic. To timely estimate the dynamic content popularity, we propose a method based on shot noise model (SNM). Then we propose a distributed caching policy to improve the cache-hit rate in such a dynamic environment. Furthermore, we analyze the tradeoff between energy efficiency and cache capacity for which an optimization is formulated. We prove its convexity and derive a closed-form optimal cache capacity for maximizing the EE. Simulation results validate the proposed scheme and show that EE can be improved with appropriate choice of cache capacity.
11
Man, Dapeng, Yao Wang, Hanbo Wang, Jiafei Guo, Jiguang Lv, Shichang Xuan e Wu Yang. "Information-Centric Networking Cache Placement Method Based on Cache Node Status and Location". Wireless Communications and Mobile Computing 2021 (14 settembre 2021): 1–13. http://dx.doi.org/10.1155/2021/5648765.
Testo completoAbstract (sommario):
Information-Centric Networking with caching is a very promising future network architecture. The research on its cache deployment strategy is divided into three categories, namely, noncooperative cache, explicit collaboration cache, and implicit collaboration cache. Noncooperative caching can cause problems such as high content repetition rate in the web cache space. Explicit collaboration caching generally reflects the best caching effect but requires a lot of communication to satisfy the exchange of cache node information and depends on the controller to perform the calculation. On this basis, implicit cooperative caching can reduce the information exchange and calculation between cache nodes while maintaining a good caching effect. Therefore, this paper proposes an on-path implicit cooperative cache deployment method based on the dynamic LRU-K cache replacement strategy. This method evaluates the cache nodes based on their network location and state and selects the node with the best state value on the transmission path for caching. Each request will only select one or two nodes for caching on the request path to reduce the redundancy of the data. Simulation experiments show that the cache deployment method based on the state and location of the cache node can improve the hit rate and reduce the average request length.
12
Thanh, Pham Duy, Tran Nhut Khai Hoan, Hoang Thi Huong Giang e Insoo Koo. "Cache-Enabled Data Rate Maximization for Solar-Powered UAV Communication Systems". Electronics 9, n. 11 (20 novembre 2020): 1961. http://dx.doi.org/10.3390/electronics9111961.
Testo completoAbstract (sommario):
Currently, deploying fixed terrestrial infrastructures is not cost-effective in temporary circumstances, such as natural disasters, hotspots, and so on. Thus, we consider a system of caching-based UAV-assisted communications between multiple ground users (GUs) and a local station (LS). Specifically, a UAV is exploited to cache data from the LS and then serve GUs’ requests to handle the issue of unavailable or damaged links from the LS to the GUs. The UAV can harvest solar energy for its operation. We investigate joint cache scheduling and power allocation schemes by using the non-orthogonal multiple access (NOMA) technique to maximize the long-term downlink rate. Two scenarios for the network are taken into account. In the first, the harvested energy distribution of the GUs is assumed to be known, and we propose a partially observable Markov decision process framework such that the UAV can allocate optimal transmission power for each GU based on proper content caching over each flight period. In the second scenario where the UAV does not know the environment’s dynamics in advance, an actor-critic-based scheme is proposed to achieve a solution by learning with a dynamic environment. Afterwards, the simulation results verify the effectiveness of the proposed methods, compared to baseline approaches.
13
Bhandari, Sovit, Navin Ranjan, Pervez Khan, Hoon Kim e Youn-Sik Hong. "Deep Learning-Based Content Caching in the Fog Access Points". Electronics 10, n. 4 (22 febbraio 2021): 512. http://dx.doi.org/10.3390/electronics10040512.
Testo completoAbstract (sommario):
Proactive caching of the most popular contents in the cache memory of fog-access points (F-APs) is regarded as a promising solution for the 5G and beyond cellular communication to address latency-related issues caused by the unprecedented demand of multimedia data traffic. However, it is still challenging to correctly predict the user’s content and store it in the cache memory of the F-APs efficiently as the user preference is dynamic. In this article, to solve this issue to some extent, the deep learning-based content caching (DLCC) method is proposed due to recent advances in deep learning. In DLCC, a 2D CNN-based method is exploited to formulate the caching model. The simulation results in terms of deep learning (DL) accuracy, mean square error (MSE), the cache hit ratio, and the overall system delay is displayed to show that the proposed method outperforms the performance of known DL-based caching strategies, as well as transfer learning-based cooperative caching (LECC) strategy, randomized replacement (RR), and the Zipf’s probability distribution.
14
Shailesh, K. S., e Suresh Pachigolla Venkata. "Personalized Chunk Framework for High Performance Personalized Web". International Journal of Web Portals 9, n. 1 (gennaio 2017): 52–63. http://dx.doi.org/10.4018/ijwp.2017010104.
Testo completoAbstract (sommario):
Dividing the web site page content or web portal page into logical chunks is one of the prominent methods for better management of web site content and for improving web site's performance. While this works well for public web page scenarios, personalized pages have challenges with dynamic data, data caching, privacy and security concerns which pose challenges in creating and caching content chunks. Web portals has huge dependence on personalized data. In this paper the authors have introduced a novel concept called “personalized content chunk” and “personalized content spot” that can be used for segregating and efficiently managing the personalized web scenarios. The authors' experiments show that performance can be improved by 30% due to the personalized content chunk framework.
15
Vishnekov, A. V., e E. M. Ivanova. "DYNAMIC CONTROL METHODS OF CACHE LINES REPLACEMENT POLICY". Vestnik komp'iuternykh i informatsionnykh tekhnologii, n. 191 (maggio 2020): 49–56. http://dx.doi.org/10.14489/vkit.2020.05.pp.049-056.
Testo completoAbstract (sommario):
The paper investigates the issues of increasing the performance of computing systems by improving the efficiency of cache memory, analyzes the efficiency indicators of replacement algorithms. We show the necessity of creation of automated or automatic means for cache memory tuning in the current conditions of program code execution, namely a dynamic cache replacement algorithms control by replacement of the current replacement algorithm by more effective one in current computation conditions. Methods development for caching policy control based on the program type definition: cyclic, sequential, locally-point, mixed. We suggest the procedure for selecting an effective replacement algorithm by support decision-making methods based on the current statistics of caching parameters. The paper gives the analysis of existing cache replacement algorithms. We propose a decision-making procedure for selecting an effective cache replacement algorithm based on the methods of ranking alternatives, preferences and hierarchy analysis. The critical number of cache hits, the average time of data query execution, the average cache latency are selected as indicators of initiation for the swapping procedure for the current replacement algorithm. The main advantage of the proposed approach is its universality. This approach assumes an adaptive decision-making procedure for the effective replacement algorithm selecting. The procedure allows the criteria variability for evaluating the replacement algorithms, its’ efficiency, and their preference for different types of program code. The dynamic swapping of the replacement algorithm with a more efficient one during the program execution improves the performance of the computer system.
16
Vishnekov, A. V., e E. M. Ivanova. "DYNAMIC CONTROL METHODS OF CACHE LINES REPLACEMENT POLICY". Vestnik komp'iuternykh i informatsionnykh tekhnologii, n. 191 (maggio 2020): 49–56. http://dx.doi.org/10.14489/vkit.2020.05.pp.049-056.
Testo completoAbstract (sommario):
The paper investigates the issues of increasing the performance of computing systems by improving the efficiency of cache memory, analyzes the efficiency indicators of replacement algorithms. We show the necessity of creation of automated or automatic means for cache memory tuning in the current conditions of program code execution, namely a dynamic cache replacement algorithms control by replacement of the current replacement algorithm by more effective one in current computation conditions. Methods development for caching policy control based on the program type definition: cyclic, sequential, locally-point, mixed. We suggest the procedure for selecting an effective replacement algorithm by support decision-making methods based on the current statistics of caching parameters. The paper gives the analysis of existing cache replacement algorithms. We propose a decision-making procedure for selecting an effective cache replacement algorithm based on the methods of ranking alternatives, preferences and hierarchy analysis. The critical number of cache hits, the average time of data query execution, the average cache latency are selected as indicators of initiation for the swapping procedure for the current replacement algorithm. The main advantage of the proposed approach is its universality. This approach assumes an adaptive decision-making procedure for the effective replacement algorithm selecting. The procedure allows the criteria variability for evaluating the replacement algorithms, its’ efficiency, and their preference for different types of program code. The dynamic swapping of the replacement algorithm with a more efficient one during the program execution improves the performance of the computer system.
17
Qureshi, Adnan Mahmood, Nadeem Anjum, Rao Naveed Bin Rais, Masood Ur-Rehman e Amir Qayyum. "Detection of malicious consumer interest packet with dynamic threshold values". PeerJ Computer Science 7 (17 marzo 2021): e435. http://dx.doi.org/10.7717/peerj-cs.435.
Testo completoAbstract (sommario):
As a promising next-generation network architecture, named data networking (NDN) supports name-based routing and in-network caching to retrieve content in an efficient, fast, and reliable manner. Most of the studies on NDN have proposed innovative and efficient caching mechanisms and retrieval of content via efficient routing. However, very few studies have targeted addressing the vulnerabilities in NDN architecture, which a malicious node can exploit to perform a content poisoning attack (CPA). This potentially results in polluting the in-network caches, the routing of content, and consequently isolates the legitimate content in the network. In the past, several efforts have been made to propose the mitigation strategies for the content poisoning attack, but to the best of our knowledge, no specific work has been done to address an emerging attack-surface in NDN, which we call an interest flooding attack. Handling this attack-surface can potentially make content poisoning attack mitigation schemes more effective, secure, and robust. Hence, in this article, we propose the addition of a security mechanism in the CPA mitigation scheme that is, Name-Key Based Forwarding and Multipath Forwarding Based Inband Probe, in which we block the malicious face of compromised consumers by monitoring the Cache-Miss Ratio values and the Queue Capacity at the Edge Routers. The malicious face is blocked when the cache-miss ratio hits the threshold value, which is adjusted dynamically through monitoring the cache-miss ratio and queue capacity values. The experimental results show that we are successful in mitigating the vulnerability of the CPA mitigation scheme by detecting and blocking the flooding interface, at the cost of very little verification overhead at the NDN Routers.
18
Duong, Chi Thang, Trung Dung Hoang, Hongzhi Yin, Matthias Weidlich, Quoc Viet Hung Nguyen e Karl Aberer. "Efficient streaming subgraph isomorphism with graph neural networks". Proceedings of the VLDB Endowment 14, n. 5 (gennaio 2021): 730–42. http://dx.doi.org/10.14778/3446095.3446097.
Testo completoAbstract (sommario):
Queries to detect isomorphic subgraphs are important in graph-based data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do not scale to a dynamic setting of a continuous stream of queries. In this paper, we address the scalability challenges induced by a stream of subgraph isomorphism queries by caching and re-use of previous results. We first present a novel subgraph index based on graph embeddings that serves as the foundation for efficient stream processing. It enables not only effective caching and re-use of results, but also speeds-up traditional algorithms for subgraph isomorphism in case of cache misses. Moreover, we propose cache management policies that incorporate notions of reusability of query results. Experiments using real-world datasets demonstrate the effectiveness of our approach in handling isomorphic subgraph search for streams of queries.
19
WEI, ZuKuan, Bo HONG e JaeHong KIM. "A New Memory MapReduce Framework for Higher Access to Resources". Indonesian Journal of Electrical Engineering and Computer Science 4, n. 3 (18 dicembre 2016): 629. http://dx.doi.org/10.11591/ijeecs.v4.i3.pp629-636.
Testo completoAbstract (sommario):
The demand for highly parallel data processing platform was growing due to an explosion in the number of massive-scale data applications both in academia and industry. MapReduce was one of the most meaningful solutions to deal with big data distributed computing, This paper was based on the work of Hadoop MapReduce. In the face of massive data computing and calculation process, MapReduce generated a lot of dynamic data, but these data were discarded after the task completed. Meanwhile, a large number of dynamic data were written to HDFS during task execution, caused much unnecessary IO cost. In this paper, we analyzed existing distributed caching mechanism and proposed a new Memory MapReduce framework that has a real-time response to read or write request from task nodes, maintain related information about cache data. After performance testing, we could clearly find MapReduce with cache significantly improved in IO performance.
20
Yovita, Leanna Vidya, Nana Rachmana Syambas, Ian Joseph Matheus Edward e Noriaki Kamiyama. "Performance Analysis of Cache Based on Popularity and Class in Named Data Network". Future Internet 12, n. 12 (9 dicembre 2020): 227. http://dx.doi.org/10.3390/fi12120227.
Testo completoAbstract (sommario):
The communication network is growing with some unique characteristics, such as consumers repeatedly request the same content to the server, similarity in local demand trend, and dynamic changes to requests within a specific period. Therefore, a different network paradigm is needed to replace the IP network, namely Named Data Network (NDN). The content store, which acts as a crucial component in the NDN nodes is a limited resource. In addition, a cache mechanism is needed to optimize the router’s content store by exploiting the different content services characters in the network. This paper proposes a new caching algorithm called Cache Based on Popularity and Class (CAPIC) with dynamic mechanism, and the detail explanation about the static method also presented. The goal of Static-CAPIC was to enhance the total cache hit ratio on the network by pre-determining the cache proportion for each content class. However, this technique is not appropriate to control the cache hit ratio for priority class. Therefore, the Dynamic-CAPIC is used to provide flexibility to change the cache proportion based on the frequency of requests in real-time. The formula involves considering the consumers’ request all the time. It gives a higher cache hit ratio for the priority content class. This method outperforms Static-CAPIC, and the LCD+sharing scheme in the total network cache hit ratio parameter and channels it to the priority class.
21
STULOVA, NATALIIA, JOSÉ F. MORALES e MANUEL V. HERMENEGILDO. "Practical run-time checking via unobtrusive property caching". Theory and Practice of Logic Programming 15, n. 4-5 (luglio 2015): 726–41. http://dx.doi.org/10.1017/s1471068415000344.
Testo completoAbstract (sommario):
AbstractThe use of annotations, referred to as assertions or contracts, to describe program properties for which run-time tests are to be generated, has become frequent in dynamic programing languages. However, the frameworks proposed to support such run-time testing generally incur high time and/or space overheads over standard program execution. We present an approach for reducing this overhead that is based on the use of memoization to cache intermediate results of check evaluation, avoiding repeated checking of previously verified properties. Compared to approaches that reduce checking frequency, our proposal has the advantage of being exhaustive (i.e., all tests are checked at all points) while still being much more efficient than standard run-time checking. Compared to the limited previous work on memoization, it performs the task without requiring modifications to data structure representation or checking code. While the approach is general and system-independent, we present it for concreteness in the context of the Ciao run-time checking framework, which allows us to provide an operational semantics with checks and caching. We also report on a prototype implementation and provide some experimental results that support that using a relatively small cache leads to significant decreases in run-time checking overhead.
22
Rehman, Rana Asif, Jong Kim e Byung-Seo Kim. "NDN-CRAHNs: Named Data Networking for Cognitive Radio Ad Hoc Networks". Mobile Information Systems 2015 (2015): 1–12. http://dx.doi.org/10.1155/2015/281893.
Testo completoAbstract (sommario):
Named data networking (NDN) is a newly proposed paradigm for future Internet, in which communication among nodes is based on data names, decoupling from their locations. In dynamic and self-organized cognitive radio ad hoc networks (CRAHNs), it is difficult to maintain end-to-end connectivity between ad hoc nodes especially in the presence of licensed users and intermittent wireless channels. Moreover, IP-based CRAHNs have several issues like scalability, inefficient-mapping, poor resource utilization, and location dependence. By leveraging the advantages of NDN, in this paper, we propose a new cross layer fine-grained architecture called named data networking for cognitive radio ad hoc networks (NDN-CRAHNs). The proposed architecture provides distinct features such as in-networking caching, security, scalability, and multipath routing. The performances of the proposed scheme are evaluated comparing to IP-based scheme in terms of average end-to-end delay and packet delivery ratio. Simulation results show that the proposed scheme is effective in terms of average contents download time and packet delivery ratios comparing to conventional cognitive radio ad hoc networks.
23
Molisch, Andreas F., Giuseppe Caire, David Ott, Jeffrey R. Foerster, Dilip Bethanabhotla e Mingyue Ji. "Caching Eliminates the Wireless Bottleneck in Video Aware Wireless Networks". Advances in Electrical Engineering 2014 (30 novembre 2014): 1–13. http://dx.doi.org/10.1155/2014/261390.
Testo completoAbstract (sommario):
Wireless video is the main driver for rapid growth in cellular data traffic. Traditional methods for network capacity increase are very costly and do not exploit the unique features of video, especially asynchronous content reuse. In this paper we give an overview of our work that proposed and detailed a new transmission paradigm exploiting content reuse and the widespread availability of low-cost storage. Our network structure uses caching in helper stations (femtocaching) and/or devices, combined with highly spectrally efficient short-range communications to deliver video files. For femtocaching, we develop optimum storage schemes and dynamic streaming policies that optimize video quality. For caching on devices, combined with device-to-device (D2D) communications, we show that communications within clusters of mobile stations should be used; the cluster size can be adjusted to optimize the tradeoff between frequency reuse and the probability that a device finds a desired file cached by another device in the same cluster. In many situations the network throughput increases linearly with the number of users, and the tradeoff between throughput and outage is better than in traditional base-station centric systems. Simulation results with realistic numbers of users and channel conditions show that network throughput can be increased by two orders of magnitude compared to conventional schemes.
24
PERLIN, MARK W. "VISUALIZING DYNAMIC ARTIFICIAL INTELLIGENCE ALGORITHMS AND APPLICATIONS". International Journal on Artificial Intelligence Tools 03, n. 02 (giugno 1994): 289–307. http://dx.doi.org/10.1142/s0218213094000145.
Testo completoAbstract (sommario):
Visualization is an important component of modern computing. By animating the course of an algorithm’s temporal execution, many key features can be elucidated. We have developed a general framework, termed Call-Graph Caching (CGC), for automating the construction of many complex AI algorithms. By incorporating visualization into CGC interpreters, principled animations can be automatically displayed as AI computations unfold. (1) Systems that support the automatic animation of AI algorithms must address these three design issues: (2) How to represent AI data structures in a general, uniform way that leads to perspicuous animation and efficient redisplay. (3) How to coordinate the succession of graphical events. (4) How to partition AI graphs to provide for separate, uncluttered displays. CGC provides a natural and effective solution to all these concerns. (5) We describe the CGC method, including detailed examples, and motivate why CGC works well for animation. We discuss the CACHE system, our CGC environment for AI algorithm animation. We demonstrate the animation of several AI algorithms – RETE match, linear unification, arc consistency, chart parsing, and truth maintenance – all of which have been implemented in CACHE. Finally, we discuss the application of these methods to interactive interfaces for intelligent systems, using molecular genetics as an example domain.
25
Mansour, Dima, Haidar Osman e Christian Tschudin. "Load Balancing in the Presence of Services in Named-Data Networking". Journal of Network and Systems Management 28, n. 2 (21 dicembre 2019): 298–339. http://dx.doi.org/10.1007/s10922-019-09507-x.
Testo completoAbstract (sommario):
AbstractLoad balancing is a mechanism to distribute client requests among several service instances. It enables resource utilization, lowers response time, and increases user satisfaction. In Named-Data Networking (NDN) and NDN-like architectures, load balancing becomes crucial when dynamic services are present, where relying solely on forwarding strategies can overload certain service instances while others are underutilized especially with the limited benefit of on-path caching when it comes to services. To understand the challenges and opportunities of load balancing in NDN, we analyze conventional load balancing in IP networks, and three closely related fields in NDN: congestion control, forwarding strategies, and data center management. We identify three possible scenarios for load balancing in NDN: facade load balancer, controller for Interest queues, and router-based load balancing. These different solutions use different metrics to identify the load on replicas, have different compliance levels with NDN, and place the load balancing functionality in different network components. From our findings, we propose and implement a new lightweight router-based load balancing approach called the communicating vessels and experimentally show how it reduces service response time and senses server capabilities without probing.
26
Cerny, Tomas, Miroslav Macik, Michael Donahoo e Jan Janousek. "On distributed concern delivery in user interface design". Computer Science and Information Systems 12, n. 2 (2015): 655–81. http://dx.doi.org/10.2298/csis141202021c.
Testo completoAbstract (sommario):
Increasing demands on user interface (UI) usability, adaptability, and dynamic behavior drives ever-growing development and maintenance complexity. Traditional UI design techniques result in complex descriptions for data presentations with significant information restatement. In addition, multiple concerns in UI development leads to descriptions that exhibit concern tangling, which results in high fragment replication. Concern-separating approaches address these issues; however, they fail to maintain the separation of concerns for execution tasks like rendering or UI delivery to clients. During the rendering process at the server side, the separation collapses into entangled concerns that are provided to clients. Such client-side entanglement may seem inconsequential since the clients are simply displaying what is sent to them; however, such entanglement compromises client performance as it results in problems such as replication, fragment granularity ill-suited for effective caching, etc. This paper considers advantages brought by concern-separation from both perspectives. It proposes extension to the aspect-oriented UI design with distributed concern delivery (DCD) for client-server applications. Such an extension lessens the serverside involvement in UI assembly and reduces the fragment replication in provided UI descriptions. The server provides clients with individual UI concerns, and they become partially responsible for the UI assembly. This change increases client-side concern reuse and extends caching opportunities, reducing the volume of transmitted information between client and server to improve UI responsiveness and performance. The underlying aspect-oriented UI design automates the server-side derivation of concerns related to data presentations adapted to runtime context, security, conditions, etc. Evaluation of the approach is considered in a case study applying DCD to an existing, production web application. Our results demonstrate decreased volumes of UI descriptions assembled by the server-side and extended client-side caching abilities, reducing required data/fragment transmission, which improves UI responsiveness. Furthermore, we evaluate the potential benefits of DCD integration implications in selected UI frameworks.
27
Li, Wen-Syan, Oliver Po, Wang-Pin Hsiung, K. Selçuk Candan e Divyakant Agrawal. "Corrigendum to: “Freshness-driven adaptive caching for dynamic content web sites” [Data & Knowledge Engineering 47 (2) (2003) 269–296]". Data & Knowledge Engineering 47, n. 2 (novembre 2003): 297. http://dx.doi.org/10.1016/s0169-023x(03)00110-1.
Testo completo
28
Heirman, Wim, Stijn Eyerman, Kristof Du Bois e Ibrahim Hur. "Automatic Sublining for Efficient Sparse Memory Accesses". ACM Transactions on Architecture and Code Optimization 18, n. 3 (giugno 2021): 1–23. http://dx.doi.org/10.1145/3452141.
Testo completoAbstract (sommario):
Sparse memory accesses, which are scattered accesses to single elements of a large data structure, are a challenge for current processor architectures. Their lack of spatial and temporal locality and their irregularity makes caches and traditional stream prefetchers useless. Furthermore, performing standard caching and prefetching on sparse accesses wastes precious memory bandwidth and thrashes caches, deteriorating performance for regular accesses. Bypassing prefetchers and caches for sparse accesses, and fetching only a single element (e.g., 8 B) from main memory (subline access), can solve these issues. Deciding which accesses to handle as sparse accesses and which as regular cached accesses, is a challenging task, with a large potential impact on performance. Not only is performance reduced by treating sparse accesses as regular accesses, not caching accesses that do have locality also negatively impacts performance by significantly increasing their latency and bandwidth consumption. Furthermore, this decision depends on the dynamic environment, such as input set characteristics and system load, making a static decision by the programmer or compiler suboptimal. We propose the Instruction Spatial Locality Estimator ( ISLE ), a hardware detector that finds instructions that access isolated words in a sea of unused data. These sparse accesses are dynamically converted into uncached subline accesses, while keeping regular accesses cached. ISLE does not require modifying source code or binaries, and adapts automatically to a changing environment (input data, available bandwidth, etc.). We apply ISLE to a graph analytics processor running sparse graph workloads, and show that ISLE outperforms the performance of no subline accesses, manual sublining, and prior work on detecting sparse accesses.
29
Wu, Qing Xiang, Jian Mei Shuai e Xiao Shuang Lu. "A Multi-Node Co-Allocation Parallel Downloading Algorithm". Applied Mechanics and Materials 58-60 (giugno 2011): 1590–95. http://dx.doi.org/10.4028/www.scientific.net/amm.58-60.1590.
Testo completoAbstract (sommario):
In distributed data storage, a particular dataset can reside at multiple locations in order to get high availability .Thus, the dataset can be downloaded in parallel from multiple nodes.Throughput between server and client changes dynamically, so the downloading speed can vary unpredictably. A dynamic parallel downloading algorithm based on measurement of bandwidth and bandwidth prediction is produced in this paper and server caching is adopted in order to improve downloading speed. The algorithm dynamically adjusts downloading of the last block to make parallel downloading from multiple servers end almost simultaneously. With this approach, the download time is reduced and the robustness of the downloading system is improved. Besides, the algorithm not only avoids complicated server selecting mechanism, but also improves load balance of the servers.
30
Gameiro, Luís, Carlos Senna e Miguel Luís. "ndnIoT-FC: IoT Devices as First-Class Traffic in Name Data Networks". Future Internet 12, n. 11 (21 novembre 2020): 207. http://dx.doi.org/10.3390/fi12110207.
Testo completoAbstract (sommario):
In recent years we have been assisting a radical change in the way devices are connected to the Internet. In this new scope, the traditional TCP/IP host-centric network fails in large-scale mobile wireless distributed environments, such as IoT scenarios, due to node mobility, dynamic topologies and intermittent connectivity, and the Information-Centric Networking (ICN) paradigm has been considered the most promising candidate to overcome the drawbacks of host-centric architectures. Despite bringing efficient solutions for content distribution, the basic ICN operating principle, where content must always be associated with an interest, has serious restrictions in IoT environments in relation to scale, performance, and naming, among others. To address such drawbacks, we are presenting ndnIoT-FC, an NDN-based architecture that respects the ICN rules but offers special treatment for IoT traffic. It combines efficient hybrid naming with strategies to minimize the number of interests and uses caching strategies that virtually eliminates copies of IoT data from intermediate nodes. The ndnIoT-FC makes available new NDN-based application-to-application protocol to implement a signature model operation and tools to manage its life cycle, following a publisher-subscriber scheme. To demonstrate the versatility of the proposed architecture, we show the results of the efficient gathering of environmental information in a simulation environment considering different and distinct use cases.
31
Jiang, Hongxu, Shenglan Li, Huiyong Li, Tingshan Liu e Jinyuan Lu. "A High-Performance and Hardware-Efficient PCIe Transmission for a Multi-Channel Video Using Command Caching and Dynamic Splicing on FPGA". Journal of Circuits, Systems and Computers 27, n. 04 (6 dicembre 2017): 1850067. http://dx.doi.org/10.1142/s0218126618500676.
Testo completoAbstract (sommario):
With the increasing requirements of transmitting larger amounts of diverse video and image data, the PCI express (PCIe) interface has been extensively used in high-speed digital systems for multimedia processing and communication. However, the existing PCIe transmission methods are not efficient to transmit multi-channel videos on FPGA processors, as they waste PCIe bandwidth and hardware resources. In this paper, an efficient PCIe transmission method for multi-channel video is presented on an FPGA processor. First, to reduce the programmed I/O (PIO) write latency, the command caching method is adopted. The traditional DMA descriptors are transformed into DMA commands, which are smaller, and the command buffer is used to store these commands. Second, a dynamic splicing mechanism is proposed for data transmission and commands the scheduling separately. The multi-type data is transmitted concurrently in this dynamic splicing mechanism. Moreover, the adjacent commands are spliced into one command, which reduces the DMA initiation times. Finally, the direct kernel memory access technique and timer self-feedback monitor technique are applied to improve the transmission efficiency and enhance the system reliability. The experimental results show that the transmission efficiency of the proposed method is increased by nearly 30% compared with other conventional methods, and the highest measured transfer rate is 1631 Mbytes/s on write and 1582 Mbytes/s on read, which reaches 84.4% of the theoretical maximum.
32
Li, Xiao Feng, Peng Fan, Xiao Hua Liu, Xing Chao Wang, Chuan Hu, Chun Xiang Liu e Shi Guang Bie. "Parallel Rendering Strategies for 3D Emulational Scene of Live Working". Applied Mechanics and Materials 457-458 (ottobre 2013): 1021–27. http://dx.doi.org/10.4028/www.scientific.net/amm.457-458.1021.
Testo completoAbstract (sommario):
Because of abundant deep scene nodes in 3D emulational scene of live working, the existing three-dimensional scene data organization methods and rendering strategies have many flaws, such as the jumping of rendering and the delay of interactive response. A real-time rendering method for huge amount of urban data was presented utilizing the techniques such as identifying model that is based on multi-grid block partition, thread pool, caching and real time external memory scheduling algorithms. The whole scene was partitioned into blocks of different size and the blocks were arranged with multi-grid which is related to model ID and tile ID to accelerate model scheduling. Fast clipping was achieved through the nailing of position and direction of block-based view frustum, and touching task of data downloading off into thread pool executed in background which achieve the dynamic data loading and parallelism of three-dimensional scene rendering. To solve the choke point at computer hardware, in-out memory scheduling algorithms are adopted to eliminate invisible scene models and recycle dirty data in memory. Experimental results showed that the method is very efficient and suitable for applications in massive urban models rendering and interactive walkthrough.
33
Tang, Jing Fan, Pei Zhang, Min Zhang e Ming Jiang. "Distributed Potential Field Based Routing with Priority Connection Probability for NDN". Applied Mechanics and Materials 667 (ottobre 2014): 133–42. http://dx.doi.org/10.4028/www.scientific.net/amm.667.133.
Testo completoAbstract (sommario):
One challenge to the retrieval process of Named Data Network (NDN) is to take advantage of largely distributed copies in in-network caches. Potential based routing (PBR) uses a potential field defined in the network to facilitate routing data packet towards a desired location is an effective solution. But due to the characteristics of “Volatilize and Dynamic Update” on caches, there exist problems of high request failure rate and transmission delay in real applications. This paper proposes a novel distributed PBR scheme with prioritized connection probability of the nodes calculated by the popularity and similarity. It mapped the nodes into a hyperbolic plane according to the sequence of the caching time, and utilized radial coordinates and angular coordinates to represent the popularity and similarity, which will be used for the function of Fermi-Dirac distribution to calculate connection probability. The connection probability will be prioritized as the weight of the nodes for construction of potential fields. The simulation results show that our proposed scheme can not only significantly improves cache hit and utilization ratio, but also effectively controls network delay and overhead.
34
Shashidhara, D. N., D. N. Chandrappa e C. Puttamadappa. "An Efficient Content Prefetching Method for Cloud Based Mobile Adhoc Network". Journal of Computational and Theoretical Nanoscience 17, n. 9 (1 luglio 2020): 4162–66. http://dx.doi.org/10.1166/jctn.2020.9038.
Testo completoAbstract (sommario):
Recently, Mobile Ad-hoc Networks (MANETs) has emerged as a very important research area for provisioning service for remote client through internet, cloud computing, and cellular network. This work focusses on improving image access in MANET. Various method has been present recently for reducing data access and reduce query latency. Number challenges need to addressed such as caching, content prefetching, shared access environment, dynamic high speed node mobility environment etc. As mobile adhoc network is growing rapidly for the possessions of its capability in forming provisional network without the requirement of any predefined infrastructure, improving throughput (i.e., access rate), reducing bit error rate (BER) (i.e., query latency) has been a major concern and requirement in mobile adhoc network. This work aimed at building an efficient content prefetching technique of geographically distributed data for enhancing the access rate and reduce query latency. Along with, our model can minimize processing time and cost for carrying content prefetching operation. Experiment result shows the proposed content prefetching method improves bit error rate (BER) and throughput performance.
35
Denko, Mieso K., e Hua Lu. "Replica Dissemination and Update Strategies in Cluster-Based Mobile Ad Hoc Networks". Mobile Information Systems 2, n. 4 (2006): 193–209. http://dx.doi.org/10.1155/2006/514842.
Testo completoAbstract (sommario):
A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that forms a temporary network without the aid of a fixed communication infrastructure. Since every node can be mobile and network topology changes can occur frequently, node disconnection is a common mode of operation in MANETs. Providing reliable data access and message delivery is a challenge in this dynamic network environment. Caching and replica allocation within the network can improve data accessibility by storing the data and accessing them locally. However, maintaining data consistency among replicas becomes a challenging problem. Hence, balancing data accessibility and consistency is an important step toward data management in MANETs. In this paper, we propose a replica-based data-storage mechanism and undelivered-message queue schemes to provide reliable data storage and dissemination. We also propose replica update strategies to maintain data consistency while improving data accessibility. These solutions are based on a clustered MANET where nodes in the network are divided into small groups that are suitable for localized data management. The goal is to reduce communication overhead, support localized computation, and enhance scalability. A simulation environment was built using an NS-2 network simulator to evaluate the performance of the proposed schemes. The results show that our schemes distribute replicas effectively, provide high data accessibility rates and maintain consistency.
36
Buzura, Sorin, Bogdan Iancu, Vasile Dadarlat, Adrian Peculea e Emil Cebuc. "Optimizations for Energy Efficiency in Software-Defined Wireless Sensor Networks". Sensors 20, n. 17 (24 agosto 2020): 4779. http://dx.doi.org/10.3390/s20174779.
Testo completoAbstract (sommario):
Software-defined wireless sensor networking (SDWSN) is an emerging networking architecture which is envisioned to become the main enabler for the internet of things (IoT). In this architecture, the sensors plane is managed by a control plane. With this separation, the network management is facilitated, and performance is improved in dynamic environments. One of the main issues a sensor environment is facing is the limited lifetime of network devices influenced by high levels of energy consumption. The current work proposes a system design which aims to improve the energy efficiency in an SDWSN by combining the concepts of content awareness and adaptive data broadcast. The purpose is to increase the sensors’ lifespan by reducing the number of generated data packets in the resource-constrained sensors plane of the network. The system has a distributed management approach, with content awareness being implemented at the individual programmable sensor level and the adaptive data broadcast being performed in the control plane. Several simulations were run on historical weather and the results show a significant decrease in network traffic. Compared to similar work in this area which focuses on improving energy efficiency with complex algorithms for routing, clustering, or caching, the current proposal employs simple computing procedures on each network device with a high impact on the overall network performance.
37
Rao T, Srinivasa, Harsha G, Kiran V e Hemanth Kumar K. "Dos flooding attack control in information-centric networks". International Journal of Engineering & Technology 7, n. 1.1 (21 dicembre 2017): 303. http://dx.doi.org/10.14419/ijet.v7i1.1.9708.
Testo completoAbstract (sommario):
ICN (Information-centric networking) is a modern networking standard that mainly works only on the content extraction from a network without taking into case about the storage location or how the content is represented. In ICN providing security for the content is more important. Here we don’t concentrate on protecting path. In order to fulfil the security goals in the new standard, it is very decisive to have a clear complete comprehension about ICN attacks and their brief allocation and the solutions. In this paper we in brief explain the attacks which effect the ICN network and other related attacks which have an impact on ICN. Attacks in ICN are divided to four categories, routing attacks, Naming attacks, Caching attacks, and other various related attacks. There are lot of solutions which are accessible. The main moto in ICN is to protect data which is very hard to achieve. So we develop a dynamic host based IP address scheme including certain snort rules which detect attacker and distinguish them in the clients and secure server from resource exhaustion. Our main center we deal with is on availability, and privacy.
38
Eiter, Thomas, Ryutaro Ichise, Josiane Xavier Parreira, Patrik Schneider e Lihua Zhao. "Deploying spatial-stream query answering in C-ITS scenarios1". Semantic Web 12, n. 1 (19 novembre 2020): 41–77. http://dx.doi.org/10.3233/sw-200408.
Testo completoAbstract (sommario):
Cooperative Intelligent Transport Systems (C-ITS) play an important role for providing the means to collect and exchange spatio-temporal data via V2X-based communication between vehicles and the infrastructure, which will become a central enabler for road safety of (semi)-autonomous vehicles. The Local Dynamic Map (LDM) is a key concept for integrating static and streamed data in a spatial context. The LDM has been semantically enhanced to allow for an elaborate domain model that is captured by a mobility ontology, and for queries over data streams that cater for semantic concepts and spatial relationships. Our approach for semantic enhancement is in the context of ontology-mediated query answering (OQA) and features conjunctive queries over DL-LiteA ontologies that support window operators over streams and spatial relations between spatial objects. In this paper, we show how this approach can be extended to address a wider range of use cases in the three C-ITS scenarios traffic statistics, traffic events detection, and advanced driving assistance systems. We define for the mentioned use cases requirements derived from necessary domain-specific features and report, based on them, on extensions of our query language and ontology model. The extensions include temporal relations, numeric predictions and trajectory predictions as well as optimization strategies such as caching. An experimental evaluation of queries that reflect the requirements has been conducted using the real-world traffic simulation tool PTV Vissim. It provides evidence for the feasibility/efficiency of our approach in the new scenarios.
39
Ioannidis, Sotiris, Umit Rencuzogullari, Robert Stets e Sandhya Dwarkadas. "CRAUL: Compiler and Run-Time Integration for Adaptation under Load". Scientific Programming 7, n. 3-4 (1999): 261–73. http://dx.doi.org/10.1155/1999/603478.
Testo completoAbstract (sommario):
Clusters of workstations provide a cost‐effective, high performance parallel computing environment. These environments, however, are often shared by multiple users, or may consist of heterogeneous machines. As a result, parallel applications executing in these environments must operate despite unequal computational resources. For maximum performance, applications should automatically adapt execution to maximize use of the available resources. Ideally, this adaptation should be transparent to the application programmer. In this paper, we present CRAUL (Compiler and Run‐Time Integration for Adaptation Under Load), a system that dynamically balances computational load in a parallel application. Our target run‐time is software‐based distributed shared memory (SDSM). SDSM is a good target for parallelizing compilers since it reduces compile‐time complexity by providing data caching and other support for dynamic load balancing. CRAUL combines compile‐time support to identify data access patterns with a run‐time system that uses the access information to intelligently distribute the parallel workload in loop‐based programs. The distribution is chosen according to the relative power of the processors and so as to minimize SDSM overhead and maximize locality. We have evaluated the resulting load distribution in the presence of different types of load – computational, computational and memory intensive, and network load. CRAUL performs within 5–23% of ideal in the presence of load, and is able to improve on naive compiler‐based work distribution that does not take locality into account even in the absence of load.
40
Yan, Li, e Yan Sheng Qu. "Research on Caching Mechanism Based on User Community". Applied Mechanics and Materials 672-674 (ottobre 2014): 2013–16. http://dx.doi.org/10.4028/www.scientific.net/amm.672-674.2013.
Testo completoAbstract (sommario):
This paper produced a data caching system framework based on two-layer Chord. Caching is shared by users in domain and hot accessing information is shared by inter-domain users. It effectively reduces the caching system’s overhead. We also introduced cache replacement algorithm based on the user community, especially the user’s influence in the community and the information flow dynamics. The result of simulation and experiment of test-bed environment shows the caching scheme based on user community outperforms most existing distributed caching schemes.
41
Yuan, Peiyan, Xiaoxiao Pang e Xiaoyan Zhao. "Influence of Crowd Participation Features on Mobile Edge Computing". Future Internet 10, n. 10 (25 settembre 2018): 94. http://dx.doi.org/10.3390/fi10100094.
Testo completoAbstract (sommario):
Mobile edge computing is a new communication paradigm, which stores content close to the end users, so as to reduce the backhaul delay and alleviate the traffic load of the backbone networks. Crowd participation is one of the most striking features of this technology, and it enables numerous interesting applications. The dynamics of crowd participation offer unprecedented opportunities for both content caching and data forwarding. In this paper, we investigate the influence of the dynamics of crowd participation, from the perspective of opportunistic caching and forwarding, and discuss how we can exploit such opportunities to allocate content and select relays efficiently. Some existing issues in this emerging research area are also discussed.
42
Wei, Xingda, Rong Chen, Haibo Chen e Binyu Zang. "XStore : Fast RDMA-Based Ordered Key-Value Store Using Remote Learned Cache". ACM Transactions on Storage 17, n. 3 (31 agosto 2021): 1–32. http://dx.doi.org/10.1145/3468520.
Testo completoAbstract (sommario):
RDMA ( Remote Direct Memory Access ) has gained considerable interests in network-attached in-memory key-value stores. However, traversing the remote tree-based index in ordered key-value stores with RDMA becomes a critical obstacle, causing an order-of-magnitude slowdown and limited scalability due to multiple round trips. Using index cache with conventional wisdom—caching partial data and traversing them locally—usually leads to limited effect because of unavoidable capacity misses, massive random accesses, and costly cache invalidations. We argue that the machine learning (ML) model is a perfect cache structure for the tree-based index, termed learned cache . Based on it, we design and implement XStore , an RDMA-based ordered key-value store with a new hybrid architecture that retains a tree-based index at the server to perform dynamic workloads (e.g., inserts) and leverages a learned cache at the client to perform static workloads (e.g., gets and scans). The key idea is to decouple ML model retraining from index updating by maintaining a layer of indirection from logical to actual positions of key-value pairs. It allows a stale learned cache to continue predicting a correct position for a lookup key. XStore ensures correctness using a validation mechanism with a fallback path and further uses speculative execution to minimize the cost of cache misses. Evaluations with YCSB benchmarks and production workloads show that a single XStore server can achieve over 80 million read-only requests per second. This number outperforms state-of-the-art RDMA-based ordered key-value stores (namely, DrTM-Tree, Cell, and eRPC+Masstree) by up to 5.9× (from 3.7×). For workloads with inserts, XStore still provides up to 3.5× (from 2.7×) throughput speedup, achieving 53M reqs/s. The learned cache can also reduce client-side memory usage and further provides an efficient memory-performance tradeoff, e.g., saving 99% memory at the cost of 20% peak throughput.
43
Teurlings, Ivonne J. M., John Odden, John D. C. Linnell e Claudia Melis. "Caching Behavior of Large Prey by Eurasian Lynx: Quantifying the Anti-Scavenging Benefits". Diversity 12, n. 9 (13 settembre 2020): 350. http://dx.doi.org/10.3390/d12090350.
Testo completoAbstract (sommario):
Large solitary felids often kill large prey items that can provide multiple meals. However, being able to utilize these multiple meals requires that they can cache the meat in a manner that delays its discovery by vertebrate and invertebrate scavengers. Covering the kill with vegetation and snow is a commonly observed strategy among felids. This study investigates the utility of this strategy using observational data from Eurasian lynx (Lynx lynx)-killed roe deer (Capreolus capreolus) carcasses, and a set of two experiments focused on vertebrate and invertebrate scavengers, respectively. Lynx-killed roe deer that were covered by snow or vegetation were less likely to have been visited by scavengers. Experimentally-deployed video-monitored roe deer carcasses had significantly longer time prior to discovery by avian scavengers when covered with vegetation. Carcass parts placed in cages that excluded vertebrate scavengers had delayed invertebrate activity when covered with vegetation. All three datasets indicated that covering a kill was a successful caching/anti-scavenger strategy. These results can help explain why lynx functional responses reach plateaus at relatively low kill rates. The success of this anti-scavenging behavior therefore has clear effects on the dynamics of a predator–prey system.
44
"Energy-efficient Delay-aware and Profit Maximization Caching enabled, Congestion Control in Stochastic Network". International Journal of Engineering and Advanced Technology 8, n. 6 (30 agosto 2019): 4266–74. http://dx.doi.org/10.35940/ijeat.f9127.088619.
Testo completoAbstract (sommario):
We are presenting a new unified structure for dynamic distributed forwarding and congestion-controlled network caching enabled. Improved use of data transfer capacity and storage resources in Stochastic networks in aspects of energy-efficient and profit-maximization. In the investigation of stochastic networks, a framework has been developed for combined implementation of caching, forwarding and traffic command called the Markov Decision Process in Stochastic Learning (MDPSL) strategy. The MDPSL structure uses a virtual plane that manages customer request prices, as well as a real plane that processes actual interest packets and data packets. It can accomplish dynamically structured transmission and caching. It can fulfill dynamically distributed forwarding and caching. Focus on MDPSL communication and queuing systems, including wireless networks with time-varying channels, mobility, and arrival of random traffic. Using this framework, estimates of the time are optimized such as throughput, utility throughput, energy, and distortion. Explicit performance-delay tradeoffs are provided to show the expense of attaining optimality. A congestion control algorithm is intended to improve client services subject to network stability when optimally coupled with forwarding and caching algorithms
45
Brabrand, Claus, Anders Møller, Steffan Olesen e Michael I. Schwartzbach. "Language-Based Caching of Dynamically Generated HTML". BRICS Report Series 8, n. 17 (17 maggio 2001). http://dx.doi.org/10.7146/brics.v8i17.20474.
Testo completoAbstract (sommario):
<p>Increasingly, HTML documents are dynamically generated by interactive Web<br />services. To ensure that the client is presented with the newest versions of such<br />documents it is customary to disable client caching causing a seemingly inevitable performance penalty. In the <bigwig> system, dynamic HTML documents are composed of higher-order templates that are plugged together to construct complete documents. We show how to exploit this feature to provide an automatic fine-grained caching of document templates, based on the service source code. A <bigwig> service transmits not the full HTML document but instead a compact JavaScript recipe for a client-side construction of the document based on a static collection of fragments that can be cached by the browser in the usual manner. We compare our approach with related techniques and demonstrate on a number of realistic benchmarks that the size of the transmitted data and the latency may be reduced significantly.</p>
46
"Rate Based Congestion Control for Wireless Links in Information Centric Network". International Journal of Engineering and Advanced Technology 9, n. 1S3 (31 dicembre 2019): 1–5. http://dx.doi.org/10.35940/ijeat.a1001.1291s319.
Testo completoAbstract (sommario):
Information-centric networking (ICN) is the prominent network architecture with the features of name based forwarding and in-network caching. These features enables ICN to provide solutions to all demands of the emerging networks. Among the proposed hop by hop congestion control schemes in ICN, almost all schemes assume the available link capacity as known and fixed which is not true for wireless links. Here we propose dynamic link capacity estimation for wireless links using kalman filter and each node maintains the data rate value estimated. Consumer forwards interest with initial data rate, each hop updates estimated data rate in outgoing data packets proactively, then consumer adjusts the data rate according to new value received.
47
"Efficient Lookup Solutions for Named Data Networks". International Journal of Innovative Technology and Exploring Engineering 9, n. 2S (14 dicembre 2019): 621–26. http://dx.doi.org/10.35940/ijitee.b1097.1292s19.
Testo completoAbstract (sommario):
Named Data Networking (NDN) is afast growing architecture, which is proposed as an alternative to existing IP. NDN allows users to request the data identified by a unique name without any information of the hosting entity. NDN supports in-network caching of contents, multi-path forwarding, and data security. In NDN, packet-forwarding decisions are driven by lookup operations on content name of the NDN packets. An NDN node maintains set of routing tables that aid in forwarding decisions. Forwarding the NDN packets depend on lookup of these NDN tables and performing Longest Prefix Matching (LPM) against these NDN tables. The NDN names are unbounded and of variable length. These features along with large and dynamic NDN tables pose several challenges that include increased memory requirement and delayed lookup operations. To this end, there is a need for an efficient data structure that support fast lookup operations with low memory overhead. Several lookup techniques are proposed in this direction. Traversing trie structures would be slow since every level of trie require a memory access. Hash tables incur additional hash computations on names and suffer from collisions. Bloom filters suffer from false positives and do not support deletions. Improving the performance of these structures can lead to a better lookup solution.This survey paper explores different lookup structures for NDN networks. Performance is measured with respect to lookup rate and memory efficiency.
48
GOUSE, SHAIK MOHAMMED, e G. PRAKASH BABU. "PRICE DEMAND MODEL FOR A CLOUD CACHE". International Journal of Computer and Communication Technology, ottobre 2010, 246–49. http://dx.doi.org/10.47893/ijcct.2012.1150.
Testo completoAbstract (sommario):
Cloud applications that offer data management services are emerging. Such clouds support caching of data in order to provide quality query services. The users can query the cloud data, paying the price for the infrastructure they use. Cloud management necessitates an economy that manages the service of multiple users in an efficient, but also, resource economic way that allows for cloud profit. Naturally, the maximization of cloud profit given some guarantees for user satisfaction presumes an appropriate price-demand model that enables optimal pricing of query services. The model should be plausible in that it reflects the correlation of cache structures involved in the queries. Optimal pricing is achieved based on a dynamic pricing scheme that adapts to time changes. This paper proposes a novel price-demand model designed for a cloud cache and a dynamic pricing scheme for queries executed in the cloud cache. The pricing solution employs a novel method that estimates the correlations of the cache services in an time-efficient manner. The experimental study shows the efficiency of the solution.
49
"PLeveraging Django and Redis using Web Scraping". International Journal of Recent Technology and Engineering 9, n. 1 (30 maggio 2020): 2103–5. http://dx.doi.org/10.35940/ijrte.a1916.059120.
Testo completoAbstract (sommario):
Web scraping is also known as data scraping and it is used for extracting data from sites. The software used for this may directly access the World Wide Web by using the Hypertext Transfer Protocol or by using a web browser. Over the years, due to advancements in web development and its technology, various frameworks have come in use and almost all of websites are dynamic with their content being served from CMS. This makes it tough to extract data since there is no common template for extracting data. Hence, we use RSS. Rich Site Summary is a kind of timeline allowing users and also applications to gain access to the updates on websites in a standardized, computer-readable format. This project combines the use of RSS to extract data from websites and serve users in a robust and easy way. The differentiation is that this project uses server side caching to serve users almost instantaneously without the need to perform data extraction from the requested site all over again. This is done using Redis and Django.
50
Jain, Prateek, e Rupsha Bagchi. "SMART: A Secure Multipath Anonymous Routing Technique". International Journal of Smart Sensor and Adhoc Network., ottobre 2011, 117–22. http://dx.doi.org/10.47893/ijssan.2011.1034.
Testo completoAbstract (sommario):
Multipath routing for mobile Ad hoc networks is a technique of concurrent management and utilization of multiple paths for transmitting distributed data evenly across the nodes instead of routing all the traffic along a single path, potentially resulting in longer lifetime along with the benefits of better transmission performance, fault tolerance, increased bandwidth and improved security. In this paper, a secure multipath anonymous routing protocol (abbreviated as SMART) has been proposed. SMART uses non cryptographic ways to help the source find the routes to the destination and dynamic onion routing to intimate the source about these routes. It includes a mechanism of key caching and defines a minimum battery protection threshold for each node to help increase the network lifetime to some extent. In effect SMART is an attempt to strike a balance between the anonymity, security and energy consumption in a network.