CN101179494A - Resource distribution method facing to network multimedia transmission service - Google Patents

Resource distribution method facing to network multimedia transmission service Download PDF

Info

Publication number
CN101179494A
CN101179494A CNA2007101644650A CN200710164465A CN101179494A CN 101179494 A CN101179494 A CN 101179494A CN A2007101644650 A CNA2007101644650 A CN A2007101644650A CN 200710164465 A CN200710164465 A CN 200710164465A CN 101179494 A CN101179494 A CN 101179494A
Authority
CN
China
Prior art keywords
file
server
list
multimedia resource
backup
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CNA2007101644650A
Other languages
Chinese (zh)
Other versions
CN101179494B (en
Inventor
陆系群
徐挺
吴哲锋
何辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jincheng Technology Co ltd
Original Assignee
Zhejiang University ZJU
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang University ZJU filed Critical Zhejiang University ZJU
Priority to CN2007101644650A priority Critical patent/CN101179494B/en
Publication of CN101179494A publication Critical patent/CN101179494A/en
Application granted granted Critical
Publication of CN101179494B publication Critical patent/CN101179494B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a resource distribution method of network multimedia transmission service-orientated. According to number of network proxy servers, available space and size of the multimedia resource, an initial distribution method is adopted to distribute all resources restored in a central node into the proxy node; according to a visiting frequency, namely, a click rate of users in the multimedia resource, a backup number of the multimedia resource in the proxy server is adjusted regularly and dynamically. For a limit of the space, the space of a document with low click rate is replaced by the space of the document with high click rate. The invention adopts the dynamic programming method to select the replaced multimedia resource taking a transmission price generated by possible rebounding of a click rate in the near future as an optimization aim , and a blind and unpractical adjustment which is able to cause a consumption of network transmission bandwidth is avoided, and a rationality of the multimedia resource distribution in the network proxy server and a quality of the multimedia network transmission service are improved.

Description

The resource distribution method of network-oriented multimedia transmission service
Technical field
The present invention relates to a kind of resource distribution method of network-oriented multimedia transmission service.
Background technology
Along with popularizing of Internet development and multimedia service, the problem of transmission bandwidth bottleneck becomes the principal contradiction in network-multimedia application field.(Content Delivery Network, CDN) (Peer to Peer, P2P) grade is the New-generation distributed network technology in order to address these problems to content distributing network for technology and peer-to-peer network transmission technology.But with regard to present network environment and technology, they the two all exist the part defective.Content distributing network can be distributed to resource network edge node to improve user capture speed and user admission quantity; but similar user behavior can cause the agent node memory contents similar on the overall situation; there is the situation of " not hitting " in Shi Changhui, at this time needs to ask for resource and cause the CDN network transmission efficiency to descend to total Resource Server.The peer-to-peer network technology is based upon on a kind of acentric freely cover layer network, but this freedom has caused copyright protection unable, and the weakness that network bandwidth occupation rate is high excessively makes it become the most disputed network technology at present.
Summary of the invention
The object of the present invention is to provide a kind of resource distribution method of network-oriented multimedia transmission service, according to size and user's clicking rate of the number of network agent server, free space, multimedia resource, improve the network transmission service quality of multimedia resource.
The technical solution adopted for the present invention to solve the technical problems such as following two steps are formed:
(1) according to the size of the number of network agent server, free space, multimedia resource, adopts the initial distribution method, all resources of storing on the Centroid are distributed on the agent node;
(2) be clicking rate according to the user to the access times of multimedia resource, the cycle is dynamically adjusted the backup number of multimedia resource on acting server, since limited storage space, method of adjustment. will exchange the low shared space of file of clicking rate for the high file of clicking rate.
The initial distribution method is according to the size of number, free space and the multimedia resource of acting server in the real network system, and according to space constraints, promptly the total free space of acting server must be more than or equal to the total size of multimedia resource.Calculate the backup number of each multimedia resource, and adopt file chained list and server chain table method that multimedia resource is distributed on the network agent server.
It is according to the access times (clicking rate) of user to multimedia resource that cycle is dynamically adjusted multimedia resource backup counting method, and exchanges the low shared space of file of clicking rate for the high file of clicking rate.
The beneficial effect that the present invention has is:
(1) comes cycle dynamic optimization adjustment resource on acting server, to distribute the backup number according to number, free space, the size of multimedia resource and the clicking rate of multimedia resource of network agent server, avoid the consumption of blindness and Network Transmission bandwidth that unpractical adjustment causes.
(2) at limited storage space in the multi-media network transmission service system, exchange the low shared space of file of clicking rate for, adopt dynamic programming method to seek optimum alternate file at acting server with the high file of clicking rate.This method is considered and is replaced file at the clicking rate transmission cost that may rebound and be brought in a short time in future simultaneously, with the target function of transmission cost as Dynamic Programming optimization, the realistic system problem that may face in service is rational transmission cost setting.
Description of drawings
Fig. 1 is step 1 a multimedia resource initial distribution flow chart of the present invention.
Fig. 2 dynamically adjusts flow chart in the step 2 multimedia resource cycle of the present invention.
Embodiment
1, the initial distribution flow chart as shown in Figure 1, concrete steps are as follows:
(1) calculate the initial back-up number of each multimedia resource: the number of supposing acting server is n, and every free space (needing not be equal to remaining space) is C 1, C 2..., C nTotal m of multimedia resource, its size is S 1, S 2..., S m, its backup number is N 1, N 2..., N m
Stipulate that each multimedia resource can only put portion at most on an agent node, the backup number of each multimedia resource is directly proportional with the size of this resource:
S 1 N 1 × α 1 = S 2 N 2 × α 2 = S 3 N 3 × α 3 = · · · = S m N m × α m - - - ( 1 )
α wherein 1, α 2..., α mRegulatory factor for each multimedia resource.
The constraints of initial distribution is:
Σ i = 1 n C i = Σ j = 1 m S j × N j - - - ( 2 )
The backup number that can obtain each multimedia resource initial distribution from formula 1 and formula 2 is:
N t = S t / α t Σ j = 1 m ( S j 2 / α j ) × Σ i = 1 n C i , ( 1 ≤ t ≤ m ) - - - ( 3 )
The free space that acting server is total and total multimedia resource size have following relation:
Σ i = 1 n C i = Σ j = 1 m S j + X - - - ( 4 )
Wherein X is more than or equal to zero.
For the backup number that guarantees each multimedia resource more than or equal to 1, i.e. N t〉=1 (1≤t≤m), be tied to form upright just like ShiShimonoseki:
S t / α t Σ j = 1 m ( S j 2 / α j ) × Σ i = 1 n C i ≥ 1
⇒ S t / α t Σ j = 1 m ( S j 2 / α j ) × ( Σ j = 1 m S j + X ) ≥ 1
⇒ X ≥ Σ j = 1 m S j ( S j / S t α j / α t - 1 ) - - - ( 5 )
Order f ( t ) = Σ j = 1 m S j ( S j / S t α j / α t - 1 ) , ( 1 ≤ t ≤ m )
Obtain thus:
Σ i = 1 n C i ≥ Σ j = 1 m S j + f ( t ) max - - - ( 6 )
Get by formula 1 α k = S k S 1 × N 1 N k , ( α 1 = 1 ) , Calculate the bound of the regulatory factor of each multimedia resource backup number thus:
S k S 1 · 1 n ≤ α k ≤ S k S 1 · n - - - ( 7 )
(2) each multimedia resource all has an acting server chained list, has write down the information of the acting server of storing this multimedia resource; A file chained list is all arranged on each acting server in addition, write down the multimedia resource information on this acting server that leaves in.
(3) under initial conditions, there are two chained lists:
File chained list file_List_0: wherein each is<filename, file size, and server chained list (this chain table record have the server of this document backup, be initialized as sky), clicking rate (being initialized as 0) increases backup number (being initialized as 0) 〉.Owing to also do not finish the distribution of file during the file_List_0 initialization, be the multimedia resource listed files so file_List_0 preserves, according to the issuing time ordering of multimedia resource.
Server chained list server_List_0: wherein each is<server capacity, free space, peak use rate, current utilance, file chained list (this chain table record the file that this server had, be initialized as sky) 〉.
(4) with of the issuing time ordering of file chained list, from nearest row front of current time according to each multimedia resource.The traversal that starts anew then, the file size during the institute that adds up simultaneously travel through, when accumulated value during more than or equal to the capacity sum of Servers-all, traversal stops, and simultaneously the data item of remainder is deleted, and obtains file_List_1.
(5) if file_List_1 is not empty, take out first f0 of file_List_1, in file_List_1, delete f0 then.If file_List_1 is empty, then jump to step 7.
(6) for the f0 that takes out from file_List_1, do following processing:
6.1) the initial back-up number of setting each multimedia resource is 2, and these two backups are placed on respectively on the different servers.A backup counter Counter is set, and backup counter Counter initial value is 0.
6.2) with each sorts from big to small according to free space among the server_List_0.
6.3) taking out one from server_List_0, the free space of checking this middle server if condition is set up, then adds the call number of this server whether more than or equal to the size of f0 in the server chained list of multimedia resource f0.In server list, add multimedia resource f0 simultaneously in the listed files of this server, recomputate the current utilance of this server, free space.
6.4) backup counter Counter adds 1.If backup counter Counter=2 then is pressed into the filename of f0 among the successful document queue queue of distribution, jump out circulation, return step 5.Otherwise the pointer in the server_List_0 tabulation moves on to the next item down, returns 6.3 steps.
(7) all elements among the formation queue being ejected, obtain chained list file_List_2, is exactly the chained list of the successful file of distribution.
2, the cycle is dynamically adjusted multimedia resource backup number flow chart as shown in Figure 2, and concrete steps are as follows:
(1) file chained list file_List_2 is sorted from big to small according to clicking rate, traversal then starts anew, add up simultaneously traveled through the item in clicking rate, when accumulated value more than or equal to chained list file_List_2 in all clicking rate summation 80% the time, record current location q, traversal stops then.
(2) duplicate preceding q item among the file_List_2, obtain chained list file_List_3, clicking rate peak α MBe mapped to the corresponding peak N of backup number, conversion coefficient calculates as follows:
Figure S2007101644650D00051
K wherein 0Be regulatory factor, work as K 0Equal at 1 o'clock, the multimedia resource that just is equivalent to the clicking rate maximum has all had the situation of a backup on every station server.
(3) the backup number that each file need increase among the calculation document chained list file_List_3 then
Increase the current backup number of clicking rate * conversion coefficient-this document of backup number=file
The every formation queue1 that is pressed into of chained list file_List_3.
(4) item of deletion from queue1 " increase backup number " smaller or equal to zero if formation is not empty, takes out first f1 (deleting this simultaneously from the queue1 formation) among the queue1.Otherwise jump to step 10.
(5) with chained list server_List_0 according to server clicking rate sort from small to large (summation that the server clicking rate is meant the clicking rate of the All Files on this server), start anew to travel through chained list server_List_0 then, locating file f1 in the file chained list in the item that traverses, if f1 is arranged, then skip this server (because having deposited file f 1 on this server of explanation); Otherwise judge whether the residual memory space of this server enough comes storage file f1 greatly earlier,, then in the listed files of this server, add f1, jump to 9 if condition satisfies.If remaining memory space does not satisfy condition, then need in the file chained list of this server, seek alternate file, storage file f1 is come in their space, search alternate file according to following three steps:
1) not every not the considering among at first every file_List_3.
2) every file backup number equals 1 file and does not consider.
3) utilize dynamic programming algorithm, select optimum alternate file according to clicking rate, file size and backup number.
(6) if can not find alternate file, then jump to step 4.Do not process.
(7) filename of log file f1 is at formation queue2.
(8) and from corresponding server delete the alternate file that chooses, file fl in the replacement.
(9) update service device chained list information and file chained list file_List_0, the information of server chained list server_List_0.The increase backup counter of file f 1 subtracts 1.If the increase of file f 1 backup number equals 0, then jump procedure 4.If be not equal to 0, then file f 1 is pressed into formation queue1, jump to step 4.
(10) adjust according to the record among the formation queue2.
When adopting dynamic programming method on acting server, to seek optimum alternate file, need to consider that this is replaced file at the clicking rate transmission cost that may rebound and be brought in a short time in future, select the optimum alternate file need be according to following condition consideration:
(1) by the file that replaces the file size sum to increase more than or equal to needs;
(2) the backup number of replaced file is high as far as possible;
(3) clicking rate of replaced file is low as far as possible.
Wherein (1) is necessary restrictive condition, and (2) belong to optimal conditions with (3).Condition (2) and (3) are taken all factors into consideration come calculation document to be replaced cost, specifically be calculated as follows:
Existing two file f 1 and f2 need accept or reject between them.Their " click volume ", backup number and file size are respectively that { { B1, B2} is with { click volume maximum in the current All Files is Am for S1, S2} for A1, A2}.
If the f1 file is replaced to new file, in next cycle, the click volume of f1 might be increased to A1 ' (if click volume reduces, not considering), and then when adjusting next time, the backup number that needs to increase just is (k * A1 '-(B1-1)).A1 ' be (therefore, the average backup number that increases is for A1, any number in Am) interval:
1 Am - A 1 Σ j = 1 Am - A 1 ( k × j - B 1 + 1 )
= 1 Am - A 1 [ k ( Am - A 1 ) ( 1 + Am - A 1 ) 2 + ( 1 - B 1 ) ( Am - A 1 ) ] - - - ( 9 )
= k 2 + k × Am 2 + 1 - k × A 1 2 - B 1
The cost that formula 9 is produced for alternate file f1.In like manner, replacing the issuable cost of f2 is k 2 + k × Am 2 + 1 - k × A 2 2 - B 2 , As the weights item.To any file f i, these weights are counted The target of problem then is Σ i ∈ F * v ~ i → min .

