Academic literature on the topic 'Caching placement'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Caching placement.'

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

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

Journal articles on the topic "Caching placement"

1

Soleimani, Somayeh, and Xiaofeng Tao. "Caching and Placement for In-Network Caching in Device-to-Device Communications." Wireless Communications and Mobile Computing 2018 (September 26, 2018): 1–9. http://dx.doi.org/10.1155/2018/9539502.

Full text
Abstract:
Caching content by users constitutes a promising solution to decrease the costly transmissions with going through the base stations (BSs). To improve the performance of in-network caching in device-to-device (D2D) communications, caching placement and content delivery should be jointly optimized. To this end, we jointly optimize caching decision and content discovery strategies by considering the successful content delivery in D2D links for maximizing the in-network caching gain through D2D communications. Moreover, an in-network caching placement problem is formulated as an integer nonlinear
APA, Harvard, Vancouver, ISO, and other styles
2

Chae, Seong Ho, and Wan Choi. "Caching Placement in Stochastic Wireless Caching Helper Networks: Channel Selection Diversity via Caching." IEEE Transactions on Wireless Communications 15, no. 10 (2016): 6626–37. http://dx.doi.org/10.1109/twc.2016.2586841.

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

Shi, Fang, Lisheng Fan, Xin Liu, Zhenyu Na, and Yanchen Liu. "Probabilistic Caching Placement in the Presence of Multiple Eavesdroppers." Wireless Communications and Mobile Computing 2018 (2018): 1–10. http://dx.doi.org/10.1155/2018/2104162.

Full text
Abstract:
The wireless caching has attracted a lot of attention in recent years, since it can reduce the backhaul cost significantly and improve the user-perceived experience. The existing works on the wireless caching and transmission mainly focus on the communication scenarios without eavesdroppers. When the eavesdroppers appear, it is of vital importance to investigate the physical-layer security for the wireless caching aided networks. In this paper, a caching network is studied in the presence of multiple eavesdroppers, which can overhear the secure information transmission. We model the locations
APA, Harvard, Vancouver, ISO, and other styles
4

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
5

Wang, Wuqu, Zhe Tao, Nan Liu, and Wei Kang. "Fundamental Limits of Coded Caching in Request-Robust D2D Communication Networks." Entropy 26, no. 3 (2024): 250. http://dx.doi.org/10.3390/e26030250.

Full text
Abstract:
D2D coded caching, originally introduced by Ji, Caire, and Molisch, significantly improves communication efficiency by applying the multi-cast technology proposed by Maddah-Ali and Niesen to the D2D network. Most prior works on D2D coded caching are based on the assumption that all users will request content at the beginning of the delivery phase. However, in practice, this is often not the case. Motivated by this consideration, this paper formulates a new problem called request-robust D2D coded caching. The considered problem includes K users and a content server with access to N files. Only
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Yanpei, Yanru Bin, Ningning Chen, and Shuaijie Zhu. "Caching Placement Optimization Strategy Based on Comprehensive Utility in Edge Computing." Applied Sciences 13, no. 16 (2023): 9229. http://dx.doi.org/10.3390/app13169229.

Full text
Abstract:
With the convergence of the Internet of Things, 5G, and artificial intelligence, limited network bandwidth and bursts of incoming service requests seem to be the most important factors affecting user experience. Therefore, caching technology was introduced. In this paper, a caching placement optimization strategy based on comprehensive utility (CPOSCU) in edge computing is proposed. Firstly, the strategy involves quantifying the placement factors of data blocks, which include the popularity of data blocks, the remaining validity ratio of data blocks, and the substitution rate of servers. By an
APA, Harvard, Vancouver, ISO, and other styles
7

Chao, Yichao, Hong Ni, and Rui Han. "RMBCC: A Replica Migration-Based Cooperative Caching Scheme for Information-Centric Networks." Electronics 13, no. 13 (2024): 2636. http://dx.doi.org/10.3390/electronics13132636.

Full text
Abstract:
How to maximize the advantages of in-network caching under limited cache space has always been a key issue in information-centric networking (ICN). Replica placement strategies aim to fully utilize cache resources by optimizing the location and quantity distribution of replicas in the network, thereby improving the performance of the cache system. However, existing research primarily focuses on optimizing the placement of replicas along the content delivery path, which cannot avoid the inherent drawback of not being able to leverage off-path cache resources. The proposals for off-path caching
APA, Harvard, Vancouver, ISO, and other styles
8

Korupolu, Madhukar R., C. Greg Plaxton, and Rajmohan Rajaraman. "Placement Algorithms for Hierarchical Cooperative Caching." Journal of Algorithms 38, no. 1 (2001): 260–302. http://dx.doi.org/10.1006/jagm.2000.1129.

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

Zhang, Xuewei, Lin Zhang, Yuan Ren, Jing Jiang, and Junxuan Wang. "Optimal Designs of SVC-Based Content Placement and Delivery in Wireless Caching Networks." Sensors 23, no. 10 (2023): 4823. http://dx.doi.org/10.3390/s23104823.

Full text
Abstract:
To allieviate the heavy traffic burden over backhaul links and improve the user’s quality of service (QoS), edge caching plays an important role in wireless networks. This paper investigated the optimal designs of content placement and transmission in wireless caching networks. The contents to be cached and requested were encoded into individual layers by scalable video coding (SVC), and different sets of layers can provide different viewing qualities to end users. The demanded contents were provided by helpers caching the requested layers, or by the macro-cell base station (MBS) otherwise. In
APA, Harvard, Vancouver, ISO, and other styles
10

Dinh, Ngocthanh, and Younghan Kim. "An Energy Reward-Based Caching Mechanism for Information-Centric Internet of Things." Sensors 22, no. 3 (2022): 743. http://dx.doi.org/10.3390/s22030743.

Full text
Abstract:
Existing information-centric networking (ICN) designs for Internet of Things (IoT) mostly make caching decisions based on probability or content popularity. From the energy-efficient perspective, those strategies may not always be energy efficient in resource-constrained IoT because without considering the energy reward of caching decisions, inappropriate routers and content objects may be selected for caching, which may lead to negative energy rewards. In this paper, we analyze the energy consumption of content caching and content retrieval in resource-constrained IoT and calculate caching en
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Caching placement"

1

Edström, Rickard. "Internet caching - sizing and placement for dynamic content." Thesis, Uppsala universitet, Avdelningen för datorteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-264729.

Full text
Abstract:
Traffic volumes on the Internet continue to increase, with the same links carrying the same data multiple times. In-network caching can alleviate much of the redundant traffic by storing popular items close to the users. This was a master thesis project that involved building on existing research and simulators, simulating a multi-level hierarchical network cache system and its resulting performance, with varying parameters such as placement and sizing of the individual cache nodes. One of the goals of the thesis work was to improve and integrate the simulation frameworks used as a starting po
APA, Harvard, Vancouver, ISO, and other styles
2

Korupolu, Madhukar. "Placement algorithms for hierarchical cooperative caching and other location problems /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text
Abstract:
Thesis (Ph. D.)--University of Texas at Austin, 1999.<br>Vita. Includes bibliographical references (leaves 143-150), Copy 2 (p. 135-142). Available also in a digital version from Dissertation Abstracts.
APA, Harvard, Vancouver, ISO, and other styles
3

Shakya, Rosish. "Optimal Placement of Video Caching Routers for Minimization of Retransmission Delay." University of Akron / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=akron1306429551.

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

Ben, Ammar Hamza. "On models for performance evaluation and cache resources placement in multi-cache networks." Thesis, Rennes 1, 2019. http://www.theses.fr/2019REN1S006/document.

Full text
Abstract:
Au cours des dernières années, les fournisseurs de contenu ont connu une forte augmentation des demandes de contenus vidéo et de services riches en média. Compte tenu des limites de la mise à l'échelle du réseau et au-delà des réseaux de diffusion de contenu, les fournisseurs de services Internet développent leurs propres systèmes de mise en cache afin d'améliorer la performance du réseau. Ces facteurs expliquent l'enthousiasme à l'égard du concept de réseau centré sur le contenu et de sa fonction de mise en cache en réseau. La quantification analytique de la performance de la mise en cache n'
APA, Harvard, Vancouver, ISO, and other styles
5

Xu, Shihong. "Replica placement algorithms for efficient internet content delivery." 2009. http://hdl.handle.net/2440/58083.

Full text
Abstract:
This thesis covers three main issues in content delivery with a focus on placement algorithms of replica servers and replica contents. In a content delivery system, the location of replicas is very important as perceived by a quotation: Closer is better. However, considering the costs incurred by replication, it is a challenge to deploy replicas in a cost-effective manner. The objective of our work is to optimally select the location of replicas which includes sites for replica server deployment, servers for replica contents hosting, and en-route caches for object caching. Our solutions for co
APA, Harvard, Vancouver, ISO, and other styles
6

Amble, Meghana Mukund. "Content-aware Caching and Traffic Management in Content Distribution Networks." Thesis, 2010. http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8587.

Full text
Abstract:
The rapid increase of content delivery over the Internet has lead to the proliferation of content distribution networks (CDNs). Management of CDNs requires algorithms for request routing, content placement, and eviction in such a way that user delays are small. Our objective in this work is to design feasible algorithms that solve this trio of problems. We abstract the system of front-end source nodes and back-end caches of the CDN in the likeness of the input and output nodes of a switch. In this model, queues of requests for different pieces of content build up at the source nodes, which rou
APA, Harvard, Vancouver, ISO, and other styles
7

Xu, Shihong. "Replica placement algorithms for efficient internet content delivery." Thesis, 2009. http://hdl.handle.net/2440/58083.

Full text
Abstract:
This thesis covers three main issues in content delivery with a focus on placement algorithms of replica servers and replica contents. In a content delivery system, the location of replicas is very important as perceived by a quotation: Closer is better. However, considering the costs incurred by replication, it is a challenge to deploy replicas in a cost-effective manner. The objective of our work is to optimally select the location of replicas which includes sites for replica server deployment, servers for replica contents hosting, and en-route caches for object caching. Our solutions
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Caching placement"

1

Li, Hui, and He Bai. "Cache Management and Access Control." In Principle of Architecture, Protocol, and Algorithms for CoG-MIN. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-3596-2_8.

Full text
Abstract:
Abstract In MIN networks, the in-network caching plays a pivotal role in mitigating overall network traffic. This chapter introduces the cache management and access control schemes deployed on MIRs. The caching scheme includes a cache placement algorithm, a dual-layer caching model, and a cache space reallocation algorithm. Furthermore, the access control policy further achieves fine-grained access control and content privacy protection.
APA, Harvard, Vancouver, ISO, and other styles
2

Aioffi, Wagner M., Geraldo R. Mateus, Jussara M. Almeida, and Raquel C. Melo. "Dynamic Content Placement for Mobile Content Distribution Networks." In Web Content Caching and Distribution. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30471-5_2.

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

Mu, Su, Chi-Hung Chi, Lin Liu, and HongGuang Wang. "Object Placement and Caching Strategies on AN.P2P." In Advances in Web-Age Information Management. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11775300_16.

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

Li, Ruyu, Rui Wang, and Erwu Liu. "Optimal Caching Placement in Cache-Enabled Cloud Radio Access Networks." In Lecture Notes in Electrical Engineering. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6504-1_68.

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

Sun, Ruijin. "Cache Placement and Content Delivery Design in Wireless Caching Networks." In Encyclopedia of Wireless Networks. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-319-78262-1_349.

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

Sun, Ruijin. "Cache Placement and Content Delivery Design in Wireless Caching Networks." In Encyclopedia of Wireless Networks. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-319-32903-1_349-1.

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

