scholarly journals Optimal Content Caching in Content-Centric Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-15 ◽  
Author(s):  
Faiza Qazi ◽  
Osman Khalid ◽  
Rao Naveed Bin Rais ◽  
Imran Ali Khan ◽  
Atta ur Rehman Khan
Keyword(s):  
Optimal Placement ◽  
Bandwidth Utilization ◽  
Network Resources ◽  
Content Centric Networking ◽  
Content Caching ◽  
Network Cost ◽  
Network Utilization ◽  
Content Popularity ◽  
Content Availability ◽  
Edge Based

Content-Centric Networking (CCN) is a novel architecture that is shifting host-centric communication to a content-centric infrastructure. In recent years, in-network caching in CCNs has received significant attention from research community. To improve the cache hit ratio, most of the existing schemes store the content at maximum number of routers along the downloading path of content from source. While this helps in increased cache hits and reduction in delay and server load, the unnecessary caching significantly increases the network cost, bandwidth utilization, and storage consumption. To address the limitations in existing schemes, we propose an optimization based in-network caching policy, named as opt-Cache, which makes more efficient use of available cache resources, in order to reduce overall network utilization with reduced latency. Unlike existing schemes that mostly focus on a single factor to improve the cache performance, we intend to optimize the caching process by simultaneously considering various factors, e.g., content popularity, bandwidth, and latency, under a given set of constraints, e.g., available cache space, content availability, and careful eviction of existing contents in the cache. Our scheme determines optimized set of content to be cached at each node towards the edge based on content popularity and content distance from the content source. The contents that have less frequent requests have their popularity decreased with time. The optimal placement of contents across the CCN routers allows the overall reduction in bandwidth and latency. The proposed scheme is compared with the existing schemes and depicts better performance in terms of bandwidth consumption and latency while using less network resources.

scholarly journals QoS Improvement Using In-Network Caching Based on Clustering and Popularity Heuristics in CCN

Sensors ◽  
2021 ◽  
Vol 21 (21) ◽  
pp. 7204
Author(s):  
Sumit Kumar ◽  
Rajeev Tiwari ◽  
Wei-Chiang Hong
Keyword(s):  
Network Performance ◽  
Network Resources ◽  
Hop Count ◽  
Intermediate Node ◽  
Content Centric Networking ◽  
Content Caching ◽  
Placement Decisions ◽  
Network Routers ◽  
Content Popularity ◽  
Content Availability

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 performance. Towards this, a novel content caching scheme is proposed in this paper. The proposed scheme first clusters the network nodes based on the hop count and bandwidth parameters to reduce content redundancy and caching operations. Then, the scheme takes content placement decisions using the cluster information, content popularity, and the hop count parameters, where the caching probability improves as the content traversed toward the requester. Hence, using the proposed heuristics, the popular contents are placed near the edges of the network to achieve a high cache hit ratio. Once the cache becomes full, the scheme implements Least-Frequently-Used (LFU) replacement scheme to substitute the least accessed content in the network routers. Extensive simulations are conducted and the performance of the proposed scheme is investigated under different network parameters that demonstrate the superiority of the proposed strategy w.r.t the peer competing strategies.

scholarly journals Content Management Based on Content Popularity Ranking in Information-Centric Networks

2021 ◽  
Vol 11 (13) ◽  
pp. 6088
Author(s):  
Nazib Abdun Nasir ◽  
Seong-Ho Jeong
Keyword(s):  
Content Management ◽  
Traffic Load ◽  
Access Time ◽  
The Internet ◽  
Network Resources ◽  
Hop Count ◽  
Content Centric Networking ◽  
Content Caching ◽  
Content Popularity ◽  
Networking Technologies

Users can access the Internet anywhere they go at any time due to the advancement of communications and networking technologies. The number of users and connected devices are rapidly increasing, and various forms of content are becoming increasingly available on the Internet. Consequently, several research ideas have emerged regarding the storage policy for the enormous amount of content, and procedures to remove existing content due to the lack of storage space have also been discussed. Many of the proposals related to content caching offer to identify the popularity of certain content and hold the popular content in a repository as long as possible. Although the host-based Internet has been serving its users for a long time, managing network resources efficiently during high traffic load is problematic for the host-based Internet because locating the host with their IP address is one of the primary mechanisms behind this architecture. A more strategical networking paradigm to resolve this issue is Content-Centric Networking (CCN), a branch of the networking paradigm Information-Centric Networking (ICN) that is focused on the name of the content, and therefore can deliver the requested content efficiently, securely, and faster. However, this paradigm has relatively simple content caching and content removal mechanisms, as it caches all the relevant content at all the nodes and removes the content based on the access time only when there is a lack of space. In this paper, we propose content popularity ranking (CPR) mechanism, content caching scheme, and content removal scheme. The proposed schemes are compared to existing caching schemes such as Leave Copy Everywhere (LCE) and Leave Copy Down (LCD) in terms of the Average Hop Count, content removal schemes such as Least Recently Used (LRU) and Least Frequently Used (LFU) in terms of the Cache Hit Ratio, and finally, the CCN paradigm incorporating the LCE and the LRU schemes and the host-based Internet architecture in terms of Content Delivery Time. Graphical presentations of performance results utilizing the proposed schemes show that the proposed CPR-based schemes for content caching and content removal provide better performance than the host-based Internet and the original CCN utilizing LCE and LRU schemes.