Claims (4)

1. the resource distribution method of network-oriented multimedia transmission service is characterized in that being made up of following two steps:
(1) according to the size of the number of network agent server, free space, multimedia resource, adopts the initial distribution method, all resources of storing on the Centroid are distributed on the agent node;
(2) be clicking rate according to the user to the access times of multimedia resource, the cycle is dynamically adjusted the backup number of multimedia resource on acting server, since limited storage space, method of adjustment. will exchange the low shared space of file of clicking rate for the high file of clicking rate.
2. the resource distribution method of a kind of network-oriented multimedia transmission service according to claim 1, it is characterized in that: described employing initial distribution method, be that the initial distribution concrete steps are as follows according to the size of number, free space and the multimedia resource of acting server in the real network system:
(1) calculate the initial back-up number of each multimedia resource: the number of supposing acting server is n, and every free space is less than or equal to remaining space, is C 1, C 2..., C nTotal m of multimedia resource, its size is S 1, S 2..., S m, its backup number is N 1, N 2..., N m
Stipulate that each multimedia resource can only put portion at most on an agent node, the backup number of each multimedia resource is directly proportional with the size of this resource:
S 1 N 1 × α 1 = S 2 N 2 × α 2 = S 3 N 3 × α 3 = · · · = S m N m × α m - - - ( 1 )
α wherein 1, α 2..., α mRegulatory factor for each multimedia resource; The constraints of initial distribution is:
Σ i = 1 n C i = Σ j = 1 m S j × N j - - - ( 2 )
The backup number that can obtain each multimedia resource initial distribution from formula 1 and formula 2 is:
N t = S t / α t Σ j = 1 m ( S j 2 / α j ) × Σ i = 1 n C i , ( 1 ≤ t ≤ m ) - - - ( 3 )
The free space that acting server is total and total multimedia resource size have following relation:
Σ i = 1 n C i = Σ j = 1 m S j + X - - - ( 4 )
Wherein X is more than or equal to zero;
For the backup number that guarantees each multimedia resource more than or equal to 1, i.e. N t〉=1 (1≤t≤m), be tied to form upright just like ShiShimonoseki:
S t / α t Σ j = 1 m ( S j 2 / α j ) × Σ i = 1 n C i ≥ 1
⇒ S t / α t Σ j = 1 m ( S j 2 / α j ) × ( Σ j = 1 m S j + X ) ≥ 1
⇒ X ≥ Σ j = 1 m S j ( S j / S t α j / α t - 1 ) - - - ( 5 )
Order f ( t ) = Σ j = 1 m S j ( S j / S t α j / α t - 1 ) , ( 1 ≤ t ≤ m )
Obtain thus:
Σ i = 1 n C i ≥ Σ j = 1 m S j + f ( t ) max - - - ( 6 )
F (t) wherein MaxIt is f (t) maximum;
Get by formula 1 α k = S k S 1 × N 1 N k , ( α 1 = 1 ) , Calculate the bound of the regulatory factor of each multimedia resource backup number thus:
S k S 1 · 1 n ≤ α k ≤ S k S 1 · n - - - ( 7 )
(2) each multimedia resource all has an acting server chained list, has write down the information of the acting server of storing this multimedia resource; A file chained list is all arranged on each acting server in addition, write down the multimedia resource information on this acting server that leaves in;
(3) under initial conditions, there are two chained lists:
File chained list file_List_0: wherein each is<filename, file size, and server chained list (this chain table record have the server of this document backup, be initialized as sky), clicking rate (being initialized as 0) increases backup number (being initialized as 0) 〉.Owing to also do not finish the distribution of file during the file_List_0 initialization, be the multimedia resource listed files so file_List_0 preserves, according to the issuing time ordering of multimedia resource;
Server chained list server_List_0: wherein each is<server capacity, free space, peak use rate, current utilance, file chained list 〉, this chain table record the file that this server had, be initialized as sky;
(4) with of the issuing time ordering of file chained list, from nearest row front of current time according to each multimedia resource.The traversal that starts anew then, the file size during the institute that adds up simultaneously travel through, when accumulated value during more than or equal to the capacity sum of Servers-all, traversal stops, and simultaneously the data item of remainder is deleted, and obtains file_List_1;
(5) if file_List_1 is not empty, take out first f0 of file_List_1, in file_List_1, delete f0 then.If file_List_1 is empty, then jump to step 7;
(6) for the f0 that takes out from file_List_1, do following processing:
6.1) the initial back-up number of setting each multimedia resource is 2, and these two backups are placed on respectively on the different servers.A backup counter Counter is set, and backup counter Counter initial value is 0;
6.2) with each sorts from big to small according to free space among the server_List_0;
6.3) taking out one from server_List_0, the free space of checking this middle server if condition is set up, then adds the call number of this server whether more than or equal to the size of f0 in the server chained list of multimedia resource f0.In server list, add multimedia resource f0 simultaneously in the listed files of this server, recomputate the current utilance of this server, free space;
6.4) backup counter Counter adds 1.If backup counter Counter=2 then is pressed into the filename of f0 among the successful document queue queue of distribution, jump out circulation, return step 5.Otherwise the pointer in the server_List_0 tabulation moves on to the next item down, returns 6.3 steps;
(7) all elements among the formation queue being ejected, obtain chained list file_List_2, is exactly the chained list of the successful file of distribution.
3. the resource distribution method of a kind of network-oriented multimedia transmission service according to claim 1, it is characterized in that: the described cycle is dynamically adjusted the method for the backup number of multimedia resource on acting server, is clicking rate according to the user to the access times of multimedia resource, exchange the low shared space of file of clicking rate for the high file of clicking rate, concrete steps are as follows:
(1) file chained list file_List_2 is sorted from big to small according to clicking rate, traversal then starts anew, add up simultaneously traveled through the item in clicking rate, when accumulated value more than or equal to chained list file_List_2 in all clicking rate summation 80% the time, record current location q, traversal stops then;
(2) duplicate preceding q item among the file_List_2, obtain chained list file_List_3, clicking rate peak α M is mapped to the corresponding peak N of backup number, conversion coefficient calculates as follows:
K wherein 0Be regulatory factor, work as K 0Equal at 1 o'clock, the multimedia resource that just is equivalent to the clicking rate maximum has all had the situation of a backup on every station server;
(3) the backup number that each file need increase among the calculation document chained list file_List_3 then
Increase the current backup number of clicking rate * conversion coefficient-this document of backup number=file
The every formation queuel that is pressed into of chained list file_List_3;
(4) item of deletion from queuel " increase backup number " smaller or equal to zero if formation is not empty, takes out first fl (deleting this simultaneously from the queuel formation) among the queuel, otherwise jumps to step 10;
(5) with chained list server_List_0 according to server clicking rate sort from small to large (summation that the server clicking rate is meant the clicking rate of the All Files on this server), start anew to travel through chained list server_List_0 then, locating file fl in the file chained list in the item that traverses, if fl is arranged, then skip this server (because having deposited file f 1 on this server of explanation); Otherwise judge whether the residual memory space of this server enough comes storage file f1 greatly earlier,, then in the listed files of this server, add f1, jump to 9 if condition satisfies; If remaining memory space does not satisfy condition, then need in the file chained list of this server, seek alternate file, storage file f1 is come in their space, search alternate file according to following three steps:
1) not every not the considering among at first every file_List_3;
2) every file backup number equals 1 file and does not consider;
3) utilize dynamic programming algorithm, select optimum alternate file according to clicking rate, file size and backup number;
(6) if can not find alternate file, then jump to step 4, do not process;
(7) filename of log file f1 is at formation queue2;
(8) and from corresponding server delete the alternate file that chooses, file f1 in the replacement.
(9) update service device chained list information and file chained list file_List_0, the information of server chained list server_List_0.The increase backup counter of file f 1 subtracts 1.If the increase of file f 1 backup number equals 0, then jump procedure 4.If be not equal to 0, then file f 1 is pressed into formation queuel, jump to step 4;
(10) adjust according to the record among the formation queue2;
4. the resource distribution method of described a kind of network-oriented multimedia transmission service according to claim 3 is characterized in that: the described dynamic programming algorithm of utilizing is selected optimum alternate file, need consider according to following condition:
(1) by the file that replaces the file size sum to increase more than or equal to needs;
(2) the backup number of replaced file is high as far as possible;
(3) clicking rate of replaced file is low as far as possible;
Wherein (1) is necessary restrictive condition, and (2) and (3) belong to optimal conditions, condition (2) and (3) is taken all factors into consideration come calculation document to be replaced cost, specifically is calculated as follows:
Existing two file f 1 and f2 need accept or reject between them; Their " click volume ", backup number and file size be respectively A1, A2}, B1, B2} is with { click volume maximum in the current All Files is Am for S1, S2};
If the f1 file is replaced to new file, in next cycle, the click volume of f1 might be increased to A1 ' (if click volume reduces, not considering), and then when adjusting next time, the backup number that needs to increase just is (k * A1 '-(B1-1)); A1 ' be (therefore, the average backup number that increases is for A1, any number in Am) interval:
1 Am - A 1 Σ j = 1 Am - A 1 ( k × j - B 1 + 1 )
= 1 Am - A 1 [ k ( Am - A 1 ) ( 1 + Am - A 1 ) 2 + ( 1 - B 1 ) ( Am - A 1 ) ] - - - ( 9 )
= k 2 + k × Am 2 + 1 - k × A 1 2 - B 1
The cost that formula 9 is produced for alternate file f1; In like manner, replacing the issuable cost of f2 is k 2 + k × Am 2 + 1 - k × A 2 2 - B 2 , As the weights item.To any file f i, these weights are counted
Figure S2007101644650C00055
The target of problem then is Σ i ∈ F * v ~ i → min .
CN2007101644650A 2007-12-03 2007-12-03 Resource distribution method facing to network multimedia transmission service Active CN101179494B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2007101644650A CN101179494B (en) 2007-12-03 2007-12-03 Resource distribution method facing to network multimedia transmission service

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2007101644650A CN101179494B (en) 2007-12-03 2007-12-03 Resource distribution method facing to network multimedia transmission service

Publications (2)

Publication Number Publication Date
CN101179494A true CN101179494A (en) 2008-05-14
CN101179494B CN101179494B (en) 2010-09-01

Family

ID=39405587

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2007101644650A Active CN101179494B (en) 2007-12-03 2007-12-03 Resource distribution method facing to network multimedia transmission service

Country Status (1)

Country Link
CN (1) CN101179494B (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102045241A (en) * 2009-10-20 2011-05-04 腾讯科技(深圳)有限公司 Method, device and system for live broadcast of network TV (television)
CN102137283A (en) * 2010-06-10 2011-07-27 华为软件技术有限公司 Application online deployment method, device and system
WO2012155679A1 (en) * 2011-05-19 2012-11-22 中兴通讯股份有限公司 Data processing method and device based on the content delivery network
CN103945278A (en) * 2013-01-21 2014-07-23 中国科学院声学研究所 Video content and content source crawling method
CN107707926A (en) * 2017-03-09 2018-02-16 贵州白山云科技有限公司 A kind of live TV stream transmission method, device and system
CN108712659A (en) * 2018-05-15 2018-10-26 山东师范大学 A kind of manifold type method of video distribution and system based on user's driving
CN109542678A (en) * 2018-11-07 2019-03-29 郑州云海信息技术有限公司 A kind of server key message timed backup method and device
CN109905862A (en) * 2019-02-26 2019-06-18 北京隆普智能科技有限公司 A kind of mobile device, base station and content sharing method
CN111131080A (en) * 2019-12-26 2020-05-08 电子科技大学 Distributed deep learning flow scheduling method, system and equipment
CN114205416A (en) * 2021-10-27 2022-03-18 北京旷视科技有限公司 Resource caching method and device, electronic equipment and computer readable medium
CN114205416B (en) * 2021-10-27 2024-03-12 北京旷视科技有限公司 Resource caching method, device, electronic equipment and computer readable medium

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100349431C (en) * 2003-08-29 2007-11-14 华为技术有限公司 Layered content distributing network and method thereof
CN1281029C (en) * 2004-05-21 2006-10-18 中国科学院计算技术研究所 Network agent buffer substitution by using access characteristics of network users
CN101005369A (en) * 2006-01-19 2007-07-25 深圳市瑞福特信息技术有限公司 Distritive content sending net and distributive content sending and up transfering method

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102045241A (en) * 2009-10-20 2011-05-04 腾讯科技(深圳)有限公司 Method, device and system for live broadcast of network TV (television)
CN102137283A (en) * 2010-06-10 2011-07-27 华为软件技术有限公司 Application online deployment method, device and system
WO2012155679A1 (en) * 2011-05-19 2012-11-22 中兴通讯股份有限公司 Data processing method and device based on the content delivery network
CN103945278A (en) * 2013-01-21 2014-07-23 中国科学院声学研究所 Video content and content source crawling method
CN107707926A (en) * 2017-03-09 2018-02-16 贵州白山云科技有限公司 A kind of live TV stream transmission method, device and system
CN108712659A (en) * 2018-05-15 2018-10-26 山东师范大学 A kind of manifold type method of video distribution and system based on user's driving
CN109542678A (en) * 2018-11-07 2019-03-29 郑州云海信息技术有限公司 A kind of server key message timed backup method and device
CN109542678B (en) * 2018-11-07 2021-12-17 郑州云海信息技术有限公司 Method and device for regularly backing up key information of server
CN109905862A (en) * 2019-02-26 2019-06-18 北京隆普智能科技有限公司 A kind of mobile device, base station and content sharing method
CN111131080A (en) * 2019-12-26 2020-05-08 电子科技大学 Distributed deep learning flow scheduling method, system and equipment
CN114205416A (en) * 2021-10-27 2022-03-18 北京旷视科技有限公司 Resource caching method and device, electronic equipment and computer readable medium
CN114205416B (en) * 2021-10-27 2024-03-12 北京旷视科技有限公司 Resource caching method, device, electronic equipment and computer readable medium

Also Published As

Publication number Publication date
CN101179494B (en) 2010-09-01

Similar Documents

Publication Publication Date Title
CN101179494B (en) Resource distribution method facing to network multimedia transmission service
CN102055650B (en) Load balance method and system and management server
CN103023938B (en) A kind of service capability control method of server cluster and system
CN104935648A (en) High-cost-performance CDN system, and file pre-push and fragment buffer memory methods
CN102332029B (en) Hadoop-based mass classifiable small file association storage method
CN101304514B (en) VOD system as well as data caching method and scheduling server thereof
CN101741884A (en) Distributed storage method and device
CN104243425A (en) Content management method, device and system in content delivery network
CN102611735A (en) Load balancing method and system of application services
CN101013387A (en) Load balancing method based on object storage device
CN101916289B (en) Method for establishing digital library storage system supporting mass small files and dynamic backup number
CN103370691A (en) Managing buffer overflow conditions
CN101373445B (en) Method and apparatus for scheduling memory
CN104539730B (en) Towards the load-balancing method of video in a kind of HDFS
CN102404399A (en) Fuzzy dynamic allocation method for cloud storage resource
CN106066818B (en) A kind of data layout method improving data de-duplication standby system restorability
CN102129434A (en) Method and system for reading and writing separation database
CN102622412A (en) Method and device of concurrent writes for distributed file system
CN103631894A (en) Dynamic copy management method based on HDFS
CN105677236A (en) Storing device and method for storing data thereof
CN106339386A (en) Flexible scheduling method and device for database
CN103297431A (en) Streaming media video-on-demand duplicate hybrid buffer strategy based on cloud server cluster
CN106202082A (en) The method and device of built-up foundation data buffer storage
CN109325001B (en) Method, device and equipment for deleting small files based on metadata server
CN105354312A (en) File storage method and method, and file downloading method and system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
ASS Succession or assignment of patent right

Owner name: ZHEJIANG GOLDPROSP TECHNOLOGY CO., LTD.

Free format text: FORMER OWNER: ZHEJIANG UNIVERSITY

Effective date: 20130402

C41 Transfer of patent application or patent right or utility model
COR Change of bibliographic data

Free format text: CORRECT: ADDRESS; FROM: 310027 HANGZHOU, ZHEJIANG PROVINCE TO: 310012 HANGZHOU, ZHEJIANG PROVINCE

TR01 Transfer of patent right

Effective date of registration: 20130402

Address after: Hangzhou City, Zhejiang province Xihu District 310012 Ma Tang Road CLP fifty-two No. 36 building 3 layer 10

Patentee after: Zhejiang Jincheng Technology Co.,Ltd.

Address before: 310027 Hangzhou, Zhejiang Province, Xihu District, Zhejiang Road, No. 38, No.

Patentee before: Zhejiang University

C56 Change in the name or address of the patentee

Owner name: KINGTION TECHNOLOGY CO., LTD.

Free format text: FORMER NAME: ZHEJIANG GOLDPROSP TECHNOLOGY CO., LTD.

CP01 Change in the name or title of a patent holder

Address after: Hangzhou City, Zhejiang province Xihu District 310012 Ma Tang Road CLP fifty-two No. 36 building 3 layer 10

Patentee after: Jincheng Technology Co.,Ltd.

Address before: Hangzhou City, Zhejiang province Xihu District 310012 Ma Tang Road CLP fifty-two No. 36 building 3 layer 10

Patentee before: Zhejiang Jincheng Technology Co.,Ltd.

PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Resource distribution method facing to network multimedia transmission service

Effective date of registration: 20160803

Granted publication date: 20100901

Pledgee: Hangzhou hi tech Company limited by guarantee

Pledgor: Jincheng Technology Co.,Ltd.

Registration number: 2016330000049

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20170809

Granted publication date: 20100901

Pledgee: Hangzhou hi tech Company limited by guarantee

Pledgor: Jincheng Technology Co.,Ltd.

Registration number: 2016330000049

PC01 Cancellation of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Resource distribution method facing to network multimedia transmission service

Effective date of registration: 20170810

Granted publication date: 20100901

Pledgee: Hangzhou hi tech Company limited by guarantee

Pledgor: Jincheng Technology Co.,Ltd.

Registration number: 2017330000081

PE01 Entry into force of the registration of the contract for pledge of patent right
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20181018

Granted publication date: 20100901

Pledgee: Hangzhou hi tech Company limited by guarantee

Pledgor: Jincheng Technology Co.,Ltd.

Registration number: 2017330000081

PC01 Cancellation of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Resource distribution method facing to network multimedia transmission service

Effective date of registration: 20181019

Granted publication date: 20100901

Pledgee: Hangzhou hi tech Company limited by guarantee

Pledgor: Jincheng Technology Co.,Ltd.

Registration number: 2018330000327

PE01 Entry into force of the registration of the contract for pledge of patent right
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20220725

Granted publication date: 20100901

Pledgee: Hangzhou hi tech Company limited by guarantee

Pledgor: Jincheng Technology Co.,Ltd.

Registration number: 2018330000327

PC01 Cancellation of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: A resource distribution method for network multimedia transmission service

Effective date of registration: 20220819

Granted publication date: 20100901

Pledgee: Societe Generale Bank Limited by Share Ltd. Hangzhou branch

Pledgor: Jincheng Technology Co.,Ltd.

Registration number: Y2022330001844

PE01 Entry into force of the registration of the contract for pledge of patent right