CN105306280A - Data driving network construction maintenance system and method for efficient substream transmission - Google Patents
Data driving network construction maintenance system and method for efficient substream transmission Download PDFInfo
- Publication number
- CN105306280A CN105306280A CN201510882182.4A CN201510882182A CN105306280A CN 105306280 A CN105306280 A CN 105306280A CN 201510882182 A CN201510882182 A CN 201510882182A CN 105306280 A CN105306280 A CN 105306280A
- Authority
- CN
- China
- Prior art keywords
- peer
- bandwidth
- node
- subflow
- peers
- 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.)
- Granted
Links
Landscapes
- Information Transfer Between Computers (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention discloses a data driving network construction maintenance system and method for efficient substream transmission. The data driving network construction maintenance system and method for efficient substream transmission can realize efficient distribution of P2P direct broadcast streaming media data. The basic idea of the method comprises: determining the bandwidth state of the substreams according to the data distribution of each substream in the network, and providing a bandwidth distribution method for newly joined peers based on the information; putting forward a father node selection method according to the bandwidth which is distributed to each substream by the newly joined peers and the residual bandwidth information of each peer in the substream transmission path; putting forward an adjusting method for the peers for the data driving network during the maintenance process; and at last putting forward a method for exit the system for the peers. The data driving network construction maintenance system and method for efficient substream transmission have the advantages of being short in the video stream distribution time delay, being high in the robustness of the system, and being low in cost.
Description
Technical field
The present invention relates to the system and method for data-driven network struction that a kind of antithetical phrase stream carries out transmitting and dispatching and maintenance, specifically a kind of nerve of a covering towards video flowing efficient distribution system and method for building and safeguarding, belongs to network data communication field.
Background technology
The a large number of users be transferred in internet is a kind of economic and method easily by live video data to adopt P2P technology, it effectively can utilize the bandwidth resources of the common access user of network edge thus greatly reduce the pressure of video stream server, there is good extensibility, the current live broadcast stream media system (livestreamingsystem) realizing large scale deployment, as Coolstreaming, PPLive, GridMedia etc., all have employed this method.But, ordinary terminal main frame is relative to server, have larger dynamic, can add at any time and log off, therefore the current main facing challenges of P2P live broadcast stream media system be exactly under dynamic network environment, how to meet the QoS requirement that user's smoothness watches programme televised live.
Generally speaking, when designing P2P live broadcast stream media system, two aspects needing emphasis to consider are scheduling and the distribution mechanisms of nerve of a covering (overlaynetwork) structure that builds of peer (peer) and video data
[1].Nerve of a covering structure is the basis of P2P live broadcast stream media system, and video data transmission is all carry out on nerve of a covering, and typical nerve of a covering structure comprises single tree structure, polytree structure and network structure
[2].The advantage of tree-shaped (tree-based) nerve of a covering has identical structure with the distribution procedure of data, be beneficial to the diffusion of data, but there is nerve of a covering more difficult maintenance in the network environment of high dynamic of ad hoc structure, therefore its robustness is not strong, and cannot utilize the bandwidth resources of leafy node.Netted (mesh-based) nerve of a covering adopts the mode of data-driven (data-driven) to build, be also referred to as structureless network, it understands adding and exiting continuous adjustment along with peer, and this nerve of a covering can successfully manage the impact that node disturbance brings to system.
The scheduling of video data and distribution mechanisms then give each peer to by video data multicast transmission on the basis of application layer nerve of a covering, and when dispatching video flowing and distributing, destination object can be whole video flowing (stream), divide after subflow (substream) or individual data block (chunk).When directly whole video flowing being dispatched, the overlay network of application layer adopts single tree structure usually, system robustness is poor, peer network resources utilance is low, and video flowing is divided into fine-grained data block when distributing, can effectively utilize the upload ability of peer to carry out concurrent transmission in a peer-to-peer network, but this fine-grained scheduling mode cannot take into account the performance of overhead and Data dissemination time delay aspect simultaneously.In order to take into account Data dissemination time delay and overhead, a kind of compromise scheme is unit video flowing being divided into more coarseness, is also subflow, transmits.Specifically, the data block in video flowing arranges sequence number according to reproduction time order, assuming that video flowing is divided into K bar subflow, the data block that so sequence number can be expressed as nK+i (wherein n is integer, and 1≤i≤K) belongs to subflow i
[3].
By contrasting various nerve of a covering and data dispatch design is known, if data-driven network and subflow scheduling mechanism are organically combined, just can realize optimizing in the robustness of system, the many aspects such as distribution time delay, overhead of data simultaneously.But, how still to lack systematic solution to building and safeguard in this data-driven network, need to develop effective method for designing.
List of references
R.Fortuna,E.Lenardi,M.Mellia,M.Meo,S.Traverso.QoEinpullbasedP2P-TVsystems:overlaytopologydesigntradeoffs.IEEEP2P2010.
Y.Liu,Y.Guo,C.Liang.Asurveyonpeer-to-peervideostreamingsystems.Peer-to-PeerNetworkingandApplications2008,1(1):18-28.
M.Zhang,Q.Zhang,L.Sun,S.Yang.Understandingthepowerofpull-basedstreamingprotocol:canwedobetter?IEEEJSAC2007,25(8):1678–1694.
N.Hu,L.Li,Z.Mao,etal.LocatingInternetbottlenecks:algorithms,measurements,andimplications.ACMSIGCOMM2004.
Summary of the invention
Goal of the invention: there is the problems such as efficiency is not high, expense is excessive for video flowing distribution in current P2P live broadcast stream media system, proposes a kind of system and method safeguarded with the data-driven network struction that is target of efficient video flow transmission.
Technical scheme: a kind of data-driven network struction maintenance system transmitted towards efficient subflow, comprises peer and adds mixed-media network modules mixed-media, peer position adjusting type modules and peer and to exit network module;
Described peer adds mixed-media network modules mixed-media for realizing: in live broadcast stream media system, the registration of peer, and the IP address and the port information that obtain other peers in current system; Peer connects according to the information selecting section peer obtained, and obtains new peer information further from these peers; Peer calculates self available uploading bandwidth; The latest data block sequence number of peer to each bar subflow contrasts, and adopts water-filling algorithm to be calculated as the bandwidth of each strip flow assignment; If the bandwidth that peer distributes to certain subflow can for k peer service, so peer select to have this sub-stream data block from known peer and the shortest peer of time delay as father node, and added father node set FatherSet.
Described peer position adjusting type modules is used for realizing: after peer adds system, if the bandwidth distributing to subflow exceedes the bandwidth that father node distributes to subflow, then contact with the father node of father node, if this ancestors' node has remaining bandwidth (remaining amount of bandwidth should be greater than the amount of bandwidth of subflow), and the time delay between peer to ancestors' node is less than the distance of peer between father node to ancestors' node, then send to ancestors' node the request of connecting, if successfully connected, then previous father node is replaced with ancestors' node; When peer receives the request that connects of other peers transmission, if peer has sufficient remaining bandwidth, then accept request and it is responded, if peer receives multiple request simultaneously, but the remaining bandwidth of self cannot provide service for all peers, then select to distribute to the maximum peer of subflow bandwidth, if bandwidth is identical, select to have the less peer of sub-stream data block as child node.
Described peer exits network module for realizing: peer sends to all father nodes and child node and exits message; All father nodes all stop to exiting peer transmitting video-frequency flow, and delete the connection with this peer; All child nodes inquire about data cases and the remaining bandwidth situation of other peers, and the node that therefrom selection remaining bandwidth is high, time delay is short is as new father node.
Peer adopts pathneck
[4]availability bandwidth measurement method calculates self available uploading bandwidth; The latest data block sequence number of peer to each bar subflow contrasts, and adopts water-filling algorithm to be calculated as the bandwidth of each strip flow assignment, and the bandwidth that described subflow i distributes is
wherein B (i) represents the sequence number of latest data block in the subflow i that peer is known, and s represents the number of subflow.
A kind of data-driven network struction maintaining method (Data-DrivenNetworkConstructionandMaintenanceScheme transmitted towards efficient subflow, be called for short DNCMS), the method describes emphatically the method that peer is taked when adding and exit network, and comprises the following steps:
A. peer adds the step of network: peer first to the tracker server registration in live broadcast stream media system, and obtains IP address and the port information of other peers current system from server; Peer connects according to the information selecting section peer obtained, and obtains new peer information further from these peers; Peer adopts pathneck
[4]availability bandwidth measurement method calculates self available uploading bandwidth; The latest data block sequence number of peer to each bar subflow contrasts, and adopts water-filling algorithm to be calculated as the bandwidth of each strip flow assignment, and the bandwidth that namely subflow i distributes is
wherein B (i) represents the sequence number of latest data block in the subflow i that peer is known, and s represents the number of subflow; If the bandwidth that peer distributes to certain subflow can for k peer service, so peer select to have this sub-stream data block from known peer and the shortest peer of time delay as father node, and added father node set FatherSet.
B. the step of peer position adjustment: after peer adds system, if the bandwidth distributing to subflow exceedes the bandwidth that father node distributes to subflow, then contact with the father node of father node, if this ancestors' node has remaining bandwidth, and the time delay between peer to ancestors' node is less than the distance of peer between father node to ancestors' node, then send to ancestors' node the request of connecting, if successfully connected, then previous father node is replaced with ancestors' node; When peer receives the request that connects of other peers transmission, if peer has sufficient remaining bandwidth, then accept request and it is responded, if peer receives multiple request simultaneously, but the remaining bandwidth of self cannot provide service for all peers, then select to distribute to the maximum peer of subflow bandwidth, if bandwidth is identical, select to have the less peer of sub-stream data block as child node.
C. the step that exits network of peer: peer sends to all father nodes and child node and exits message; All father nodes all stop to exiting peer transmitting video-frequency flow, and delete the connection with this peer; All child nodes inquire about data cases and the remaining bandwidth situation of other peers, therefrom select remaining bandwidth higher than the short node of subflow bandwidth, time delay as new father node.
Beneficial effect: hinge structure of the present invention has the following advantages:
1, distribution time delay is short, efficiency is high: than existing method for designing, the present invention take subflow as scheduling and distribution object, decrease the time of data perception and request, thus there is higher distribution efficiency, in the short period of time video flowing can be distributed to all peers in P2P live broadcast stream media system.
2, strong robustness, overhead are few: the present invention is based on data-driven network, peer can adjust accordingly according to the dynamic feature of network, there is serious performance degradation when violent node disturbance and burst access in the system that avoids, decrease the expense of system based on the data transmission method pushed simultaneously.
Accompanying drawing explanation
Fig. 1 is the network environment that the embodiment of the present invention is run.
Fig. 2 is the corresponding DNCMS method flow diagram of the embodiment of the present invention.
Embodiment
Below in conjunction with specific embodiment, illustrate the present invention further, these embodiments should be understood only be not used in for illustration of the present invention and limit the scope of the invention, after having read the present invention, the amendment of those skilled in the art to the various equivalent form of value of the present invention has all fallen within the application's claims limited range.
First the running environment required for data-driven network struction maintenance and application scenarios transmitted towards efficient subflow is provided, as shown in Figure 1: dispose tracker server in advance in a network, tracker network in charge is that peer (also namely holding main frame) provides registration service, and assist the peer newly adding system to search out other peers in Already in network, and need these peer information of regular update so that carry out sharing of data.
System configuration is as follows: on the PC of Intel-Linux framework, realize present system, and PC is connected in internet with the access bandwidth of at least 1Mbps.The dominant frequency of these PC hardware is the Core double-core CPU of 4.66GHz, internal memory 2GB, hard disk 250GB, runs RedHat6.1Enterprise operating system.
Towards the data-driven network struction maintenance system that efficient subflow is transmitted, comprise peer and add mixed-media network modules mixed-media, peer position adjusting type modules and peer and to exit network module;
Peer adds mixed-media network modules mixed-media for realizing: peer first to the tracker server registration in live broadcast stream media system, and obtains IP address and the port information of other peers current system from server; Peer connects according to the information selecting section peer obtained, and obtains new peer information further from these peers; Peer adopts pathneck
[4]availability bandwidth measurement method calculates self available uploading bandwidth; The latest data block sequence number of peer to each bar subflow contrasts, and adopts water-filling algorithm to be calculated as the bandwidth of each strip flow assignment, and the bandwidth that namely subflow i distributes is
wherein B (i) represents the sequence number of latest data block in the subflow i that peer is known, and s represents the number of subflow; If the bandwidth that peer distributes to certain subflow can be k peer service, so peer is selected to have the peer of this up-to-date sub-stream data block and is added candidate parent node set FatherSet from known peer, and using peer the shortest for time delay in candidate parent node set as father node.
Peer position adjusting type modules is used for realizing: after peer adds system, if the bandwidth distributing to subflow exceedes the bandwidth that father node distributes to subflow, then contact with the father node of father node, if this ancestors' node has remaining bandwidth, and the time delay between peer to ancestors' node is less than the distance of peer between father node to ancestors' node, then send to ancestors' node the request of connecting, if successfully connected, then previous father node is replaced with ancestors' node; When peer receives the request that connects of other peers transmission, if peer has sufficient remaining bandwidth, then accept request and it is responded, if peer receives multiple request simultaneously, but the remaining bandwidth of self cannot provide service for all peers, then select to distribute to the maximum peer of subflow bandwidth, if bandwidth is identical, select to have the less peer of sub-stream data block as child node.
Peer exits network module for realizing: peer sends to all father nodes and child node and exits message; All father nodes all stop to exiting peer transmitting video-frequency flow, and delete the connection with this peer; All child nodes inquire about data cases and the remaining bandwidth situation of other peers, and the node that therefrom selection remaining bandwidth is high, time delay is short is as new father node.
Fig. 2 gives the workflow diagram of DNCMS method of the present invention, this flow process starts from step S101, at this moment peer adds in the middle of system, then S102 is turned, register to tracker server, and ask peer list, turn S104, obtain the information of other peers in system and upgrade peer set, turn S103 subsequently, in the set of perception peer, the sequence number of each bar subflow latest data block and self available uploading bandwidth, turn S105, adopts water-filling algorithm to be the bandwidth that every strip flow assignment is suitable.The bandwidth that subflow i distributes is
wherein B (i) represents the sequence number of latest data block in the subflow i that peer is known, and s represents the number of subflow;
In step s 106, if the bandwidth of certain strip flow assignment more (bandwidth of namely distributing exceedes the size of subflow bandwidth) then turns S108, selecting to have compared with the peer of new data block from peer set is candidate's node, otherwise turn S107, selecting to have compared with the peer of old data block is candidate's node.Then proceed to step S109, from candidate's node, select time delay the shortest and have the peer of sufficient available bandwidth (bandwidth of namely distributing exceedes the size of subflow bandwidth) to be father node, turning S110, start to receive and transmission data.
In step s 110, peer needs regularly to turn S111 and other peers obtain new peer list alternately, and turns S104 and upgrade peer set.
In step S112, if the father node of father node has unnecessary bandwidth, then turn S113, time delay between peer to ancestors' node is less than the distance of peer between father node to ancestors' node, then send to ancestors' node the request of connecting, if successfully connected, then previous father node is replaced with ancestors' node; Otherwise return S110.
In step S114, if peer receives the connection request of other peers, turn S115, otherwise return S110.
In step sl 15, if peer has enough bandwidth, turn S117 and accept request, otherwise turn S116, the peer connection request that responsive bandwidth maximum delay is shorter under the prerequisite meeting the bandwidth upper limit, and turn S110.
In step S118, if certain child node of peer logs off, turn S120, stop to this node transmission data, and turn S110, otherwise directly return S110.
In step S119, if there is father node to log off, then turns S109 from candidate's node, select suitable node as father node, otherwise return S110.
In step S121, if peer does not log off, then return S110, otherwise turn S122, send to all father nodes and child node and exit message, and turn S123 and terminate whole flow process.
Embodiment
This gives the software run based on data-driven network struction of the present invention and maintaining method on the multiple stage PC in certain test bed to organize all test PCs, think that video stream data efficient distribution by streaming media server provides scientific basis to all peers.
Assuming that all PCs in this test envelope are all linked in internet with the bandwidth of at least 1Mbps, and undertaken interconnected by internet, all PCs all run the software based on data-driven network struction of the present invention and maintaining method.When after the software startup on PC, DNCMS method can be called and initiatively to build and service data drives network with tracker server.
After building data-driven network by DNCMS method, content supplier just can realize low time delay, highly reliably transmitting video-frequency flow in this data-driven network, and user just can watch the programme televised live with higher Quality of experience online.
The part that the present invention does not relate to prior art that maybe can adopt all same as the prior art is realized.
Claims (4)
1. towards the data-driven network struction maintenance system that efficient subflow is transmitted, it is characterized in that, comprise peer and add mixed-media network modules mixed-media, peer position adjusting type modules and peer and to exit network module;
Described peer adds mixed-media network modules mixed-media for realizing: in live broadcast stream media system, peer is registered, and obtains IP address and the port information of other peers in current system; Peer connects according to the information selecting section peer obtained, and obtains new peer information further from these peers; Peer calculates self available uploading bandwidth; The latest data block sequence number of peer to each bar subflow contrasts, and adopts water-filling algorithm to be calculated as the bandwidth of each strip flow assignment; If the bandwidth that peer distributes to certain subflow can for k peer service, so peer select to have this sub-stream data block from known peer and the shortest peer of time delay as father node, and added father node set FatherSet;
Described peer position adjusting type modules is used for realizing: after peer adds system, if the bandwidth distributing to subflow exceedes the bandwidth that father node distributes to subflow, then contact with the father node of father node, if this ancestors' node has remaining bandwidth, and the time delay between peer to ancestors' node is less than the distance of peer between father node to ancestors' node, then send to ancestors' node the request of connecting, if successfully connected, then previous father node is replaced with ancestors' node; When peer receives the request that connects of other peers transmission, if peer has sufficient remaining bandwidth, then accept request and it is responded, if peer receives multiple request simultaneously, but the remaining bandwidth of self cannot provide service for all peers, then select to distribute to the maximum peer of subflow bandwidth, if bandwidth is identical, select to have the less peer of sub-stream data block as child node;
Described peer exits network module for realizing: peer sends to all father nodes and child node and exits message; All father nodes all stop to exiting peer transmitting video-frequency flow, and delete the connection with this peer; All child nodes inquire about data cases and the remaining bandwidth situation of other peers, and the node that therefrom selection remaining bandwidth is high, time delay is short is as new father node.
2. the data-driven network struction maintenance system transmitted towards efficient subflow as claimed in claim 1, is characterized in that, peer adopts pathneck availability bandwidth measurement method to calculate the available uploading bandwidth of self; The latest data block sequence number of peer to each bar subflow contrasts, and adopts water-filling algorithm to be calculated as the bandwidth of each strip flow assignment, and the bandwidth that described subflow i distributes is
wherein B (i) represents the sequence number of latest data block in the subflow i that peer is known, and s represents the number of subflow.
3., towards the data-driven network struction maintaining method that efficient subflow is transmitted, it is characterized in that, comprise the following steps:
A. peer adds the step of network: peer first to the tracker server registration in live broadcast stream media system, and obtains IP address and the port information of other peers current system from server; Peer connects according to the information selecting section peer obtained, and obtains new peer information further from these peers; Peer calculates self available uploading bandwidth; The latest data block sequence number of peer to each bar subflow contrasts, and adopt water-filling algorithm to be calculated as the bandwidth of each strip flow assignment, if the bandwidth that peer distributes to certain subflow can be k peer service, so peer select to have this sub-stream data block from known peer and the shortest peer of time delay as father node, and added father node set FatherSet;
B. the step of peer position adjustment: after peer adds system, if the bandwidth distributing to subflow exceedes the bandwidth that father node distributes to subflow, then contact with the father node of father node, if this ancestors' node has remaining bandwidth, and the time delay between peer to ancestors' node is less than the distance of peer between father node to ancestors' node, then send to ancestors' node the request of connecting, if successfully connected, then previous father node is replaced with ancestors' node; When peer receives the request that connects of other peers transmission, if peer has sufficient remaining bandwidth, then accept request and it is responded, if peer receives multiple request simultaneously, but the remaining bandwidth of self cannot provide service for all peers, then select to distribute to the maximum peer of subflow bandwidth, if bandwidth is identical, select to have the less peer of sub-stream data block as child node;
C. the step that exits network of peer: peer sends to all father nodes and child node and exits message; All father nodes all stop to exiting peer transmitting video-frequency flow, and delete the connection with this peer; All child nodes inquire about data cases and the remaining bandwidth situation of other peers, and the node that therefrom selection remaining bandwidth is high, time delay is short is as new father node.
4. the data-driven network struction maintaining method transmitted towards efficient subflow as claimed in claim 2, is characterized in that, peer adopts pathneck availability bandwidth measurement method to calculate the available uploading bandwidth of self; The latest data block sequence number of peer to each bar subflow contrasts, and adopts water-filling algorithm to be calculated as the bandwidth of each strip flow assignment, and the bandwidth that described subflow i distributes is
wherein B (i) represents the sequence number of latest data block in the subflow i that peer is known, and s represents the number of subflow.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510882182.4A CN105306280B (en) | 2015-12-03 | 2015-12-03 | The data-driven network struction maintenance system and method transmitted towards efficient subflow |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510882182.4A CN105306280B (en) | 2015-12-03 | 2015-12-03 | The data-driven network struction maintenance system and method transmitted towards efficient subflow |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105306280A true CN105306280A (en) | 2016-02-03 |
CN105306280B CN105306280B (en) | 2018-06-19 |
Family
ID=55203064
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510882182.4A Expired - Fee Related CN105306280B (en) | 2015-12-03 | 2015-12-03 | The data-driven network struction maintenance system and method transmitted towards efficient subflow |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105306280B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN117221126A (en) * | 2023-11-09 | 2023-12-12 | 之江实验室 | Network collaboration flow-oriented route scheduling method and system |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101459585A (en) * | 2007-12-14 | 2009-06-17 | 中国科学院声学研究所 | P2P stream media data request method |
CN104023277A (en) * | 2014-06-10 | 2014-09-03 | 上海大学 | Method of bandwidth allocation of video stream in P2P (Peer to Peer) overlay network based on Nash bargaining solution |
CN104967866A (en) * | 2015-05-13 | 2015-10-07 | 浙江树人大学 | Dynamic self-adaptive P2P live streaming media substream scheduling method |
-
2015
- 2015-12-03 CN CN201510882182.4A patent/CN105306280B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101459585A (en) * | 2007-12-14 | 2009-06-17 | 中国科学院声学研究所 | P2P stream media data request method |
CN104023277A (en) * | 2014-06-10 | 2014-09-03 | 上海大学 | Method of bandwidth allocation of video stream in P2P (Peer to Peer) overlay network based on Nash bargaining solution |
CN104967866A (en) * | 2015-05-13 | 2015-10-07 | 浙江树人大学 | Dynamic self-adaptive P2P live streaming media substream scheduling method |
Non-Patent Citations (1)
Title |
---|
韩亚峰: "数据驱动的P2P流媒体直播系统数据调度研究", 《中国优秀硕士论文全文数据库》 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN117221126A (en) * | 2023-11-09 | 2023-12-12 | 之江实验室 | Network collaboration flow-oriented route scheduling method and system |
CN117221126B (en) * | 2023-11-09 | 2024-02-13 | 之江实验室 | Network collaboration flow-oriented route scheduling method and system |
Also Published As
Publication number | Publication date |
---|---|
CN105306280B (en) | 2018-06-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Lawey et al. | BitTorrent content distribution in optical networks | |
EP2135430B1 (en) | Hierarchically clustered p2p streaming system | |
US8279766B2 (en) | Interior-node-disjoint multi-tree topology formation | |
US20110219114A1 (en) | Pod-based server backend infrastructure for peer-assisted applications | |
US20130110931A1 (en) | Scalable Peer To Peer Streaming For Real-Time Data | |
CN101567796B (en) | Multimedia network with fragmented content and business method thereof | |
Sweha et al. | Angelcast: cloud-based peer-assisted live streaming using optimized multi-tree construction | |
US20120210014A1 (en) | P2p-engine | |
Roverso et al. | Smoothcache 2.0: Cdn-quality adaptive http live streaming on peer-to-peer overlays | |
Chellouche et al. | Home-box-assisted content delivery network for internet video-on-demand services | |
Zhang et al. | A distributed multichannel demand-adaptive P2P VoD system with optimized caching and neighbor-selection | |
Graffi et al. | Load balancing for multimedia streaming in heterogeneous peer-to-peer systems | |
CN105306280A (en) | Data driving network construction maintenance system and method for efficient substream transmission | |
Sayit et al. | Adaptive, incentive and scalable dynamic tree overlay for P2P live video streaming | |
CN102821316A (en) | Improved video on demand (VOD) transmission method based on peer-to-peer computing core algorithm | |
Li et al. | A progressive flow auction approach for low-cost on-demand p2p media streaming | |
Jiang et al. | A replica placement algorithm for hybrid CDN-P2P architecture | |
Esposito et al. | On the impact of seed scheduling in peer-to-peer networks | |
Ishakian et al. | AngelCast: Cloud-based peer-assisted live streaming using optimized multi-tree construction | |
Muñoz-Gea et al. | Design and analysis of a peer-assisted VOD provisioning system for managed networks | |
Cui et al. | Optimizing P2P streaming throughput under peer churning | |
CN101369915A (en) | P2P operating network resource management system | |
CN114422529B (en) | Data processing method, device and medium | |
Kawakami et al. | A load distribution method based on distributed hashing for P2P sensor data stream delivery system | |
Miguel et al. | Resource-constrained P2P streaming overlay construction for efficient joining under flash crowds |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180619 Termination date: 20191203 |