Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Content Caching Method Based on Social Relationship

A social relationship and content caching technology, applied in the field of content caching based on social relationships, can solve the problem of heavy burden on important nodes

Active Publication Date: 2021-05-11
江苏有线数据网络有限责任公司
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The problem is that important nodes are often fixed and do not change dynamically with the network topology and content popularity, resulting in the overload of some important nodes

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 Content Caching Method Based on Social Relationship
  • A Content Caching Method Based on Social Relationship
  • A Content Caching Method Based on Social Relationship

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0036] Embodiment 1 of the present invention provides a content caching method based on social relations, such as figure 1 shown, including:

[0037] Step 11: Initialize, establish a content social relationship matrix according to the network topology and the user's social relationship;

[0038] Exemplarily, assuming that there are m nodes in the entire network, the initially established content social relationship matrix is:

[0039]

[0040] Among them, the matrix changes dynamically with the change of social relations, U c is the content social relationship matrix, and the cache for content c (that is, the Interest package) is determined by this matrix; u ij Indicates the relative importance of nodes, i.e. the importance of i to j, I i Indicates the importance of the node itself of node i, and the importance of node i itself is determined by the social relationship of the node.

[0041] Step 12: When a request node needs to request content, search for the node that c...

Embodiment 2

[0047] Embodiment 2 of the present invention is a preferred embodiment of the present invention, specifically including:

[0048] In this embodiment, the network controller maintains the content social relationship matrix, sorts the nodes according to their own importance from high to low in advance, and selects a preset number of nodes (for convenience of description, the preset number is defined as L here) as nodes. global important nodes;

[0049] The value of L is determined according to the importance of the content β and the total number of nodes in the entire network m, that is, L=β*m, and the value of L is adjusted according to the needs of network users for content.

[0050] During routing and forwarding, when a globally important node is encountered, a copy of the request content is kept in the cache space of the globally important node;

[0051] Preferably, a counter is maintained in the network to record the number of copies reserved, and after each copy is reserv...

Embodiment 3

[0064] Embodiment 3 of the present invention describes the characteristics of nodes in detail, including:

[0065] Node characteristics include node betweenness, node self-importance and node relative importance;

[0066] Node betweenness: if the shortest path (distance) between a pair of nodes has g jk bar with g jk (i) item passes through node i, then the contribution of node i to this pair of nodes is g jk (i) / g jk , add up the contribution of node i to all node pairs and divide by the total number of node pairs, you can get the betweenness B of node i i ,Right now

[0067]

[0068] Node self-importance: Indicates the comprehensive importance of node i in the entire network for content c; according to the node betweenness and the user's own interest preference, the user's own importance I of content c is calculated i ,Specifically:

[0069] I i =B i ψ(i,c)

[0070] I i The larger the value of , the more preferred the node i is to the content c, and the stronger...

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 application provides a content caching method based on social relationships, including: establishing a content social relationship matrix according to network topology and user social relationships; when a request node needs to request content, search layer by layer according to the content social relationship matrix A node that caches the requested content; if there is a hit node in the content social relationship matrix, forward the cached requested content from the hit node to the requesting node via an original route. The technical solution provided by the present invention is combined with user social relationship factors to help users share content, thereby improving the efficiency of content distribution.

Description

technical field [0001] The invention belongs to the field of computer communication networks, and relates to a content caching technology under the framework of an information center network, in particular to a content caching method based on social relations. Background technique [0002] The communication network has developed into a network that mainly focuses on content distribution and retrieval, while network technology still only involves the connection between hosts. In order to accelerate the distribution of content, existing research has proposed a future network architecture with content as the core - Information-Centric Network (ICN). ICN retrieves content by name and performs routing and forwarding. In an ICN, each ICN router has a cache space that caches data passing through it. Such caching strategies in the web have been extensively studied and greatly reduce the time for content retrieval. [0003] The existing D2D cache-based content distribution methods...

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/5682H04L67/568H04L67/63
Inventor 苑贵全
Owner 江苏有线数据网络有限责任公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com