scholarly journals PPCS: A Progressive Popularity-Aware Caching Scheme for Edge-Based Cache Redundancy Avoidance in Information-Centric Networks

Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 694 ◽  
Author(s):  
Quang Ngoc Nguyen ◽  
Jiang Liu ◽  
Zhenni Pan ◽  
Ilias Benkacem ◽  
Toshitaka Tsuda ◽  
...  
Keyword(s):  
Communication Networks ◽  
Replacement Policy ◽  
Joint Optimization ◽  
Hit Rate ◽  
Caching Scheme ◽  
Content Popularity ◽  
Entire Object ◽  
Content Availability ◽  
Edge Based ◽  
Over Time

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) along the delivery path over time, according to the content popularity and each CN position. Therefore, PPCS efficiently avoids wasting cache space for storing on-path content duplicates and improves cache diversity by allowing no more than one replica of a specified content to be cached. To enable a complete ICN caching solution for communication networks, we also propose an autonomous replacement policy to optimize the cache utilization by maximizing the utility of each CN from caching content items. By simulation, we show that PPCS, utilizing edge-computing for the joint optimization of caching decision and replacement policies, considerably outperforms relevant existing ICN caching strategies in terms of latency (number of hops), cache redundancy, and content availability (hit rate), especially when the CN’s cache size is small.

scholarly journals Blocking Probability in Pipeline Forwarding Networks

2014 ◽  
Vol 10 (1) ◽  
pp. 30
Author(s):  
Mario Baldi ◽  
Andrea Vesco
Keyword(s):  
Proper Time ◽  
Blocking Probability ◽  
Network Routing ◽  
Analytical Models ◽  
Network Resources ◽  
High Resource ◽  
Delay Sensitive ◽  
Network Utilization ◽  
Real Size ◽  
Time Frames

As multimedia communications continue to grow steadily on the Internet, pipeline forwarding (PF) of packets provides a scalable solution for engineering delay-sensitive traffic while guaranteeing deterministic Quality of Service (QoS) with high resource utilization. In PF networks resource reservation, while ensuring deterministic QoS on a per-flow basis, can result in a not null blocking probability. A reservation request may fails due to enough resources being available but not during the proper time frames. This work analyses blocking probability of reservation requests since it affects the capability of utilizing network resources to carry traffic with deterministic QoS. The blocking probability and, consequently, the achievable network utilization are analytically derived on general topology PF networks as function of the traffic intensity given the traffic matrix and the network routing. The correctness of the blocking models is also assessed by simulation in different scenarios. This work represent a valuable contribution over previous analytical models of the blocking probability as their application to real size scenarios is impractical due to their computation complexity.

scholarly journals An Edge-Based Approach for Virtual Network Embedding Based on the Graph Edit Distance

2021 ◽  
Author(s):  
Ze Xi Xu ◽  
Lei Zhuang ◽  
Meng Yang He ◽  
Si Jin Yang ◽  
Yu Song ◽  
...  
Keyword(s):  
Edit Distance ◽  
Virtual Network ◽  
Cost Ratio ◽  
Virtual Network Embedding ◽  
Network Embedding ◽  
Graph Edit Distance ◽  
Network Resources ◽  
Network Resource ◽  
Distance Method ◽  
Edge Based

Abstract Virtualization and resource isolation techniques have enabled the efficient sharing of networked resources. How to control network resource allocation accurately and flexibly has gradually become a research hotspot due to the growth in user demands. Therefore, this paper presents a new edge-based virtual network embedding approach to studying this problem that employs a graph edit distance method to accurately control resource usage. In particular, to manage network resources efficiently, we restrict the use conditions of network resources and restrict the structure based on common substructure isomorphism and an improved spider monkey optimization algorithm is employed to prune redundant information from the substrate network. Experimental results showed that the proposed method achieves better performance than existing algorithms in terms of resource management capacity, including energy savings and the revenue-cost ratio.

scholarly journals An Improved Flooding Routing Protocol for Wireless Sensor Networks Based on Network-Coding

2018 ◽  
Vol 17 ◽  
pp. 02001
Author(s):  
Churan Tang ◽  
Linghua Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Coding ◽  
Routing Protocol ◽  
Network Reliability ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Bandwidth Utilization ◽  
Network Utilization ◽  
Save Energy

A central question in wireless sensor network research is how to reduce the consumption of the energy of the sensor nodes. Theoretically, the network coding technology proposed by Ahlswede et al (2000) can improve the network reliability and network throughput, increase the robustness and save energy. Based on the classic flooding routing protocol, the present study proposes a new flooding control protocol, i.e. NC-Flooding for wireless sensor networks. NC-Flooding protocol introduces five mechanisms to enhance the efficiency of wireless sensor networks. As shown by MATLAB simulation results, NC-Flooding protocol reduces the number of broadcasts of wireless sensor networks, increases the throughput of the network and increases the bandwidth utilization. We conclude that NC-Flooding protocol reduces data forwarding cost and node energy consumption and extends nodes’ life cycle, thus increasing network utilization.

scholarly journals An Efficient Network Resource Management in SDN for Cloud Services

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1556
Author(s):  
Myunghoon Jeon ◽  
Namgi Kim ◽  
Yehoon Jang ◽  
Byoung-Dai Lee
Keyword(s):  
Cloud Services ◽  
Computing Technology ◽  
Network Efficiency ◽  
Network Resources ◽  
Network Resource ◽  
Service Flow ◽  
Network Utilization ◽  
Network Resource Management ◽  
Flow Information

With the recent advancements in cloud computing technology, the number of cloud-based services has been gradually increasing. Symmetrically, users are asking for quality of experience (QoE) to be maintained or improved. To do this, it has become necessary to manage network resources more efficiently inside the cloud. Many theoretical studies for improving the users’ QoE have been proposed. However, there are few practical solutions due to the lack of symmetry between implementation and theoretical researches. Hence, in this study, we propose a ranking table-based network resource allocation method that dynamically allocates network resources per service flow based on flow information periodically collected from a software defined network (SDN). It dynamically identifies the size of the data transmission for each service flow on the SDN and differentially allocates network resources to each service flow based on this size. As a result, it maintains the maximum QoE for the user by increasing the network utilization. The experimental results show that the proposed method achieves 29.4% higher network efficiency than the general Open Shortest Path First (OSPF) method on average.

scholarly journals Group-Interest-Based Verifiable CCN

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
DaeYoub Kim
Keyword(s):  
The Internet ◽  
Content Centric Networking ◽  
Verification Method ◽  
Content Caching ◽  
Group Interest ◽  
Transmission Process ◽  
Service Delay ◽  
Caching Scheme ◽  
Verification Process ◽  
Networking Architectures

To solve various problems of the Internet, content centric networking (CCN), one of information centric networking architectures (ICN), provides both an in-network content caching scheme and a built-in content verification scheme. However, a user is still asked to generate many request messages when retrieving fragmented content through CCN. This model can seriously increase the amount of network traffic. Furthermore, when receiving content, a user is asked to verify the received content before using it. This verification process can cause a serious service delay. To improve such inefficiencies, this paper proposes a transmission process to handle request messages at one time. Also, it suggests an efficient content verification method using both hash chains and Merkel-hash tree.

scholarly journals New Efficient Caching Strategy based on Clustering in Named Data Networking

2019 ◽  
Vol 13 (12) ◽  
pp. 104
Author(s):  
Nour El Houda Fethellah ◽  
Hafida Bouziane ◽  
Abdallah Chouarfia
Keyword(s):  
Selection Process ◽  
Cluster Head ◽  
Global Network ◽  
Network Clustering ◽  
Named Data Networking ◽  
Network Resources ◽  
Content Centric Networking ◽  
Multi Attribute Decision Making ◽  
Novel Strategy ◽  
Data Networking

<p>The Named Data Networking NDN is one of the most proposed architecture for the new model of Internet communications based on contents distribution, called Information-Centric Network ICN. It is widely accepted by the research community since it has become dominant in ICN design that resolves TCP-IP based Internet problems such as bandwidth, delay, location dependent and congestion. Based on location host IP addresses, TCP-IP designed for Peer-to-Peer communication P2P. NDN architecture is oriented Content Centric Networking CCN, where the data is stored on routers and distributed to users from the nearest router.  Cache capacities of routers are limited compared to forwarded contents. To move from TCP-IP model to CCN model, many papers propose several new contents distribution based architecture ICN. In this paper, we propose a novel strategy to optimize the use of network resources inspired from Network clustering and cluster head selection in MANETs. Specifically, the improved K-medoids cluster algorithm is used to divide the global network in clusters, where for each cluster; three routers are selected as content routers. The first is the main caching router as well as the second and the third are the secondary caching router. The caching router selection process relies on three relevant criteria consisting of the distance between a node and its cluster centroid, the number of neighbors, and the congestion level. Two Multi Attribute Decision–Making methods MADM are applied, namely TOPSIS and AHP. Performance analysis of our proposed strategy with the established criteria showed  � its effectiveness and strong potential.<em></em></p>

Sign in / Sign up

Export Citation Format

Share Document