To see the other types of publications on this topic, follow the link: Caching Dynamic Data.

Journal articles on the topic 'Caching Dynamic Data'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Caching Dynamic Data.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Park, Seongsoo, Minseop Jeong, and Hwansoo Han. "CCA: Cost-Capacity-Aware Caching for In-Memory Data Analytics Frameworks." Sensors 21, no. 7 (March 26, 2021): 2321. http://dx.doi.org/10.3390/s21072321.

Full text
Abstract:
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 c
APA, Harvard, Vancouver, ISO, and other styles
2

Kumar, Prashant, Naveen Chauhan, LK Awasthi, and Narottam Chand. "Enhancing Data Availability in MANETs with Cooperative Caching." International Journal of Mobile Computing and Multimedia Communications 3, no. 4 (October 2011): 53–66. http://dx.doi.org/10.4018/jmcmc.2011100104.

Full text
Abstract:
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++
APA, Harvard, Vancouver, ISO, and other styles
3

Yovita, Leanna Vidya, and Nana Rachmana Syambas. "Caching on Named Data Network: a Survey and Future Research." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 6 (December 1, 2018): 4456. http://dx.doi.org/10.11591/ijece.v8i6.pp4456-4466.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Xiaohui, Kehe Wu, and 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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
5

Raghunathan, A., and K. Murugesan. "Performance-Enhanced Caching Scheme for Web Clusters for Dynamic Content." International Journal of Business Data Communications and Networking 7, no. 3 (July 2011): 16–36. http://dx.doi.org/10.4018/jbdcn.2011070102.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
6

Kumar, Prashant, Naveen Chauhan, LK Awasthi, and Narottam Chand. "Cooperative Cache Replacement Policy for MANETs." International Journal of Advanced Pervasive and Ubiquitous Computing 6, no. 2 (April 2014): 36–47. http://dx.doi.org/10.4018/ijapuc.2014040103.

Full text
Abstract:
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 nod
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Ru, and Meiju Yu. "A caching strategy based on dynamic popularity for named data networking." International Journal of Information Technology and Management 19, no. 4 (2020): 305. http://dx.doi.org/10.1504/ijitm.2020.10028767.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yu, Meiju, and Ru Li. "A caching strategy based on dynamic popularity for named data networking." International Journal of Information Technology and Management 19, no. 4 (2020): 305. http://dx.doi.org/10.1504/ijitm.2020.110238.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Jinjiang, Yihua Lan, Jingjing Liang, Quanzhou Cheng, Chih-Cheng Hung, Chao Yin, and 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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
10

Ji, Jiequ, Kun Zhu, Ran Wang, Bing Chen, and 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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
11

Man, Dapeng, Yao Wang, Hanbo Wang, Jiafei Guo, Jiguang Lv, Shichang Xuan, and Wu Yang. "Information-Centric Networking Cache Placement Method Based on Cache Node Status and Location." Wireless Communications and Mobile Computing 2021 (September 14, 2021): 1–13. http://dx.doi.org/10.1155/2021/5648765.

Full text
Abstract:
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 basi
APA, Harvard, Vancouver, ISO, and other styles
12

Thanh, Pham Duy, Tran Nhut Khai Hoan, Hoang Thi Huong Giang, and Insoo Koo. "Cache-Enabled Data Rate Maximization for Solar-Powered UAV Communication Systems." Electronics 9, no. 11 (November 20, 2020): 1961. http://dx.doi.org/10.3390/electronics9111961.

Full text
Abstract:
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 mu
APA, Harvard, Vancouver, ISO, and other styles
13

Bhandari, Sovit, Navin Ranjan, Pervez Khan, Hoon Kim, and Youn-Sik Hong. "Deep Learning-Based Content Caching in the Fog Access Points." Electronics 10, no. 4 (February 22, 2021): 512. http://dx.doi.org/10.3390/electronics10040512.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
14

Shailesh, K. S., and Suresh Pachigolla Venkata. "Personalized Chunk Framework for High Performance Personalized Web." International Journal of Web Portals 9, no. 1 (January 2017): 52–63. http://dx.doi.org/10.4018/ijwp.2017010104.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
15

Vishnekov, A. V., and E. M. Ivanova. "DYNAMIC CONTROL METHODS OF CACHE LINES REPLACEMENT POLICY." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 191 (May 2020): 49–56. http://dx.doi.org/10.14489/vkit.2020.05.pp.049-056.

Full text
Abstract:
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, sequentia
APA, Harvard, Vancouver, ISO, and other styles
16

Vishnekov, A. V., and E. M. Ivanova. "DYNAMIC CONTROL METHODS OF CACHE LINES REPLACEMENT POLICY." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 191 (May 2020): 49–56. http://dx.doi.org/10.14489/vkit.2020.05.pp.049-056.

Full text
Abstract:
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, sequentia
APA, Harvard, Vancouver, ISO, and other styles
17

Qureshi, Adnan Mahmood, Nadeem Anjum, Rao Naveed Bin Rais, Masood Ur-Rehman, and Amir Qayyum. "Detection of malicious consumer interest packet with dynamic threshold values." PeerJ Computer Science 7 (March 17, 2021): e435. http://dx.doi.org/10.7717/peerj-cs.435.

Full text
Abstract:
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 consequent
APA, Harvard, Vancouver, ISO, and other styles
18

Duong, Chi Thang, Trung Dung Hoang, Hongzhi Yin, Matthias Weidlich, Quoc Viet Hung Nguyen, and Karl Aberer. "Efficient streaming subgraph isomorphism with graph neural networks." Proceedings of the VLDB Endowment 14, no. 5 (January 2021): 730–42. http://dx.doi.org/10.14778/3446095.3446097.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
19

WEI, ZuKuan, Bo HONG, and JaeHong KIM. "A New Memory MapReduce Framework for Higher Access to Resources." Indonesian Journal of Electrical Engineering and Computer Science 4, no. 3 (December 18, 2016): 629. http://dx.doi.org/10.11591/ijeecs.v4.i3.pp629-636.

Full text
Abstract:
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. I
APA, Harvard, Vancouver, ISO, and other styles
20

Yovita, Leanna Vidya, Nana Rachmana Syambas, Ian Joseph Matheus Edward, and Noriaki Kamiyama. "Performance Analysis of Cache Based on Popularity and Class in Named Data Network." Future Internet 12, no. 12 (December 9, 2020): 227. http://dx.doi.org/10.3390/fi12120227.

Full text
Abstract:
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 pr
APA, Harvard, Vancouver, ISO, and other styles
21

STULOVA, NATALIIA, JOSÉ F. MORALES, and MANUEL V. HERMENEGILDO. "Practical run-time checking via unobtrusive property caching." Theory and Practice of Logic Programming 15, no. 4-5 (July 2015): 726–41. http://dx.doi.org/10.1017/s1471068415000344.

Full text
Abstract:
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 fre
APA, Harvard, Vancouver, ISO, and other styles
22

Rehman, Rana Asif, Jong Kim, and 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.

Full text
Abstract:
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 ne
APA, Harvard, Vancouver, ISO, and other styles
23

Molisch, Andreas F., Giuseppe Caire, David Ott, Jeffrey R. Foerster, Dilip Bethanabhotla, and Mingyue Ji. "Caching Eliminates the Wireless Bottleneck in Video Aware Wireless Networks." Advances in Electrical Engineering 2014 (November 30, 2014): 1–13. http://dx.doi.org/10.1155/2014/261390.

Full text
Abstract:
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 femtocac
APA, Harvard, Vancouver, ISO, and other styles
24

PERLIN, MARK W. "VISUALIZING DYNAMIC ARTIFICIAL INTELLIGENCE ALGORITHMS AND APPLICATIONS." International Journal on Artificial Intelligence Tools 03, no. 02 (June 1994): 289–307. http://dx.doi.org/10.1142/s0218213094000145.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
25

Mansour, Dima, Haidar Osman, and Christian Tschudin. "Load Balancing in the Presence of Services in Named-Data Networking." Journal of Network and Systems Management 28, no. 2 (December 21, 2019): 298–339. http://dx.doi.org/10.1007/s10922-019-09507-x.

Full text
Abstract:
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 conv
APA, Harvard, Vancouver, ISO, and other styles
26

Cerny, Tomas, Miroslav Macik, Michael Donahoo, and Jan Janousek. "On distributed concern delivery in user interface design." Computer Science and Information Systems 12, no. 2 (2015): 655–81. http://dx.doi.org/10.2298/csis141202021c.

Full text
Abstract:
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. Durin
APA, Harvard, Vancouver, ISO, and other styles
27

Li, Wen-Syan, Oliver Po, Wang-Pin Hsiung, K. Selçuk Candan, and 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, no. 2 (November 2003): 297. http://dx.doi.org/10.1016/s0169-023x(03)00110-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Heirman, Wim, Stijn Eyerman, Kristof Du Bois, and Ibrahim Hur. "Automatic Sublining for Efficient Sparse Memory Accesses." ACM Transactions on Architecture and Code Optimization 18, no. 3 (June 2021): 1–23. http://dx.doi.org/10.1145/3452141.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
29

Wu, Qing Xiang, Jian Mei Shuai, and Xiao Shuang Lu. "A Multi-Node Co-Allocation Parallel Downloading Algorithm." Applied Mechanics and Materials 58-60 (June 2011): 1590–95. http://dx.doi.org/10.4028/www.scientific.net/amm.58-60.1590.

Full text
Abstract:
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 serve
APA, Harvard, Vancouver, ISO, and other styles
30

Gameiro, Luís, Carlos Senna, and Miguel Luís. "ndnIoT-FC: IoT Devices as First-Class Traffic in Name Data Networks." Future Internet 12, no. 11 (November 21, 2020): 207. http://dx.doi.org/10.3390/fi12110207.

Full text
Abstract:
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 m
APA, Harvard, Vancouver, ISO, and other styles
31

Jiang, Hongxu, Shenglan Li, Huiyong Li, Tingshan Liu, and 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, no. 04 (December 6, 2017): 1850067. http://dx.doi.org/10.1142/s0218126618500676.

Full text
Abstract:
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 i
APA, Harvard, Vancouver, ISO, and other styles
32

Li, Xiao Feng, Peng Fan, Xiao Hua Liu, Xing Chao Wang, Chuan Hu, Chun Xiang Liu, and Shi Guang Bie. "Parallel Rendering Strategies for 3D Emulational Scene of Live Working." Applied Mechanics and Materials 457-458 (October 2013): 1021–27. http://dx.doi.org/10.4028/www.scientific.net/amm.457-458.1021.

Full text
Abstract:
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-
APA, Harvard, Vancouver, ISO, and other styles
33

Tang, Jing Fan, Pei Zhang, Min Zhang, and Ming Jiang. "Distributed Potential Field Based Routing with Priority Connection Probability for NDN." Applied Mechanics and Materials 667 (October 2014): 133–42. http://dx.doi.org/10.4028/www.scientific.net/amm.667.133.

Full text
Abstract:
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 pop
APA, Harvard, Vancouver, ISO, and other styles
34

Shashidhara, D. N., D. N. Chandrappa, and C. Puttamadappa. "An Efficient Content Prefetching Method for Cloud Based Mobile Adhoc Network." Journal of Computational and Theoretical Nanoscience 17, no. 9 (July 1, 2020): 4162–66. http://dx.doi.org/10.1166/jctn.2020.9038.

Full text
Abstract:
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 wi
APA, Harvard, Vancouver, ISO, and other styles
35

Denko, Mieso K., and Hua Lu. "Replica Dissemination and Update Strategies in Cluster-Based Mobile Ad Hoc Networks." Mobile Information Systems 2, no. 4 (2006): 193–209. http://dx.doi.org/10.1155/2006/514842.

Full text
Abstract:
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 c
APA, Harvard, Vancouver, ISO, and other styles
36

Buzura, Sorin, Bogdan Iancu, Vasile Dadarlat, Adrian Peculea, and Emil Cebuc. "Optimizations for Energy Efficiency in Software-Defined Wireless Sensor Networks." Sensors 20, no. 17 (August 24, 2020): 4779. http://dx.doi.org/10.3390/s20174779.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
37

Rao T, Srinivasa, Harsha G, Kiran V, and Hemanth Kumar K. "Dos flooding attack control in information-centric networks." International Journal of Engineering & Technology 7, no. 1.1 (December 21, 2017): 303. http://dx.doi.org/10.14419/ijet.v7i1.1.9708.

Full text
Abstract:
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 relate
APA, Harvard, Vancouver, ISO, and other styles
38

Eiter, Thomas, Ryutaro Ichise, Josiane Xavier Parreira, Patrik Schneider, and Lihua Zhao. "Deploying spatial-stream query answering in C-ITS scenarios1." Semantic Web 12, no. 1 (November 19, 2020): 41–77. http://dx.doi.org/10.3233/sw-200408.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
39

