CN110493327B - Data transmission method and device - Google Patents
Data transmission method and device Download PDFInfo
- Publication number
- CN110493327B CN110493327B CN201910716632.0A CN201910716632A CN110493327B CN 110493327 B CN110493327 B CN 110493327B CN 201910716632 A CN201910716632 A CN 201910716632A CN 110493327 B CN110493327 B CN 110493327B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- nodes
- downloading
- child
- 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
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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1053—Group management mechanisms with pre-configuration of logical or physical connections with a determined number of other peers
-
- 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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1053—Group management mechanisms with pre-configuration of logical or physical connections with a determined number of other peers
- H04L67/1055—Group management mechanisms with pre-configuration of logical or physical connections with a determined number of other peers involving connection limits
Abstract
The invention discloses a data transmission method and a data transmission device, wherein the method comprises the following steps: the node downloads data from a server side at an initial stage; after the initial phase, attempting to download data from other nodes if the node has no child nodes; and if the node has child nodes, keeping downloading data from the server. The invention can effectively avoid the occurrence of loop in the P2P transmission link, thereby avoiding the condition that no node is connected with the server and ensuring the data download quality of the nodes on the whole link.
Description
Technical Field
The present invention relates to the field of streaming media technologies, and in particular, to a data transmission method and apparatus.
Background
In a CDN (Content Delivery Network) and P2P (peer-to-peer) live broadcast system, a client serves as a node in a P2P transmission link, a root node downloads data from a CDN server, and each child node downloads data from its parent, and the transmission link is as shown in fig. 1 a.
However, a loop easily occurs in the current P2P transmission link, so that no node downloads data from the CDN server, the nodes on the entire link cannot normally download data, and finally the connection is disconnected overtime, thereby affecting the overall download quality and reducing the sharing rate.
Disclosure of Invention
In order to solve the problem that a loop easily occurs in a transmission link of the existing P2P, embodiments of the present invention provide a data transmission method and apparatus. The technical scheme is as follows:
in a first aspect, a data transmission method is provided, where the method includes:
the node downloads data from a server side at an initial stage;
after the initial stage, judging whether the self node has a child node or not;
attempting to download data from other nodes if the node has no child nodes;
and if the node has child nodes, keeping downloading data from the server.
Optionally, the method further includes:
and if the node finishes downloading the data from the father node of the node and has a child node, switching back to the server side for downloading the data.
Optionally, the method further includes:
if the node downloads data from the server, after all the child nodes of the node finish downloading the data from the node, the node tries to download the data from other nodes.
Optionally, the method further includes:
after the initial phase, the node expects a value F based on the data sourcenThe manner in which the data is acquired is determined,
Wherein, Fn＝xn×(yn-yn-1+a)，
xnNumber of child nodes, y, representing the current nodenRepresenting the number of parent nodes of the current node, yn-1Representing the number of father nodes of the last sampling point, and a is more than 0 and less than 1.
Optionally, the method further includes:
if FnIs 0 and the node is currently downloading data from the server, the node attempts to download data from other nodes;
if FnIf the value of the node is less than 0, the node is switched back to the server side for data downloading;
if FnIs greater than 0, the node keeps downloading data from the current data source.
Optionally, the step of the node attempting to download data from other nodes includes:
the node sends a subscription request;
if the node receives the response information of accepting the subscription, the node downloads data from the subscribed node;
and if the node receives the response information of refusing the subscription, the node cannot download the data from the subscribed node.
Optionally, after the step of sending the subscription request by the node, the method includes:
before the node does not receive the response information, if the node receives the subscription request sent by other nodes, the node sends the response information of refusing the subscription to the node
In a second aspect, there is provided a data transmission apparatus, the apparatus including:
the downloading module is used for downloading data from the server side in the initial stage;
the judging module is used for judging whether the self node has a child node or not after the initial stage;
the downloading module is used for trying to download data from other nodes when the node has no child node;
and the downloading module is also used for keeping downloading data from the server side when the node has a child node.
Optionally, the downloading module is configured to switch back to the server for data downloading when the node finishes downloading data from its parent node and the node has a child node.
Optionally, the downloading module is configured to, if the node downloads data from the server, after all child nodes of the node finish downloading data from the node, the node attempts to download data from other nodes.
Optionally, the determining module is further configured to, after the initial stage, expect value F based on data sourcenThe manner in which the data is acquired is determined,
wherein, Fn＝xn×(yn-yn-1+a)，
xnNumber of child nodes, y, representing the current nodenRepresenting the number of parent nodes of the current node, y n-1Representing the number of father nodes of the last sampling point, and a is more than 0 and less than 1.
Optionally, the downloading module is further configured to:
when F is presentnIs 0 and when the node is currently downloading data from the server, then the node attempts to download data from other nodes;
when F is presentnIs less than 0, the node switches back to the serviceDownloading data by the terminal;
when F is presentnWhen the value of (d) is greater than 0, the node keeps downloading data from the current data source.
Optionally, the downloading module is specifically configured to:
sending a subscription request;
if the node receives the response information of accepting the subscription, downloading data from the subscribed node;
and if the node receives the response information of refusing the subscription, the data can not be downloaded from the subscribed node.
Optionally, the downloading module is further configured to:
before the node does not receive the response information, if the node receives the subscription request sent by other nodes, the node sends the response information of refusing the subscription to the node
In a third aspect, a node device is provided, including:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of the first aspect.
In a fourth aspect, a computer-readable storage medium is provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the data transmission method of the first aspect.
In the implementation of the invention, all nodes download data from the server firstly in the initial stage, after the initial stage, no node of a child node exists, data can be tried to be downloaded from other nodes, and the node of the child node cannot try to download data from other nodes and needs to keep downloading data from the server, so that a loop of a P2P transmission link can be effectively avoided, the condition that no node is connected with the server is also avoided, and the data downloading quality of the nodes on the whole link can be ensured.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1a is a schematic diagram of a normal p2p transmission link according to an embodiment of the present invention;
fig. 1b is a schematic diagram of a p2p transmission link with loopback appearing according to an embodiment of the present invention;
fig. 2 is a flowchart of a data transmission method according to an embodiment of the present invention;
fig. 3 is a schematic flowchart of a data transmission method for initiating a unidirectional subscription between nodes according to an embodiment of the present invention;
fig. 4 is a flowchart illustrating a data transmission method for initiating a subscription among multiple nodes simultaneously according to an embodiment of the present invention;
fig. 5 is a block diagram of a data transmission apparatus according to an embodiment of the present invention;
fig. 6 is a block diagram of a node device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail with reference to the accompanying drawings.
In the existing P2P transmission method, when a node selects an uplink data source, i.e., a parent node, no limitation is imposed, and any node can be selected as the parent node to establish a connection, so that a loopback easily occurs. For example, as shown in fig. 1a, node D has node B as a parent node, and node B has node a as a parent node, when node a finishes downloading data from the CDN server and instead downloads data from node D, a loop as shown in fig. 1B occurs. In order to avoid the loop back of the P2P transmission link, the embodiment of the present invention provides a data transmission method, which is described in detail below.
Referring to fig. 2, a flowchart of a data transmission method according to an embodiment of the present invention is provided, where the method specifically includes the following steps.
In step 201, a node downloads data from a server at an initial stage.
In the initial stage, all nodes download data from the server side. In a scenario where a CDN network is used to provide a server for a node, the server is a CDN server. The node in the embodiment of the present invention may be a player for playing a streaming media resource, or an electronic device configured with the player, such as a mobile phone, a tablet computer, a notebook computer, or a vehicle-mounted computer. The data downloaded by the node from the server may be a streaming media resource. The initial stage refers to a preset time period when the node starts to access the target data, for example, when the node starts to play a live video, the node first establishes a connection with the CDN server, and downloads data from the CDN server within the preset time period.
If the node does not have a child node, an attempt is made to download data from other nodes, step 203.
In a particular application, when there is data transmission between two nodes, the node providing the downloaded data is a parent node of the other node, and the node receiving the downloaded data is a child node of the other node. For example, if node B downloads data from node a, node a is a parent node and node B is a child node.
After the initial stage is finished, namely after the target data starts to be accessed for a preset time period, judging whether the node of the node has a child node or not, namely judging whether other nodes download data from the node.
Since all nodes download data from the server in the initial stage, after the initial stage, the nodes have no child nodes and can attempt to download data from other nodes. Before downloading data from other nodes, the nodes try to establish a subscription relationship with each other. For example, the flow of the first node attempting to download data from the second node includes: a first node sends a subscription request to a second node; if the first node receives the response information of accepting subscription sent by the second node, which indicates that the subscription is successful, the first node can download data from the second node; and if the first node receives response information of refusing subscription sent by the second node, the subscription is failed, and the first node cannot download data from the second node. That is, the step of a node attempting to download data from another node includes: the node sends a subscription request; if the node receives the response information of accepting subscription, the data downloading from the server can be stopped, and the data is downloaded from the subscribed node; and if the node receives the response information of refusing the subscription, downloading the data from the subscribed node. After receiving the response information of refusing the subscription, the node can try to subscribe other nodes again and download data from other nodes.
And step 204, if the node has child nodes, keeping downloading data from the server.
In the embodiment of the invention, when the node already has a child node, that is, other nodes download data from the node, the node cannot actively download data to other nodes, so as to prevent a transmission link from generating a loop. For example, if node B downloads data from node a, node a can only keep downloading data from the server and can no longer subscribe to other nodes.
In a specific application, due to reasons such as poor link quality between two nodes, a child node may cancel a subscription relationship with its parent node, that is, the child node finishes downloading data from its parent node. And if the node for canceling the subscription relationship also has a child node, the node only allows to switch back to the server side for data downloading. That is, if a node finishes downloading data from its parent node, and the node has a child node, the node switches back to the server for data downloading. Until no child node subscribes to data from a node, the node may attempt to download data from other nodes. That is, after all children of a node finish downloading data from the node, the node attempts to download data from other nodes.
Hereinafter, an embodiment of the present invention will be described by way of example with reference to fig. 3.
(1) In the initial stage, node a, node B and node C all download data from CDN servers first, and since none of them has a child node, all try to subscribe to other nodes.
(2) After the node B successfully subscribes to the node a, the number of child nodes of the node a is 1, and according to the rule, the node a does not allow active subscription to other nodes, and keeps downloading live broadcast data from the CDN, and shares the downloaded data to the node B. Node B stops downloading data from the CDN.
(3) After the node C successfully subscribes the node B, the node B shares the data shared by the node A to the node C again, the number of the sub-nodes of the node B is 1, the node B does not allow to actively subscribe other nodes according to the rule, and if the node B and the node A cancel the subscription relationship, the node B only allows to switch back to the CDN server for data downloading.
(4) Node a and node B may not attempt to subscribe to other nodes until no child node subscribes to the data.
Under the condition that a plurality of nodes initiate subscription at the same time, for example, the node A sends a subscription request to the node B, the node B sends a subscription request to the node C, and the node C sends the subscription request to the node A, since the number of child nodes is 0, the subscription can be successful, and a loop is formed. In order to avoid such a situation, other nodes are denied to subscribe themselves in the active subscription process, that is, after a node sends a subscription request to other nodes, the node replies response information of the denied subscription if the node receives the subscription request sent by other nodes again before the node does not receive response information. For example, as shown in fig. 4, node B initiates subscription to node a, and when node B does not receive the response of node a, node C initiates subscription to node B, and node B replies to node C with a rejection of subscription.
In summary, the subscription rules among the P2P nodes are as follows:
(1) and the nodes without the child nodes actively try to download data from other nodes.
(2) Nodes that already have children cannot actively download data to other nodes. Depending on the position of the node in the transmission link, there are two cases: if the node is a root node, the node always keeps downloading data from the server side until all other child nodes are disconnected; if the node is a child node, after the upper node of the node is disconnected, the node is switched to a server side for data downloading until all other child nodes are disconnected.
(3) Before downloading data from other nodes, each node tries to establish a subscription relationship with the other node. When the node initiates the subscription, the node does not accept the subscription of other nodes, and a loop caused by the simultaneous mutual subscription of a plurality of nodes is prevented.
In order to enable a node to quickly determine a data acquisition mode under the limitation of various condition rules, embodiments of the present invention provide a subscription policy, that is, a data acquisition mode is determined by calculating a data source expected value. The specific data transmission mode is as follows:
after the initial phase is over, the node expects a value F based on the data source nThe source of the data is determined,
wherein, Fn＝xn×(yn-yn-1+a)，
xnRepresenting the number of child nodes of the current node, ynRepresenting the number of parent nodes of the current node, yn-1Representing the number of father nodes of the last sampling point, and a is more than 0 and less than 1.
Accordingly, the method can be used for solving the problems that,
if FnIs 0 and the node is currently downloading data from the server, the node attempts to download data from other nodes;
if FnIf the value of the node is less than 0, the node is switched back to the server side for data downloading;
if FnIs greater than 0, the node keeps downloading data from the current data source.
In implementation, the node may collect the numbers of its child nodes and parent nodes at preset time intervals, and calculate the expected data source value, or calculate the expected data source value each time the number of its child nodes or parent nodes is found to change.
The calculation method of the expected value of the data source is verified to meet the subscription rule among the nodes of P2P as follows:
(1) if a node has no child nodes, i.e. xnIs 0 to give FnIs 0, then the node attempts to download data from other nodes.
(2) If the node is disconnected from its parent, ynTable is 0, and at the last sampling point, y n-1Is 1, ynAnd yn-1Has a difference of-1, and the node has a child node, i.e., xnGreater than 0, at which time FnIf the value of the node is less than 0, the node is switched back to the server side for data downloading;
(3) if the number of parent nodes of the node remains unchanged, ynAnd yn-1Has a difference of 0, and the node has a child node, i.e., xnGreater than 0, at which time FnIs greater than 0, then the node keeps downloading data from the current data source. For example, keeping downloading data from a server, or keeping downloading data from a parent node.
From the above discussion, the calculation method of the expected value of the data source conforms to the subscription rule between the above P2P nodes.
In the embodiment of the invention, the node determines the data acquisition mode by calculating the expected value of the data source, so that the subscription rule can be simplified, namely, various data acquisition modes can be determined by one preset formula, so that corresponding rules do not need to be written for various data acquisition modes respectively, the development time can be saved, and when the node determines the data acquisition mode, the node does not need to care about the logic limitation among various conditions, but substitutes the number of the child nodes and the parent nodes of the node into the preset formula for calculation, so that the current data acquisition mode can be determined according to the calculated value, and the node subscription efficiency is improved.
In the implementation of the invention, all nodes download data from the server side at the initial stage, after the initial stage, no node of a child node exists, data can be tried to be downloaded from other nodes, and the node with the child node cannot try to download data from other nodes and needs to keep downloading data from the server side, so that a loop of a P2P transmission link can be effectively avoided, the condition that no node is connected with the server side is also avoided, and the data download quality of the nodes on the whole link can be ensured.
Referring to fig. 5, a block diagram of a data transmission apparatus according to an embodiment of the present invention is shown, where the apparatus includes:
a downloading module 501, configured to download data from a server at an initial stage;
a determining module 502, configured to determine whether a child node exists in a self node after the initial stage;
the downloading module 501 is configured to, when the node has no child node, attempt to download data from another node;
the downloading module 501 is further configured to keep downloading data from the server when the node has a child node.
Preferably, the downloading module 501 is further configured to switch back to the server for data downloading when the node finishes downloading data from its parent node and the node has a child node.
Preferably, the downloading module 501 is further configured to, if the node downloads data from the server, attempt to download data from other nodes after all child nodes of the node finish downloading data from the node.
Preferably, the determining module 502 is further configured to expect a value F based on a data source after the initial stagenThe manner in which the data is acquired is determined,
wherein, Fn＝xn×(yn-yn-1+a)，
xnNumber of child nodes, y, representing the current nodenRepresenting the number of parent nodes of the current node, yn-1Representing the number of father nodes of the last sampling point, and a is more than 0 and less than 1.
Accordingly, the method can be used for solving the problems that,
the downloading module 501 is further configured to:
when F is presentnIs 0 and when the node is currently downloading data from the server, then the node attempts to download data from other nodes;
when F is presentnWhen the value of the node is less than 0, the node is switched back to the server side for data downloading;
when F is presentnWhen the value of (d) is greater than 0, the node keeps downloading data from the current data source.
Preferably, the downloading module 501 is specifically configured to:
sending a subscription request;
if the node receives the response information of accepting the subscription, downloading data from the subscribed node;
And if the node receives the response information of refusing the subscription, the data can not be downloaded from the subscribed node.
Preferably, the downloading module 501 is further configured to:
before the node does not receive the response information, if a subscription request sent by other nodes is received, the node sends response information of refusing subscription to the node.
In the implementation of the invention, all nodes download data from the server side at the initial stage, after the initial stage, no node of a child node exists, data can be tried to be downloaded from other nodes, and the node with the child node cannot try to download data from other nodes and needs to keep downloading data from the server side, so that a loop of a P2P transmission link can be effectively avoided, the condition that no node is connected with the server side is also avoided, and the data download quality of the nodes on the whole link can be ensured.
It should be noted that: the data transmission device provided in the above embodiments may be implemented based on a computer program, and when executing a data downloading task, only the division of the above functional modules is taken as an example, in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules to complete all or part of the above described functions. In addition, the data transmission device and the data transmission method provided by the above embodiments belong to the same concept, and specific implementation processes thereof are described in the method embodiments and are not described herein again.
Fig. 6 is a schematic structural diagram of a node device according to an embodiment of the present invention. The node apparatus 600 may vary significantly depending on configuration or performance, and may include one or more central processors 622 (e.g., one or more processors) and memory 632, one or more storage media 630 (e.g., one or more mass storage devices) storing applications 642 or data 644. Memory 632 and storage medium 630 may be, among other things, transient or persistent storage. The program stored on the storage medium 630 may include one or more modules (not shown), each of which may include a sequence of instructions operating on the node device. Still further, central processor 622 may be configured to communicate with storage medium 630 to execute a sequence of instruction operations in storage medium 630 on node device 600.
The node apparatus 600 may comprise a memory, and one or more computer programs stored in the memory and configured to be executed by one or more processors to implement the data transmission method described above.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the storage medium may be a read-only memory, a magnetic disk or an optical disk.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and should not be taken as limiting the scope of the present invention, which is intended to cover any modifications, equivalents, improvements, etc. within the spirit and scope of the present invention.
Claims (16)
1. A method of data transmission, the method comprising:
the node downloads data from a server side at an initial stage;
after the initial stage, judging whether the self node has a child node or not;
If the node has no child nodes, attempting to download data from other nodes;
if the node has child nodes, wherein if the node is a root node, the node keeps downloading data from the server until all child nodes of the node are disconnected, and if the node is a child node, after a superior node of the node is disconnected, the node is switched to the server to download data until all child nodes of the node are disconnected.
2. The method of claim 1, further comprising:
and if the node finishes downloading the data from the father node of the node and has a child node, switching back to the server side for downloading the data.
3. The method of claim 2, further comprising:
if the node downloads data from the server, after all the child nodes of the node finish downloading the data from the node, the node tries to download the data from other nodes.
4. The method of claim 3, further comprising:
after the initial phase, the node bases its data Source expected value FnThe manner in which the data is acquired is determined,
wherein, Fn＝xn×(yn-yn-1+a)，
xnNumber of child nodes, y, representing the current nodenRepresenting the number of parent nodes of the current node, yn-1Representing the number of father nodes of the last sampling point, and a is more than 0 and less than 1.
5. The method of claim 4, further comprising:
if FnIs 0 and the node is currently downloading data from the server, the node attempts to download data from other nodes;
if FnIf the value of the node is less than 0, the node is switched back to the server side for data downloading;
if FnIs greater than 0, the node keeps downloading data from the current data source.
6. The method according to any one of claims 1 to 5, wherein the step of the node attempting to download data from other nodes comprises:
the node sends a subscription request;
if the node receives the response information of accepting subscription, the node downloads data from the subscribed node;
and if the node receives the response information of refusing the subscription, the node cannot download the data from the subscribed node.
7. The method of claim 6, wherein the step of the node sending the subscription request is followed by:
Before the node does not receive the response information, if a subscription request sent by other nodes is received, the node sends response information of refusing subscription to the node.
8. A data transmission apparatus, characterized in that the apparatus comprises:
the downloading module is used for downloading data from the server side in the initial stage;
the judging module is used for judging whether the self node has a child node or not after the initial stage;
the downloading module is used for trying to download data from other nodes when the node has no child node;
the downloading module is further configured to, when the node has child nodes, if the node is a root node, the node keeps downloading data from the server until all the child nodes of the node are disconnected, and if the node is a child node, after a superior node of the node is disconnected, the node switches to the server to download data until all the child nodes of the node are disconnected.
9. The apparatus of claim 8,
and the downloading module is used for switching back to the server side for data downloading when the node finishes downloading data from the father node of the node and the node has a child node.
10. The apparatus of claim 9,
the downloading module is configured to, if the node downloads data from the server, attempt to download data from other nodes after all child nodes of the node finish downloading data from the node.
11. The apparatus of claim 10,
the judging module is further used for obtaining an expected value F based on a data source after the initial stagenThe manner in which the data is acquired is determined,
wherein, Fn＝xn×(yn-yn-1+a)，
xnIndicates the currentNumber of children of a node, ynRepresenting the number of parent nodes of the current node, yn-1Representing the number of father nodes of the last sampling point, and a is more than 0 and less than 1.
12. The apparatus of claim 11,
the download module is further configured to:
when F isnIs 0 and when the node is currently downloading data from the server, then the node attempts to download data from other nodes;
when F isnWhen the value of the node is less than 0, the node is switched back to the server side for data downloading;
when F is presentnWhen the value of (d) is greater than 0, the node keeps downloading data from the current data source.
13. The apparatus according to any one of claims 8 to 12, wherein the download module is specifically configured to:
Sending a subscription request;
if the node receives the response information of accepting the subscription, downloading data from the subscribed node;
and if the node receives the response information of refusing the subscription, the data can not be downloaded from the subscribed node.
14. The apparatus of claim 13, wherein the download module is further configured to:
before the node does not receive the response information, if a subscription request sent by other nodes is received, the node sends response information of refusing subscription to the node.
15. A node apparatus, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the data transfer method of any one of claims 1 to 7.
16. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the data transmission method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910716632.0A CN110493327B (en) | 2019-08-05 | 2019-08-05 | Data transmission method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910716632.0A CN110493327B (en) | 2019-08-05 | 2019-08-05 | Data transmission method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110493327A CN110493327A (en) | 2019-11-22 |
| CN110493327B true CN110493327B (en) | 2022-06-10 |
Family
ID=68549443
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910716632.0A Active CN110493327B (en) | 2019-08-05 | 2019-08-05 | Data transmission method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110493327B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115065859A (en) * | 2022-06-07 | 2022-09-16 | 北京达佳互联信息技术有限公司 | Video data acquisition method, device, equipment and medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075576A (en) * | 2011-01-10 | 2011-05-25 | 华中科技大学 | Distributed cooperative transmission method in embedded environment |
| CN102387164A (en) * | 2010-08-30 | 2012-03-21 | 上海悠络客电子科技有限公司 | Method for transmitting peer-to-peer (p2p) network data |
| CN109348243A (en) * | 2018-11-14 | 2019-02-15 | 广州虎牙信息科技有限公司 | Subscribe to the method, apparatus and live broadcast system of processing |
| CN109348257A (en) * | 2018-11-14 | 2019-02-15 | 广州虎牙信息科技有限公司 | Draw method of flow control, device and live broadcast system |
| CN109525869A (en) * | 2018-11-14 | 2019-03-26 | 广州虎牙信息科技有限公司 | Draw the method, apparatus and live broadcast system of stream |
| CN109889543A (en) * | 2019-03-26 | 2019-06-14 | 广州华多网络科技有限公司 | Method, root node, child node, P2P server and the system of transmission of video |
| CN109951723A (en) * | 2019-03-26 | 2019-06-28 | 广州华多网络科技有限公司 | The method of adjustment of root node, device and storage medium in peer-to-peer network live broadcast system |
| CN110505280A (en) * | 2019-07-29 | 2019-11-26 | 网宿科技股份有限公司 | The control method and P2P node of P2P transmission |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5253248A (en) * | 1990-07-03 | 1993-10-12 | At&T Bell Laboratories | Congestion control for connectionless traffic in data networks via alternate routing |
| EP2460320B1 (en) * | 2009-07-31 | 2015-03-04 | Ciena Luxembourg S.a.r.l. | Linear route protection |
| CN102340434B (en) * | 2011-07-07 | 2014-03-26 | 杭州华三通信技术有限公司 | Multihoming access-based loop avoidance method and edge devices |
| US9420058B2 (en) * | 2012-12-27 | 2016-08-16 | Akamai Technologies, Inc. | Stream-based data deduplication with peer node prediction |
-
2019
- 2019-08-05 CN CN201910716632.0A patent/CN110493327B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102387164A (en) * | 2010-08-30 | 2012-03-21 | 上海悠络客电子科技有限公司 | Method for transmitting peer-to-peer (p2p) network data |
| CN102075576A (en) * | 2011-01-10 | 2011-05-25 | 华中科技大学 | Distributed cooperative transmission method in embedded environment |
| CN109348243A (en) * | 2018-11-14 | 2019-02-15 | 广州虎牙信息科技有限公司 | Subscribe to the method, apparatus and live broadcast system of processing |
| CN109348257A (en) * | 2018-11-14 | 2019-02-15 | 广州虎牙信息科技有限公司 | Draw method of flow control, device and live broadcast system |
| CN109525869A (en) * | 2018-11-14 | 2019-03-26 | 广州虎牙信息科技有限公司 | Draw the method, apparatus and live broadcast system of stream |
| CN109889543A (en) * | 2019-03-26 | 2019-06-14 | 广州华多网络科技有限公司 | Method, root node, child node, P2P server and the system of transmission of video |
| CN109951723A (en) * | 2019-03-26 | 2019-06-28 | 广州华多网络科技有限公司 | The method of adjustment of root node, device and storage medium in peer-to-peer network live broadcast system |
| CN110505280A (en) * | 2019-07-29 | 2019-11-26 | 网宿科技股份有限公司 | The control method and P2P node of P2P transmission |
Non-Patent Citations (1)
| Title |
|---|
| 基于CDN-P2P流媒体直播系统方案设计实现;邓达等;《计算机工程与设计》;20130630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110493327A (en) | 2019-11-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2018137523A1 (en) | Game server switching method, relevant device and system | |
| US11489686B2 (en) | Virtual meetings in ad-hoc networks | |
| US20170085633A1 (en) | Method and apparatus for saving cloud service traffic using peer-to-peer connection | |
| US20220141311A1 (en) | Resource subscription method, device and server, and computer storage medium | |
| CN104243266A (en) | Method and device for network access | |
| CN112398689A (en) | Network recovery method and device, storage medium and electronic equipment | |
| CN110493327B (en) | Data transmission method and device | |
| US20170155712A1 (en) | Method and device for updating cache data | |
| US20210329098A1 (en) | Methods of operating service instance sets and/or set restoration storage resources and related network nodes | |
| US20170180468A1 (en) | Method, electronic device and non-transitory computer-readable storage medium for connecting P2P network node | |
| CN108111630B (en) | Zookeeper cluster system and connection method and system thereof | |
| CN113382065A (en) | File downloading method, device, system, equipment and storage medium | |
| CN110278109B (en) | Disaster recovery method and system | |
| US9736661B2 (en) | Handling of messages in a partially deployed IMS network | |
| US20150237650A1 (en) | Management of the Use of a Gateway by a Plurality of Terminals | |
| US20100183017A1 (en) | Network System, Node Device, Data Distribution Method, Information Recording Medium, and Program | |
| CN113055444B (en) | File sharing method and related device thereof | |
| CN104602047A (en) | Share method of EPG (error pattern generator) data, server, terminal and system | |
| CN111479137B (en) | Method and device for providing line address, server and storage medium | |
| CN114296869A (en) | Server node service method and device based on TCP long connection | |
| CN114884880A (en) | Data transmission method and system | |
| US8769523B2 (en) | Systems and methods for interrupting upgrades of content distribution systems | |
| CN107506491B (en) | OSD data distribution method and device of distributed file system | |
| CN110597540A (en) | Version updating method and device of financial terminal, server and storage medium | |
| CN111988745A (en) | Target user determination method, device, equipment and medium based on WiFi connection data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |