CN104506929A - Hybrid data scheduling method for P2P (peer to peer) systems - Google Patents
Hybrid data scheduling method for P2P (peer to peer) systems Download PDFInfo
- Publication number
- CN104506929A CN104506929A CN201410831223.2A CN201410831223A CN104506929A CN 104506929 A CN104506929 A CN 104506929A CN 201410831223 A CN201410831223 A CN 201410831223A CN 104506929 A CN104506929 A CN 104506929A
- Authority
- CN
- China
- Prior art keywords
- data block
- data
- window
- nodes
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 45
- 230000000750 progressive effect Effects 0.000 claims description 4
- 230000015572 biosynthetic process Effects 0.000 claims description 3
- 239000003607 modifier Substances 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 3
- 238000005516 engineering process Methods 0.000 description 4
- 239000002699 waste material Substances 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/438—Interfacing the downstream path of the transmission network originating from a server, e.g. retrieving encoded video stream packets from an IP network
- H04N21/4385—Multiplex stream processing, e.g. multiplex stream decrypting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/443—OS processes, e.g. booting an STB, implementing a Java virtual machine in an STB or power management in an STB
- H04N21/4438—Window management, e.g. event handling following interaction with the user interface
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client
- H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
- H04N21/643—Communication protocols
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Human Computer Interaction (AREA)
- Software Systems (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a hybrid data scheduling method for P2P (peer to peer) systems and relates to the technical field of broadcasting application devices or methods directly related to broadcast information or broadcast time and space. According to the method, a required data window in the P2P video-on-demand system is divided into a playing window, an emergency window and a common window, and nodes in the P2P video-on-demand system can acquire data from a film source server and can also share data with other nodes; meanwhile, a BitTorrent protocol is introduced to a streaming media video-on-demand service, and the nodes communicate with other nodes through the modified BitTorrent protocol. The BitTorrent protocol has the priority of downloading fewest data blocks, thus distribution of the data in a whole network is improved; data transmission with limited playing time is not supported. According to the method, emergency data is downloaded prior through a sliding window. The method has the advantages that downloading speed is increased and the P2P video-on-demand system plays more smoothly.
Description
Technical field
The present invention relates to for broadcast message or broadcast the directly related broadcasted application device of space-time or method and technology field, particularly relate to a kind of P2P System Admixture Data dispatching method.
Background technology
P2P technology and Stream Media Application being combined is one of the focus of current research, and the maximum advantage of P2P system makes user effectively can utilize resource in network, and these resources comprise data resource, bandwidth resources and computer resource.So this makes the bottleneck almost not having original C/S mode in P2P system, there is good extensibility.In P2P model, each node (peer) plays two kinds of roles simultaneously, is client and server, can, as other querying nodes and the service required for request, service can be provided to other nodes as server as client.
User, by using BitTorrent agreement shared file, greatly increases speed of download.But what the sheet choosing mechanism due to BitTorrent agreement adopted is minimum preference strategy, the transfer of data that this strategy will not be suitable for time-sensitive.Reason is the transfer of data to time-sensitive, and the download of each block has a deadline.Exceed deadline, this data block will become useless and can be dropped, and cause bandwidth waste like this and can not meet the demand of broadcasting.Because BitTorrent agreement is for file-sharing, do not consider the restriction in transmission time limit.
Summary of the invention
Technical problem to be solved by this invention is to provide a kind of P2P System Admixture Data dispatching method, described method client both can from sheet source server acquisition number certificate, also with other nodes sharing data, speed of download can be improve simultaneously, P2P VOD system be play more smooth.
For solving the problems of the technologies described above, the technical solution used in the present invention is: a kind of P2P System Admixture Data dispatching method, it is characterized in that: data window required in described P2P VOD system is divided into broadcast window, urgent window and common window, window before playing pointer is broadcast window, the data block play for present node in broadcast window, data block between described broadcast window and common window is urgent window, data block in described urgent window is the data block at once needing to play, along with the forward slip of broadcast window, treat that requested data block is downloaded to sheet source server or other node requests in described urgent window, after the data block in described urgent window has all been downloaded, data block in common window is downloaded from other nodes or sheet source server and is treated requested data block, in present node playing process, data block after data block before urgent window and common window is not downloaded.
Further technical scheme is: the data block sheet choosing method in described urgent window is progressive download, and node adopts Stochastic choice.
Further technical scheme is: the size of urgent window is relevant with playout-delay, suppose that the sustainable playout-delay time is d, need the data block of d time after quick-downloading as much as possible current playing pointer within this time of delay, in order to reach this target, suppose that urgent window size is w, should formula be met
Wherein d is broadcast time-delay, and b is video encoding rate, and c is data block size, and the speed of download of each client at least should be greater than broadcasting speed.
Further technical scheme is: the data block sheet choosing method in described common window is minimum precedence method.
Further technical scheme is: described minimum precedence method is specially: add up owner's quantity of data block, and the data block with equal number owner is formed a list, then by these lists according to owner's quantity sequence formation list, the 0th element in list is that oneself lacks, the list that interested data block is formed, its all neighbor nodes all do not have these data blocks; 1st element is that oneself lacks, the list that interested data block is formed, and only has a neighboring client end to have one of them data block in its all neighbor nodes; Data block in 2nd element, in its all neighbor nodes, only have two neighbor nodes all to have one of them data block, the like, n-th element is that oneself lacks, the list that interested data block is formed, only has n neighbor node to have one of them data block in its all neighbor nodes; If one of them neighbor node has downloaded the 1st piece, then this neighbor node has sent have message to it, after the have message receiving first piece, then first piece can be moved in the list of the block only having two nodes to have;
When node selects next data block in common window time, one piece of download is selected from the list of the block only having a node to have of this list, if this sublist is empty, then select to only have two, the like, if this sublist is empty, then select the sublist of the block only having n, wherein n be greater than 2 natural number.
Further technical scheme is: described data block comprises non-downloading data block, just in downloading data block and downloading data block.
Further technical scheme is: described non-downloading data block is not for this data block is in internal memory or disk, and present node did not cross this blocks of data to any other node or film source server request in the past, if this data block is after play time, just can select to download this block to any other node or film source server request, then this bulk state is revised as and download.
Further technical scheme is: described just downloading data block for this data block not in internal memory or disk, but user had sent the download request of this data block to other nodes or sheet source server, but also do not receive this blocks of data, after receiving this blocks of data, by the status modifier of this block for download.
Further technical scheme is: described downloading data block gets from other nodes or sheet source server there for this data block, is kept in internal memory or disk.
Adopt the beneficial effect that produces of technique scheme to be: by described method, the node in P2P VOD system both can from sheet source server acquisition number certificate, simultaneously also can with other nodes sharing data.BitTorrent agreement is introduced streaming media on demand service simultaneously, node uses amended BitTorrent agreement to communicate with other nodes, because BitTorrent treaty override downloads minimum data block to improve the distribution of data in whole network, the transfer of data playing the time limit can not be applicable to, there is employed herein sliding window mechanism and carry out preferential download emergency data.Described method improves speed of download, P2P VOD system is play more smooth.
Accompanying drawing explanation
Below in conjunction with the drawings and specific embodiments, the present invention is further detailed explanation.
Fig. 1-2 is that the method for the invention realizes schematic diagram;
Fig. 3-4 is minimum precedence method data block owner list figure in the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, be clearly and completely described the technical scheme in the embodiment of the present invention, obviously, described embodiment is only a part of embodiment of the present invention, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
Set forth a lot of detail in the following description so that fully understand the present invention, but the present invention can also adopt other to be different from alternate manner described here to implement, those skilled in the art can when without prejudice to doing similar popularization when intension of the present invention, therefore the present invention is by the restriction of following public specific embodiment.
Described method proposes a kind of blended data scheduling mechanism, and client both can sheet source server acquisition number certificate, simultaneously also can with other nodes sharing data.User, by using BitTorrent agreement shared file, greatly increases speed of download.But what the sheet choosing mechanism due to BitTorrent agreement adopted is minimum preference strategy, the transfer of data that this strategy will not be suitable for time-sensitive.Reason is the transfer of data to time-sensitive, and the download of each block has a deadline.Exceed deadline, this data block will become useless and can be dropped, and cause bandwidth waste like this and can not meet the demand of broadcasting.Because BitTorrent agreement is for file-sharing, do not consider the restriction in transmission time limit.In order to address this problem, we have made amendment to BitTorrent agreement, and make the data of client no longer before downloading and playing time point, we introduce sliding window mechanism, preferential download emergency data simultaneously.
As shown in Figure 1, the invention discloses a kind of P2P System Admixture Data dispatching method, concrete, described method is as follows: data window required in described P2P VOD system is divided into broadcast window, urgent window and common window, window before playing pointer is broadcast window, the data block play for present node in broadcast window, data block between described broadcast window and common window is urgent window, data block in described urgent window is the data block at once needing to play, along with the forward slip of broadcast window, treat that requested data block is downloaded to sheet source server or other node requests in described urgent window, after the data block in described urgent window has all been downloaded, data block in common window is downloaded from other nodes or sheet source server and is treated requested data block, the download pressure of sheet source server can be alleviated like this, in present node playing process, data block after data block before urgent window and common window is not downloaded.
Data block sheet choosing method in described urgent window is progressive download, and node adopts Stochastic choice, avoids the data block of progressive download all to same node request.The size of urgent window is relevant with playout-delay, supposing that the sustainable playout-delay time is d, needing the data block of d time after quick-downloading as much as possible current playing pointer within this time of delay, in order to reach this target, suppose that urgent window size is w, should formula be met:
Wherein d is broadcast time-delay, and b is video encoding rate, and c is data block size, and the speed of download of each client at least should be greater than broadcasting speed.
Data before urgent window are out-of-date data, no longer download, in order to avoid waste bandwidth.Data block after common window is the data block all can not used recently, if download meeting occupied bandwidth, affects the download of urgent window data block.Even if the data block of urgent window and common window is all downloaded complete, common window data below also can not be downloaded, because user likely can not watch video content below.Only have playing pointer to move and window could be driven to move, then download new data block.As shown in Figure 2, playing pointer moves right, and urgent window and common window are moved to the left simultaneously.
Data block sheet choosing method in described common window is minimum precedence method.Described minimum precedence method is specially: add up owner's quantity of data block, and the data block with equal number owner is formed a list, then by these lists according to owner's quantity sequence formation list.The 0th element in list is that oneself lacks, the list that interested data block is formed, and its all neighbor nodes all do not have these data blocks; 1st element is that oneself lacks, the list that interested data block is formed, and only has a neighbor node to have one of them data block in its all neighbor nodes; Data block in same 2nd element, only has two neighbor nodes all to have one of them data block in its all neighbor nodes, the like.As shown in Figure 3, wherein the 3rd, 6 pieces of needs are downloaded, but all neighbor nodes all do not have this part, and the 7th, 1 piece also needs to be downloaded, and all only having a neighbor node to have, this is fast, and the same 0th, 5,4 pieces of every blocks all only have two neighbor nodes to have this block.
If one of them neighbor node has downloaded the 1st piece, then this neighbor node can send have message to current broadcast nodes, after the have message receiving first piece, then first piece can be moved in the list of the data block only having two nodes to have.Be illustrated in fig. 4 shown below: when broadcast nodes selects next data block in common window time, from the list of the block only having a node to have of this list, select a data block to download, if this sublist is empty, then select to only have two successively, the sublist of the block that three people have.
Bitmap, for recording the state information of each data block, prevents the data block that user's repeated downloads is being downloaded or downloaded, in order to avoid waste bandwidth.File is divided into polylith (general every block size is 64KB) according to fixing size.TORRENT file can be resolved and obtain every block file size, data block quantity.According to data block quantity, we use the state of an every block of bitmap data structure record.Always be divided into three kinds of states: do not download, download, download.
Described non-downloading data block is that this data block is not in internal memory or disk, and present node did not cross this blocks of data to any other node or film source server request in the past, if this data block is after play time, just can select to download this block to any other node or film source server request, then this bulk state is revised as and download.Described is being just that this data block is not in internal memory or disk in downloading data block, but user had sent the download request of this data block to other nodes or sheet source server, but also do not receive this blocks of data, after receiving this blocks of data, by the status modifier of this block for download.Described downloading data block gets from other nodes or sheet source server there for this data block, is kept in internal memory or disk.
By described method, the node in P2P VOD system both from sheet source server acquisition number certificate, also with other nodes sharing data, can improve speed of download simultaneously, P2P VOD system was play more smooth.
Claims (9)
1. a P2P System Admixture Data dispatching method, it is characterized in that: data window required in described P2P VOD system is divided into broadcast window, urgent window and common window, window before playing pointer is broadcast window, the data block play for present node in broadcast window, data block between described broadcast window and common window is urgent window, data block in described urgent window is the data block at once needing to play, along with the forward slip of broadcast window, treat that requested data block is downloaded to sheet source server or other node requests in described urgent window, after the data block in described urgent window has all been downloaded, data block in common window is downloaded from other nodes or sheet source server and is treated requested data block, in present node playing process, data block after data block before urgent window and common window is not downloaded.
2. P2P System Admixture Data dispatching method according to claim 1, is characterized in that: the data block sheet choosing method in described urgent window is progressive download, and node adopts Stochastic choice.
3. P2P System Admixture Data dispatching method according to claim 1, it is characterized in that: the size of urgent window is relevant with playout-delay, suppose that the sustainable playout-delay time is d, need the data block of d time after quick-downloading as much as possible current playing pointer within this time of delay, in order to reach this target, suppose that urgent window size is w, should formula be met
Wherein d is broadcast time-delay, and b is video encoding rate, and c is data block size, and the speed of download of each client at least should be greater than broadcasting speed.
4. P2P System Admixture Data dispatching method according to claim 1, is characterized in that: the data block sheet choosing method in described common window is minimum precedence method.
5. P2P System Admixture Data dispatching method according to claim 4, is characterized in that described minimum precedence method is specially:
Owner's quantity of data block is added up, and the data block with equal number owner is formed a list, then by these lists according to owner's quantity sequence formation list, the 0th element in list is that oneself lacks, the list that interested data block is formed, its all neighbor nodes all do not have these data blocks; 1st element is that oneself lacks, the list that interested data block is formed, and only has a neighboring client end to have one of them data block in its all neighbor nodes; Data block in 2nd element, in its all neighbor nodes, only have two neighbor nodes all to have one of them data block, the like, n-th element is that oneself lacks, the list that interested data block is formed, only has n neighbor node to have one of them data block in its all neighbor nodes; If one of them neighbor node has downloaded the 1st piece, then this neighbor node has sent have message to it, after the have message receiving first piece, then first piece can be moved in the list of the block only having two nodes to have;
When node selects next data block in common window time, one piece of download is selected from the list of the block only having a node to have of this list, if this sublist is empty, then select to only have two, the like, if this sublist is empty, then select the sublist of the block only having n, wherein n be greater than 2 natural number.
6. P2P System Admixture Data dispatching method according to claim 1, is characterized in that: described data block comprises non-downloading data block, just in downloading data block and downloading data block.
7. P2P System Admixture Data dispatching method according to claim 6, it is characterized in that: described non-downloading data block is not for this data block is in internal memory or disk, and present node did not cross this blocks of data to any other node or film source server request in the past, if this data block is after play time, just can select to download this block to any other node or film source server request, then this bulk state is revised as and download.
8. P2P System Admixture Data dispatching method according to claim 6, it is characterized in that: described just downloading data block for this data block not in internal memory or disk, but user had sent the download request of this data block to other nodes or sheet source server, but also do not receive this blocks of data, after receiving this blocks of data, by the status modifier of this block for download.
9. P2P System Admixture Data dispatching method according to claim 6, is characterized in that: described downloading data block gets from other nodes or sheet source server there for this data block, is kept in internal memory or disk.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410831223.2A CN104506929A (en) | 2014-12-26 | 2014-12-26 | Hybrid data scheduling method for P2P (peer to peer) systems |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410831223.2A CN104506929A (en) | 2014-12-26 | 2014-12-26 | Hybrid data scheduling method for P2P (peer to peer) systems |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104506929A true CN104506929A (en) | 2015-04-08 |
Family
ID=52948633
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410831223.2A Pending CN104506929A (en) | 2014-12-26 | 2014-12-26 | Hybrid data scheduling method for P2P (peer to peer) systems |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104506929A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105323260A (en) * | 2015-12-10 | 2016-02-10 | 康佳集团股份有限公司 | P2P stream media system based data scheduling optimization method and broadcast system |
| CN105872764A (en) * | 2015-12-21 | 2016-08-17 | 乐视云计算有限公司 | Data downloading method and device based on P2P (Peer-to-Peer) network |
| WO2016184230A1 (en) * | 2015-05-15 | 2016-11-24 | 乐视云计算有限公司 | P2p data downloading method and apparatus |
| CN109450815A (en) * | 2018-09-28 | 2019-03-08 | 桂林电子科技大学 | A kind of equity network flow medium system data scheduling algorithm based on value of utility |
| CN110493320A (en) * | 2019-07-23 | 2019-11-22 | 北京三快在线科技有限公司 | Data download method, device, electronic equipment and storage medium |
| CN111556344A (en) * | 2020-04-04 | 2020-08-18 | 网宿科技股份有限公司 | Method, device, equipment and system for downloading video stream |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050239451A1 (en) * | 2004-04-02 | 2005-10-27 | Shalini Periyalwar | System and method for peer-to-peer communication in cellular systems |
| CN101170371A (en) * | 2007-11-30 | 2008-04-30 | 中兴通讯股份有限公司 | A client data request optimization method and system in P2P order |
| CN101345768A (en) * | 2008-08-15 | 2009-01-14 | 南京邮电大学 | Peer-to-peer network transmission method of music demand system |
| CN101471919A (en) * | 2007-12-29 | 2009-07-01 | 突触计算机系统（上海）有限公司 | Method and device for downloading slicing of equipment based on point-to-point transmission protocol |
| CN101626400A (en) * | 2009-08-11 | 2010-01-13 | 华中科技大学 | Compensation method of P2P music on-demand system |
| CN101631092A (en) * | 2008-07-18 | 2010-01-20 | 株式会社日立制作所 | System and method for distributing data |
| CN103188279A (en) * | 2011-12-27 | 2013-07-03 | 中国电信股份有限公司 | Method and device for downloading file from neighbor nodes through peer-to-peer network |
-
2014
- 2014-12-26 CN CN201410831223.2A patent/CN104506929A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050239451A1 (en) * | 2004-04-02 | 2005-10-27 | Shalini Periyalwar | System and method for peer-to-peer communication in cellular systems |
| CN101170371A (en) * | 2007-11-30 | 2008-04-30 | 中兴通讯股份有限公司 | A client data request optimization method and system in P2P order |
| CN101471919A (en) * | 2007-12-29 | 2009-07-01 | 突触计算机系统（上海）有限公司 | Method and device for downloading slicing of equipment based on point-to-point transmission protocol |
| CN101631092A (en) * | 2008-07-18 | 2010-01-20 | 株式会社日立制作所 | System and method for distributing data |
| CN101345768A (en) * | 2008-08-15 | 2009-01-14 | 南京邮电大学 | Peer-to-peer network transmission method of music demand system |
| CN101626400A (en) * | 2009-08-11 | 2010-01-13 | 华中科技大学 | Compensation method of P2P music on-demand system |
| CN103188279A (en) * | 2011-12-27 | 2013-07-03 | 中国电信股份有限公司 | Method and device for downloading file from neighbor nodes through peer-to-peer network |
Non-Patent Citations (2)
| Title |
|---|
| 张奎: "P2P点播客户端的设计和实现", 《万方学位论文数据库》 * |
| 韩亚峰: "《P2P流媒体数据调度策略研究》", 《河南科技学院学报》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016184230A1 (en) * | 2015-05-15 | 2016-11-24 | 乐视云计算有限公司 | P2p data downloading method and apparatus |
| CN105323260A (en) * | 2015-12-10 | 2016-02-10 | 康佳集团股份有限公司 | P2P stream media system based data scheduling optimization method and broadcast system |
| CN105872764A (en) * | 2015-12-21 | 2016-08-17 | 乐视云计算有限公司 | Data downloading method and device based on P2P (Peer-to-Peer) network |
| CN109450815A (en) * | 2018-09-28 | 2019-03-08 | 桂林电子科技大学 | A kind of equity network flow medium system data scheduling algorithm based on value of utility |
| CN109450815B (en) * | 2018-09-28 | 2020-10-30 | 桂林电子科技大学 | Peer-to-peer network streaming media system data scheduling method based on utility value |
| CN110493320A (en) * | 2019-07-23 | 2019-11-22 | 北京三快在线科技有限公司 | Data download method, device, electronic equipment and storage medium |
| CN111556344A (en) * | 2020-04-04 | 2020-08-18 | 网宿科技股份有限公司 | Method, device, equipment and system for downloading video stream |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104506929A (en) | Hybrid data scheduling method for P2P (peer to peer) systems | |
| Li et al. | Random network coding in peer-to-peer networks: From theory to practice | |
| CN102394899B (en) | On-demand system and method for improving file downloading speed | |
| Pianese et al. | Pulse, a flexible p2p live streaming system | |
| CN103037015A (en) | Active P2P data distribution method and node client-side | |
| Ghaffari Sheshjavani et al. | An adaptive buffer-map exchange mechanism for pull-based peer-to-peer video-on-demand streaming systems | |
| Bideh et al. | Adaptive content-and-deadline aware chunk scheduling in mesh-based P2P video streaming | |
| US9578077B2 (en) | Aggressive prefetching | |
| Tran et al. | An efficient hybrid push-pull methodology for peer-to-peer video live streaming system on mobile broadcasting social media | |
| CN102884759A (en) | Content distribution in a P2P infrastructure by means of multicast connections | |
| Ma et al. | Measurement, modeling and enhancement of BitTorrent-based VoD system | |
| US20110113099A1 (en) | Method for transmitting buffer map and network thereof | |
| Tian et al. | A novel caching mechanism for peer-to-peer based media-on-demand streaming | |
| Feng et al. | Network coding for content distribution and multimedia streaming in peer-to-peer networks | |
| CN103037017A (en) | Passive P2P data distribution method and node client-side | |
| CN104661108A (en) | Media stream downloading method for terminal, terminal and communication system | |
| AU2014339127B2 (en) | Aggressive prefetching | |
| Dakshayini et al. | Client-to-client streaming scheme for vod applications | |
| Chadagorn et al. | PileCast: Multiple bit rate live video streaming over BitTorrent | |
| WO2016165596A1 (en) | Multimedia file control method and system | |
| EP2579542A1 (en) | A method for dissemination of multimedia information through deployment of a decentralized peer-to-peer network and a decentralized network for implementation of the method | |
| CN111263221B (en) | Video information carousel method and device and video information receiving method and device | |
| CN105323260A (en) | P2P stream media system based data scheduling optimization method and broadcast system | |
| KR101257579B1 (en) | Peer-to-peer overlay system and method for real time streaming service | |
| Hu et al. | Towards efficient video chunk dissemination in peer-to-peer live streaming |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150408 |