A Collaborative Caching Method Based on Popularity Prediction in Named Data Networks

A named data network and collaborative caching technology, applied in the future network field, can solve the problems of idleness and waste of cache space in the network, save storage space, improve hit rate, and reduce request delay.

Active Publication Date: 2019-04-09
CHONGQING UNIV OF POSTS & TELECOMM
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The above strategy only stores content indiscriminately in a small number of locations, and the rest of the nodes with poor locations will be idle, resulting in a waste of cache space in the network

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Collaborative Caching Method Based on Popularity Prediction in Named Data Networks
  • A Collaborative Caching Method Based on Popularity Prediction in Named Data Networks
  • A Collaborative Caching Method Based on Popularity Prediction in Named Data Networks

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0026] The technical solutions in the embodiments of the present invention will be described clearly and in detail below with reference to the drawings in the embodiments of the present invention. The described embodiments are only some of the embodiments of the invention.

[0027] 1. If figure 1 Shown is the flow chart of content popularity prediction. The node request arrival rate generally adopts the Poisson distribution, while the content distribution in the entire network conforms to the zipf distribution. That is, the 28th distribution, the top 20% of the content in the network can satisfy 80% of the requests in the network. As shown in the following formula:

[0028] C is a constant

[0029] p(i) represents the frequency of occurrence of content corresponding to i, and i represents the order of all content sorting, and the sorting is arranged in order of the frequency of occurrence of the content, from high to low. Then the probability that the content sorted by ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention requests protection of a collaborative caching method based on popularity prediction in a named data network. When storing content in a named data network (Named Data Networking, NDN), multiple caching strategies along the path or caching strategies at important nodes are used to cause This ensures high redundancy of node data in the network and low utilization of cache space. This paper adopts the method of "partial collaborative caching". First, after predicting the future popularity of the content, each node allocates an optimal proportion of cache space as a local cache space to store highly popular content. The remaining part of each node stores content with relatively low popularity through neighborhood cooperation. The optimal space division ratio is calculated by considering the number of hops that the Interest packet hits the node in the network and the server-side request hits. Compared with the traditional cache strategy, this method increases the utilization rate of the cache space in the network, reduces the cache redundancy in the network, improves the cache hit rate of the nodes in the network, and improves the performance of the entire network.

Description

technical field [0001] The invention is a research on the cache strategy in the named data network, and belongs to the technical field of the future network. In particular, it involves the prediction mechanism of content popularity in the network, the cooperative caching strategy between neighboring nodes, and the division method of the node cache space ratio. Background technique [0002] With the rapid development of Internet technology and applications, "broadband", "content" and "personalization" have become the main theme of network development. People's demand for data content is becoming stronger and stronger. Service evolution transfer. According to Cisco's prediction, all content-related traffic on the Internet will account for more than 97.5% by 2016, and the traditional host-centric network architecture cannot meet the development requirements of current network information services. For this reason, Information-Centric Networking (ICN), as a revolutionary futur...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): H04L29/08
CPCH04L67/568H04L67/5681H04L67/5682H04L67/63
Inventor 刘期烈秦庆伟夏远鹏李云冯志宇刘竞成李国军
Owner CHONGQING UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap