CN105306280B - The data-driven network struction maintenance system and method transmitted towards efficient subflow - Google Patents
The data-driven network struction maintenance system and method transmitted towards efficient subflow Download PDFInfo
- Publication number
- CN105306280B CN105306280B CN201510882182.4A CN201510882182A CN105306280B CN 105306280 B CN105306280 B CN 105306280B CN 201510882182 A CN201510882182 A CN 201510882182A CN 105306280 B CN105306280 B CN 105306280B
- Authority
- CN
- China
- Prior art keywords
- peer
- bandwidth
- subflow
- node
- father
- 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.)
- Expired - Fee Related
Links
Landscapes
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a kind of data-driven network struction maintenance systems and method transmitted towards efficient subflow, realize the efficient distribution of P2P live broadcast stream media data.The basic thought of this method is：First the bandwidth conditions of subflow are judged according to the data distribution of each subflow in network, and the bandwidth allocation methods to newly adding in peer are proposed based on the information；Further according to it is new add in peer and distribute to the remaining bandwidth information of each peer in the bandwidth of each subflow and subflow transmission path propose father node selection method；Then the method for adjustment of data-driven network peer in the process of maintenance is proposed；Finally propose the method that peer logs off.The present invention has the advantages that video stream distribution time delay is short, system robustness is strong and expense is few.
Description
Technical field
The data-driven network struction for being transmitted and dispatching the present invention relates to a kind of antithetical phrase stream and the system safeguarded and side
Method, it is specifically a kind of towards the nerve of a covering structure of video flowing efficient distribution and the system and method safeguarded, belong to network number
According to the communications field.
Background technology
The a large number of users that live video data is transferred in internet using P2P technologies be a kind of economical and easily side
Method, it can efficiently use the bandwidth resources of the common accessing user of network edge so as to greatly reduce the pressure of video stream server
Power has preferable scalability, current live broadcast stream media system (the live streaming for realizing large scale deployment
System), such as Coolstreaming, PPLive, GridMedia, this method is all employed.However, ordinary terminal host
For server, there is larger dynamic, can add in and log off at any time, therefore P2P live broadcast stream media systems
Main facing challenges are how to meet the service quality that user's smoothness watches programme televised live under dynamic network environment at present
Demand.
In general, when designing P2P live broadcast stream media systems, it is peer to need two aspects that emphasis considers
(peer) nerve of a covering (overlay network) structure of structure and scheduling and the distribution mechanisms of video data[1].Nerve of a covering
Structure is the basis of P2P live broadcast stream media systems, and video data transmission is carried out on nerve of a covering, typical nerve of a covering knot
Structure includes single tree construction, polytree structure and reticular structure[2].The advantages of tree-shaped (tree-based) nerve of a covering is point with data
Hair process has identical structure, and conducive to the diffusion of data, but the nerve of a covering with specific structure is in the network of high dynamic
More difficult maintenance in environment, therefore its robustness is not strong, and can not utilize the bandwidth resources of leafy node.Netted (mesh-
Based) nerve of a covering is built by the way of data-driven (data-driven), also referred to as structureless network, its meeting
With peer addition and exit continuous adjustment, this nerve of a covering can successfully manage node and disturb the influence brought to system.
The scheduling of video data and distribution mechanisms are then to by video data multicast transmission on the basis of application layer nerve of a covering
To each peer, and when being scheduled and distributing to video flowing, target object can be entire video flowing (stream), draw
Subflow (substream) or individual data block (chunk) after point.When being directly scheduled to entire video flowing, application layer
Overlay network generally use list tree construction, system robustness is poor, peer network resources utilization rate is low, and video flowing is divided into
When fine-grained data block is distributed, the upload ability that can efficiently use peer in a peer-to-peer network is concurrently passed
It is defeated, but the performance in terms of this fine-grained scheduling mode can not take into account overhead and data distribution time delay simultaneously.In order to simultaneous
It is that video flowing is divided into the unit of more coarseness, Ye Jizi to care for data distribution time delay and overhead, a kind of scheme of compromise
Stream, is transmitted.Specifically, the data block in video flowing sets sequence number according to reproduction time sequence, it is assumed that video flowing quilt
Be divided into K subflow, then sequence number be represented by nK+i (wherein n be integer, and 1≤i≤K) data block belong to subflow i[3]。
If by comparing various nerves of a covering and data Scheduling Design mode it is found that data-driven network and subflow are dispatched
Mechanism organically combines, it will be able to while the realization of many aspects such as robustness, the distribution time delay of data, overhead in system is excellent
Change.But how still to lack systematic solution to being built and being safeguarded in this data-driven network, it needs to develop
Effective design method.
Bibliography
R.Fortuna,E.Lenardi,M.Mellia,M.Meo,S.Traverso.QoE in pull based P2P-
TV systems:overlay topology design tradeoffs.IEEE P2P 2010.
Y.Liu,Y.Guo,C.Liang.A survey on peer-to-peer video streaming
systems.Peer-to-Peer Networking and Applications 2008,1(1):18-28.
M.Zhang,Q.Zhang,L.Sun,S.Yang.Understanding the power of pull-based
streaming protocol:can we do betterIEEE JSAC 2007,25(8):1678–1694.
N.Hu,L.Li,Z.Mao,et al.Locating Internet bottlenecks:algorithms,
measurements,and implications.ACM SIGCOMM 2004.
Invention content
Goal of the invention：For video stream distribution in current P2P live broadcast stream media systems there are it is inefficient, expense is excessive etc.
Problem proposes the system and method that a kind of data-driven network struction using efficient video steaming transfer as target is safeguarded.
Technical solution：A kind of data-driven network struction maintenance system transmitted towards efficient subflow, including peer plus
Enter network module, peer position adjusting type modules and peer to exit network module；
The peer adds in network module and is used to implement：In live broadcast stream media system, the registration of peer, and worked as
The IP address and port information of other peers in preceding system；Peer is established according to obtained information selecting section peer to be connected
It connects, and new peer information is further obtained at these peers；Peer calculates the available uploading bandwidth of itself；It is right
The latest data block serial number of each subflow is compared Deng side, and the band of each substream allocation is calculated as using water-filling algorithm
It is wide；If the bandwidth that peer distributes to certain subflow can be k peer service, then peer is from known peer
It selects to possess the sub-stream data block and the shortest peer of time delay is as father node, and is added into father node set
FatherSet。
The peer position adjusting type modules are used to implement：After peer addition system, if distributing to the bandwidth of subflow
It more than the bandwidth that father node distributes to subflow, is then contacted with the father node of father node, if ancestors' node has remaining bandwidth
(remaining amount of bandwidth should be more than the amount of bandwidth of subflow), and peer is less than equity to the time delay between ancestors' node
Side then establishes connection request, if the company of being successfully established by the distance between father node to ancestors' node to the transmission of ancestors' node
It connects, then previous father node is replaced with into ancestors' node；When peer receive other peers transmission establish connection request
When, if peer has sufficient remaining bandwidth, receive to ask and respond thereto, if peer receive simultaneously it is multiple
Request, but the remaining bandwidth of itself can not provide service for all peers, then and the equity of subflow bandwidth maximum is distributed in selection
Side, selects to possess if bandwidth is identical the less peer of sub-stream data block as child node.
The peer module that exits network is used to implement：Report is exited in all father nodes in reciprocity direction and child node transmission
Text；All father nodes all stop to exiting peer transmitting video-frequency flow, and delete the connection with the peer；All child nodes are looked into
The data cases of other peers and remaining bandwidth situation are ask, therefrom selects remaining bandwidth is high, time delay is short node as newly
Father node.
Peer uses pathneck[4]Availability bandwidth measurement method calculates the available uploading bandwidth of itself；Peer pair
The latest data block serial number of each subflow is compared, and the bandwidth of each substream allocation is calculated as using water-filling algorithm, described
Subflow i distribution bandwidth beWherein B (i) represents newest number in subflow i known to peer
According to the serial number of block, s represents the number of subflow.
A kind of data-driven network struction maintaining method (Data-Driven Network transmitted towards efficient subflow
Construction and Maintenance Scheme, abbreviation DNCMS), this method emphatically describe peer add in and
The method taken when exitting network, includes the following steps：
A. peer adds in the step of network：Tracker server note of the peer first into live broadcast stream media system
Volume, and obtain the IP address and port information of other peers in current system from server；Peer is according to obtained information
Selected section peer establishes connection, and new peer information is further obtained at these peers；Peer uses
pathneck[4]Availability bandwidth measurement method calculates the available uploading bandwidth of itself；Peer is to the latest data of each subflow
Block serial number is compared, and the bandwidth of each substream allocation is calculated as using water-filling algorithm, i.e. the bandwidth of subflow i distribution isWherein B (i) represents the serial number of latest data block in subflow i known to peer, and s represents son
The number of stream；If the bandwidth that peer distributes to certain subflow can be k peer service, then peer is from known right
It selects to possess the sub-stream data block in grade sides and the shortest peer of time delay is as father node, and is added into father node set
FatherSet。
B. the step of peer position adjusts：After peer addition system, if the bandwidth for distributing to subflow is tied more than father
Point distributes to the bandwidth of subflow, then is contacted with the father node of father node, if ancestors' node has remaining bandwidth, and equity
Side is less than peer by the distance between father node to ancestors' node to the time delay between ancestors' node, then is sent out to ancestors' node
It send and establishes connection request, if being successfully established connection, previous father node is replaced with into ancestors' node；When peer receives
Other peers send when establishing connection request, if peer has sufficient remaining bandwidth, receive request and to its into
Row response, if peer receives multiple requests simultaneously, but the remaining bandwidth of itself can not provide service for all peers, then
The peer of subflow bandwidth maximum is distributed in selection, selects to possess the less peer work of sub-stream data block if bandwidth is identical
For child node.
C. the step of peer exits network：Message is exited in all father nodes in reciprocity direction and child node transmission；All fathers
Node all stops to exiting peer transmitting video-frequency flow, and delete the connection with the peer；It is right that all child nodes inquire other
Deng the data cases of side and remaining bandwidth situation, the node for therefrom selecting remaining bandwidth short higher than subflow bandwidth, time delay is as new
Father node.
Advantageous effect：The present invention has the following advantages compared with the prior art：
1st, distribution time delay is short, efficient：It is of the invention using subflow as scheduling and distribution object compared with existing design method,
Reduce the time of data perception and request, thus with higher distribution efficiency, it can be in a relatively short period of time by video flowing
All peers being distributed in P2P live broadcast stream media systems.
2nd, strong robustness, overhead are few：For the present invention based on data-driven network, peer can be according to network
Dynamic feature is adjusted correspondingly, and avoids system and serious performance occurs in violent node disturbance and burst access
Decline, while the data transmission method based on push reduces the expense of system.
Description of the drawings
Fig. 1 is the network environment of operation of the embodiment of the present invention.
Fig. 2 corresponds to DNCMS method flow diagrams for the embodiment of the present invention.
Specific embodiment
With reference to specific embodiment, the present invention is furture elucidated, it should be understood that these embodiments are merely to illustrate the present invention
Rather than limit the scope of the invention, after the present invention has been read, those skilled in the art are to the various equivalences of the present invention
The modification of form falls within the application range as defined in the appended claims.
The data-driven network struction transmitted towards efficient subflow is provided first safeguards required running environment and application
Scene, as shown in Figure 1：In a network in advance dispose tracker servers, tracker servers be responsible for peer (namely end
Host) registration service is provided, and the new peer for adding in system is assisted to search out other peers being already present in network,
And it needs to regularly update these peer information in order to carry out the shared of data.
System configuration is as follows：Present system is realized in the PC machine of Intel-Linux frameworks, PC machine is at least 1Mbps
Access bandwidth be connected in internet.The dominant frequency of these PC machine hardware is Core double-core CPU, the memory 2GB of 4.66GHz, firmly
Disk 250GB runs Red Hat 6.1Enterprise operating systems.
The data-driven network struction maintenance system transmitted towards efficient subflow adds in network module, right including peer
It exits network module Deng square position adjusting type modules and peer；
Peer adds in network module and is used to implement：Tracker service of the peer first into live broadcast stream media system
Device is registered, and obtains the IP address and port information of other peers in current system from server；Peer is according to obtaining
Information selecting section peer establishes connection, and new peer information is further obtained at these peers；Peer is adopted
Use pathneck[4]Availability bandwidth measurement method calculates the available uploading bandwidth of itself；Peer is to the newest number of each subflow
It is compared according to block serial number, and the bandwidth of each substream allocation is calculated as using water-filling algorithm, is i.e. the bandwidth of subflow i distribution isWherein B (i) represents the serial number of latest data block in subflow i known to peer, and s represents son
The number of stream；If the bandwidth that peer distributes to certain subflow can be k peer service, then peer is from known right
Selection possesses the peer of the newest sub-stream data block and is added into candidate parent node set FatherSet in grade sides, and will
The shortest peer of time delay is as father node in candidate parent node set.
Peer position adjusting type modules are used to implement：After peer addition system, if the bandwidth for distributing to subflow is more than
Father node distributes to the bandwidth of subflow, then is contacted with the father node of father node, if ancestors' node has remaining bandwidth, and
Peer is less than peer by the distance between father node to ancestors' node to the time delay between ancestors' node, then is tied to ancestors
Point sends and establishes connection request, if being successfully established connection, previous father node is replaced with ancestors' node；When peer connects
When establishing connection request of other peers transmission is received, if peer has sufficient remaining bandwidth, receives to ask and right
It is responded, if peer receives multiple requests simultaneously, but the remaining bandwidth of itself can not provide clothes for all peers
The peer of subflow bandwidth maximum is distributed in business, then selection, selects to possess less pair of sub-stream data block if bandwidth is identical
Child node is used as Deng side.
The peer module that exits network is used to implement：Message is exited in all father nodes in reciprocity direction and child node transmission；Institute
There is father node all to stop to exiting peer transmitting video-frequency flow, and delete the connection with the peer；All child nodes inquire it
The data cases of his peer and remaining bandwidth situation therefrom select the node that remaining bandwidth is high, time delay is short to be tied as new father
Point.
Fig. 2 gives the work flow diagram of DNCMS methods of the present invention, which starts from step S101, at this moment peer
In addition system, then turn S102, registered to tracker servers, and ask peer list, turn S104, obtain
The information of other peers and peer set is updated in system, then turn S103, perceive in peer set each subflow most
The serial number of new data block and itself available uploading bandwidth, turn S105, use water-filling algorithm suitable to be distributed per strip stream
Bandwidth.Subflow i distribution bandwidth beWherein B (i) is represented in subflow i known to peer most
The serial number of new data block, s represent the number of subflow；
In step s 106, bandwidth if certain substream allocation is more, and (bandwidth distributed is more than the big of subflow bandwidth
It is small) then turn S108, the peer for selecting to possess newer data block from peer set is candidate node, otherwise turns S107, selects
It is candidate node to select the peer possessed compared with old data block.Then step S109 is transferred to, selects time delay most short from candidate node
And it is father node to have the peer of the sufficient available bandwidth size of subflow bandwidth (bandwidth distributed be more than), turns S110, starts
Receive and transmit data.
In step s 110, peer needs the regular S111 that turns to interact the new peer list of acquisition with other peers,
And turn S104 update peer set.
In step S112, if the father node of father node has extra bandwidth, turn S113, peer to ancestors' node it
Between time delay be less than peer by father node the distance between to ancestors' node, then sent to ancestors' node and establish connection and ask
It asks, if being successfully established connection, previous father node is replaced with into ancestors' node；Otherwise S110 is returned.
In step S114, if peer receives the connection request of other peers, turn S115, otherwise return
S110。
In step sl 15, turn S117 if there are enough bandwidth if peer and receive request, otherwise turn S116, meeting
The shorter peer connection request of responsive bandwidth maximum delay under the premise of the bandwidth upper limit, and turn S110.
In step S118, turn S120 if some child node of peer logs off, stop transmitting to the node
Data, and turn S110, otherwise directly return to S110.
In step S119, if there is father node logs off, then turn S109 and suitable node is selected from candidate node
As father node, S110 is otherwise returned.
In step S121, if peer does not log off, S110 is returned, otherwise turns S122, to all father nodes
Message is exited, and turn S123 and terminate whole flow process with child node transmission.
Embodiment
This gives data-driven network struction of the operation based on the present invention on the multiple pc machine in certain test bed
Tissue is carried out to all test PC machine with the software of maintaining method, efficiently to divide by streaming media server for video stream data
It issues all peers and scientific basis is provided.
It is assumed that all PC machine in the test envelope are all linked into at least bandwidth of 1Mbps in internet, and pass through because of spy
Net is interconnected, and all PC machine all run the data-driven network struction based on the present invention and the software of maintaining method.Work as PC machine
On software start after, can call DNCMS methods actively with tracker servers and building and safeguarding data-driven network.
After building data-driven network by DNCMS methods, content supplier just can be in the data-driven network
Middle to realize low time delay, highly reliably transmitting video-frequency flow, user can just watch the programme televised live with higher Quality of experience online
.
Part that the present invention does not relate to is same as the prior art or the prior art can be used is realized.
Claims (4)
1. a kind of data-driven network struction maintenance system transmitted towards efficient subflow, which is characterized in that including peer plus
Enter network module, peer position adjusting type modules and peer to exit network module；
The peer adds in network module and is used to implement：In live broadcast stream media system, peer registration, and obtain current system
In other peers IP address and port information；Peer establishes connection according to obtained information selecting section peer, and
New peer information is further obtained at these peers；Peer calculates the available uploading bandwidth of itself；Peer
The latest data block serial number of each subflow is compared, and the bandwidth of each substream allocation is calculated as using water-filling algorithm；Such as
The bandwidth that fruit peer distributes to certain subflow can be k peer service, then peer is selected from known peer
Possess the sub-stream data block and the shortest peer of time delay is as father node, and is added into father node set FatherSet；
The peer position adjusting type modules are used to implement：After peer addition system, if the bandwidth for distributing to subflow is more than
Father node distributes to the bandwidth of subflow, then is contacted with the father node of father node, and the father node of father node is known as ancestors' node, if
Ancestors' node has remaining bandwidth, and peer is less than peer by father node to ancestral to the time delay between ancestors' node
The distance between first node then establishes connection request to the transmission of ancestors' node, if being successfully established connection, previous father is tied
Point replaces with ancestors' node；When peer receive other peers transmission when establishing connection request, filled if peer has
The remaining bandwidth of foot, then receive to ask and respond thereto, if peer receives multiple requests, but the residue of itself simultaneously
Bandwidth can not provide service for all peers, then the peer of subflow bandwidth maximum is distributed in selection, if bandwidth is identical
Select to possess the less peer of sub-stream data block as child node；
The peer module that exits network is used to implement：Message is exited in all father nodes in reciprocity direction and child node transmission；Institute
There is father node all to stop to exiting peer transmitting video-frequency flow, and delete the connection with the peer；All child nodes inquire it
The data cases of his peer and remaining bandwidth situation therefrom select the node that remaining bandwidth is high, time delay is short to be tied as new father
Point.
2. the data-driven network struction maintenance system transmitted as described in claim 1 towards efficient subflow, which is characterized in that
Peer calculates the available uploading bandwidth of itself using pathneck availability bandwidth measurement methods；Peer is to each subflow
Latest data block serial number is compared, and the bandwidth of each substream allocation is calculated as using water-filling algorithm, the subflow i distribution
Bandwidth isWherein B (i) represents the serial number of latest data block in subflow i known to peer, s
Represent the number of subflow.
3. a kind of data-driven network struction maintaining method transmitted towards efficient subflow, which is characterized in that include the following steps：
A. peer adds in the step of network：Tracker server registration of the peer first into live broadcast stream media system, and
The IP address and port information of other peers in current system are obtained from server；Peer is according to obtained information selector
Peer is divided to establish connection, and new peer information is further obtained at these peers；Peer calculates itself
Uploading bandwidth can be used；Peer compares the latest data block serial number of each subflow, and is calculated as respectively using water-filling algorithm
The bandwidth of substream allocation, if the bandwidth that peer distributes to certain subflow can be k peer service, then peer from
It selects to possess the sub-stream data block in known peer and the shortest peer of time delay is as father node, and be added into father's knot
Point set FatherSet；
B. the step of peer position adjusts：After peer addition system, if distributing to the bandwidth of subflow more than father node point
The bandwidth of dispensing subflow is then contacted with the father node of father node, if ancestors' node has remaining bandwidth, and peer arrives
Time delay between ancestors' node is less than peer by the distance between father node to ancestors' node, then is built to the transmission of ancestors' node
Vertical connection request, if being successfully established connection, ancestors' node is replaced with by previous father node；When peer receives other
When establishing connection request of peer transmission if peer has sufficient remaining bandwidth, receives to ask and ring it
Should, if peer receives multiple requests simultaneously, but the remaining bandwidth of itself can not provide service for all peers, then select
The peer of subflow bandwidth maximum is distributed to, selects to possess the less peer of sub-stream data block if bandwidth is identical as son
Node；
C. the step of peer exits network：Message is exited in all father nodes in reciprocity direction and child node transmission；All father nodes
All stop to exiting peer transmitting video-frequency flow, and delete the connection with the peer；All child nodes inquire other peers
Data cases and remaining bandwidth situation, therefrom select the node that remaining bandwidth is high, time delay is short as new father node.
4. the data-driven network struction maintaining method transmitted as claimed in claim 3 towards efficient subflow, which is characterized in that
Peer calculates the available uploading bandwidth of itself using pathneck availability bandwidth measurement methods；Peer is to each subflow
Latest data block serial number is compared, and the bandwidth of each substream allocation is calculated as using water-filling algorithm, the subflow i distribution
Bandwidth isWherein B (i) represents the serial number of latest data block in subflow i known to peer, s
Represent 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 CN105306280A (en) | 2016-02-03 |
| CN105306280B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117221126B (en) * | 2023-11-09 | 2024-02-13 | 之江实验室 | 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流媒体直播系统数据调度研究;韩亚峰;《中国优秀硕士论文全文数据库》;20141031;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105306280A (en) | 2016-02-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Magharei et al. | ISP-friendly live P2P streaming | |
| Ren et al. | On reducing mesh delay for peer-to-peer live streaming | |
| Sweha et al. | Angelcast: cloud-based peer-assisted live streaming using optimized multi-tree construction | |
| CN104954866B (en) | A kind of live middle broadcast point dynamic control method of stream medium data | |
| CN104967866B (en) | A kind of P2P live broadcast stream media subflow dispatching methods of dynamic self-adapting | |
| Chellouche et al. | Home-box-assisted content delivery network for internet video-on-demand services | |
| Tuncer et al. | Scalable cache management for ISP-operated content delivery services | |
| Ren et al. | Fast-mesh: A low-delay high-bandwidth mesh for peer-to-peer live streaming | |
| Ganesan et al. | QoS-aware multicast for crowdsourced 360 live streaming in SDN aided NG-EPON | |
| Luo et al. | DigiMetro-an application-level multicast system for multi-party video conferencing | |
| CN105306280B (en) | The data-driven network struction maintenance system and method transmitted towards efficient subflow | |
| Chang et al. | Content-priority-aware chunk scheduling over swarm-based p2p live streaming system: from theoretical analysis to practical design | |
| CN105392025A (en) | User-side bandwidth aggregation method, apparatus and content distribution system | |
| Alghazawy et al. | A scheme for maximal resource utilization in peer-to-peer live streaming | |
| Liu et al. | Network coding for peer-to-peer live media streaming | |
| Jiang et al. | A replica placement algorithm for hybrid CDN-P2P architecture | |
| Ishakian et al. | AngelCast: Cloud-based peer-assisted live streaming using optimized multi-tree construction | |
| Muscat et al. | A Hybrid CDN-P2P Architecture for Live Video Streaming | |
| CN107800567B (en) | Method for establishing P2P streaming media network topology model of mixed mode | |
| RU2465638C1 (en) | Method of distributing multimedia information by peer-to-peer decentralised network deployment and decentralised network for realising said method | |
| Wen et al. | User density sensitive p2p streaming in wireless mesh networks | |
| Cui et al. | Optimizing P2P streaming throughput under peer churning | |
| Hu et al. | Exploring the optimal substream scheduling and distribution mechanism for data-driven P2P media streaming | |
| Mykoniati et al. | Scalable peer-to-peer streaming for live entertainment content | |
| Kamiyama et al. | Parallel video streaming optimizing network throughput |
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 |
Granted publication date: 20180619 Termination date: 20191203 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |