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

Efficient CDN fragment refreshing method

An efficient and fragmented technology, applied in electrical components, transmission systems, etc., can solve the problems of huge total request volume, long total time consumption, and increased system pressure, so as to improve throughput, reduce average time consumption, and improve overall performance Effect

Active Publication Date: 2021-11-23
杭州又拍云科技有限公司
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] 1) The total refresh time is long. When refreshing resource fragments, it is necessary to wait until each fragment is refreshed before the resource can be refreshed;
[0005] 2) Fragment refresh causes "request storm" and increases system pressure. If a large number of resources need fragment refresh during batch refresh, the total refresh requests will be very large and form "request storm", which increases the load on the system. pressure

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
  • Efficient CDN fragment refreshing method
  • Efficient CDN fragment refreshing method
  • Efficient CDN fragment refreshing method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0049] Embodiment 1: As shown in Figure 1, this embodiment includes a slice calculation formula module and a KV cache system. When the refresh request is sent, the CDN system will request the origin site to obtain the latest resource of the original URL, and then send the resource to the shard calculation formula module to calculate the shard of the resource. Finally, the latest resources are cached in the KV cache system according to the results of the sharding calculation formula.

Embodiment 2

[0050] Example 2: See figure 2 , the calculation method of the shard calculation formula in Embodiment 1, comprising the following steps:

[0051] 1. Determine the size dataSize of the resource according to the attribute of the resource;

[0052] 2. If limitSize is carried in the header of the refresh request and limitSize is greater than defaultSize, use limitSize as the slice size sliceSize, otherwise use defaultSize as the slice size sliceSize;

[0053] 3. If middleNum, the quotient of dataSize divided by sliceSize, is equal to 1, it means that the resources are too small to be sliced;

[0054] 4. If the quotient middleNum of dataSize divided by sliceSize is greater than 1, there are two cases:

[0055] a. The quotient middleNum is an integer, then the quotient is the resource slice number sliceNum;

[0056] b. If the quotient middleNum is a decimal, add 1 to the integer part roundNum of the quotient middleNum as the number of resource fragments.

Embodiment 3

[0057] Example 3: If image 3 As shown, storing in the cache system includes the following steps:

[0058] 1. According to whether the operation result of the shard calculation formula is equal to 1, there are two cases:

[0059] 1) The result of the operation is equal to 1, the resource is too small and can be refreshed directly without sharding;

[0060] 2) If the operation result is greater than 1, it can be divided into two cases according to whether the operation result is an integer:

[0061] a) The operation result is an integer, and the size of each slice is sliceSize;

[0062] b) The operation result is a decimal, the size of the last slice is: dataSize – roundNum *SliceSize, and the size of the remaining slices is sliceSize;

[0063] 2. Generate the corresponding hash value as the etag of the fragment according to the content of the fragment;

[0064] 3. Each fragment uses "original URL + fragment etag + fragment ID" as the key value and the fragment resource as ...

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 invention discloses an efficient CDN refreshing fragmentation method, and the method comprises the following steps: when a content delivery network caches resource data, fragmenting the resource data to obtain fragmentation number (sliceNum); calculating the size of each piece of resources according to the number of the pieces of the resources to obtain the sizes of the pieces of the resources; fragmenting the resource data, and then generating a corresponding hash value for the resource content corresponding to each fragment after fragmentation to serve as the hash value of the fragment; updating the cache by taking the original URL, the hash value and the serial number ID of each fragment as key values and the fragment resources as values, and storing the fragment cache into a cache storage system for caching to finish refreshing. According to the method, the resources can be automatically fragmented according to the size of the resources and the capacity of the server, the burden of operators is reduced, the resources are utilized more reasonably, and meanwhile, the fragmentation only needs to be refreshed once during refreshing, so the refreshing efficiency is greatly improved.

Description

technical field [0001] The invention relates to the field of CDN refreshing fragments, in particular to an efficient method for CDN refreshing fragments. Background technique [0002] CDN (Content Delivery Network), that is, content distribution network, aims to solve the bottleneck of Internet data transmission. By caching resource data at each edge node, users can directly obtain resources in the cache of the nearest edge node, avoiding going to the source station, and reducing user traffic. The time spent in network transmission. [0003] When CDN caches resource data, it will fragment resource data that is too large. When the cache resource needs to be refreshed, the current open source server will refresh each fragment of the cache resource. There are following defects in this scheme: [0004] 1) The total refresh time is long. When refreshing resource fragments, it is necessary to wait until each fragment is refreshed before the resource can be refreshed; [0005] ...

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 Applications(China)
IPC IPC(8): H04L29/08
CPCH04L67/5651H04L67/5682Y02D30/50
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