2010
DOI: 10.3724/sp.j.1016.2010.00613
|View full text |Cite
|
Sign up to set email alerts
|

P2P-Based Video-on-Demand Systems: A Survey

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 19 publications
0
7
0
Order By: Relevance
“…We can use a copy of fault-tolerant strategy to solve problem of network jitter [31]. The most common method is to select many good sending nodes, one as the current active node, the other as a backup node [41]. Most of the current study focused on how to switch between the main and backup node when the reduction of network jitter and maintain the continuity of streaming media services.…”
Section: Copy Strategymentioning
confidence: 99%
See 2 more Smart Citations
“…We can use a copy of fault-tolerant strategy to solve problem of network jitter [31]. The most common method is to select many good sending nodes, one as the current active node, the other as a backup node [41]. Most of the current study focused on how to switch between the main and backup node when the reduction of network jitter and maintain the continuity of streaming media services.…”
Section: Copy Strategymentioning
confidence: 99%
“…The systems encourage node as seed node, providing the uploader more nodes, can enjoying the greater download service priority is greater. This kind of game theory method is called TFT (Tit-for-Tat) [41], its core ideas are is: the quantity of service node providing will equal to the one node enjoying many service will enjoy node how many service .This TFT is a fair m echanism of way , which has a defect that the node with lower servicing ability difference node will not get the timely corresponding service timely, which may not be able to survive, so it's not suitable for the scale of VoD using.…”
Section: Incentive Mechanismmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, encoding [1,5,4,3,1,2,3] shows that the first piece downloaded from the first peer, the second piece downloaded from the fifth peer, and so on, the last piece downloaded from the third peer in this data scheduling process. The PSO algorithm has tackled integer programming problems [23].…”
Section: Ipso Algorithmmentioning
confidence: 99%
“…A peer not only requests data as a client, but also provides service to neighbors as a server, which makes P2P system transfer data quickly and efficiently, and effectively solves the server bottleneck problem of the C/S mode system. In P2P streaming system, proper scheduling policy not only achieves strong service capabilities, high throughput, short startup delay and good streaming continuity, but also reduces the waste of network bandwidth [2].…”
Section: Introductionmentioning
confidence: 99%