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 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 Void Avoidance Opportunistic Routing Protocol for Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1942
Author(s):  
Rogaia Mhemed ◽  
Frank Comeau ◽  
William Phillips ◽  
Nauman Aslam
Keyword(s):  
Sensor Networks ◽  
Routing Protocol ◽  
Opportunistic Routing ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Underwater Sensor Networks ◽  
Network Resources ◽  
Hop Count ◽  
Intermediate Node ◽  
Packet Delivery

Much attention has been focused lately on the Opportunistic Routing technique (OR) that can overcome the restrictions of the harsh underwater environment and the unique structures of the Underwater Sensor Networks (UWSNs). OR enhances the performance of the UWSNs in both packet delivery ratio and energy saving. In our work; we propose a new routing protocol; called Energy Efficient Depth-based Opportunistic Routing with Void Avoidance for UWSNs (EEDOR-VA), to address the void area problem. EEDOR-VA is a reactive OR protocol that uses a hop count discovery procedure to update the hop count of the intermediate nodes between the source and the destination to form forwarding sets. EEDOR-VA forwarding sets can be selected with less or greater depth than the packet holder (i.e., source or intermediate node). It efficiently prevents all void/trapped nodes from being part of the forwarding sets and data transmission procedure; thereby saving network resources and delivering data packets at the lowest possible cost. The results of our extensive simulation study indicate that the EEDOR-VA protocol outperforms other protocols in terms of packet delivery ratio and energy consumption

scholarly journals Method of intelligent content management in mobile networks

2020 ◽  
Vol 68 (3) ◽  
Author(s):  
T. A. Maksymyuk ◽  
◽  
B. P. Shubyn ◽  
V. S. Andrushchak ◽  
S. S. Dumych ◽  
...  
Keyword(s):  
User Experience ◽  
Mobile Networks ◽  
Network Performance ◽  
Mobile Network ◽  
Content Management ◽  
Dark Side ◽  
Multimedia Content ◽  
Physical Constraints ◽  
Content Caching ◽  
Content Popularity

With the advent of 5G, the market has been expecting the immersive user experience with rich multimedia content. Meeting such requirements within the physical constraints of limited spectrum and infrastructure availability is a challenging task, which prevents operators to scale their services properly. Currently, mobile operators are forced to invest large amount of money in their infrastructure, in order to maximize the capacity by network densification and higher frequency reuse factors. The dark side of such trend is that infrastructure becomes more expensive, spectrum price is getting higher and total cost of ownership for operator increases drastically. Nowadays, with the rise of artificial intelligence, cloud and edge computing the network becomes more flexible that opens many opportunities to enhance the performance and user experience. In this paper, we propose a new approach for content management in mobile network by using predictive caching of rich multimedia content in edge servers. Proposed approach is based on the content popularity prediction by using recurrent neural networks, that allows to deliver corresponding content in the close proximity to the target end users by the time it will be needed. Simulation results show that the proposed model is more than 90% accurate for both daily and weekly timeframes. Furthermore, we develop a method of personalized content caching in user devices based on their subscriptions and preferences, to make sure that user will have the best experience. Proposed approach for content management allows to improve the overall network performance by proactive content caching during the time of low network load. Moreover, the proactive caching allows to download the content in the best quality, regardless of the network congestions and bottlenecks.

scholarly journals The integration research of pre-multicast method and adaptive routing protocol with random network coding based on the OMNeT++ platform

2018 ◽  
Vol 189 ◽  
pp. 04007
Author(s):  
Qing Nie ◽  
Kai Song ◽  
Fei Gao
Keyword(s):  
Network Coding ◽  
Routing Protocol ◽  
Network Performance ◽  
Random Network ◽  
Adaptive Routing ◽  
Network Resources ◽  
Random Network Coding ◽  
Intermediate Node ◽  
Network Topologies ◽  
Network Transmission

In this paper, both the pre-multicast method and the adaptive routing protocol are proposed. The random network coding with these protocols are not only more stable and reliable, but also improves the utilization of network resources. According to the function of the nodes in the network, this paper establishes the source node model, the intermediate node model and the sink node model based on the OMNeT++ simulation platform. In particular, in this paper, both pre-multicast and adaptive routing modules are combined in the node model. By the simulation, using or not using both pre-multicast module and adaptive routing module in the network transmission module, the network transmission reliability is analyzed. The network performance, such as delay and effective throughput, is evaluated to verify the expected results. Because the designed node models are independent of each other, they can be applied to most real network topologies. Researchers can also modify a module of a model or improve an algorithm to achieve more complex functions according to their own needs.

scholarly journals Node Value and Content Popularity-Based Caching Strategy for Massive VANETs

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Jinyuan Gu ◽  
Yancheng Ji ◽  
Wei Duan ◽  
Guoan Zhang
Keyword(s):  
High Speed ◽  
Network Performance ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Smart Cities ◽  
Dynamic Environment ◽  
Privacy And Security ◽  
Hop Count ◽  
Caching Strategy ◽  
Content Popularity

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 observations, this article proposes a caching strategy based on the node value and content popularity (NVCP) for the massive VANET scenario. In the proposed NVCP scheme, different from the traditional caching strategies, we evaluate the node value from three aspects: the connectivity, intermediary, and eigenvector centralities, synthetically, since the content with different types of popularity is placed in nodes with different values, resulting in the redundancy deterioration and diversity improvement for the content. The proposed caching strategy is evaluated by the stochastic network topology with multifactors, which provides different impacts on the system performance. Simulation results show that the NVCP outperforms the traditional cache strategies for 6G-CCN in terms of the cache hit ratio, average hop count, and transmission latency. Moreover, placing the content in the neighbor nodes is also introduced to further improve the utilization of the cache space and achieve better cache performance.

scholarly journals An Effective Fairness Scheme for Named Data Networking

Electronics ◽  
2020 ◽  
Vol 9 (5) ◽  
pp. 749
Author(s):  
Hammad Zafar ◽  
Ziaul Haq Abbas ◽  
Ghulam Abbas ◽  
Fazal Muhammad ◽  
Muhammad Tufail ◽  
...  
Keyword(s):  
Interest Rates ◽  
Future Internet ◽  
High Volume ◽  
Named Data Networking ◽  
Network Resources ◽  
Network Nodes ◽  
Network Routers ◽  
Rate Shaping ◽  
Network Topologies ◽  
Data Networking

Named data networking (NDN) is a revolutionary approach to cater for modern and future Internet usage trends. The advancements in web services, social networks and cloud computing have shifted Internet utilization towards information delivery. Information-centric networking (ICN) enables content-awareness in the network layer and adopts name-based routing through the NDN architecture. Data delivery in NDN is receiver-driven pull-based and governed by requests (interests) sent out by the receiver. The ever-increasing share of high-volume media streams traversing the Internet due to the popularity and availability of video-streaming services can put a strain on network resources and lead to congestion. Since most congestion control techniques proposed for NDN are receiver-based and rely on the users to adjust their interest rates, a fairness scheme needs to be implemented at the intermediate network nodes to ensure that “rogue” users do not monopolize the available network resources. This paper proposes a fairness-based active queue management at network routers which performs per-flow interest rate shaping in order to ensure fair allocation of resources. Different congestion scenarios for both single path and multipath network topologies have been simulated to test the effectiveness of the proposed fairness scheme. Performance of the scheme is evaluated using Jain’s fairness index as a fairness metric.

scholarly journals False Data Filtering Strategy in Wireless Sensor Network Based on Neighbor Node Monitoring

2017 ◽  
Vol 13 (03) ◽  
pp. 174
Author(s):  
Haishan Zhang ◽  
Xinchun Wang ◽  
Chenghui Jia
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Simulation Experiment ◽  
Wireless Sensor ◽  
Network Node ◽  
Malicious Node ◽  
Data Filtering ◽  
Font Size ◽  
Network Resources ◽  
Intermediate Node

<span style="font-family: 'Times New Roman',serif; font-size: 12pt; mso-fareast-font-family: SimSun; mso-fareast-theme-font: minor-fareast; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;">The injection attack of false data is a common attack form in wireless sensor network. This attack form achieves the purpose of consuming limited network resources and severely threatens the safety of wireless sensor network through consistent sending false data. This paper proposes a type of false data filtering strategy based on neighbor node monitoring. The idea of this strategy is to enable each node to store the neighbor node's information within the two-hop range. In the meantime, the data package determines whether the upstream node is original node or data forwarding intermediate node through whether ACK package is remitted by the upstream node to avoid the impersonation of wireless sensor network node by malicious node. The false data package of malicious node will be filtered within one hop. The simulation experiment verifies the filtering performance and anti-capture performance of this strategy, thus guaranteeing the safety of wireless sensor network.</span>

scholarly journals A Device-to-Device Multicast Scheme for Delay-Constraint Content Delivery

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Yanli Xu
Keyword(s):  
Network Performance ◽  
Content Delivery ◽  
D2d Communication ◽  
Delay Constraint ◽  
Delay Constraints ◽  
Content Caching ◽  
Multiple Users ◽  
Device To Device ◽  
Resource Cost ◽  
Multicast Scheme

Motivated by the explosive increase of mobile traffic, study on the device-to-device (D2D) communication is kicked off for content delivery through proximal transmission among users. D2D multicast has advantage on serving multiple users simultaneously with less resource cost. However, when D2D multicast is appropriate for content delivery and how to make it serve delay-constraint traffic are still unclear. In this paper, parameters impacting on D2D multicast content delivery is investigated to find good chances for utilizing D2D multicast. Furthermore, some rules to be obeyed are proposed for the content caching and delivery of D2D multicast to satisfy delay constraints. Based on these analyses, a delay-aware multicast scheme is proposed to maximize the network performance utility while satisfying delay constraints of contents. Simulations results verify our analyses and show that the proposed scheme can significantly improve multicast efficiency with guaranteed delay.

scholarly journals A Smart Congestion Control Mechanism for the Green IoT Sensor-Enabled Information-Centric Networking

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2889 ◽  
Author(s):  
Rungrot Sukjaimuk ◽  
Quang Nguyen ◽  
Takuro Sato
Keyword(s):  
Congestion Control ◽  
Network Performance ◽  
Control Mechanism ◽  
Real Life ◽  
Future Internet ◽  
Global Scale ◽  
Information Centric Networking ◽  
Internet Architecture ◽  
Content Popularity ◽  
Congestion Control Mechanism

Information-Centric Networking (ICN) is a new Internet architecture design, which is considered as the global-scale Future Internet (FI) paradigm. Though ICN offers considerable benefits over the existing IP-based Internet architecture, its practical deployment in real life still has many challenges, especially in the case of high congestion and limited power in a sensor enabled-network for the Internet of Things (IoT) era. In this paper, we propose a smart congestion control mechanism to diminish the network congestion rate, reduce sensor power consumptions, and enhance the network performance of ICN at the same time to realize a complete green and efficient ICN-based sensor networking model. The proposed network system uses the chunk-by-chunk aggregated packets according to the content popularity to diminish the number of exchanged packets needed for data transmission. We also design the sensor power-based cache management strategy, and an adaptive Markov-based sensor scheduling policy with selective sensing algorithm to further maximize power savings for the sensors. The evaluation results using ndnSIM (a widely-used ICN simulator) show that the proposed model can provide higher network performance efficiency with lower energy consumption for the future Internet by achieving higher throughput with higher cache hit rate and lower Interest packet drop rate as we increase the number of IoT sensors in ICN.

Sign in / Sign up

Export Citation Format

Share Document