CN102195986A - Method and device for processing data based on content distribution network - Google Patents
Method and device for processing data based on content distribution network Download PDFInfo
- Publication number
- CN102195986A CN102195986A CN2011101302965A CN201110130296A CN102195986A CN 102195986 A CN102195986 A CN 102195986A CN 2011101302965 A CN2011101302965 A CN 2011101302965A CN 201110130296 A CN201110130296 A CN 201110130296A CN 102195986 A CN102195986 A CN 102195986A
- Authority
- CN
- China
- Prior art keywords
- data
- described data
- correspondence
- order number
- preserving
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/63—Routing a service request depending on the request content or context
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a method and device for processing data based on a content distribution network, which are used for solving the problem of high load of a central node during the realization of an NPVR (Network Personal Video Recorder) service based on a CDN (Content Delivery Network) in the prior art. The method comprises the following steps of: when set storage time duration of stored data is reached, judging whether the number of current ordering people corresponding to the stored data is zero by using an edge node; if so, deleting the stored data; and otherwise, continually storing the data and deleting the stored data until the number of current ordering people corresponding to the data is 0. According to the embodiment of the invention, stored data is not deleted by using the edge node when the number of current ordering people corresponding to the data is not zero specific to the stored data, so that the storage time of the data with higher interest degree can be prolonged by the edge node, a terminal is not required to order data from a central node within a very long period of time, and the load of the central node is lowered.
Description
Technical field
The present invention relates to communication technical field, relate in particular to a kind of data processing method and device of content-based distributing network.
Background technology
IPTV (IPTV, Internet Protocol TV) is a kind of multimedia communication technology based on the Internet, utilize the infrastructure of broadband networks, by Internet protocol (IP, Internet Protocol) provides the multiple interactive digital media business that comprises TV programme service to terminal, wherein, terminal comprises television set, computer and other forms of terminal.And, IPTV can provide network individual video recording (NPVR, Network Personal Video Recorder) business service, terminal is by the NPVR business, the data recording of contents such as interested TV programme can be got off and be kept at network side, when terminal will be obtained the data of recording, terminal was obtained the data of recording from network side.
In the prior art, network side utilizes content distributing network (CDN, Content Delivery Network) provides NPVR business service to terminal, usually the CDN network comprises a Centroid, and several fringe nodes that link to each other with this Centroid, wherein, Centroid is used to manage this several fringe nodes, and backing up data on these several fringe nodes, fringe node is used for providing business service to terminal.And Centroid and fringe node are recorded and are preserved the data of contents such as TV programme simultaneously, and it is shorter that fringe node is preserved the very first time length of the data of recording, and second time span of the data that the Centroid preservation is recorded is longer.
Network side utilizes the CDN network to provide the detailed process of NPVR business service to be to terminal in the prior art: when terminal need obtain the NPVR business service, this terminal sends the subscription request of ordering the NPVR business to the fringe node of ownership, fringe node provides the data of this identification information of preservation according to the identification information of the data of the order of carrying in this subscription request that receives to this terminal.
In the practical application scene, the terminal attaching in the normally same zone is in some or certain several fringe node, and the interested data of terminal institute in the same area are often identical substantially, and the interested data of the terminal of zones of different institute difference to some extent.For example, the terminal of zone A all belongs to fringe node a, the terminal of area B all belongs to fringe node b, the terminal of zone A is interested for data 1, and the terminal of area B is interested for data 2, therefore in actual applications, the data 1 of preserving among the fringe node a can be requested to order in very long a period of time, same, the data 2 of preserving among the fringe node b also can be requested to order in very long a period of time, and the data 2 of preserving among the fringe node a, and 1 of the data of preserving among the fringe node b seldom are requested to order.
But in the prior art, the very first time length that each fringe node is preserved each data of recording all is identical, and should very first time length shorter, and second time span that Centroid is preserved the data of recording is longer.Because the terminal of zones of different is to the interest level difference of different pieces of information, if fringe node has been deleted certain interest level higher data, then to order these data again, can only arrive in the Centroid and order, can increase the load of Centroid like this if belong to the terminal of this fringe node.
Continuing to continue to use example describes, suppose that it is a week that each fringe node is preserved the very first time length of each data of recording, second time span that Centroid is preserved the data of recording is one month, because the data 1 of preserving among fringe node a and the fringe node b and the very first time length of data 2 all are a week, therefore after fringe node a preserves the week age of data 1, with this data 1 deletion of preserving, if the terminal of regional A will be ordered these data 1 again, then can only arrive in the Centroid and order, if second time span of the data 1 of preserving in the Centroid does not also reach, then provide this data 1 to the terminal of regional A by Centroid, same, the terminal of area B is wanted subscription data 2 again after the week age of fringe node b preservation data 2, also can only arrive in the Centroid and order, will cause the load of Centroid excessive like this.
Summary of the invention
The embodiment of the invention provides a kind of data processing method and device of content-based distributing network, the big problem of Centroid load when realizing that based on the CDN network NPVR is professional in order to solve in the prior art.
The data processing method of a kind of content-based distributing network that the embodiment of the invention provides comprises:
When the fringe node in the content distributing network arrives in the setting holding time length of preserving data, judge whether the current order number of the described data correspondence of preserving is 0;
If judged result is for being the described data that then described fringe node deletion is preserved;
Otherwise described fringe node continues to preserve described data, is 0 o'clock until the current order number of described data correspondence, the described data that deletion is preserved.
The data processing equipment of a kind of content-based distributing network that the embodiment of the invention provides comprises:
Judge module is used for judging whether the current order number of the described data correspondence of preserving is 0 when the setting holding time length of preserving data arrives;
Processing module is used for if judged result is for being, deletion described data of preserving then, otherwise, continue to preserve described data, be 0 o'clock until the current order number of described data correspondence, the described data of deletion preservation.
The embodiment of the invention provides a kind of data processing method and device of content-based distributing network, when this method fringe node arrives in the setting holding time length of preserving data, whether the current order number of judging this data correspondence of preserving is 0, if, then delete these data of preserving, otherwise continue preserving these data, is 0 o'clock until the current order number of this data correspondence, these data that deletion is preserved.Because fringe node is at the data of preserving in the embodiment of the invention, current order number in this data correspondence is not 0 o'clock, do not delete these data, therefore for the interest level higher data, fringe node can prolong the time of preserving this interest level higher data, thereby terminal can needn't arrive the Centroid subscription data in very long a period of time, reduced the load of Centroid.
Description of drawings
The data handling procedure of the content-based distributing network that Fig. 1 provides for the embodiment of the invention;
The data processing detailed process of the content-based distributing network that Fig. 2 provides for the embodiment of the invention;
The data processing equipment structural representation of the content-based distributing network that Fig. 3 provides for the embodiment of the invention.
Embodiment
In embodiments of the present invention, terminal mainly shows as the interest level of certain data of preserving in the fringe node is higher, and certain data of this that preserve in the fringe node can be ordered by terminal request in very long a period of time.On the contrary, if terminal is lower to the interest level of certain data of preserving in the fringe node, then these certain data can seldom be ordered by terminal request.Therefore, fringe node in the embodiment of the invention is according to certain rule, the time span of data is preserved in suitable prolongation, terminal needn't be arrived in a very long time order these data in the Centroid, direct fringe node at this terminal attaching obtains data and gets final product, and can alleviate the load of Centroid to a certain extent.
Below in conjunction with Figure of description, the embodiment of the invention is described in detail.
The data handling procedure of the content-based distributing network that Fig. 1 provides for the embodiment of the invention specifically may further comprise the steps:
S101: when the fringe node in the content distributing network arrives in the setting holding time length of preserving data, judge whether the current order number of this data correspondence of preserving is 0, if, execution in step S102 then, otherwise execution in step S103.
For example, the data that fringe node is preserved are: the TV programme of the 7:00～7:30 in afternoon on the 13rd May in 2011 of certain TV station, suppose that this setting holding time length is a week, then fringe node is at 7:30 in afternoon on the 20th May in 2011, when also promptly the setting holding time length of these data arrives, judge whether the current order number of this data correspondence is 0.
S102: these data that the fringe node deletion is preserved.
In embodiments of the present invention,, then illustrate and currently order these data of preserving in the fringe node, illustrate promptly that also the interest level of these data is lower, then delete these data without any terminal if the current order number of this data correspondence is 0.
S103: fringe node continue to be preserved these data, is 0 o'clock until the current order number of this data correspondence, these data that deletion is preserved.
In embodiments of the present invention, when if fringe node arrives in the setting holding time length of preserving these data, the current order number of judging this data correspondence is not 0, then illustrate and currently also have terminal ordering these data, the interest level that these data also promptly are described is higher, then fringe node continue to be preserved these data, is 0 o'clock until the current order number of this data correspondence, these data that deletion is preserved.
In said process, when fringe node when the setting holding time length of preserving data arrives, if judge that the current order number of this data correspondence is 0, then delete these data, otherwise continue to preserve these data, current order number until this data correspondence is 0, delete this data, because terminal mainly shows as the interest level of certain data of preserving in the fringe node is higher, certain data of this that preserve in the fringe node can be ordered by terminal request in very long a period of time, therefore, fringe node can be according to the interest level of terminal to the data of preservation, prolong the time of preserving the interest level higher data, also promptly continue to preserve in the process of these data at fringe node, terminal can arrive Centroid and order this data, directly orders these data at this fringe node and gets final product, thereby reduced the load of Centroid.
In embodiments of the present invention, current order number for each data correspondence of determining accurately to preserve in the fringe node, fringe node is in the process of preserving data, if receive the subscription request of these data of order of terminal transmission, the current order number of this data correspondence that then will preserve adds 1, if receive the request of quitting the subscription of of quitting the subscription of these data that terminal sends, the current order number of this data correspondence that then will preserve subtracts 1.Wherein, the process of preserving these data is specially, fringe node is preserved the process of these data in the setting holding time length of preserving these data, and fringe node is when this setting holding time length arrives, and the current order number of judging this data correspondence is not 0 o'clock, continues to preserve the process of these data.And the current order number of each data correspondence that fringe node will initially be preserved all is set to 0.
Concrete, in said process, when fringe node receives the subscription request of these data of order that terminal sends, the current order number of this data correspondence of preserving being added 1 process is specially, fringe node is according to the identification information of these data of the order of carrying in the subscription request that receives, in the data of preserving, search the data of this identification information correspondence, obtain the current order number of this data correspondence of preservation according to these data that find, and the current order number of this data correspondence that will get access to adds 1 also preservation.
Accordingly, fringe node receives that terminal sends quit the subscription of these data quit the subscription of request the time, 1 process that the current order number of this data correspondence of preserving subtracted is specially, fringe node is according to the identification information of quitting the subscription of these data of quitting the subscription of of carrying in the request that receives, in the data of preserving, search the data of this identification information correspondence, obtain the current order number of this data correspondence of preservation according to these data that find, and the current order number of this data correspondence that will get access to subtracts 1 also preservation.
In embodiments of the present invention, make the corrupted data of preserving in the fringe node for fear of some emergency case, with the quality of the business service that guarantees to provide, fringe node is preserved in the process of data, and the Centroid in also can the content of announcement distributing network is preserved these data accordingly.Also promptly, the data of preserving in the Centroid backup fringe node.
Certainly, in order further to alleviate the load of Centroid, save the storage resources of Centroid, fringe node also can be when the setting holding time length of preserving these data arrives, this data deletion that the Centroid in the content of announcement distributing network will be preserved.
The data processing detailed process of the content-based distributing network that Fig. 2 provides for the embodiment of the invention specifically may further comprise the steps:
S201: the fringe node in the content distributing network is preserved data, and the current order number of this data correspondence that will preserve puts 0, while execution in step S202 and S203.
S202: when fringe node receives the subscription request of these data of order that terminal sends, the current order number of this data correspondence of preserving is added 1.
S203: when fringe node receive that terminal sends quit the subscription of these data quit the subscription of request the time, the current order number of this data correspondence of preserving is subtracted 1.
S204: judge whether the setting holding time length of preserving these data arrives, if then carry out step S205, otherwise return step S202 and step S203.
S205: whether the current order number of judging this data correspondence of preserving is 0, if then carry out step S206, otherwise carry out step S207.
S206: these data that the fringe node deletion is preserved.
S207: fringe node continue to be preserved these data, is 0 o'clock until the current order number of this data correspondence, these data that deletion is preserved.
In said process, when fringe node when the setting holding time length of preserving data arrives, if judge that the current order number of this data correspondence is 0, then delete these data, otherwise continue to preserve these data, current order number until this data correspondence is 0, delete this data, because terminal mainly shows as the interest level of certain data of preserving in the fringe node is higher, certain data of this that preserve in the fringe node can be ordered by terminal request in very long a period of time, therefore, fringe node can be according to the interest level of terminal to the data of preservation, prolong the time of preserving the interest level higher data, also promptly continue to preserve in the process of these data at fringe node, terminal can arrive Centroid and order this data, directly orders these data at this fringe node and gets final product, thereby reduced the load of Centroid.
The data processing equipment structural representation of the content-based distributing network that Fig. 3 provides for the embodiment of the invention specifically comprises:
Described judge module 301 specifically is used for, in the process of preserving described data, if receive the subscription request of the described data of order of terminal transmission, the current order number of the described data correspondence that then will preserve adds 1, if receive the request of quitting the subscription of of quitting the subscription of described data that terminal sends, the current order number of the described data correspondence that then will preserve subtracts 1.
Described judge module 301 specifically is used for, identification information according to the described data of the order of carrying in the described subscription request that receives, in the data of preserving, search the described data of described identification information correspondence, obtain the current order number of the described data correspondence of preservation according to the described data that find, the current order number of the described data correspondence that gets access to is added 1 and preserve.
Described judge module 301 specifically is used for, according to the described identification information of quitting the subscription of the described data of quitting the subscription of of carrying in the request that receives, in the data of preserving, search the described data of described identification information correspondence, obtain the current order number of the described data correspondence of preservation according to the described data that find, the current order number of the described data correspondence that gets access to is subtracted 1 and preserve.
Described device also comprises:
The data processing equipment of concrete above-mentioned content-based distributing network can be arranged in fringe node.
The embodiment of the invention provides a kind of data processing method and device of content-based distributing network, when this method fringe node arrives in the setting holding time length of preserving data, whether the current order number of judging this data correspondence of preserving is 0, if, then delete these data of preserving, otherwise continue preserving these data, is 0 o'clock until the current order number of this data correspondence, these data that deletion is preserved.Because fringe node is at the data of preserving in the embodiment of the invention, current order number in this data correspondence is not 0 o'clock, do not delete these data, therefore for the interest level higher data, fringe node can prolong the time of preserving this interest level higher data, thereby terminal can needn't arrive the Centroid subscription data in very long a period of time, reduced the load of Centroid.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.
Claims (10)
1. the data processing method of a content-based distributing network is characterized in that, comprising:
When the fringe node in the content distributing network arrives in the setting holding time length of preserving data, judge whether the current order number of the described data correspondence of preserving is 0;
If judged result is for being the described data that then described fringe node deletion is preserved;
Otherwise described fringe node continues to preserve described data, is 0 o'clock until the current order number of described data correspondence, the described data that deletion is preserved.
2. the method for claim 1 is characterized in that, described fringe node is preserved the current order number of described data correspondence, specifically comprises:
Described fringe node is in the process of preserving described data, if receive the subscription request of the described data of order of terminal transmission, the current order number of the described data correspondence that then will preserve adds 1;
If receive the request of quitting the subscription of of quitting the subscription of described data that terminal sends, the current order number of the described data correspondence that then will preserve subtracts 1.
3. method as claimed in claim 2 is characterized in that, if described fringe node receives the subscription request of the described data of order of terminal transmission, the current order number of the described data correspondence that then will preserve adds 1, specifically comprises:
Described fringe node is searched the described data of described identification information correspondence according to the identification information of the described data of the order of carrying in the described subscription request that receives in the data of preserving;
Obtain the current order number of the described data correspondence of preservation according to the described data that find, the current order number of the described data correspondence that gets access to is added 1 and preserve.
4. method as claimed in claim 2 is characterized in that, if described fringe node receives the request of quitting the subscription of of quitting the subscription of described data that terminal sends, the current order number of the described data correspondence that then will preserve subtracts 1, specifically comprises:
Described fringe node is searched the described data of described identification information correspondence according to the described identification information of quitting the subscription of the described data of quitting the subscription of of carrying in the request that receives in the data of preserving;
Obtain the current order number of the described data correspondence of preservation according to the described data that find, the current order number of the described data correspondence that gets access to is subtracted 1 and preserve.
5. the method for claim 1 is characterized in that, described method also comprises:
The described data deletion that described fringe node notifies the Centroid in the described content distributing network to preserve when the setting holding time length of preserving described data arrives.
6. the data processing equipment of a content-based distributing network is characterized in that, comprising:
Judge module is used for judging whether the current order number of the described data correspondence of preserving is 0 when the setting holding time length of preserving data arrives;
Processing module is used for if judged result is for being, deletion described data of preserving then, otherwise, continue to preserve described data, be 0 o'clock until the current order number of described data correspondence, the described data of deletion preservation.
7. device as claimed in claim 6, it is characterized in that, described judge module specifically is used for, in the process of preserving described data, if receive the subscription request of the described data of order of terminal transmission, the current order number of the described data correspondence that then will preserve adds 1, if receive the request of quitting the subscription of of quitting the subscription of described data that terminal sends, the current order number of the described data correspondence that then will preserve subtracts 1.
8. device as claimed in claim 7, it is characterized in that, described judge module specifically is used for, identification information according to the described data of the order of carrying in the described subscription request that receives, in the data of preserving, search the described data of described identification information correspondence, obtain the current order number of the described data correspondence of preservation according to the described data that find, the current order number of the described data correspondence that gets access to is added 1 and preserve.
9. device as claimed in claim 7, it is characterized in that, described judge module specifically is used for, according to the described identification information of quitting the subscription of the described data of quitting the subscription of of carrying in the request that receives, in the data of preserving, search the described data of described identification information correspondence, obtain the current order number of the described data correspondence of preservation according to the described data that find, the current order number of the described data correspondence that gets access to is subtracted 1 and preserve.
10. device as claimed in claim 6 is characterized in that, described device also comprises:
Notification module, the described data that are used for notifying when the setting holding time length of preserving described data arrives the Centroid of described content distributing network to preserve are deleted.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101302965A CN102195986A (en) | 2011-05-19 | 2011-05-19 | Method and device for processing data based on content distribution network |
| PCT/CN2012/072914 WO2012155679A1 (en) | 2011-05-19 | 2012-03-23 | Data processing method and device based on the content delivery network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101302965A CN102195986A (en) | 2011-05-19 | 2011-05-19 | Method and device for processing data based on content distribution network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102195986A true CN102195986A (en) | 2011-09-21 |
Family
ID=44603373
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011101302965A Pending CN102195986A (en) | 2011-05-19 | 2011-05-19 | Method and device for processing data based on content distribution network |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102195986A (en) |
| WO (1) | WO2012155679A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012155679A1 (en) * | 2011-05-19 | 2012-11-22 | 中兴通讯股份有限公司 | Data processing method and device based on the content delivery network |
| WO2014201942A1 (en) * | 2013-06-19 | 2014-12-24 | Tencent Technology (Shenzhen) Company Limited | Method, server and system for managing content in content delivery network |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106612298B (en) * | 2015-10-22 | 2019-08-06 | 中国科学院声学研究所 | A kind of content distribution method and system based on large-scale network node |
| CN111950872A (en) * | 2020-07-30 | 2020-11-17 | 深圳市高德信通信股份有限公司 | CDN resource scheduling system |
| CN112383792B (en) * | 2020-11-12 | 2023-04-18 | 咪咕视讯科技有限公司 | Live content synchronous processing method, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020046405A1 (en) * | 2000-01-28 | 2002-04-18 | Ibeam Broadcasting Corporation | System and method for determining optimal server in a distributed network for serving content streams |
| CN101123602A (en) * | 2006-08-11 | 2008-02-13 | 郑州威科姆电子科技有限公司 | Content scheduling method based on network TV system |
| CN101127883A (en) * | 2007-09-06 | 2008-02-20 | 中兴通讯股份有限公司 | Network TV system and content scheduling method for system recording and playing |
| CN101489108A (en) * | 2009-01-20 | 2009-07-22 | 深圳市同洲电子股份有限公司 | Method, system and equipment for program content processing |
| CN100556038C (en) * | 2005-10-28 | 2009-10-28 | 中兴通讯股份有限公司 | A kind of content distribution method based on outer condition trigger node action |
| CN101668177A (en) * | 2009-09-24 | 2010-03-10 | 中兴通讯股份有限公司 | Multimedia content management method and device |
| CN101179494B (en) * | 2007-12-03 | 2010-09-01 | 浙江大学 | Resource distribution method facing to network multimedia transmission service |
| CN101883012A (en) * | 2010-07-09 | 2010-11-10 | 四川长虹电器股份有限公司 | Processing method of storage resource in network edge node |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20040074403A (en) * | 2003-02-18 | 2004-08-25 | 주식회사 케이티 | System and method for wholesale service of Content Delivery Network |
| CN101119225B (en) * | 2006-07-31 | 2011-05-18 | 诺基亚西门子通信系统技术（北京）有限公司 | Statistical method for network visit |
| CN102195986A (en) * | 2011-05-19 | 2011-09-21 | 南京中兴新软件有限责任公司 | Method and device for processing data based on content distribution network |
-
2011
- 2011-05-19 CN CN2011101302965A patent/CN102195986A/en active Pending
-
2012
- 2012-03-23 WO PCT/CN2012/072914 patent/WO2012155679A1/en active Application Filing
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020046405A1 (en) * | 2000-01-28 | 2002-04-18 | Ibeam Broadcasting Corporation | System and method for determining optimal server in a distributed network for serving content streams |
| CN100556038C (en) * | 2005-10-28 | 2009-10-28 | 中兴通讯股份有限公司 | A kind of content distribution method based on outer condition trigger node action |
| CN101123602A (en) * | 2006-08-11 | 2008-02-13 | 郑州威科姆电子科技有限公司 | Content scheduling method based on network TV system |
| CN101127883A (en) * | 2007-09-06 | 2008-02-20 | 中兴通讯股份有限公司 | Network TV system and content scheduling method for system recording and playing |
| CN101179494B (en) * | 2007-12-03 | 2010-09-01 | 浙江大学 | Resource distribution method facing to network multimedia transmission service |
| CN101489108A (en) * | 2009-01-20 | 2009-07-22 | 深圳市同洲电子股份有限公司 | Method, system and equipment for program content processing |
| CN101668177A (en) * | 2009-09-24 | 2010-03-10 | 中兴通讯股份有限公司 | Multimedia content management method and device |
| CN101883012A (en) * | 2010-07-09 | 2010-11-10 | 四川长虹电器股份有限公司 | Processing method of storage resource in network edge node |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012155679A1 (en) * | 2011-05-19 | 2012-11-22 | 中兴通讯股份有限公司 | Data processing method and device based on the content delivery network |
| WO2014201942A1 (en) * | 2013-06-19 | 2014-12-24 | Tencent Technology (Shenzhen) Company Limited | Method, server and system for managing content in content delivery network |
| US10262005B2 (en) | 2013-06-19 | 2019-04-16 | Tencent Technology (Shenzhen) Company Limited | Method, server and system for managing content in content delivery network |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2012155679A1 (en) | 2012-11-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200296151A1 (en) | Downloading Media Objects | |
| US8839319B2 (en) | Limiting recording demands | |
| WO2016184229A1 (en) | Method and system for recording live video | |
| EP3777101B1 (en) | Group enhanced content delivery | |
| US9197872B2 (en) | Managing stored content | |
| CN102195986A (en) | Method and device for processing data based on content distribution network | |
| US20150074709A1 (en) | Commercials on mobile devices | |
| US20140157324A1 (en) | Content Identification and Management | |
| US9503496B2 (en) | System and method for a media content reconciler | |
| CN102238419A (en) | Method and apparatus for playing live content | |
| CN102057683A (en) | Downloading method and apparatus of terminal entity | |
| CN101068341B (en) | Stream media dispatching system and medium file scheduling method thereof | |
| US8037499B2 (en) | Systems, methods, and computer products for recording of repeated programs | |
| WO2016062081A1 (en) | System, device and method for implementing hls channel playback service, and storage medium | |
| US20170064378A1 (en) | Intelligent scheduling of dvr commands and dvr client status updates | |
| US20160309233A1 (en) | Video distribution and media resource system interaction method and system | |
| US20150229694A1 (en) | Time-sensitive content manipulation in adaptive streaming buffer | |
| CN107911712B (en) | Data buffering method and electronic equipment | |
| US9571994B2 (en) | Alert systems and methodologies | |
| CN102291629A (en) | P2P (peer-to-peer) proxy on-demand system and implementation method applied to IPTV (Internet protocol television) | |
| CN106993236B (en) | A kind of video broadcasting method and terminal | |
| US20160249088A1 (en) | System and method for delayed digital video recording | |
| CN101883234A (en) | Program prerecording system and program prerecording method based on set top box | |
| CN103795810A (en) | Data distribution system and method and central server of data distribution system | |
| US20130007045A1 (en) | System, method and computer program product for linking content availability to media consumption |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110921 |
|
| RJ01 | Rejection of invention patent application after publication |