CN101272404B - Link selection method of P2P video living broadcast system data scheduling - Google Patents
Link selection method of P2P video living broadcast system data scheduling Download PDFInfo
- Publication number
- CN101272404B CN101272404B CN2008101116565A CN200810111656A CN101272404B CN 101272404 B CN101272404 B CN 101272404B CN 2008101116565 A CN2008101116565 A CN 2008101116565A CN 200810111656 A CN200810111656 A CN 200810111656A CN 101272404 B CN101272404 B CN 101272404B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- request
- neighbor
- neighbor 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
- 238000010187 selection method Methods 0.000 title abstract 2
- 238000000034 method Methods 0.000 claims abstract description 27
- 230000005540 biological transmission Effects 0.000 claims abstract description 16
- 238000012913 prioritisation Methods 0.000 claims description 4
- 230000015572 biosynthetic process Effects 0.000 claims description 3
- 230000004907 flux Effects 0.000 abstract 2
- 238000000205 computational method Methods 0.000 description 4
- 230000003139 buffering effect Effects 0.000 description 3
- 230000000052 comparative effect Effects 0.000 description 3
- 230000000875 corresponding effect Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
Images
Abstract
The invention discloses a link selection method for data scheduling of a P2P video living transmission system, which comprises the steps that: the data request nodes registers to a login server, and the login server distributes neighbor nodes to the request nodes; the request nodes establish connections with the distributed neighbor nodes, and the neighbor nodes are graded into different levels according to the link-cost; the request nodes acquire the request data from the neighbor nodes according to the different levels of the neighbor nodes and based on the information of data content and data transmitting performance. In the same data scheduling order, the method can make better use of network resources, thereby remarkably reducing the flux of going through NAT and the flux of stepping over autonomous system and backbone network of internet service providers.
Description
Technical field
The present invention relates to the network flow-medium technical field, more specifically, the present invention relates to the link selecting method in a kind of P2P video living broadcast system data scheduling.
Background technology
In recent years, receive increasing concern based on the net cast technology of P2P, various P2P net cast softwares have also been come into people's life.
The P2P technology is to adopt point-to-point mode to carry out transfer of data, and is different with traditional client/server (C/S) pattern, and in the P2P system, node should also will be the neighbor node service simultaneously from the neighbor node data download, uploads data and gives neighbor node.
Fig. 1 as shown in Figure 1, in the P2P video living transmission system, mainly contains 2 kinds of roles, logon server (Tracker) and node for the structure chart of existing P2P video living transmission system.The effect of Tracker is the information of distributing neighbor node and safeguarding current line node for initiate node, and node responds the request of data of neighbor node simultaneously to the neighbor node request msg.
In the P2P video living transmission system, each node all has a core buffer, the data of the current broadcast of storage in this buffering area, and along with the carrying out of playing, buffer window constantly moves forward, simultaneously, the video data that node meeting whereabouts neighbor node please be looked for novelty.Node is in the playing programs process, regularly send buffering area snapshot (BufferMap) message to neighbor node, BufferMap message is a snapshot of this section dot buffer zone information, from BufferMap, can see the current data that have of node, each node carries out the request of data scheduling according to the BufferMap and the bandwidth situation of neighbor node.
In the prior art, the course of work of P2P VOD system is as follows: node sends to Tracker and adds channel request, and Tracker distributes neighbor node for this node, and the neighbor node of this node and distribution connects, after the successful connection, carry out the P2P transfer of data between the node.
The P2P The Application of Technology has solved under traditional C/S pattern the problem that increase server bandwidth and disposal ability along with node become system bottleneck, still, it is found that P2P uses the backbone traffic that has taken a large amount of preciousnesses, has limited the transmittability of network.
Summary of the invention
Do not consider the limited defective of network capacity that node link cost and transmittability cause for overcoming in the existing P2P video living broadcast system data scheduling, the present invention proposes a kind of link selecting method of P2P video living broadcast system data scheduling.
According to an aspect of the present invention, proposed the link selecting method in a kind of P2P video living broadcast system data scheduling, having comprised:
Step 10), request of data node are registered to logon server, and described logon server obtains the network topological information of described request node; Described logon server distributes neighbor node according to the upgrading Network topological information node listing of described request node to the described request node;
Step 20), the neighbor node of described request node and described distribution connects, to described neighbor node prioritization, it comprises the information of data content to described neighbor node to the described request node broadcasts immediately according to link cost;
Step 30), the described request node calculates, upgrades the transmittability of described neighbor node;
Step 40), the described request node is according to the priority of described neighbor node, information and data transmission capabilities according to the data content of described neighbor node obtain request msg from described neighbor node.
Wherein, in the step 10), described logon server obtains AS number and ISP number of described request node according to the described request IP addresses of nodes.
Wherein, in the step 10), described logon server is stored in the described request node in the described node listing according to the order of ISP number of node, AS number and IP address size.
Wherein, in the step 10), described logon server distributes several neighbor nodes with identical IP network section and/or several to have identical ISP number neighbor node for the described request node and/or several have identical AS number neighbor node.
Wherein, step 20) further comprise: the described request node sorts its neighbor node tabulation according to link cost, the neighbor node that link cost is little is as the override requests node.
Wherein, step 20) in, its neighbor node tabulation sorted according to link cost further to be comprised:
Step 210) if requesting node is positioned at Intranet, the link cost of neighbor node that then is positioned at Intranet is less; If any a plurality of such neighbor nodes, the neighbor node cost that then has more common prefix is less;
Step 220) if requesting node is not positioned at Intranet, then to have same AS number neighbor node cost less with the described request node; If any a plurality of such neighbor nodes, the neighbor node cost that then has more common prefix is less;
Step 230) if requesting node is not positioned at Intranet, and do not exist and requesting node AS number identical neighbor node, then to have same ISP number neighbor node cost less with requesting node; If any a plurality of such neighbor nodes, the neighbor node cost that then has more common prefix is less.
Wherein, step 30) in, the transmittability of described neighbor node can be between described request node two secondary data request, the maximum of the data volume that described neighbor node can send to the described request node.
Wherein, step 30) further comprise:
Step 310), the N time data total amount of described request nodes records to certain neighbor node request, described data total amount is less than or equal to the transmittability of certain neighbor node;
Step 320), when the described request node is received the packet that described neighbor node sends, the data total amount of the neighbor node that receives is increased;
Step 330), carry out when scheduling the N+1 time, calculate the data total amount that requesting node receives from neighbor node between dispatching for the N time and the N+1 time at the described request node;
Step 340) if the data total amount that requesting node receives less than data total amount to the neighbor node request, the transmittability that then reduces neighbor node is the described data total amount number that receives; If the data total amount that receives more than or equal to described transmittability, then increases the transmittability of neighbor node within the specific limits.
Wherein, step 40) further comprises: if certain neighbor node comprises the data of described request node request, and the transmittability of described neighbor node is greater than or equal to this data total amount to described neighbor node request of described request node, the request of data formation of described data being put into described neighbor node; The described request node sends request and obtains data to described neighbor node.
Wherein, step 40) further comprise: can provide under the required same data conditions at a plurality of neighbor nodes, the described request node preferentially sends request to the low neighbor node of link cost.
Under same data dispatch order, this method can the better utilization Internet resources, significantly reduce the flow of passing through NAT and the backbone traffic of crossing over autonomous system (AS), ISP (ISP), can be when guaranteeing QOS, make the data transfer throughput optimization of P2P video living transmission system, reduce the Network Transmission cost.
Description of drawings
Fig. 1 is a P2P video living transmission system structure chart of the prior art;
Fig. 2 is the query tree structure schematic diagram of node IP to AS, ISP;
Fig. 3 is the querying flow figure of IP to AS, ISP;
Fig. 4 is a relatively flow chart of link cost according to an embodiment of the invention.
Embodiment
Below in conjunction with the drawings and specific embodiments the link selecting method in a kind of P2P video living broadcast system data scheduling provided by the invention is described in detail.
Existing P 2P The Application of Technology has solved under traditional C/S pattern the problem that increase server bandwidth and disposal ability along with node become system bottleneck, but the application of P2P takies the backbone traffic of a large amount of preciousnesses, existing method is only considered the influence of P2P topological structure to cross-domain flow rate, does not consider the effect of data dispatching method to cross-domain flow rate.Topological structure to P2P is optimized, and can reduce P2P and use the backbone traffic that takies, and on this basis, the data dispatching method of optimizing application can further reduce P2P and use the backbone traffic that takies.
In the P2P video living transmission system, when node need be downloaded certain data block, may all have this data block by several neighbor nodes.According to embodiments of the invention, in this case, how to make the network cost of data download minimum: node sorts the cost of neighbor node according to network link, when carrying out the data download, preferentially the neighbor node that comes the front from the neighbor node tabulation is downloaded the data that meet its transmittability, promptly preferential from the lower node data download of link cost, institute's data downloaded is smaller or equal to the maximum transmitted ability of neighbor node.
The request of data node is at first registered to Tracker, and Tracker obtains the network topological information of its AS and ISP according to the IP address of requesting node; Tracker distributes neighbor node to requesting node subsequently according to the AS and the ISP information updating node listing of requesting node; Requesting node and neighbor node connect, and to the neighbor node prioritization, neighbor node is broadcasted the information of its data content immediately to requesting node, and requesting node calculates, upgrades and write down the transmittability of neighbor node; Requesting node is according to the priority of neighbor node, and information and data transmission capabilities according to the data content of neighbor node obtain request msg from neighbor node respectively.
Obtaining of node self topology information
Node is after Tracker sends the adding channel request, Tracker is according to topology informations such as this node places of this IP addresses of nodes information acquisition AS number, ISP number, and described topology information sent to this node with the alternative information of neighbor nodes that distributes for this node, Tracker must have the function according to IP addresses of nodes query node place AS and ISP in realization, can be stored in the overall AS topology information of having obtained in the file, Tracker reads this document and obtains overall AS topology information when starting.
The storage file of overall situation AS topology information is the record sheet of IP corresponding A S and ISP, and this record sheet can be as follows:
| The IP address | The IP prefix length | Place AS | Place ISP |
Tracker stores record, as shown in Figure 2 after reading this document with the version of tree.The superiors are arrays among Fig. 2, and each element of array all is the pointer of one tree, and preceding 8 bit that point to node IP address respectively are from 1 to 223 IP query sub tree to AS, ISP.Every query sub tree is one 2 fork tree.Shown in Fig. 2 and 3, query script is as follows: at first obtaining preceding 8 bit of IP address, inquire about under corresponding subtree then, is 6.1.2.3 as the IP address, then entering the 6th stalk tree inquires about, check the 9th bit of IP address then,, then travel through to left subtree because the 9th bit is 0, remove to inquire about the 10th bit then, and the like, till running into leaf node, obtain AS number and ISP number of place of node.
Tracker is that node distributes neighbours according to relevant neighbor node system of selection.Have the neighbor node of identical IP network section for node distributes one or several, and/or one or several have identical ISP number neighbor node, and/or one or several has identical AS number neighbor node.Send message to node then.Comprised the information of neighbor nodes of node and the form of node self in the message, as shown in the table:
| The channel UUID (universe unique identification) that is correlated with | The AS at node place | The ISP at node place | The neighbours' number that distributes | Neighbours' IP, PORT (port) |
Neighbor node link cost comparative approach
In the P2P video living transmission system, each node all has a neighbor node tabulation, in the present embodiment, sorts according to link cost for the neighbor node tabulation of node, and the node that link cost is little comes the front.Fig. 4 illustrates link cost comparison flow chart according to an embodiment of the invention, as shown in Figure 4, for this node (request of data node), given two neighbor nodes, the method for carrying out the link cost comparison is as follows, supposes 2 neighbor node A and B:
If this node of step S1 is the Intranet node, then enter step S2, otherwise, enter step S3;
If step S2 A be with this node in same Intranet node and B is not, then the link cost of A is less, finishes relatively; If B be with this node at the node of same Intranet and A is not, then the link cost of B is less; If node A and Node B all are and the node of this node in same Intranet, then enter step S5;
Step S3, relatively according to the AS territory, if A with this node in same AS territory and B is not, then the link cost of A is lower, finishes relatively; If in same AS territory and A is not, then the link cost of B is lower with this node for B, finish relatively; If both and this node not in same AS territory, then enter step S4, if both and this node then enter step S5 in same AS territory;
Step S4, relatively according to ISP, if A with this node in same ISP and B is not, then the link cost of A is lower, finishes relatively; If in same AS and A is not, then the link cost of B is lower with this node for B, finish relatively, if both and this node in same ISP, then enter step S5;
If step S5 A is many with the common prefix figure place of this node, then the link cost of A is lower, otherwise the link cost of B is lower, finishes relatively.
The management of neighbor node tabulation
The situation that the neighbor node tabulation increases neighbor node has 2 kinds, and a kind of is that this node sends neighbours' connection request to other nodes, and the positive reply of having received this node; Another kind is that this node has received the connection request that other nodes send, and agrees and this node becomes neighbours.No matter be that node sends neighbours' connection request message to other nodes, still send response neighbours connection request message to other nodes, the topology information that all should comprise this node in the message comprises that whether this node is Intranet node, this node place AS number, ISP number.Like this, node just can be known the topology information of neighbor node, according to the above-mentioned neighbor node link cost comparative approach of carrying the link cost of neighbor node is compared.
When a new node joins the neighbor node tabulation of this node, the individual node of i (i is since 1) in the neighbor node tabulation of this new node and this node is link cost relatively, if it is low to occupy the link cost of i node in the node listing near the new node link cost, then this node is inserted into the front of i node in the neighbor node tabulation; If high, i+1 node in then tabulating with neighbor node carries out above-mentioned comparison procedure, up to the position of finding this new node to insert.
Above-mentioned comparative approach can guarantee that node in the neighbor node tabulation is the arrangement from small to large according to chain degree cost.
The definition of neighbor node transmittability and computational methods
In the P2P video living transmission system, each node all has several neighbor nodes.Node is according to data conditions in own and the neighbor node buffering area, regularly to the neighbor node request msg.Different neighbor nodes is because the difference of physical location, disposal ability, the node number of degrees is also different with the bandwidth of this node transmission data.
In order to realize goal of the invention, the transmittability (Capability) of neighbor node to this node is defined as: between twice request of data of this node, the maximum of the data volume that neighbor node can send to this node.Concrete computational methods are as follows:
1, the N time request of nodes records is Reques tNum to the data total amount of each neighbor node request, and RequstNum is less than or equal to Capability;
2, when node is received the packet that neighbor node sends, the data total amount of the neighbor node that receives is increased;
3, when node carries out the N+1 time scheduling, calculate the data total amount ReceiveNum that node receives from neighbor node between 2 scheduling;
If it is ReceiveNum that the data volume that 4 nodes receive, then reduces the ability of neighbor node less than the data volume to the neighbor node request; If ReceiveNum more than or equal to Capability, then increases the Capability of neighbor node within the specific limits.
The data dispatch process of P2P video living transmission system
Node obtains this data block that should ask set according to certain request of data priority computational methods; According to the computational methods of neighbor node transmittability, upgrade the ability of all neighbor nodes; This data block that should ask for each, carry out following operation: for each neighbor node, if i neighbor node contains this data block, and ability is greater than the data total amount of this scheduling of current node to this neighbor node request, the request of data formation of then these data certainly being put into i neighbor node; Send request of data with posterior nodal point to each neighbor node.
Above-mentioned scheduling process can guarantee, node is under the low neighbor node of cost has the ability to provide required data conditions, preferentially ask to the low neighbor node of cost, and do not have ability to provide under the required data conditions of this node at the low neighbor node of cost, just ask to the high neighbor node of cost; Like this, flow is distributed on the lower transmission link of cost as far as possible.
It should be noted that at last, above embodiment is only in order to describe technical scheme of the present invention rather than the present technique method is limited, the present invention can extend to other modification, variation, application and embodiment on using, and therefore thinks that all such modifications, variation, application, embodiment are in spirit of the present invention and teachings.
Claims (10)
1. the link selecting method in the P2P video living broadcast system data scheduling comprises:
Step 10), request of data node are registered to logon server, and described logon server distributes neighbor node to described request of data node;
Step 20), the neighbor node of described request of data node and described distribution connects, to described neighbor node prioritization, it comprises the information of data content to described neighbor node to described request of data node broadcasts immediately according to link cost; Wherein, describedly according to link cost described neighbor node prioritization is comprised that described request of data node sorts the tabulation of its neighbor node according to link cost, the neighbor node that link cost is little is as the override requests node;
Step 30), described request of data node calculates, upgrades the transmittability of described neighbor node;
Step 40), described request of data node is according to the priority of described neighbor node, information and data transmission capabilities according to the data content of described neighbor node obtain request msg from described neighbor node.
2. the process of claim 1 wherein that step 10) comprises that also described logon server obtains the network topological information of described request of data node; Described logon server is according to the upgrading Network topological information node listing of described request of data node.
3. the method for claim 2, wherein, in the step 10), described logon server obtains autonomous system AS number and ISP number of described request of data node according to described request of data IP addresses of nodes.
4. the method for claim 3, wherein, in the step 10), described logon server has the function according to ISP number of the IP addresses of nodes query node, autonomous system AS number, and described request of data node is stored in the described node listing.
5. the method for claim 3, wherein, in the step 10), described logon server is that described request of data node distributes several neighbor nodes with identical IP network section and/or several to have identical ISP number neighbor node and/or several have identical autonomous system AS number neighbor node.
6. the method for claim 2, wherein, step 20), its neighbor node tabulation sorted according to link cost further to be comprised:
Step 210) if the request of data node is positioned at Intranet, the link cost of neighbor node that then is positioned at Intranet is less; If any a plurality of such neighbor nodes, the neighbor node cost that then has more common prefix is less;
Step 220) if the request of data node is not positioned at Intranet, then to have same autonomous system AS number neighbor node cost less with described request of data node; If any a plurality of such neighbor nodes, the neighbor node cost that then has more common prefix is less;
Step 230) if the request of data node is not positioned at Intranet, and do not exist and AS number identical neighbor node of request of data node, then to have same ISP number neighbor node cost less with the request of data node; If any a plurality of such neighbor nodes, the neighbor node cost that then has more common prefix is less.
7. the method for claim 2, wherein, step 30), the transmittability of described neighbor node is the maximum of the data volume that described neighbor node sends to described request of data node between described request of data node two secondary data request.
8. the method for claim 7, wherein, step 30) further comprise:
Step 310), the N time data total amount of described request of data nodes records to certain neighbor node request, described data total amount is less than or equal to the transmittability of certain neighbor node;
Step 320), when described request of data node is received the packet that described neighbor node sends, the data total amount of the neighbor node that receives is increased;
Step 330), carry out when scheduling the N+1 time, calculate the data total amount that the request of data node receives from neighbor node between dispatching for the N time and the N+1 time at described request of data node;
Step 340) if the data total amount that the request of data node receives less than data total amount to the neighbor node request, the transmittability that then reduces neighbor node is the described data total amount number that receives; If the data total amount that receives more than or equal to described transmittability, then increases the transmittability of neighbor node within the specific limits.
9. the method for claim 1, wherein, step 40) further comprises: if certain neighbor node comprises the data of described request of data node request, and the transmittability of described neighbor node is greater than or equal to the data total amount of described request of data node to described neighbor node request, the request of data formation of described data being put into described neighbor node; Described request of data node sends request and obtains data to described neighbor node.
10. the method for claim 10, wherein, step 40) further comprise: can provide under the required same data conditions at a plurality of neighbor nodes, described request of data node preferentially sends request to the low neighbor node of link cost.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101116565A CN101272404B (en) | 2008-05-15 | 2008-05-15 | Link selection method of P2P video living broadcast system data scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101116565A CN101272404B (en) | 2008-05-15 | 2008-05-15 | Link selection method of P2P video living broadcast system data scheduling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101272404A CN101272404A (en) | 2008-09-24 |
| CN101272404B true CN101272404B (en) | 2011-10-19 |
Family
ID=40006088
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101116565A Active CN101272404B (en) | 2008-05-15 | 2008-05-15 | Link selection method of P2P video living broadcast system data scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101272404B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101771550A (en) * | 2008-12-31 | 2010-07-07 | 华为技术有限公司 | Method, device and system for acquiring media content in P2P network |
| CN101883124B (en) * | 2009-05-08 | 2013-03-27 | 北京大学 | Data downloading method, device and system of on-demand system |
| CN101562804B (en) * | 2009-05-12 | 2012-09-05 | 中兴通讯股份有限公司 | Region management server system based on mobile P2P and deploying method thereof |
| CN101969448B (en) * | 2009-06-17 | 2013-03-13 | ***通信集团公司 | Method, system and equipment for searching active node in P2P streaming media system |
| CN102111333B (en) * | 2011-02-17 | 2015-09-16 | 上海聚欣网络科技有限公司 | Within network nodes for determining the method for network speed limit information, device and equipment |
| CN102130962A (en) * | 2011-04-06 | 2011-07-20 | 上海少思网络科技有限公司 | Method for screening network nodes for downloading acceleration based on cloud computing |
| US9413846B2 (en) | 2012-12-14 | 2016-08-09 | Microsoft Technology Licensing, Llc | Content-acquisition source selection and management |
| US9716749B2 (en) | 2012-12-14 | 2017-07-25 | Microsoft Technology Licensing, Llc | Centralized management of a P2P network |
| US9294580B2 (en) * | 2012-12-14 | 2016-03-22 | Microsoft Technology Licensing, Llc | Managed P2P network with content-delivery network |
| US10391387B2 (en) | 2012-12-14 | 2019-08-27 | Microsoft Technology Licensing, Llc | Presenting digital content item with tiered functionality |
| CN103023768B (en) * | 2013-01-11 | 2015-11-04 | 中国科学院声学研究所 | Edge routing node and its method from multi-source prefetching content |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6667960B1 (en) * | 2000-04-29 | 2003-12-23 | Hewlett-Packard Development Company, L.P. | Protocol for identifying components in a point-to-point computer system |
| WO2004077738A3 (en) * | 2003-02-21 | 2004-12-16 | Nortel Networks Ltd | Connector module with power-over-ethernet functionality |
| CN1645829A (en) * | 2005-01-27 | 2005-07-27 | 中国科学院计算技术研究所 | Topological matching method for structured P2P system |
| EP1737253A1 (en) * | 2005-06-20 | 2006-12-27 | Alcatel | Fault tolerant single plane switch fabric for a telecommunication system |
| CN1968164A (en) * | 2005-11-17 | 2007-05-23 | 中国科学院计算技术研究所 | Global Internet topology knowledge-based P2P application construction method |
-
2008
- 2008-05-15 CN CN2008101116565A patent/CN101272404B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6667960B1 (en) * | 2000-04-29 | 2003-12-23 | Hewlett-Packard Development Company, L.P. | Protocol for identifying components in a point-to-point computer system |
| WO2004077738A3 (en) * | 2003-02-21 | 2004-12-16 | Nortel Networks Ltd | Connector module with power-over-ethernet functionality |
| CN1645829A (en) * | 2005-01-27 | 2005-07-27 | 中国科学院计算技术研究所 | Topological matching method for structured P2P system |
| EP1737253A1 (en) * | 2005-06-20 | 2006-12-27 | Alcatel | Fault tolerant single plane switch fabric for a telecommunication system |
| CN1968164A (en) * | 2005-11-17 | 2007-05-23 | 中国科学院计算技术研究所 | Global Internet topology knowledge-based P2P application construction method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101272404A (en) | 2008-09-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101272404B (en) | Link selection method of P2P video living broadcast system data scheduling | |
| CN110417916B (en) | Content distribution method capable of feeding back income, central node and edge node | |
| CN101567796B (en) | Multimedia network with fragmented content and business method thereof | |
| CN101237429B (en) | Stream media living broadcasting system, method and device based on content distribution network | |
| JP5745169B2 (en) | Content processing method, content processing device, and content processing system | |
| CN101534204B (en) | Streaming media information distribution system and method thereof and user end | |
| US9497035B2 (en) | Method, device, and system for playing media based on P2P | |
| CN101764831B (en) | Method and system for sharing stream media data, and stream media node | |
| CN102065112B (en) | Peer-to-peer (P2P) network system and method and related device for establishing the same | |
| CN102143199A (en) | Content acquisition method, node and content network | |
| US20110153835A1 (en) | System and method for controlling peer-to-peer connections | |
| CN101997891B (en) | Method, device and system for allocating P2P media stream | |
| CN101841553A (en) | Method, user node and server for requesting location information of resources on network | |
| CN101640699A (en) | P2P streaming media system and streaming media downloading method thereof | |
| CN103634692A (en) | CDN (content distribution network) and P2P (peer-to-peer) based hybrid stream media video-on-demand system | |
| WO2002060127A2 (en) | Distributed multicast caching technique | |
| CN102308549A (en) | Network aware peer to peer | |
| CN102075562A (en) | Cooperative caching method and device | |
| CN113453038B (en) | Effectiveness optimal collaborative cache management method under CDN-P2P hybrid architecture | |
| CN101729581A (en) | Method, system and device for realizing re-orientation in P2P network | |
| CN101499914A (en) | Parent node selection method, system and node for multicast system | |
| WO2016180284A1 (en) | Service node allocation method, device, cdn management server and system | |
| CN102740165B (en) | Peer-to-peer streaming media living broadcast system and data transmission method therefor | |
| CN101394339A (en) | Method, system and apparatus for routing implementation in peer-to-peer network | |
| CN103685344A (en) | Synergetic method and system for multiple P2P (point-to-point) cache peers |
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: HEYI NETWORK TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: INSTITUTE OF COMPUTING TECHNOLOGY, CHINESE ACADEMY OF SCIENCES Effective date: 20121023 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20121023 Address after: 6 floors, block A, Sinosteel International Plaza, No. 8, Haidian Avenue, Beijing, Haidian District Patentee after: 1VERGE INTERNET TECHNOLOGY (BEIJING) Co.,Ltd. Address before: 100190 Haidian District, Zhongguancun Academy of Sciences, South Road, No. 6, No. Patentee before: Institute of Computing Technology, Chinese Academy of Sciences |
|
| CP03 | Change of name, title or address |
Address after: Zone A and C, 5 / F, block a, Sinosteel International Plaza, No. 8, Haidian Street, Haidian District, Beijing Patentee after: Youku network technology (Beijing) Co.,Ltd. Address before: 6 floors, block A, Sinosteel International Plaza, No. 8, Haidian Avenue, Beijing, Haidian District Patentee before: 1VERGE INTERNET TECHNOLOGY (BEIJING) Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200624 Address after: 310052 room 508, floor 5, building 4, No. 699, Wangshang Road, Changhe street, Binjiang District, Hangzhou City, Zhejiang Province Patentee after: Alibaba (China) Co.,Ltd. Address before: 100080 Beijing Haidian District city Haidian street A Sinosteel International Plaza No. 8 block 5 layer A, C Patentee before: Youku network technology (Beijing) Co.,Ltd. |
|
| TR01 | Transfer of patent right |