Li, Taoshen, Ling You, and Zhihui Ge. "Edge Collaborative Assisted Caching Content Placement Optimization Strategy Based on DDSG." In Communications in Computer and Information Science. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-0827-7_10.

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

Wu, Shuhan, Yunchun Li, Hailong Yang, Zerong Luan, and Wei Li. "ODCP: Optimizing Data Caching and Placement in Distributed File System Using Erasure Coding." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79478-1_38.

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

Nissar, Basma, Ahmed El Ouadrhiri, and Mohamed El Kamili. "The Content Placement Problem in D2D Networks Under Coupling Distributed Caching and Distributed Storage." In Ubiquitous Networking. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02849-7_19.

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

Wu, Jingyan, Jiawei Zhang, and Yuefeng Ji. "Joint Allocation of Caching and Computing Resources for Service Placement in D2D-Enabled MEC Networks." In Communications in Computer and Information Science. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-6459-7_10.

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

Conference papers on the topic "Caching placement"

1

Zaki Hamidi, Eki Ahmad, Khibran Muhammad Akbar, Ridha Muldina Negara, et al. "NDN Collaborative Caching Replacement and Placement Policy Performance Evaluation." In 2024 10th International Conference on Wireless and Telematics (ICWT). IEEE, 2024. http://dx.doi.org/10.1109/icwt62080.2024.10674708.

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

Chen, Zeru, Nan Liu, and Wei Kang. "A Cyclic Placement Strategy for Multi-Access Coded Caching." In 2024 16th International Conference on Wireless Communications and Signal Processing (WCSP). IEEE, 2024. https://doi.org/10.1109/wcsp62071.2024.10826942.

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

Pandey, Rajlaxmi, Charul Rajput, and B. Sundar Rajan. "Coded Caching for Hierarchical Two-Layer Networks with Coded Placement." In 2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024. http://dx.doi.org/10.1109/isit57864.2024.10619310.

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

Namboodiri, K. K. Krishnan, Elizabath Peter, and B. Sundar Rajan. "Placement Delivery Arrays for Coded Caching with Shared and Private Caches." In 2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024. http://dx.doi.org/10.1109/isit57864.2024.10619297.

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

Negaral, Ridha Muldina, Nana Rachmana Syambas, Eueung Mulyana, and Novan Purba Wasesa. "Maximizing Router Efficiency in Named Data Networking with Machine Learning-Driven Caching Placement Strategy." In 2024 6th International Conference on Computer Communication and the Internet (ICCCI). IEEE, 2024. http://dx.doi.org/10.1109/iccci62159.2024.10674657.

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

Song, Jaeyoung, Hojin Song, and Wan Choi. "Optimal caching placement of caching system with helpers." In 2015 IEEE International Conference on Signal Processing for Communications (ICC). IEEE, 2015. http://dx.doi.org/10.1109/icc.2015.7248590.

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

Rao, Jun, Hao Feng, Chenchen Yang, Zhiyong Chen, and Bin Xia. "Optimal caching placement for D2D assisted wireless caching networks." In ICC 2016 - 2016 IEEE International Conference on Communications. IEEE, 2016. http://dx.doi.org/10.1109/icc.2016.7511410.

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

Yang, Shiyu, Shaoshuai Fan, Gang Deng, and Hui Tian. "Local Content Cloud based Cooperative Caching Placement for Edge Caching." In 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). IEEE, 2019. http://dx.doi.org/10.1109/pimrc.2019.8904138.

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

Chedia, Jarray, and Chibani Belgacem. "Optimal caching placement in D2D networks." In 2018 International Conference on Advanced Systems and Electric Technologies (IC_ASET). IEEE, 2018. http://dx.doi.org/10.1109/aset.2018.8379856.

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

Peng, Xi, Juei-Chin Shen, Jun Zhang, and Khaled B. Letaief. "Backhaul-Aware Caching Placement for Wireless Networks." In GLOBECOM 2015 - 2015 IEEE Global Communications Conference. IEEE, 2014. http://dx.doi.org/10.1109/glocom.2014.7417343.

Full text
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!