Patent Application
20180375930
The present disclosure generally relates to the network data transmission technology and, more particularly, relates to a method and a system for peer-to-peer network data transmission.
As the Internet technology advances, the network data transmission technology is also constantly improving.
In the traditional network data transmission, a client-end can use the network connection between the client-end and a server to download file data from the server to a local location. In this process, because the file data has a certain size, it takes certain amount of downloading time.
From the client-end perspective, it is possible, because the bandwidth limitation of network, packet loss rate, and other unpredictable irregularities may cause the file transmission to be slow or abnormal, the client-end may be unable to obtain requested data normally or quickly. Especially, when the requested file data has a large size or real-timeliness, such as, streaming media files, the file data transmission model under such client/server architecture often encounters numerous issues.
From the server perspective, the number of concurrent connections may be limited. If each client-end is connected extensively long, other client's requests for connection may likely be rejected or placed in queues.
Thus, the traditional network data transmission technology often has many problems, and is more and more unlikely to satisfy various business demands, such as on-demand service and live streaming service that require dependable real-time file transfer. Moreover, client-end resources are not effectively utilized either.
In recent years, the emerging P2P (peer-to-peer network) technology can take advantage of individual nodes on the Internet for peer-to-peer computing, fully utilize idle resources on the Internet, and allow two client-ends to directly exchange information.
At present, many network data transmission technical solutions are based on p2p. Primarily, individual client-end nodes in the peer-to-peer network may exchange the data the client-ends own by exchanging bitmap with each other. However, requiring each node to exchange bitmap information with each other is not only difficult to implement, but also affects the transmission speed and performance, thereby ineffective to achieve low latency.
To solve issues in the existing technology, the present disclosure provides a peer-to-peer network based data transmission technology. The technical solution includes the followings.
A peer-to-peer network based data transmission method, comprising:
Further, slicing the requested data into data slices includes slicing the requested data into data slices according to pre-determined processing rules.
Further, transmitting data slices through the corresponding transmission sub-stream includes sequentially distributing data slices to each transmission sub-stream in an order in which the data slices are generated.
Further, selecting, by the requesting node, a transmission sub-stream includes selecting a transmission sub-stream based on a selection status of each transmission sub-stream or a randomly generated number.
Further, establishing data sharing relationship with other requesting nodes includes:
Further, the requesting node and the other requesting nodes in the data sharing relationship push the self-downloaded data slices to each other, and respectively receive the data slices pushed by the other party.
Further, the other requesting node in the data sharing relationship pushes the self-downloaded data slices to the requesting node, and the requesting node receives the data slices pushed by the other requesting node.
Further, the requested data includes a streaming media file.
Further, the streaming media file includes a source file of live streaming.
Further, the requesting node keeps or terminates the data sharing relationship with the other requesting nodes.
The present disclosure provides a peer-to-peer network based data transmission system, comprising:
Further, slicing, by the data server, the requested data into data slices includes slicing the requested data into data slices according to pre-determined processing rules.
Further, the data server creates a sequence number for the data slice, and distributes the data slice to each transmission sub-stream based on the sequence number of the data slice.
Further, selecting, by the requesting node, a transmission sub-stream includes selecting a transmission sub-stream based on the selection status of each transmission sub-stream or a randomly generated number.
Further, the system further including a distribution server, where the requesting node's establishing data sharing relationship with other requesting nodes includes:
Further, the requesting node and the other requesting nodes in the data sharing relationship push the self-downloaded data slices to each other, and respectively receive the data slices pushed by the other party.
Further, the other requesting node in the data sharing relationship pushes the self-downloaded data slices to the requesting node, and the requesting node receives the data slices pushed by the other requesting node.
Further, the requested data includes a streaming media file.
Further, the requested data on the data server includes a streaming media file obtained from a live streaming platform.
Further, the requesting node keeps or terminates the data sharing relationship with the other requesting nodes.
Further, the system includes a plurality of data servers.
The technical solution according to the present disclosure first slices the requested data into the data slices and respectively distributes the data slices to the corresponding transmission sub-streams such that the data slices are split to each transmission sub-stream. In this way, the data transmitted through each transmission sub-stream is only a fraction of the requested data, and the amount of the transmitted data through each transmission sub-stream is smaller than the requested data.
The requesting node selects the transmission sub-stream, downloads the corresponding data slices through the transmission sub-stream, obtains the corresponding data downloaded by the other requesting node through the other transmission sub-stream based on the data sharing relationship with the other requesting node, and thus obtains the requested data. The technical solution not only reduces the workload at the data source from which the requesting node downloads the data slices, but also fully utilizes the data sharing with the other requesting nodes. Thus, the timeliness of the data transmission is improved, the latency is reduced, and the live streaming service requirement is better satisfied.
Further, based on the timeliness and the integrity of the received data slices, the requesting node decides whether to keep or terminate certain data sharing relationship the requesting node creates. Thus, the data sharing relationship is evolved and updated.
To more clearly illustrate the technical solution in the present disclosure, the accompanying drawings need to be used in the description of the disclosed embodiments are briefly described hereinafter. Obviously, the drawings described below are merely some embodiments of the present disclosure. Other drawings derived from such drawings may be obtained by a person having ordinary skill in the art without creative labor.
Reference will now be made in detail to exemplary embodiments of the disclosure, which are illustrated in the accompanying drawings. Those skilled in the art may readily understand other advantages and effects of the present disclosure as described in the specification. The present disclosure may be embodied or practiced in the ways different from the disclosed embodiments. The details described in the specification may be modified or varied for different perspectives and applications without departing from the spirit of the present disclosure. Under non-conflicting circumstances, the features in the present disclosure may be combined with each other.
It should be noted that the illustrations provided in the disclosed embodiments are intended to provide only the basic concept of the present disclosure. Only the components related to the present disclosure are shown in the schematic drawings rather than the actual number, shape or size of the components in the real life applications. The actual implementation of the various components may be arbitrarily changed in type, quantity and proportion, and the component layout may also be more sophisticated.
Embodiments of the present disclosure are described as follows with references to the accompanying drawings.
Step S10: slicing requested data into data slices, and establishing at least two transmission sub-streams, wherein the data slices are transmitted through the corresponding transmission sub-streams.
Specifically, the requested data may include various types of data files and streaming media files, etc.
Slicing the requested data into slices may include slicing the requested data into slices according to pre-defined processing rules, wherein the pre-defined processing rules may include setting a length for an individual data slice.
For the streaming media files, the pre-defined processing rules may include slicing the streaming media file into data slices in a pre-defined length of time to obtain the data slices having equal length in time. Thus, each data slice may have a substantially uniform size.
In certain other embodiments, other pre-defined processing rules may be used to slice the requested data into data slices. For example, the data slice length may vary according to the size of data. For streaming media files, the data slice length may be determined such that each data slice includes a key frame, and the obtained data slices may have variable length. No limitation is imposed by the present disclosure.
The transmission sub-streams may be used to transfer the data slices separately. In one embodiment, each requesting node may exchange data through peer-to-peer networking. Thus, at least two transmission sub-streams may be needed.
In the process of data transmission, each data slice may be transmitted in an assigned transmission sub-stream. The generation and distribution of data slices are described below in detail with reference to the accompanying drawings.
In one embodiment, the data slice may be distributed to a corresponding transmission sub-stream based on the sequence number F of the data slice and the transmission sub-stream number N. Specifically, the data slice may be assigned to the transmission sub-stream by a modulo operation method. That is, the data slice having a sequence number F may be assigned to the transmission sub-stream F % N. As shown in
As shown in
For the on-demand service, the streaming media file may be static, and may not change. Thus, the streaming media file may first be sliced and assigned with sequence numbers. Then, the number of slices may determine the number of the transmission sub-streams. Finally, the data slices may be distributed to the corresponding transmission sub-streams. The number of transmission sub-streams may be a pre-determined fixed number. In this way, the data slices may be generated and at the same time assigned to the corresponding transmission sub-stream. No limitation is imposed by the present disclosure.
For the live streaming service, the streaming media file A may be dynamic, and may be generated continuously during the live streaming. Thus, the data slices may be sequentially distributed to the transmission sub-streams in the order in which the data slices are generated. Specifically, because the streaming media file is continuously generated, the slicing of the data slices and the distribution to the transmission sub-streams may proceed as the streaming media file is being generated. In other words, during the live streaming, when the streaming media file is generated to reach a pre-determined slice unit length, the corresponding section of the data may be sliced into a data slice, and may be distributed to a transmission sub-stream. In this way, the live streaming data transmission may be ensured to be in real-time.
It should be noted that, as shown in
Step S20: selecting, by a requesting node, a transmission sub-stream and establishing a data sharing relationship with another requesting node.
The requesting node may be a network node that sends a data request to a data source. Selecting a transmission sub-stream at the requesting node may include selecting a transmission sub-stream based on a selection status of the transmission sub-stream by the currently requested data. For example, the transmission sub-stream with a minimum number of established selections may be selected such that each transmission sub-stream may be selected by a balanced number of the requesting nodes.
In certain other embodiments, a random number may be generated to select a corresponding transmission sub-stream. As shown in
Network based data transmission may encounter substantial concurrent traffic, especially when a large number of simultaneously active users go online and request the same data. That is, the number of requesting nodes is large, and each transmission sub-stream may be selected by a certain number of the users. In this case, using a randomly generated number to select the transmission sub-stream may be simple and fast as compared to other suitable methods, and the low latency requirement for the live streaming service may be better satisfied.
In one embodiment, the requesting node and certain other requesting nodes may request the same data, and may establish mutual connections through the network. The certain other requesting nodes may select the transmission sub-streams different from the transmission sub-stream selected by the requesting node.
Step S201: sending, by the requesting node, distribution request information to a distribution server.
Step S202: selecting and responding, by the distribution server, information about other nearby requesting nodes based on the distribution request information.
Step S203: respectively establishing, by the requesting node, data sharing relationship with other requesting nodes according to the response from the distribution server.
For clearer description for the steps S201 through S203, referring to
As shown in
The identification information may be used to identify the requesting node C1 such that other requesting nodes may determine the requesting node C1 through the identification information. The identification information may include attributes inherent to the requesting node C1, e.g., the IP address and port number of the requesting node C1. The identification information may be created in other method, e.g., an identity registered at a registration server dedicated for this purpose. No limitation is imposed by the present disclosure. The transmission sub-stream information may include requested data information D and the transmission sub-stream sequence number n1.
The distribution server S may receive the distribution request information M1 through the connection L1, extract the identification information id1, the requested data information D, and the transmission sub-stream sequence number n1 from the distribution request information M1, select other requesting nodes C2 and C3 near the requesting node C1 through looking up local records, and return the other requesting node information M2 to the requesting node C1. The other requesting node information M2 may include the identification information about each of the other requesting nodes. The local records may include the identification information about each requesting node, the requested data information, and the transmission sub-stream information. After extracting the information from the distribution request information M1, the distribution server S may store the distribution request information M1 in the local records.
The other requesting nodes may include the requested data information D, and may select a transmission sub-stream other than the transmission sub-stream n1. For example, the transmission sub-streams set forth based on the requested data may include n1, n2, and n3. The requesting node C1 may select the transmission sub-stream n1. Then, when making selection, the other requesting nodes may select the transmission sub-stream n2 or n3.
When selecting the other neighboring requesting nodes, the distribution server S may obtain the information about all the requesting nodes that share the same requested data and select different transmission sub-streams in the local records, and may select the neighboring requesting nodes that are physically close to the requesting node. Alternatively, the distribution server S may select the other requesting nodes that belong to the same service provider as the requesting node C1. In one embodiment, the distribution server S may select the neighboring requesting nodes according to the specific requirement by considering the physical location, the service provider, and the network status, etc. No limitation is imposed by the present disclosure.
The requesting node C1 may receive the other requesting node information M2 returned by the distribution server S, extract the identification information for the other requesting nodes C2 and C3, and establish data sharing relationship Z1 and Z2 with the other requesting nodes C2 and C3, respectively.
The data sharing relationship may include bidirectional sharing relationship and unidirectional sharing relationship.
In the bidirectional sharing relationship, both requesting nodes may push the self-downloaded data slices to the other party, and may receive the data slices pushed by the other party.
As shown in
After the data slice is pushed out, the requesting nodes C1 and C2 may receive the data slice pushed by the opposite party respectively through the data sharing relationship Z1. In this way, the requesting node C1 and the other requesting node C2 may form a peer-to-peer network, and may share data across the peer-to-peer network such that the requesting node C1 may obtain the data slice through the unselected transmission sub-stream from the other requesting node C2. Similarly, the requesting nodes C1 and C3 may share the data slices through the data sharing relationship Z2.
In the unidirectional sharing relationship, the requesting node that creates the data sharing relationship may have the data sharing relationship with the other requesting node similar to subscription relationship. That is, the requesting node C1 may subscribe to the requesting nodes C2 and C3. Then, after the subscribed requesting nodes C2 and C3 download data slices through the self-selected transmission sub-streams n2 and n3, respectively, the subscribed requesting nodes C2 and C3 may push the data slices to the subscribing requesting node C1. The subscribing requesting node C1 may receive the data slices pushed by the subscribed requesting nodes C2 and C3. However, the subscribing requesting node C1 may not be required to push any data slice to the subscribed requesting nodes C2 and C3.
In either the bidirectional sharing relationship or the unidirectional relationship, the requesting node that creates the data sharing relationship may terminate the data sharing relationship.
As previously described, the network data transmission may encounter substantial concurrent traffic. Numerous requesting nodes may request the same data. Then, the number of requesting nodes that select the same transmission sub-stream may naturally be large. Although screening conditions may be set forth to optimize the selection, the number of requesting nodes that select the same transmission sub-stream may be not be 1. Then, the requesting node that proactively creates data sharing relationship may need to select a requesting node, that is, make a requesting node selection based on the status of the data received by each other requesting node that selects the same transmission sub-stream (e.g., transmission sub-stream n2).
Specifically, the requesting node may compare the timeliness and the integrity, etc. among the data slices pushed by the other requesting nodes that select the same transmission sub-stream, keep the data sharing relationship with certain other requesting nodes that provide good quality data slices, and terminate the data sharing relationship with certain other requesting nodes that provide poor quality data slices. Thus, the data sharing relationship may be evolved and updated.
Therefore, subject to the steps S10 and S20, the requesting node may select a transmission sub-stream, and may establish data sharing relationship with the other requesting nodes that select different transmission sub-streams.
Step S30: downloading, by the requesting node, the corresponding data slices through the transmission sub-stream, and based on the data sharing relationship, receiving the data slices downloaded through the transmission sub-streams self-selected by the other requesting nodes.
In this way, the requesting node may obtain the complete requested data through the self downloading and the data sharing with the other requesting nodes.
In the embodiments of the present disclosure, only a single requesting node may be illustrated as an entry point. Both the entry requesting node and the other requesting nodes may be requesting nodes of the network. These requesting nodes may use the same method for the data transmission. In other words, regardless of whether the requesting node is the entry requesting node C1, or the other requesting node C2 or C3, the same method may be used for downloading and sharing data.
The data transmission method in the peer-to-peer network according to the present disclosure may first slice the requested data into data slices and distribute the data slices to the corresponding transmission sub-streams such that the data slices may be split to each transmission sub-stream. In this way, the data transmitted through each transmission sub-stream may only be a fraction of the requested data, and the amount of the transmitted data through each transmission sub-stream may be less than the requested data.
The requesting node may select the transmission sub-stream, download the corresponding data slices through the transmission sub-stream, obtain the corresponding data downloaded by the other requesting nodes through the other transmission sub-streams based on the data sharing relationship with the other requesting nodes, and obtain the corresponding data slices downloaded from other transmission sub-streams by other requesting nodes and thus obtain the requested data. The method may not only reduce the workload at the data source from which the requesting nodes download the data slices, but also fully utilize the data sharing with the other requesting nodes. Thus, the timeliness of the data transmission may be improved, the latency may be reduced, and the live streaming service requirement may be better satisfied.
Further, based on the timeliness and the integrity of the received data slices, the requesting node may decide whether to keep or terminate certain data sharing relationship the requesting node creates. Thus, the data sharing relationship may be evolved and updated.
In addition, based on the same idea, the present disclosure also provides a peer-to-peer network data transmission system.
Specifically, the data server 20 may store various file data for the requesting nodes on the network to download. Based on different service scenarios, the various file data may include static files and dynamic files. For example, for the general data access or on-demand streaming service, the data server 20 may primarily store static files. For the live streaming service, the data server 20 may primarily store dynamic files. Because the requirement for the live streaming service is more stringent than the requirement for the other services, the embodiments provided by the present disclosure may be described in detail with respect to the live streaming service.
For the live streaming service, the data server 20 may be a data source, e.g., a host server or a live streaming platform server, or an intermediate server that obtains and processes the streaming media file from the host server or the live streaming platform server.
When a user selects a live streaming program, the requesting node may request downloading the streaming media file corresponding to the program from the data server 20.
The data server 20 may slice the streaming media file into data slices, and establish at least two transmission sub-streams for the data slices. Each data slice may be transmitted through one of the transmission sub-streams. The data server 20 may proactively slice the streaming media file into data slices, that is, always slice the streaming media file regardless of the existence of user requests. Slicing the streaming media file into data slices may also be driven by a user request, that is, when receiving a user request, the data server 20 may slice the corresponding streaming media file into data slices. The data server 20 may store a large number of streaming media files simultaneously, i.e., the number of the concurrent live streaming programs is large. Some programs may have a large audience while some other programs may have no audience. Slicing the streaming media files into data slices in response to user requests may substantially save the resource of the data server 20.
At the data server 20, slicing the requested data into data slices may include slicing the requested data according to pre-determined processing rules. The pre-determined rules may include a length of a single data slice.
In one embodiment, the pre-determined processing rules may include slicing streaming media files into data slice according to a preset time length to obtain data slices with an equal time length such that each data slice may have a substantially average time length.
In certain other embodiments, other pre-determined processing rules may be used to slice streaming media files into data slices. For example, the size of data may be used as slicing unit. Alternatively, for streaming media files, each data slice may include a key frame, and the data slices may have variable time lengths other than the average time length. No limitation is imposed by the present disclosure.
The transmission sub-streams may be used to transmit each data slice separately. In one embodiment, each requesting node may exchange data based on the peer-to-peer network, and may include at least two transmission sub-streams.
In the data transmission process, each data slice may be transmitted through the assigned transmission sub-stream. The specific details of the process may be referred to
Based on the user selected live streaming program, the requesting nodes 10 (10a, 10b, 10c, and 10d as shown in
The requesting node 10a may select a transmission sub-stream and establish data sharing relationship with other requesting nodes.
Specifically, at the requesting node 10a, selecting a transmission sub-stream may include selecting a transmission sub-stream based on the selection status of each transmission sub-stream of the currently requested data. For example, the transmission sub-stream that has been less selected may be selected to balance the number of requesting nodes selecting each transmission sub-stream. The selection status of the current queries may be obtained from the distribution server 30. The distribution server 30 may be described more later.
In certain other embodiments, the transmission sub-stream may be selected corresponding to a randomly generated number. As shown in
Network based data transmission may encounter substantial concurrent traffic, especially when a large number of simultaneously active users go online and request the same data. That is, the number of requesting nodes is large, and each transmission sub-stream may be selected by a certain number of the users. In this case, using a randomly generated number to select the transmission sub-stream may be simple and fast as compared to other suitable methods, and the low latency requirement for the live streaming service may be better satisfied.
In one embodiment, the requesting node 10a and the other requesting nodes 10b, 10c, and 10d may request the same data, and may establish connections with each other through the network. The other requesting nodes 10b, 10c, and 10d may select the transmission sub-streams different from the requesting node 10a's selection.
As previously described, the peer-to-peer network based data transmission system 1 in the embodiments of the present disclosure may include a distribution server 30.
After selecting a transmission sub-stream, the requesting node 10a may send distribution request information to the distribution server 30. Based on the distribution request information, the distribution server 30 may select and respond information about other nearby requesting nodes 10b, 10c, and 10d. According to the response from the distribution server 30, the requesting node 10a may establish the data sharing relationship with the other requesting nodes 10b, 10c, and 10d, respectively.
Specifically, the distribution request information may include identification information of the requesting node 10a and the selected transmission sub-stream information.
The identification information may be used to identify the requesting node 10a such that other requesting nodes may determine the requesting node 10a through the identification information. The identification information may include attributes inherent to the requesting node 10a, e.g., the IP address and port number of the requesting node 10a. The identification information may be created in other method, e.g., an identity registered at a registration server dedicated for this purpose. No limitation is imposed by the present disclosure.
The transmission sub-stream information may include the requested data information and the transmission sub-stream sequence number.
The distribution server 30 may receive the distribution request information through the connection, extract the identification information, the requested data information, and the transmission sub-stream sequence number from the distribution request information, select other requesting nodes near the requesting node 10a through looking up local records, and return the other requesting node information to the requesting node 10a. The other requesting node information may include the identification information about each of the other requesting nodes. The local records 31 of the distribution server 30 may include the identification information about each requesting node, the requested data information, and the transmission sub-stream information. After extracting the information from the distribution request information of the requesting nodes 10, the distribution server 30 may store the extracted information in the local records.
The other requesting nodes 10b, 10c, and 10d may query the same streaming media file as the requesting node 10a, and may select the transmission sub-streams other than the transmission sub-stream of the requesting node 10a. For example, the data server 20 may set forth three transmission sub-streams n1, n2, and n3 for the streaming media file requested by the requesting nodes 10. The requesting node 10a may select the transmission sub-stream n1. Then, when making selection, the other requesting nodes 10b, 10c, and 10d may select the transmission sub-streams n2, n2, and n3, respectively.
When selecting the other neighboring requesting nodes, the distribution server 30 may obtain the information about all the requesting nodes that share the same requested data and select different transmission sub-streams in the local records, and may select the requesting nodes that are physically close to the requesting node. Alternatively, the distribution server 10a may select the other requesting nodes that belong to the same service provider as the requesting node. In one embodiment, the distribution server 10a may select the neighboring requesting nodes according to the specific requirement by considering the physical location, the service provider, and the network status, etc. No limitation is imposed by the present disclosure.
The requesting node 10a may receive the other requesting node information returned by the distribution server 30, extract the identification information for the other requesting nodes 10b, 10c, and 10d, and establish the data sharing relationship with the other requesting nodes 10b, 10c, and 10d, respectively.
The data sharing relationship may include bidirectional sharing relationship and unidirectional sharing relationship.
In the bidirectional sharing relationship, both requesting nodes may push the self-downloaded data slices to the other party, and may receive the data slices pushed by the other party.
In the unidirectional sharing relationship, the requesting node that creates the data sharing relationship may have the data sharing relationship with the other requesting node similar to a subscription relationship. That is, the requesting node may subscribe to the other requesting nodes. Then, after the subscribed requesting nodes download data slices through the self-selected transmission sub-streams, the subscribed requesting nodes may proactively push the data slices to the subscribing requesting node. The subscribing requesting node may receive the data slices pushed by the subscribed requesting nodes. However, the subscribing requesting node may not be required to push any data slice to the subscribed requesting nodes.
In either the bidirectional sharing relationship or the unidirectional relationship, the requesting node that creates the data sharing relationship may terminate the data sharing relationship.
As previously described, the network data transmission may encounter substantial concurrent traffic. Numerous requesting nodes may request the same data. Then, the number of requesting nodes that select the same transmission sub-stream may naturally be large. Although screening conditions may be set forth to optimize the selection, the number of requesting nodes that select the same transmission sub-stream may not be 1. For example, the requesting nodes that select the same transmission sub-stream may include the requesting nodes 10b and 10c. Then, the requesting node 10a that proactively creates the data sharing relationship may need to select a requesting node, that is, make a requesting node selection based on the status of the data received by each other requesting node 10b or 10c that selects the same transmission sub-stream (e.g., transmission sub-stream n2).
Specifically, the requesting node may compare the timeliness and the integrity, etc. among the data slices pushed by the other requesting nodes that select the same transmission sub-stream, keep the data sharing relationship with certain other requesting nodes that provide good quality data slices, and terminate the data sharing relationship with certain other requesting nodes that provide poor quality data slices. Thus, the data sharing relationship may be evolved and updated. For example, when the requesting node 10a receives a data slice from the requesting node 10b, the requesting node 10a may discover that the same data slice has been received from the requesting node 10c. Then, the data transmission with the requesting node 10b may have poor timeliness, and the data sharing relationship with the requesting node 10b may be terminated by the requesting node 10a.
The requesting node 10a may download the corresponding data slices through the self-selected transmission sub-stream, and may use the data sharing relationship to obtain the data slices downloaded through other transmission sub-streams from the other requesting nodes 10b, 10c, and 10d such that a complete section of the streaming media file may be obtained and played.
In one embodiment, for illustrative purposes, the requesting node 10a may be used as an entry point. Other requesting nodes 10b, 10c, and 10d may perform data transmission through the same method as described.
Further, in certain other embodiments, a plurality of data servers may be included. The requesting nodes in the network may access the plurality of the data servers.
The peer-to-peer network based data transmission system according to the present disclosure may have a simple architecture and a streamlined process. The data server may first slice the requested data into data slices, and may distribute each data slice separately to the corresponding transmission sub-stream such that the data slices may be split to different transmission sub-streams. In this way, the data transmitted through each transmission sub-stream may be a fraction of the requested data. The amount of data may be less than the requested data.
The requesting node may select a transmission sub-stream and download the corresponding data slices through the transmission sub-stream. Based on the data sharing relationship with other requesting nodes, the requesting node may obtain the corresponding data slices downloaded through other transmission sub-streams from the other requesting nodes such that the requested data may be obtained. The data transmission system may not only reduce the workload at the data source from which the requesting nodes download the data slices, but also fully utilize the data sharing with the other requesting nodes. Thus, the timeliness of the data transmission may be improved, the latency may be reduced, and the live streaming service requirement may be better satisfied.
Further, based on the timeliness and the integrity of the received data slices, the requesting node may decide whether to keep or terminate certain data sharing relationship the requesting node creates. Thus, the data sharing relationship may be evolved and updated.
The system embodiments described above are merely for illustrative purpose. The units described as separated parts may or may not be physically detached. The parts displayed as units may or may not be physical units, i.e., may be located at one place, or distributed at a plurality of network units. Based on the actual needs, a part or all of the modules may be selected to achieve the objective of the embodiments. Those ordinarily skilled in the art may understand and implement the disclosed embodiments without contributing creative labor.
Through the descriptions of various aforementioned embodiments, those skilled in the art may clearly understand that the embodiments may be implemented by means of software in conjunction with an essential common hardware platform, or may be simply implemented by hardware. Based on such understanding, the essential part of the aforementioned technical solutions or the part that contribute to the prior art may be embodied in the form of software products. The software products may be stored in computer readable storage media, such as ROM/RAM, magnetic disk, and optical disk, etc., and may include a plurality of instructions to enable a computer device (may be a personal computer, a server, or a network device) to execute the methods described in various embodiments or parts of the embodiments.
The foregoing are merely certain preferred embodiments of the present disclosure, and are not intended to limit the present disclosure. Without departing from the spirit and principles of the present disclosure, any modifications, equivalent substitutions, and improvements, etc. shall fall within the scope of the present disclosure.
| Number | Date | Country | Kind |
|---|---|---|---|
| 201710465546.8 | Jun 2017 | CN | national |
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/CN2017/092775 | 7/13/2017 | WO | 00 |
