Log in

Relevant bibliographies by topics / Node caching / Journal articles

To see the other types of publications on this topic, follow the link: Node caching.

Journal articles on the topic 'Node caching'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 July 2025

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 'Node caching.'

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

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

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

1

Man, Dapeng, Yao Wang, Hanbo Wang, et al. "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

2

Kim, Backhyun, Iksoo Kim, and Yoseop Woo. "Hop-based Exclusive Neighborhood Caching Scheme for Content Centric IMANET." International Journal of Engineering & Technology 7, no. 3.33 (2018): 143. http://dx.doi.org/10.14419/ijet.v7i3.33.18595.

Full text

Abstract:

MANETs have a relatively low transmission bandwidth and energy capacity, which is very different from a wired network. Frequent change of the transmission path due to movement of the node may cause problems such as service delay or disconnection in providing multimedia contents requiring transmission for a long time. A caching scheme that stores and uses the content being transmitted for future requests is an efficient technique in terms of use of transmission bandwidth and node energy. In this paper, caching is performed by selecting nodes that are not located within the transmission range of

APA, Harvard, Vancouver, ISO, and other styles

3

Hundewale, Nisar, Sunsook Jung, and Alex Zelikovsky. "Energy Efficient Node Caching and Load Balancing Enhancement of Reactive Ad Hoc Routing Protocols." JUCS - Journal of Universal Computer Science 13, no. (1) (2007): 110–32. https://doi.org/10.3217/jucs-013-01-0110.

Full text

Abstract:

Enhancing route request broadcasting protocols constitutes a substantial part of recent research in mobile ad-hoc network (MANET) routing. We suggest a novel approach to modify route request broadcast based on node caching. The intuition behind node caching is that the nodes involved in recent data packet forwarding have more reliable information about its neighbors and have better locations (e.g., on the intersection of several data routes) than other nodes. We cache nodes which are recently involved in data packet forwarding, and use only them to forward route requests. Stopping forwarding r

APA, Harvard, Vancouver, ISO, and other styles

4

Zhang, Wancai, and Rui Han. "An Efficient Multipath-Based Caching Strategy for Information-Centric Networks." Electronics 14, no. 3 (2025): 439. https://doi.org/10.3390/electronics14030439.

Full text

Abstract:

The growing demand for large-scale data distribution and sharing presents significant challenges to content transmission within the current TCP/IP network architecture. To address these challenges, Information-Centric Networking (ICN) has emerged as a promising alternative, offering inherent support for multipath forwarding and in-network caching to improve data transmission performance. However, most existing ICN caching strategies primarily focus on utilizing resources along the default transmission path and its neighboring nodes, without fully exploiting the additional resources provided by

APA, Harvard, Vancouver, ISO, and other styles

5

Zhou, Mo, Bo Ji, Kun Peng Han, and Hong Sheng Xi. "A Cooperative Hybrid Caching Strategy for P2P Mobile Network." Applied Mechanics and Materials 347-350 (August 2013): 1992–96. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.1992.

Full text

Abstract:

Recently mobile network technologies develop quickly. To meet the increasing demand of wireless users, many multimedia proxies have been deployed over wireless networks. The caching nodes constitute a wireless caching system with an architecture of P2P and provide better service to mobile users. In this paper, we formulate the caching system to optimize the consumption of network bandwidth and guarantee the response time of mobile users. Two strategies: single greedy caching strategy and cooperative hybrid caching strategy are proposed to achieve this goal. Single greedy caching aims to reduce

APA, Harvard, Vancouver, ISO, and other styles

6

Dinh, Ngoc-Thanh, and Younghan Kim. "An Efficient Distributed Content Store-Based Caching Policy for Information-Centric Networking." Sensors 22, no. 4 (2022): 1577. http://dx.doi.org/10.3390/s22041577.

Full text

Abstract:

Content store (CS) is one of the main components of information-centric networking (ICN), which enables content objects to be cached and retrieved from any intermediate node in the network. However, in existing ICN designs, CS information is not exploited to coordinate content caching and content retrieval. CS of nodes in the network operates independently while Interest packets forwarding mainly uses forwarding information base (FIB). This paper highlights the importance of CS information for efficient content caching and content retrieval to improve the performance of information-centric net

APA, Harvard, Vancouver, ISO, and other styles

7

Bai, Jingpan, Silei Zhu, and Houling Ji. "Blockchain Based Decentralized and Proactive Caching Strategy in Mobile Edge Computing Environment." Sensors 24, no. 7 (2024): 2279. http://dx.doi.org/10.3390/s24072279.

Full text

Abstract:

In the mobile edge computing (MEC) environment, the edge caching can provide the timely data response service for the intelligent scenarios. However, due to the limited storage capacity of edge nodes and the malicious node behavior, the question of how to select the cached contents and realize the decentralized security data caching faces challenges. In this paper, a blockchain-based decentralized and proactive caching strategy is proposed in an MEC environment to address this problem. The novelty is that the blockchain was adopted in an MEC environment with a proactive caching strategy based

APA, Harvard, Vancouver, ISO, and other styles

8

Ma, Zhenjie, Haoran Wang, Ke Shi, and Xinda Wang. "Learning Automata Based Caching for Efficient Data Access in Delay Tolerant Networks." Wireless Communications and Mobile Computing 2018 (2018): 1–19. http://dx.doi.org/10.1155/2018/3806907.

Full text

Abstract:

Effective data access is one of the major challenges in Delay Tolerant Networks (DTNs) that are characterized by intermittent network connectivity and unpredictable node mobility. Currently, different data caching schemes have been proposed to improve the performance of data access in DTNs. However, most existing data caching schemes perform poorly due to the lack of global network state information and the changing network topology in DTNs. In this paper, we propose a novel data caching scheme based on cooperative caching in DTNs, aiming at improving the successful rate of data access and red

APA, Harvard, Vancouver, ISO, and other styles

9

Jeon, Sang-Woon, and Sung Ho Chae. "Two-Stage Interference Cancellation for Device-to-Device Caching Networks." Sensors 20, no. 3 (2020): 780. http://dx.doi.org/10.3390/s20030780.

Full text

Abstract:

Wireless device-to-device (D2D) caching networks are studied, in which n nodes are distributed uniformly at random over the network area. Each node caches M files from the library of size m ≥ M and independently requires a file from the library. Each request will be served by cooperative D2D transmission from other nodes having the requested file in their cache memories. In many practical sensor or Internet of things (IoT) networks, there may exist simple sensor or IoT devices that are not able to perform real-time rate and power control based on the reported channel quality information (CQI).

APA, Harvard, Vancouver, ISO, and other styles

10

Ashraf, M. Wasim Abbas, Chuanghe Huang, Khuhawar Arif Raza, Shidong Huang, Yabo Yin, and Dong-Fang Wu. "Dynamic Cooperative Cache Management Scheme Based on Social and Popular Data in Vehicular Named Data Network." Wireless Communications and Mobile Computing 2022 (March 22, 2022): 1–11. http://dx.doi.org/10.1155/2022/8374181.

Full text

Abstract:

Vehicular Named Data Network (VNDN) is considered a strong paradigm to deploy in vehicular applications. In VNDN, each node has its cache, but due to limited cache, it directly affects the performance in a highly dynamic environment, which requires massive and fast content delivery. To reduce these issues, the cooperative caching plays an efficient role in VNDN. Most studies regarding cooperative caching focus on content replacement and caching algorithms and implement these methods in a static environment rather than a dynamic environment. In addition, few existing approaches addressed the ca

APA, Harvard, Vancouver, ISO, and other styles

11

Zhao, Yawen, and Nan Ding. "Cache Optimization Methods Involving Node and Content Sharding of Blockchain in Internet of Vehicles." Electronics 13, no. 3 (2024): 560. http://dx.doi.org/10.3390/electronics13030560.

Full text

Abstract:

Blockchain stands out in addressing the data security requirements of the Internet of Vehicles. However, blockchain has storage pressure that cannot be met by most existing nodes. The emergence of Mobile Edge Computing allows nodes closer to the users to undertake the caching and computation process. Although sharding can alleviate the storage pressure on blockchain nodes, frequent cross-shard communication can affect the overall performance of the blockchain. In this paper, combining the features of traffic flow with strong regional similarity as well as inter-node correlation, we propose two

APA, Harvard, Vancouver, ISO, and other styles

12

Ye, Hui, Zhi Gang Chen, and Xiao Jian Shen. "A Data Cooperative Caching Policy Using Human Mobile Patterns for Delay Tolerant Networks." Advanced Materials Research 171-172 (December 2010): 561–64. http://dx.doi.org/10.4028/www.scientific.net/amr.171-172.561.

Full text

Abstract:

Recently, many researchers focus on delay tolerant networks (DTN). In DTN, the mobile characteristic of nodes is used to help transfer data. Therefore, how to use the cooperative relations and cache resource of nodes effectively to avoid network congestion and improve network performance is an important issue. In this paper, we proposed a cooperative caching policy based on human mobile patterns, which referred as HMP-Cache. The node movement characteristics are discussed in detail in HMP-Cache. HMP-Cache uses the standard of target address matching to choose cooperative caching nodes. In addi

APA, Harvard, Vancouver, ISO, and other styles

13

M, Kannan, and Aboorva S. "ENHANCEMENT OF FOG CACHING USING NATURE INSPIRATION OPTIMIZATION TECHNIQUE BASED ON CLOUD COMPUTING." International Journal of Advanced Research 13, no. 05 (2025): 388–94. https://doi.org/10.21474/ijar01/20914.

Full text

Abstract:

An new concept called fog computing brings cloud computing closer to the network edge, allowing for data processing, storage, and application execution near end users. Nonetheless, effective fog node managementâ€”especially with regard to cachingâ€”remains a significant obstacle. Caching techniques are essential for boosting fog computing's overall performance since they lower latency, use less bandwidth, and make apps more responsive.

APA, Harvard, Vancouver, ISO, and other styles

14

Gu, Jinyuan, Yancheng Ji, Wei Duan, and Guoan Zhang. "Node Value and Content Popularity-Based Caching Strategy for Massive VANETs." Wireless Communications and Mobile Computing 2021 (April 5, 2021): 1–10. http://dx.doi.org/10.1155/2021/5585896.

Full text

Abstract:

The high-speed dynamic environment and massive information transmitted via wireless communications in the vehicular ad hoc networks (VANETs) pose a great challenge to privacy and security. To overcome this issue, use of the content-centric networking (CCN) provides a potential and practical solution. In-network caching is a main feature for future smart cities, in which the content is mainly placed in network nodes. Therefore, how to effectively select the cache locality and cache content is essential to improve the overall network performance, which is an inevitable trend. With these observat

APA, Harvard, Vancouver, ISO, and other styles

15

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

16

Nguyen, Quang Ngoc, Jiang Liu, Zhenni Pan, et al. "PPCS: A Progressive Popularity-Aware Caching Scheme for Edge-Based Cache Redundancy Avoidance in Information-Centric Networks." Sensors 19, no. 3 (2019): 694. http://dx.doi.org/10.3390/s19030694.

Full text

Abstract:

This article proposes a novel chunk-based caching scheme known as the Progressive Popularity-Aware Caching Scheme (PPCS) to improve content availability and eliminate the cache redundancy issue of Information-Centric Networking (ICN). Particularly, the proposal considers both entire-object caching and partial-progressive caching for popular and non-popular content objects, respectively. In the case that the content is not popular enough, PPCS first caches initial chunks of the content at the edge node and then progressively continues caching subsequent chunks at upstream Content Nodes (CNs) al

APA, Harvard, Vancouver, ISO, and other styles

17

Choi, Yoonjeong, and Yujin Lim. "Deep Reinforcement Learning for Edge Caching with Mobility Prediction in Vehicular Networks." Sensors 23, no. 3 (2023): 1732. http://dx.doi.org/10.3390/s23031732.

Full text

Abstract:

As vehicles are connected to the Internet, various services can be provided to users. However, if the requests of vehicle users are concentrated on the remote server, the transmission delay increases, and there is a high possibility that the delay constraint cannot be satisfied. To solve this problem, caching can be performed at a closer proximity to the user which in turn would reduce the latency by distributing requests. The road side unit (RSU) and vehicle can serve as caching nodes by providing storage space closer to users through a mobile edge computing (MEC) server and an on-board unit

APA, Harvard, Vancouver, ISO, and other styles

18

Kim, Chang Kyung, TaeYoung Kim, SuKyoung Lee, Seungkyun Lee, Anna Cho, and Mun-Suk Kim. "Delay-aware distributed program caching for IoT-edge networks." PLOS ONE 17, no. 7 (2022): e0270183. http://dx.doi.org/10.1371/journal.pone.0270183.

Full text

Abstract:

Edge computing is a novel network architecture that is in proximity to the end devices in an Internet of Things (IoT). As the IoT becoming a major factor in our daily life, provisioning a low response time of the services to IoT users through edge computing is an important problem. Caching necessary program data for the task in an edge node effectively reduces the response time of the computation task. However, due to the increase of IoT users and devices, it is noteworthy that limited-resource edge nodes would receive a number of tasks, having a heavy burden of processing the requests. Theref

APA, Harvard, Vancouver, ISO, and other styles

19

Amadeo, Marica, Claudia Campolo, Giuseppe Ruggeri, and Antonella Molinaro. "Popularity-Aware Closeness Based Caching in NDN Edge Networks." Sensors 22, no. 9 (2022): 3460. http://dx.doi.org/10.3390/s22093460.

Full text

Abstract:

By enabling name-based routing and ubiquitous in-network caching, Named Data Networking (NDN) is a promising network architecture for sixth generation (6G) edge network infrastructures. However, the performance of content retrieval largely depends on the selected caching strategy, which is implemented in a distributed fashion by each NDN node. Previous research showed the effectiveness of caching decisions based on content popularity and network topology information. This paper presents a new distributed caching strategy for NDN edge networks based on a metric called popularity-aware closeness

APA, Harvard, Vancouver, ISO, and other styles

20

Sim, Alex, Ezra Kissel, Damian Hazen, and Chin Guok. "Experiences in deploying in-network data caches." EPJ Web of Conferences 295 (2024): 07018. http://dx.doi.org/10.1051/epjconf/202429507018.

Full text

Abstract:

Data caches of various forms have been widely deployed in the context of commercial and research and education networks, but their common positioning at the Edge limits their utility from a network operator perspective. When deployed outside the network core, providers lack visibility to make decisions or apply traffic engineering based on data access patterns and caching node location. As an alternative, in-network caching provides a different type of content delivery network for scientific data infrastructure, supporting on-demand temporary caching service. We will describe the status of in-

APA, Harvard, Vancouver, ISO, and other styles

21

Cai, Rui-yan, Yang Qian, and De-bin Wei. "Dynamic Cache Replacement Strategy of Space Information Network Based on Cache Value." Journal of Physics: Conference Series 2290, no. 1 (2022): 012106. http://dx.doi.org/10.1088/1742-6596/2290/1/012106.

Full text

Abstract:

Abstract With the development of space network communication technology, satellite cache becomes possible. However, due to the limited space on the satellites, content replacement has become a major factor affecting network performance. Aiming at the limited cache resources of space network nodes and the low cache hit rate of nodes, a space information network dynamic cache replacement strategy (SINDR) based on cache value is proposed. On the basis of considering the popularity of the content and the cost of caching, the strategy also calculates the caching value of the content by quantifying

APA, Harvard, Vancouver, ISO, and other styles

22

Zhong, Yuqing, Zhaohua Li, and Liping Liao. "A Privacy-Preserving Caching Scheme for Device-to-Device Communications." Security and Communication Networks 2021 (February 6, 2021): 1–8. http://dx.doi.org/10.1155/2021/6696149.

Full text

Abstract:

With device-to-device (D2D) communication, user equipment can share data with each other without the involvement of network infrastructures. In order to maintain the Quality of Service (QoS) and Quality of Experience (QoE) for user applications in D2D communications, most existing schemes use proactive content caching that needs to predict content popularity before making caching decisions which may result in privacy leakage, since the information of users is collected to train a deep learning-based model to predict content popularity. Therefore, it is crucial to guarantee secure data collecti

APA, Harvard, Vancouver, ISO, and other styles

23

Chao, Yichao, Hong Ni, and Rui Han. "A Path Load-Aware Based Caching Strategy for Information-Centric Networking." Electronics 11, no. 19 (2022): 3088. http://dx.doi.org/10.3390/electronics11193088.

Full text

Abstract:

Ubiquitous in-network caching plays an important role in improving the efficiency of content access and distribution in Information-Centric Networks (ICN). Content placement strategies, which determine the location distribution of content replicas in the network, have a decisive impact on the performance of the cache system. Existing strategies primarily focus on pushing popular content to the network edge, aiming to improve the overall cache hit ratio while neglecting to effectively balance the traffic load between network links; this leads to insufficient utilization of network bandwidth res

APA, Harvard, Vancouver, ISO, and other styles

24

Recayte, Estefania, and Giuseppe Cocco. "Caching in Heterogeneous Networks With Per-File Rate Constraints." IEEE Transactions on Communications 67, no. 2 (2018): 1210–24. https://doi.org/10.1109/TCOMM.2018.2876295.

Full text

Abstract:

We study the problem of caching optimization in heterogeneous networks with mutual interference and per-file rate constraints from an energy efficiency perspective. A setup is considered in which two cache-enabled transmitter nodes and a coordinator node serve two users. We analyse and compare two approaches: (i) a cooperative approach where each of the transmitters might serve either of the users and (ii) a noncooperative approach in which each transmitter serves only the respective user. We formulate the cache allocation optimization problem so that the overall system power consumption is mi

APA, Harvard, Vancouver, ISO, and other styles

25

Zulfa, Mulki Indana, Muhammad Syaiful Aliim, Ari Fadli, and Waleed Ali. "CACHE DATA REPLACEMENT POLICY BASED ON RECENTLY USED ACCESS DATA AND EUCLIDEAN DISTANCE." Jurnal Teknik Informatika (Jutif) 4, no. 4 (2023): 875–81. http://dx.doi.org/10.52436/1.jutif.2023.4.4.1244.

Full text

Abstract:

Data access management in web-based applications that use relational databases must be well thought out because the data continues to grow every day. The Relational Database Management System (RDBMS) has a relatively slow access speed because the data is stored on disk. This causes problems with decreased database server performance and slow response times. One strategy to overcome this is to implement caching at the application level. This paper proposed SIMGD framework that models Application Level Caching (ALC) to speed up relational data access in web applications. The ALC strategy maps ea

