CN101345690B - Contents grading memory of telecommunication level P2P network and transmission method - Google Patents
Contents grading memory of telecommunication level P2P network and transmission method Download PDFInfo
- Publication number
- CN101345690B CN101345690B CN2007101287973A CN200710128797A CN101345690B CN 101345690 B CN101345690 B CN 101345690B CN 2007101287973 A CN2007101287973 A CN 2007101287973A CN 200710128797 A CN200710128797 A CN 200710128797A CN 101345690 B CN101345690 B CN 101345690B
- Authority
- CN
- China
- Prior art keywords
- content
- node
- stores
- content stores
- fringe node
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 13
- 230000005540 biological transmission Effects 0.000 title claims abstract description 12
- 230000008859 change Effects 0.000 claims description 2
- 230000003993 interaction Effects 0.000 claims description 2
- 230000008521 reorganization Effects 0.000 claims 1
- 230000002950 deficient Effects 0.000 abstract 1
- 230000005055 memory storage Effects 0.000 abstract 1
- 239000012634 fragment Substances 0.000 description 12
- 238000007726 management method Methods 0.000 description 5
- 230000008034 disappearance Effects 0.000 description 3
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 230000004807 localization Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000013467 fragmentation Methods 0.000 description 1
- 238000006062 fragmentation reaction Methods 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000006798 recombination Effects 0.000 description 1
- 238000005215 recombination Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Landscapes
- Information Transfer Between Computers (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a content staging memory storage and transmission method of a communication level P2P network, wherein all sharing content is stored on three kinds of nodes with P2P alternation capability, namely: a content storage central node, a content storage fringe node and a content storage terminal node. According to the invention, the content is downloaded in priority order of the content storage terminal node, the content storage fringe node and the content storage central node. The scheme of the invention satisfies the requirement of the communication level network on stability, high efficiency, high quality and saved cost, thereby solving the problems of lower efficiency of prior distributivity storing frame, deficient content, 'uneven cold and hot' of content storage and distribution.
Description
Technical field
The present invention relates to a kind of content classification storage and transfer approach of telecommunication level P 2 P network.
Background technology
At present, the most widely used field of P2P is exactly to be the field of resource sharing of representative with the file in download, various file-sharing softwares emerge in an endless stream, for example BitTorrent, eMule, KazaA, domestic KuGoo, PP click-through etc., and wherein the use with BitTorrent and eMule is the most extensive.
Distributed storage mode has all been adopted in above various application, and promptly all shared files all disperse to leave on the terminal node, and the content that wherein has is complete, and the content that has then lacks some segment.Have " selfishness " behavior because the P2P content is shared the field, promptly a lot of users no longer provide shared to other people after obtaining complete file, cause a lot of contents to have the situation of segment disappearance on network, thereby can't form complete file.In addition, the content of " focus " is easy to find the seed of download in one period, and the content of " unexpected winner " often can not find the seed that can download.Even more serious is that when these contents that are distributed in the different location transmitted on the internet, its flow and the flow direction were unordered, have and be difficult to the characteristic predicting and control, for whole network, can cause the waste of a large amount of network bandwidth resources, its whole efficiency is not high.Above-mentioned these problems all come from these P2P application and do not develop for the carrier class service operation, so the content stores framework of its bottom can not fully satisfy the requirement of carrier class service operation.Be fit to carrier-class P2P content sharing application if develop, just must find the technological means that can address the above problem.
Summary of the invention
The objective of the invention is to propose a kind of content classification storage architecture of telecommunication level P 2 P network and the content transfer method of burst equity transmission, it is applicable to the exploitation based on carrier-class P2P content sharing application, can satisfy the requirement of carrier class network, thereby solve the problem of existing distributed storage architecture inefficiency and content disappearance, content stores and distribution " uneven in temperature " stability, high efficiency, high-quality and the cost that practices every conceivable frugality.
For achieving the above object, the present invention has adopted a kind of storage architecture of classification, wherein all shared contents all leave on three grades of shared nodes that possess autonomous P2P ability, comprising: content stores Centroid (CSCN), content stores fringe node (CSEN) and content stores terminal node (CSTN).Wherein the calculating of content stores Centroid and storage capacity are the strongest, and it is the highest to connect bandwidth, general long-time staying incessantly on the network, and the initial data by examination, content legality all leaves on this category node.The content stores fringe node is distributed in the edge of network access layer, compare with the content stores Centroid, its calculate and storage capacity a little less than, to be connected bandwidth lower, these nodes generally also are to stay on the network for a long time.The 3rd category node is the content stores terminal node, the calculating of this category node and storage capacity is the most weak, access bandwidth is minimum, and it is indefinite to rest on the online time.
Principle according to the content centralized stores, whole initial data by examination, content legality all leave on the content center node, this node is as the storage and the distribution node of concentrated and reserve, can guarantee the legitimacy and the integrality of content in the whole system, thereby ensure those less delivery quality that " unexpected winner " content of user's download is arranged.
The content stores fringe node can increase the service source of focus content as the important node of stablizing resource is provided, and improves content service quality and response speed, for the user provides service nearby, improves the Terminal Service quality, reduces the flow that passes through of backbone network simultaneously.As required, the content stores center regularly or aperiodically is distributed to the focus content on the content stores fringe node.
When transmitting content, the content stores terminal node at first requires to download content to other guide storage terminal node, if other guide storage terminal node does not have corresponding content, then the content stores fringe node under it is asked for this content; If this content stores fringe node has corresponding content, then the content stores terminal node to the request of sending transmits this content, if do not have, then asks for this content to other guide storage fringe node; If other guide storage fringe node has corresponding content, then this content is sent to the content fringe node of the request of sending, and and then send to content stores terminal node that need to download this content, if other guide storage fringe node does not have corresponding content yet, then ask for this content to content storage center node, send this content the content fringe node of the request of sending to by the content stores Centroid, and and then send the content stores terminal node that needs to download this content to.
In the present invention, by the storage and the transmission of above-mentioned three grades of nodes, realized that equity between the brother of node transmits and lower-level nodes to the content requests of higher-level node.With traditional CDN forms sharp contrast is that the present invention does not adopt the C/S hierarchical structure and the distribution policy of existing CDN system, but has introduced the principle of distributed P 2 P transmission, has realized the content distribution and exchange of content source center and peripheral node.
Different with the pattern of existing C DN source contents center centralized management exchangeable object, the content stores fringe node can be from the tabulation of content information autonomous select target node (comprising content stores Centroid, other guide storage fringe node and content stores terminal), set up P2P with it and connect and realize obtaining and transmitting of content.
The content stores fringe node has the parallel download capabilities of P2P, and it not only can download content from the content stores Centroid, and can download related content from other content stores fringe node.
Have only when other content stores terminal does not have the required content segments of user, when running into unexpected winner segment or some contents and have deletion fragment, can not be organized into complete content, just ask for to the content stores fringe node, under the situation that the content stores fringe node does not have yet, finally ask for to content storage center node.
Different with existing C DN content downloading mode is, adopted fragmentation schema in the present invention, it is the same content fragment technology of all having introduced of content stores fringe node with other guide storage terminal node, can adopt the part downloading mode, download the different parts of same content respectively from a plurality of peer node, and obtain complete content by the content recombination form.Under unwanted situation, the content stores fringe node does not need to download the full content burst yet recombinates, thereby has saved memory space.
Adopt technical scheme of the present invention, compare with the central server of in the past C/S model, user terminal is much smaller to the pressure of content storage center node and content stores fringe node, therefore the requirement to equipment performance has reduced a lot, system does not need dilatation continually, is not easy to form bottleneck in network center and network edge yet.
Owing to introduced the P2P distributed transmission among the present invention, realized distributing and exchange of content source center and peripheral node from main contents, have more flexibility and intelligent.
In addition, the present invention helps to eliminate the problem of " uneven in temperature ".Relatively the content of " focus " can be distributed on content stores fringe node and the content stores terminal node, thereby does not need accessed content storage center node continually; And the content that compares " unexpected winner " also need not to occupy the memory space of the more weak terminal node of performance.Because visit capacity is little, can be to the visit of " unexpected winner " content to content storage center node formation pressure.
Description of drawings
Can understand classification storage architecture and content load mode better below with reference to accompanying drawing and to the specific descriptions of embodiment according to telecommunication level P 2 P network of the present invention.As shown in the figure:
Fig. 1 shows according to content classification storage architecture of the present invention.
Fig. 2 shows the whole pattern that pushes (push) of content distribution.
Fig. 3 shows the process of finding the focus content.
Fig. 4 shows the propelling movement of focus contents list.
Fig. 5 shows the P2P establishment of connection.
Fig. 6 shows the transmission of content fragment.
Fig. 7 shows the report of resource.
Embodiment
P2P content classification storage architecture of the present invention as shown in Figure 1.In this improved content stores framework, comprised that three classes possess the node of P2P interaction capabilities, i.e. content stores Centroid, content stores fringe node and content stores terminal node.Wherein, all leave on the content center memory node by whole initial data examination, content legality.According to the needs of distribution, the content on the content stores Centroid is distributed on the content stores fringe node aperiodically.The 3rd category node in the dotted ellipse is the content stores terminal node, and the performance and the storage capacity of this category node are the most weak, and access bandwidth is not high yet, and it is irregular, duration is stayed on the network erratically.
Generally speaking, the content stores terminal node only carries out P2P with other content stores terminal node, content stores fringe node and communicates by letter.The priority that its content is downloaded is successively: other guide storage terminal node, content stores fringe node, content stores Centroid.
According to flow localized principle, P2P content exchange between the content stores terminal node is generally carried out between adjacent node, as the network in same metropolitan area network or same area etc., have only when the content stores terminal of this area not (such as the deletion fragment of some unexpected winner contents or some contents) the required content segments of this user the time, can not be organized into a complete content, just need send request, notify the content stores fringe node of this area simultaneously to other regional content stores terminal nodes.Do not have when the content stores fringe node under the situation of required content yet, just ask for to content storage center node.
Fig. 2 shows the whole pattern that pushes of content distribution.Wherein the content stores Centroid can regularly or aperiodically be that unit pushes the integral body of content file to fringe node with the file according to judgement artificial setting or the focus content.What the content stores fringe node was received is complete content file.
Fig. 3,4,5,6 shows the intelligent distribution procedure of content.Generally speaking, the transmission of P2P content is initiated by the content stores terminal, and these content stores terminals are also as the P2P node.
As shown in Figure 3, the content stores terminal is generally obtained the various information of content by information distribution center, sets up P2P then and connect between each terminal node, and carry out the transmission of content.In the starting stage, owing to download node seldom, content also is in the state of " unexpected winner ", and this moment, the content stores terminal of this area did not generally all have the required content segments of user, can only send request to other regional content stores terminals.As shown in the figure, content stores fringe node CSEN_A subordinate's content stores terminal node CSTN sends the P2P connection request to another content stores fringe node CSEN_B subordinate's CSTN, and receives the content fragment of being stored from CSEN_B subordinate's content stores terminal node.
When CSEN_A downloads certain content when more and more, content stores terminal that information distribution center will perceive in certain area becomes " heat " gradually to obtaining of this content.Information distribution center will regularly be pushed to the content stores Centroid to the tabulation of these focus contents, by the content stores Centroid this tabulation will be handed down to each regional content stores fringe node again, as shown in Figure 4.
When the content stores fringe node obtains the tabulation of above-mentioned focus content, set up P2P with the content stores Centroid with the content stores fringe node respectively according to the content in the tabulation and be connected.As shown in Figure 5, CSEN_A learns that by the focus contents list CSEN_B and CSEN_C have certain content that this area becomes " heat ", therefore sets up P2P with CSEN_B, CSEN_C respectively and is connected.Simultaneously, the needs that these nodes also can obtain according to the focus content are set up P2P with content stores Centroid CSCN and are connected.
P2P connect to set up finish after, the transmission of content fragment is carried out in the tabulation of the content stores fringe node exchange content fragment that both sides had then, simultaneously also can be as required initiatively to some content fragment of content storage center node request.As shown in Figure 6, CSEN_A can obtain most of burst of certain focus content by CSEN_B and CSEN_C, but still lacks some burst, and at this moment CSEN_A just can apply for the fragment of these disappearances to content storage center node CSCN.
Although content stores fringe node and content stores terminal node have the branch of performance power, they all can be monitored.As shown in Figure 7, no matter be which kind of node, all need regularly to the tabulation of the resource management system report content fragment that they had.In order to prevent that resource management system from becoming bottleneck, the resource management system here also can be taked the mechanism of classification.
Therefore, when certain content after this area becomes focus gradually, local CSTN can learn the situation of change of distribution of content from resource management system, gradually reduce from the P2P node of far-end and obtain content fragment, then to the CSEN of this locality request content burst, the final content fragment of realizing progressively is distributed on local other the content stores terminal, realizes the localization of flow and the localization of focus content stores.
Claims (9)
1. the content classification storage and the transfer approach of a telecommunication level P 2 P network, wherein all shared contents all leave on three grades of nodes with P2P interaction capabilities, that is: content stores Centroid, content stores fringe node and content stores terminal node, wherein the calculating of content stores Centroid is the strongest with storage capacity, to be connected bandwidth the highest, stays on the network incessantly for a long time; The content stores fringe node is distributed in the edge of network access layer, compare with the content stores Centroid calculate and storage capacity a little less than, to be connected bandwidth lower, also is to stay on the network for a long time; The calculating of content stores terminal node is the most weak with storage capacity, it is minimum to be connected bandwidth, and the time of staying on the network is indefinite,
Wherein the whole initial data by examination, content legality all leave on the content stores Centroid, and the content stores Centroid regularly or aperiodically is distributed to " focus " content on the content stores fringe node,
When transmitting content, the content stores terminal node at first requires to download content to other guide storage terminal node, if other guide storage terminal node does not have corresponding content, then the content stores fringe node under it is asked for this content; If this content stores fringe node has corresponding content, then the content stores terminal node to the request of sending transmits this content, if do not have, then asks for this content to other guide storage fringe node; If other guide storage fringe node has corresponding content, then this content is sent to the content fringe node of the request of sending, and and then send to content stores terminal node that need to download this content, if other guide storage fringe node does not have corresponding content yet, then ask for this content to content storage center node, send this content the content fringe node of the request of sending to by the content stores Centroid, and and then send the content stores terminal node that needs to download this content to.
2. the method for claim 1 is characterized in that, the content stores Centroid is that the unit is pushed to content whole on the content stores fringe node with the complete file.
3. the method for claim 1, it is characterized in that, the content stores terminal node at first requires to download content to the other guide storage terminal node of this area, if the other guide storage terminal node of this area does not have required content, then ask for this content to other regional content stores terminal nodes, if other regional content stores terminal nodes are this content not also, ask for this content by this content stores terminal node to higher level's content stores fringe node again.
4. the method for claim 1, it is characterized in that, if the content stores fringe node does not have corresponding content when subordinate's content stores terminal node requires to ask for content, then ask for this content to contiguous content stores fringe node, if contiguous content stores fringe node does not have corresponding content yet, then ask for this content to content storage center node.
5. the method for claim 1 is characterized in that, the content stores terminal node obtains various information about content from an information distribution center, sets up P2P then and connects, and carries out the transmission of content.
6. method as claimed in claim 5, it is characterized in that, when certain content is downloaded more and morely, described information distribution center perceives this content and is gradually becoming the focus content, this information distribution center regularly is pushed to the content stores Centroid to the tabulation of focus content, by the content center node described focus contents list is issued to each content stores fringe node again, each content stores fringe node is set up with the P2P of other guide storage fringe node and/or content stores Centroid according to the content of focus contents list and is connected, to obtain the focus content.
7. the method for claim 1, it is characterized in that, each node in described content stores Centroid, content stores fringe node and the content stores terminal node is all regularly to a resource management system report contents list that they had, thereby these nodes are monitored.
8. method as claimed in claim 7, it is characterized in that, the content stores terminal node is learned the situation of change of distribution of content from described resource management system, when required content after this area becomes the focus content gradually, gradually reduce from other regional nodes and obtain this content, then the content stores terminal node to this area obtains this content, thereby this content finally progressively is distributed on the other guide storage terminal node of this area.
9. method according to any one of the preceding claims is characterized in that, the transmission of described content between peer node is to carry out in the mode of burst, obtains complete content by reorganization again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101287973A CN101345690B (en) | 2007-07-12 | 2007-07-12 | Contents grading memory of telecommunication level P2P network and transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101287973A CN101345690B (en) | 2007-07-12 | 2007-07-12 | Contents grading memory of telecommunication level P2P network and transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101345690A CN101345690A (en) | 2009-01-14 |
| CN101345690B true CN101345690B (en) | 2010-10-13 |
Family
ID=40247585
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101287973A Active CN101345690B (en) | 2007-07-12 | 2007-07-12 | Contents grading memory of telecommunication level P2P network and transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101345690B (en) |
Families Citing this family (33)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102308549A (en) * | 2009-02-06 | 2012-01-04 | 瑞典爱立信有限公司 | Network aware peer to peer |
| CN101902346A (en) | 2009-05-31 | 2010-12-01 | 国际商业机器公司 | P2P (Point to Point) content caching system and method |
| CN102098209B (en) * | 2009-12-14 | 2014-07-23 | 中国电信股份有限公司 | P2P traffic control method and system |
| CN102065119A (en) * | 2010-10-18 | 2011-05-18 | 中山大学 | Network interactive program-oriented network service system |
| WO2012106918A1 (en) | 2011-07-22 | 2012-08-16 | 华为技术有限公司 | Content processing method, device and system |
| CN102316362A (en) * | 2011-09-06 | 2012-01-11 | 中兴通讯股份有限公司 | Internet protocol television (IPTV) content scheduling method and apparatus thereof |
| CN103179150B (en) * | 2011-12-21 | 2016-04-06 | 明博教育科技股份有限公司 | A kind of method and system of data distributing of waterfall type |
| CN102710966A (en) * | 2012-06-13 | 2012-10-03 | 百视通网络电视技术发展有限责任公司 | Video live broadcast method and system based on HTTP (Hyper Text Transport Protocol) |
| CN103037015A (en) * | 2012-12-31 | 2013-04-10 | 乐视网信息技术（北京）股份有限公司 | Active P2P data distribution method and node client-side |
| CN103747047A (en) * | 2013-12-24 | 2014-04-23 | 乐视网信息技术（北京）股份有限公司 | CDN file storage method, file distribution control center and system thereof |
| CN103747049A (en) * | 2013-12-24 | 2014-04-23 | 乐视网信息技术（北京）股份有限公司 | CDN file distribution method, control center and system |
| CN103905527A (en) * | 2014-03-05 | 2014-07-02 | 深圳市同洲电子股份有限公司 | Content distribution method, related equipment and related system |
| CN104052808A (en) * | 2014-06-13 | 2014-09-17 | 乐视网信息技术（北京）股份有限公司 | Digital content acquiring method and system based on CDN |
| CN104735044A (en) * | 2014-11-18 | 2015-06-24 | 深圳市同洲电子股份有限公司 | Streaming media live broadcast method and system |
| CN104468796B (en) * | 2014-12-10 | 2018-10-09 | 深圳中兴网信科技有限公司 | Desktop data sharing method, desktop data shared system and server |
| CN106330997B (en) * | 2015-06-19 | 2019-08-09 | 网宿科技股份有限公司 | A method and system for content distribution of mobile terminal applications |
| CN106936870A (en) * | 2015-12-29 | 2017-07-07 | 北京广联达正源兴邦科技有限公司 | Network data shared platform, sharing method and shared system |
| CN106375410B (en) * | 2016-08-31 | 2019-09-20 | 赫里奥(苏州)科技有限公司 | A kind of hierarchical topology network-building method based on content center network |
| CN107995531B (en) * | 2016-10-26 | 2020-10-09 | 中国电信股份有限公司 | Method, device and system for transmitting IPTV video of mobile terminal |
| CN106375352B (en) * | 2016-12-02 | 2019-07-05 | 北京数码视讯科技股份有限公司 | The load-balancing method and device of edge content buffer network |
| CN108696895B (en) | 2017-04-07 | 2020-10-09 | 华为技术有限公司 | Resource acquisition method, device and system |
| CN109151613B (en) * | 2017-06-16 | 2022-12-02 | 中兴通讯股份有限公司 | Content distribution system and method |
| CN107707616B (en) * | 2017-08-21 | 2019-02-12 | 贵州白山云科技股份有限公司 | A kind of data transmission method and system |
| CN109561469A (en) * | 2017-09-25 | 2019-04-02 | 中兴通讯股份有限公司 | Caching method, device, storage medium and the electronic device of local content |
| CN109788025B (en) * | 2018-12-12 | 2022-06-28 | 北京世纪互联宽带数据中心有限公司 | Data grading method and device, electronic equipment and computer readable medium |
| CN111327651A (en) * | 2018-12-14 | 2020-06-23 | 华为技术有限公司 | Resource downloading method, device, edge node and storage medium |
| CN109885424B (en) * | 2019-01-16 | 2024-05-31 | 平安科技（深圳）有限公司 | Data backup method and device and computer equipment |
| CN110012106B (en) * | 2019-04-15 | 2021-01-29 | 北京邮电大学 | Edge calculation-based coordinated caching method, device and system |
| CN110417861B (en) * | 2019-06-25 | 2023-05-26 | 腾讯科技（北京）有限公司 | Information pushing method and related device |
| CN110677683B (en) * | 2019-09-30 | 2022-03-04 | 北京奇艺世纪科技有限公司 | Video storage and video access method and distributed storage and video access system |
| CN110856007B (en) * | 2019-11-21 | 2021-12-03 | 咪咕视讯科技有限公司 | Content distribution network, storage optimization method thereof, electronic device, and storage medium |
| CN115174696B (en) * | 2022-09-08 | 2023-01-20 | 北京达佳互联信息技术有限公司 | Node scheduling method and device, electronic equipment and storage medium |
| CN118075560B (en) * | 2024-03-06 | 2025-01-07 | 书行科技(北京)有限公司 | Media data generation method, device, computer equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1735264A (en) * | 2004-08-10 | 2006-02-15 | 皇家飞利浦电子股份有限公司 | Method and device for point-to-point opposite communication |
| EP1633111A1 (en) * | 2004-09-03 | 2006-03-08 | Microsoft Corporation | A system and method for distributed streaming of scalable media |
-
2007
- 2007-07-12 CN CN2007101287973A patent/CN101345690B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1735264A (en) * | 2004-08-10 | 2006-02-15 | 皇家飞利浦电子股份有限公司 | Method and device for point-to-point opposite communication |
| EP1633111A1 (en) * | 2004-09-03 | 2006-03-08 | Microsoft Corporation | A system and method for distributed streaming of scalable media |
Non-Patent Citations (1)
| Title |
|---|
| 张景春等.基于分区结构的P2P目录服务策略.《郑州大学学报（理学版）》.2007,第39卷(第2期),33-36. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101345690A (en) | 2009-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101345690B (en) | Contents grading memory of telecommunication level P2P network and transmission method | |
| CN101641685B (en) | Method for file transfer by a peer-to-peer file transfer model and a client-server transfer model | |
| EP2135430B1 (en) | Hierarchically clustered p2p streaming system | |
| Lawey et al. | BitTorrent content distribution in optical networks | |
| CN101567796B (en) | Multimedia network with fragmented content and business method thereof | |
| CN102907065A (en) | System and method for managing data delivery in a peer-to-peer network | |
| CN101997891B (en) | Method, device and system for allocating P2P media stream | |
| KR20100084179A (en) | Method for caching content data packages in caching nodes | |
| CN113453038B (en) | Effectiveness optimal collaborative cache management method under CDN-P2P hybrid architecture | |
| CN101272404B (en) | Link selection method of P2P video living broadcast system data scheduling | |
| CN101800731B (en) | Network transmission management server, network transmission management method and network transmission system | |
| US7898993B2 (en) | Efficiency and resiliency enhancements for transition states in ad hoc networks | |
| CN1937554A (en) | Method for making P2P file download flow localized | |
| CN101309282A (en) | A method, server and system for transferring files in a local area network | |
| CN103037015A (en) | Active P2P data distribution method and node client-side | |
| CN101854387A (en) | P2P traffic optimization method and system under distributed index server architecture | |
| CN109194993B (en) | Media file distribution method and file distribution platform | |
| CN103905923A (en) | Content caching method and device | |
| CN104767796B (en) | A kind of car networking hot point resource management method based on mobile P 2 P | |
| D'Acunto et al. | Bandwidth allocation in bittorrent-like vod systems under flashcrowds | |
| CN101369915B (en) | P2P operating network resource management system | |
| CN112925946B (en) | Service data storage method and device and electronic equipment | |
| Funasaka et al. | Dynamic peer grouping method conforming with tit-for-tat strategy for p2p file distribution systems | |
| CN103037017A (en) | Passive P2P data distribution method and node client-side | |
| US20080170589A1 (en) | Server and simultaneous access control method thereof |
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 |