2008 the 28th International Conference on Distributed Computing Systems Workshops 2008
DOI: 10.1109/icdcs.workshops.2008.49
|View full text |Cite
|
Sign up to set email alerts
|

A Measurement Study of Cache Rejection in P2P Live Streaming System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 18 publications
(11 citation statements)
references
References 7 publications
0
11
0
Order By: Relevance
“…In [27], authors derive the performance bounds with regards to the minimum server load, maximum streaming rate, and minimum tree depth. [28] models the cache rejection algorithm in PPLive as a fixed-duration virtual buffer. A common weakness is that they focus only on particular applications and they never investigate what will happen if different streaming service providers collaborate with each other.…”
Section: Related Workmentioning
confidence: 99%
“…In [27], authors derive the performance bounds with regards to the minimum server load, maximum streaming rate, and minimum tree depth. [28] models the cache rejection algorithm in PPLive as a fixed-duration virtual buffer. A common weakness is that they focus only on particular applications and they never investigate what will happen if different streaming service providers collaborate with each other.…”
Section: Related Workmentioning
confidence: 99%
“…In order to relax the time requirements, to have enough time to react to node failures and to smooth out the jitter, packets flow through two buffers: one is managed by PPLive, and the second by the media player. A downside of such architecture is the long start-up delay [78]. The working of PPStream is very similar to PPLive.…”
Section: Popular Mesh-based Live Streaming Systemsmentioning
confidence: 99%
“…Through analyzing and modeling, we ever characteristic PPLive on several aspects, including its chunk based buffer policy, the Proportional Placement scheme based initial phase decision [4], sequential fetching and rarest first based chunk fetching [7], etc. On the other hand, we ever evaluate the performance of early version of PPStream, and reveal features on geographic clustering, topology, and arrival/departure pattern in 2007 [2]; Recently WeiTing at [1] presents some simple description on PPStream's buffer schedule, and provides a preliminary analysis on the startup progress for the new version of PPStream; Report of [3] focuses on the privacy, locality.…”
Section: Introductionmentioning
confidence: 99%