APA, Harvard, Vancouver, ISO, and other styles

26

Saleem, Qudsia, Ikram Ud Din, Ahmad Almogren, Ibrahim Alkhalifa, Hasan Ali Khattak, and Joel J. P. C. Rodrigues. "Named Data Networking-Based On-Demand Secure Vehicle-To-Vehicle Communications." Wireless Communications and Mobile Computing 2021 (November 26, 2021): 1–15. http://dx.doi.org/10.1155/2021/1615015.

Full text

Abstract:

The detection of secure vehicles for content placement in vehicle to vehicle (V2V) communications makes a challenging situation for a well-organized dynamic nature of vehicular ad hoc networks (VANET). With the increase in the demand of efficient and adoptable content delivery, information-centric networking (ICN) can be a promising solution for the future needs of the network. ICN provides a direct retrieval of content through its unique name, which is independent of locations. It also performs better in content retrieval with its in-network caching and named-based routing capabilities. Since

APA, Harvard, Vancouver, ISO, and other styles

27

Kumar, Sumit, Rajeev Tiwari, and Wei-Chiang Hong. "QoS Improvement Using In-Network Caching Based on Clustering and Popularity Heuristics in CCN." Sensors 21, no. 21 (2021): 7204. http://dx.doi.org/10.3390/s21217204.

Full text

Abstract:

Content-Centric Networking (CCN) has emerged as a potential Internet architecture that supports name-based content retrieval mechanism in contrast to the current host location-oriented IP architecture. The in-network caching capability of CCN ensures higher content availability, lesser network delay, and leads to server load reduction. It was observed that caching the contents on each intermediate node does not use the network resources efficiently. Hence, efficient content caching decisions are crucial to improve the Quality-of-Service (QoS) for the end-user devices and improved network perfo

APA, Harvard, Vancouver, ISO, and other styles

28

Li, Feng, Kwok-Yan Lam, Li Wang, Zhenyu Na, Xin Liu, and Qing Pan. "Caching Efficiency Enhancement at Wireless Edges with Concerns on User’s Quality of Experience." Wireless Communications and Mobile Computing 2018 (2018): 1–10. http://dx.doi.org/10.1155/2018/1680641.

Full text

Abstract:

Content caching is a promising approach to enhancing bandwidth utilization and minimizing delivery delay for new-generation Internet applications. The design of content caching is based on the principles that popular contents are cached at appropriate network edges in order to reduce transmission delay and avoid backhaul bottleneck. In this paper, we propose a cooperative caching replacement and efficiency optimization scheme for IP-based wireless networks. Wireless edges are designed to establish a one-hop scope of caching information table for caching replacement in cases when there is not e

APA, Harvard, Vancouver, ISO, and other styles

29

Miura, Teruhisa, and Toru Ishida. "Stochastic node caching for memory-bounded search." Systems and Computers in Japan 30, no. 2 (1999): 57–65. http://dx.doi.org/10.1002/(sici)1520-684x(199902)30:2<57::aid-scj7>3.0.co;2-n.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Chauhan, Naveen, Lalit K. Awasthi, and Narottam Chand. "Cache Replacement in Mobile Adhoc Networks." International Journal of Distributed Systems and Technologies 3, no. 2 (2012): 22–38. http://dx.doi.org/10.4018/jdst.2012040102.

Full text

Abstract:

Caching of frequently accessed data in Mobile Adhoc NETwork (MANET) is a technique that can improve data access performance and availability. In the situation of sufficient cache space one may think of keeping all the data items in the cache. However, this has overhead in terms of multiple copies of same data distributed all over the network and there are chances of inconsistency of data among different nodes. The main objective of cooperative caching is the optimum utilization of cache by storing different data items in the cache of each Mobile Node (MN). By doing this, different sets of item

APA, Harvard, Vancouver, ISO, and other styles

31

Lei, Fangyuan, Jun Cai, Qingyun Dai, and Huimin Zhao. "Deep Learning Based Proactive Caching for Effective WSN-Enabled Vision Applications." Complexity 2019 (May 2, 2019): 1–12. http://dx.doi.org/10.1155/2019/5498606.

Full text

Abstract:

Wireless Sensor Networks (WSNs) have a wide range of applications scenarios in computer vision, from pedestrian detection to robotic visual navigation. In response to the growing visual data services in WSNs, we propose a proactive caching strategy based on Stacked Sparse Autoencoder (SSAE) to predict content popularity (PCDS2AW). Firstly, based on Software Defined Network (SDN) and Network Function Virtualization (NFV) technologies, a distributed deep learning network SSAE is constructed in the sink nodes and control nodes of the WSN network. Then, the SSAE network structure parameters and ne

APA, Harvard, Vancouver, ISO, and other styles

32

H. S., Shrisha, and Uma Boregowda. "Quality-of-Service-Linked Privileged Content-Caching Mechanism for Named Data Networks." Future Internet 14, no. 5 (2022): 157. http://dx.doi.org/10.3390/fi14050157.

Full text

Abstract:

The domain of information-centric networking (ICN) is expanding as more devices are becoming a part of connected technologies. New methods for serving content from a producer to a consumer are being explored, and Named Data Networking (NDN) is one of them. The NDN protocol routes the content from a producer to a consumer in a network using content names, instead of IP addresses. This facility, combined with content caching, efficiently serves content for very large networks consisting of a hybrid and ad hoc topology with both wired and wireless media. This paper addresses the issue of the qual

APA, Harvard, Vancouver, ISO, and other styles

33

Zhang, Guo Yin, Bin Tang, Xiang Hui Wang, and Yan Xia Wu. "Neighbor-Referencing Cooperative Cache Policy in Content-Centric Network." Applied Mechanics and Materials 433-435 (October 2013): 1702–8. http://dx.doi.org/10.4028/www.scientific.net/amm.433-435.1702.

Full text

Abstract:

In-network caching is one of the key aspects of content-centric networks (CCN), while the cache replacement algorithm of LRU does not consider the relation between the cache contents and its neighbor nodes in the cache replacement process, which reduced the efficiency of the cache. In this paper, a Neighbor-Referencing Cooperative Cache Policy (NRCCP) in CCN has been proposed to check whether the neighbors have cached the content. Node will cache the content while none of its neighbors has cached it, therefore reduce redundancy of cached content and increase the variety of contents. Simulation

APA, Harvard, Vancouver, ISO, and other styles

34

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

35

Dong, Zhiyuan, Zhaoguo Wang, Xiaodong Zhang, et al. "Fine-Grained Re-Execution for Efficient Batched Commit of Distributed Transactions." Proceedings of the VLDB Endowment 16, no. 8 (2023): 1930–43. http://dx.doi.org/10.14778/3594512.3594523.

Full text

Abstract:

Distributed transaction systems incur extensive cross-node communication to execute and commit serializable OLTP transactions. As a result, their performance greatly suffers. Caching data at nodes that execute transactions can cut down remote reads. Batching transactions for validation and persistence can amortize the communication cost during committing. However, caching and batching can significantly increase the likelihood of conflicts, causing expensive aborts. In this paper, we develop Hackwrench to address the challenge of caching and batching. Instead of aborting conflicted transactions

APA, Harvard, Vancouver, ISO, and other styles

36

Jain, Devendra Kumar, Sanjay Sharma, Shashank Yadav, and Jitendra Singh. "A Detailed Survey and Comparative Study of Cooperative Caching Methods for Mobile Ad Hoc Networks." International Journal of Sensors, Wireless Communications and Control 9, no. 3 (2019): 314–29. http://dx.doi.org/10.2174/2210327908666181120103838.

Full text

Abstract:

: Mobile Ad Hoc Networks (MANETs) are networks that enable server and clients to impart without any settled foundation. MANET is a quickly developing region of research as it discovers use in different applications. In MANETs, network parceling and the fizzling of a mobile node because of weariness of their battery power can significantly diminish data accessibility. Data caching on the client is generally observed as a successful answer for enhancing data availability. Specifically, cooperative caching based on information sharing and coordination of cached data item among numerous clients is

APA, Harvard, Vancouver, ISO, and other styles

37

Shan, Chun, Xiao-ping Wu, Yan Liu, Jun Cai, and Jian-zhen Luo. "IBP Based Caching Strategy in D2D." Applied Sciences 9, no. 12 (2019): 2416. http://dx.doi.org/10.3390/app9122416.

Full text

Abstract:

Device to Device (D2D) communication is a key technology in 5th generation wireless systems to increase communication capacity and spectral efficiency. Applying caching into D2D communication networks, the device can retrieve content from other devices by establishing D2D communication links. In this way, the backhaul traffic can be significantly reduced. However, most of the existing caching schemes in D2D are proactive caching, which cannot satisfy the requirement of real-time updating. In this paper, we propose an Indian Buffet Process based D2D caching strategy (IBPSC). Firstly, we constru

APA, Harvard, Vancouver, ISO, and other styles

38

Wang, Zhi-hong, and A.-liang Dong. "Research on Load Balancing and Caching Strategy for Central Network." Journal of Electrical and Computer Engineering 2022 (April 8, 2022): 1–12. http://dx.doi.org/10.1155/2022/6601965.

Full text

Abstract:

The central network architecture takes the information content as the processing object and can better meet the user access needs. However, the traditional network node load balancing and caching strategy has been difficult to adapt to the development of the central network architecture. Therefore, this article proposed a load balancing and cache management strategy based on the central network in order to provide a reference for the architecture and application of the central network. Based on the analysis of the existing network architecture, this article expounded the networking form and ch

APA, Harvard, Vancouver, ISO, and other styles

39

Sang, Yongxuan, Yukang Guo, Bo Wang, and Ying Song. "Diversified caching algorithm with cooperation between edge servers." PeerJ Computer Science 11 (April 30, 2025): e2824. https://doi.org/10.7717/peerj-cs.2824.

Full text

Abstract:

Edge computing makes up for the high latency of the central cloud network by deploying server resources in close proximity to users. The storage and other resources configured by edge servers are limited, and a reasonable cache replacement strategy is conducive to improving the cache hit ratio of edge services, thereby reducing service latency and enhancing service quality. The spatiotemporal correlation of user service request distribution brings opportunities and challenges to edge service caching. The collaboration between edge servers is often ignored in the existing research work for cach

APA, Harvard, Vancouver, ISO, and other styles

40

Vyazigin, Stepan, Madina Mansurova, Victor Malyshkin, and Aygul Shaykhulova. "Random access memory page caching: a strategy for enhancing shared virtual memory multicomputer systems performance." Indonesian Journal of Electrical Engineering and Computer Science 34, no. 3 (2024): 1879. http://dx.doi.org/10.11591/ijeecs.v34.i3.pp1879-1892.

Full text

Abstract:

This study examines a modified approach to optimizing the performance of support vector machine (SVM)-type multicomputer systems through a distinct type of caching method that allocates space in the random access memory (RAM) of a computing node for caching pages. The article extensively describes research on enhancing the performance of the SVM system through memory page caching in RAM at the hardware level by implementing the SVM system based on field-programmable gate arrays (FPGA). A systematic comparative evaluation highlights a discernible enhancement in system performance relative to sy

APA, Harvard, Vancouver, ISO, and other styles

41

Vyazigin, Stepan, Madina Mansurova, Victor Malyshkin, and Aygul Shaykhulova. "Random access memory page caching: a strategy for enhancing shared virtual memory multicomputer systems performance." Indonesian Journal of Electrical Engineering and Computer Science 34, no. 3 (2024): 1879–92. https://doi.org/10.11591/ijeecs.v34.i3.pp1879-1892.

Full text

Abstract:

This study examines a modified approach to optimizing the performance of support vector machine (SVM)-type multicomputer systems through a distinct type of caching method that allocates space in the random access memory (RAM) of a computing node for caching pages. The article extensively describes research on enhancing the performance of the SVM system through memory page caching in RAM at the hardware level by implementing the SVM system based on field-programmable gate arrays (FPGA). A systematic comparative evaluation highlights a discernible enhancement in system performance relative to sy

APA, Harvard, Vancouver, ISO, and other styles

42

Wang, Danyue, Xingshuo An, Xianwei Zhou, and Xing Lü. "Data cache optimization model based on cyclic genetic ant colony algorithm in edge computing environment." International Journal of Distributed Sensor Networks 15, no. 8 (2019): 155014771986786. http://dx.doi.org/10.1177/1550147719867864.

Full text

Abstract:

Edge computing has recently emerged as an important paradigm to bring filtering, processing, and caching resources to the edge of networks. However, with the increasing popularity of augmented reality and virtual reality application, user requirements on data access speed have increased. Since the edge node has limited cache space, efficient data caching model is needed to improve the performance of edge computing. We propose a multi-objective optimization data caching model in the edge computing environment using data access counts, data access frequency, and data size as optimization goals.

APA, Harvard, Vancouver, ISO, and other styles

43

Hou, Jiacheng, Tianhao Tao, Haoye Lu, and Amiya Nayak. "Intelligent Caching with Graph Neural Network-Based Deep Reinforcement Learning on SDN-Based ICN." Future Internet 15, no. 8 (2023): 251. http://dx.doi.org/10.3390/fi15080251.

Full text

Abstract:

Information-centric networking (ICN) has gained significant attention due to its in-network caching and named-based routing capabilities. Caching plays a crucial role in managing the increasing network traffic and improving the content delivery efficiency. However, caching faces challenges as routers have limited cache space while the network hosts tens of thousands of items. This paper focuses on enhancing the cache performance by maximizing the cache hit ratio in the context of software-defined networking–ICN (SDN-ICN). We propose a statistical model that generates users’ content preferences

APA, Harvard, Vancouver, ISO, and other styles

44

Um, Doosik, Hyung-Seok Park, Hyunho Ryu, and Kyung-Joon Park. "Predictive Forwarding Rule Caching for Latency Reduction in Dynamic SDN." Sensors 25, no. 1 (2024): 155. https://doi.org/10.3390/s25010155.

Full text

Abstract:

In mission-critical environments such as industrial and military settings, the use of unmanned vehicles is on the rise. These scenarios typically involve a ground control system (GCS) and nodes such as unmanned ground vehicles (UGVs) and unmanned aerial vehicles (UAVs). The GCS and nodes exchange different types of information, including control data that direct unmanned vehicle movements and sensor data that capture real-world environmental conditions. The GCS and nodes communicate wirelessly, leading to loss or delays in control and sensor data. Minimizing these issues is crucial to ensure n

APA, Harvard, Vancouver, ISO, and other styles

45

Yang, Zhi-Peng, Lu Hua, Ning-Jie Gao, Ru Huo, Jiang Liu, and Tao Huang. "An Accelerating Approach for Blockchain Information Transmission Based on NDN." Future Internet 13, no. 2 (2021): 47. http://dx.doi.org/10.3390/fi13020047.

Full text

Abstract:

Blockchain is becoming more and more popular in various fields. Since the information transmission mode of the blockchain is data broadcasting, the traditional TCP/IP network cannot support the blockchain system well, but the Named-Data Networking (NDN) could be a good choice because of its multi-path forwarding and intra-network caching functions. In this article, we propose a new blockchain information transmission acceleration strategy (AITS) combining with graph theory and probability theory based on the NDN architecture. We select some more important nodes in the network as “secondary nod

APA, Harvard, Vancouver, ISO, and other styles

46

Durner, Dominik, Badrish Chandramouli, and Yinan Li. "Crystal." Proceedings of the VLDB Endowment 14, no. 11 (2021): 2432–44. http://dx.doi.org/10.14778/3476249.3476292.

Full text

Abstract:

Cloud analytical databases employ a disaggregated storage model, where the elastic compute layer accesses data persisted on remote cloud storage in block-oriented columnar formats. Given the high latency and low bandwidth to remote storage and the limited size of fast local storage, caching data at the compute node is important and has resulted in a renewed interest in caching for analytics. Today, each DBMS builds its own caching solution, usually based on file-or block-level LRU. In this paper, we advocate a new architecture of a smart cache storage system called Crystal , that is co-located

APA, Harvard, Vancouver, ISO, and other styles

47

Byun, Si-Woo. "Flash Node Caching Scheme for Hybrid Hard Disk Systems." Journal of the Korea Academia-Industrial cooperation Society 9, no. 6 (2008): 1696–704. http://dx.doi.org/10.5762/kais.2008.9.6.1696.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Yu, Cui, James Bailey, Julian Montefusco, Rui Zhang, and Jiling Zhong. "Enhancing the B+-tree by dynamic node popularity caching." Information Processing Letters 110, no. 7 (2010): 268–73. http://dx.doi.org/10.1016/j.ipl.2010.01.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Jia, Shijie, Tianyin Wang, Xiaoyan Su, and Liuke Liang. "A Novel Video Propagation Strategy Fusing User Interests and Social Influences Based on Assistance of Key Nodes in Social Networks." Electronics 12, no. 3 (2023): 532. http://dx.doi.org/10.3390/electronics12030532.

Full text

Abstract:

Accurate video launching and propagation is significant for promotion and distribution of videos. In this paper, we propose a novel video propagation strategy that fuses user interests and social influences based on the assistance of key nodes in social networks (VPII). VPII constructs an estimation model for video distribution capacities in the process of video propagation by investigating interest preference and influence of social users: (1) An estimation method of user preferences for video content is designed by integrating a comparative analysis between current popular videos and histori

APA, Harvard, Vancouver, ISO, and other styles

50

Mohammad, Arifuzzaman, NazneenTuli Naheed, Keping Yu, N. Nguyen Quang, and Takuro Sato. "Integrated Caching and Routing Strategy for Information-Centric Networks." European Journal of Advances in Engineering and Technology 5, no. 2 (2018): 80–90. https://doi.org/10.5281/zenodo.10702236.

Full text

Abstract:

<strong>ABSTRACT </strong> In Information Centric Networking (ICN), on-path caching is an integrated caching solution with-in an Autonomous System's (AS) local network. However, it is seen that in on-path caching, the content is cached en-route in the reverse path towards the Interest generator. Thus, local Rendezvous Network (RENE) /Name Resolution System (NRS) (in routing through name resolution) or FIB (in name-based routing) is not conscious of the cached data. Therefore, the most extensively deployed intra-domain routing protocol and their forwarding strategy is not capable of addressing

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!