Ioannidis, Sotiris, Umit Rencuzogullari, Robert Stets, and Sandhya Dwarkadas. "CRAUL: Compiler and Run-Time Integration for Adaptation under Load." Scientific Programming 7, no. 3-4 (1999): 261–73. http://dx.doi.org/10.1155/1999/603478.

Full text
Abstract:
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 Adap
APA, Harvard, Vancouver, ISO, and other styles
40

Yan, Li, and Yan Sheng Qu. "Research on Caching Mechanism Based on User Community." Applied Mechanics and Materials 672-674 (October 2014): 2013–16. http://dx.doi.org/10.4028/www.scientific.net/amm.672-674.2013.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
41

Yuan, Peiyan, Xiaoxiao Pang, and Xiaoyan Zhao. "Influence of Crowd Participation Features on Mobile Edge Computing." Future Internet 10, no. 10 (September 25, 2018): 94. http://dx.doi.org/10.3390/fi10100094.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
42

Wei, Xingda, Rong Chen, Haibo Chen, and Binyu Zang. "XStore : Fast RDMA-Based Ordered Key-Value Store Using Remote Learned Cache." ACM Transactions on Storage 17, no. 3 (August 31, 2021): 1–32. http://dx.doi.org/10.1145/3468520.

Full text
Abstract:
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 pe
APA, Harvard, Vancouver, ISO, and other styles
43

Teurlings, Ivonne J. M., John Odden, John D. C. Linnell, and Claudia Melis. "Caching Behavior of Large Prey by Eurasian Lynx: Quantifying the Anti-Scavenging Benefits." Diversity 12, no. 9 (September 13, 2020): 350. http://dx.doi.org/10.3390/d12090350.

Full text
Abstract:
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-
APA, Harvard, Vancouver, ISO, and other styles
44

"Energy-efficient Delay-aware and Profit Maximization Caching enabled, Congestion Control in Stochastic Network". International Journal of Engineering and Advanced Technology 8, № 6 (30 серпня 2019): 4266–74. http://dx.doi.org/10.35940/ijeat.f9127.088619.

Full text
Abstract:
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 p
APA, Harvard, Vancouver, ISO, and other styles
45

Brabrand, Claus, Anders Møller, Steffan Olesen, and Michael I. Schwartzbach. "Language-Based Caching of Dynamically Generated HTML." BRICS Report Series 8, no. 17 (May 17, 2001). http://dx.doi.org/10.7146/brics.v8i17.20474.

Full text
Abstract:
<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> ser
APA, Harvard, Vancouver, ISO, and other styles
46

"Rate Based Congestion Control for Wireless Links in Information Centric Network." International Journal of Engineering and Advanced Technology 9, no. 1S3 (December 31, 2019): 1–5. http://dx.doi.org/10.35940/ijeat.a1001.1291s319.

Full text
Abstract:
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,
APA, Harvard, Vancouver, ISO, and other styles
47

"Efficient Lookup Solutions for Named Data Networks." International Journal of Innovative Technology and Exploring Engineering 9, no. 2S (December 14, 2019): 621–26. http://dx.doi.org/10.35940/ijitee.b1097.1292s19.

Full text
Abstract:
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)
APA, Harvard, Vancouver, ISO, and other styles
48

GOUSE, SHAIK MOHAMMED, and G. PRAKASH BABU. "PRICE DEMAND MODEL FOR A CLOUD CACHE." International Journal of Computer and Communication Technology, October 2010, 246–49. http://dx.doi.org/10.47893/ijcct.2012.1150.

Full text
Abstract:
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 pla
APA, Harvard, Vancouver, ISO, and other styles
49

"PLeveraging Django and Redis using Web Scraping." International Journal of Recent Technology and Engineering 9, no. 1 (May 30, 2020): 2103–5. http://dx.doi.org/10.35940/ijrte.a1916.059120.

Full text
Abstract:
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 applicati
APA, Harvard, Vancouver, ISO, and other styles
50

Jain, Prateek, and Rupsha Bagchi. "SMART: A Secure Multipath Anonymous Routing Technique." International Journal of Smart Sensor and Adhoc Network., October 2011, 117–22. http://dx.doi.org/10.47893/ijssan.2011.1034.

Full text
Abstract:
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 oni
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!