LiveShift: Peer-to-Peer Live Streaming with Distributed Time-Shifting

Hecht, Fabio; Bocek, Thomas; Morariu, Cristian; Hausheer, David; Stiller, Burkhard

doi:10.1109/p2p.2008.49

Cited by 9 publications

(9 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The policy 4213 is greedier than the policy 2134 since we can obtain the former by three greedy transpositions on the later, namely: (1,2), (2,3) and (3,4). Definition 4 (Concatenation operator ·) Let P s (i) be the priority of the i th cell of policy counting from left to right in policy s and l s be its length.…”

Section: Definition 3 (Greediness) a Transposition (I J)mentioning

confidence: 99%

“…There are three curves which correspond to the simulation, the segment model and stochastic model in [15] respectively. Figure 4b shows the result for an ad-hoc piece selection policy (3,1,6,4,2,5,11,7,12,9,10,8) on a buffer of size n = 14. To apply the segment model, again we split it into two buffers of size 8.…”

Section: Segmentation Approachmentioning

confidence: 99%

“…There are number of recent work on P2P live streaming systems [3,4,[9][10][11] wherein authors discuss the incentive issues, network-wide quality, time-shifting operations and advantages of the data-driven architecture. Several studies have explored the chunk selection policies for data-driven P2P streaming systems.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Exploring the optimal chunk selection policy for data-driven P2P streaming systems

Zhao

Lui

Chiu

2009

2009 IEEE Ninth International Conference on Peer-to-Peer Computing

View full text Add to dashboard Cite

show abstract

Section: Definition 3 (Greediness) a Transposition (I J)mentioning

confidence: 99%

Section: Segmentation Approachmentioning

confidence: 99%

See 1 more Smart Citation

Exploring the optimal chunk selection policy for data-driven P2P streaming systems

Zhao

Lui

Chiu

2009

2009 IEEE Ninth International Conference on Peer-to-Peer Computing

View full text Add to dashboard Cite

show abstract

“…[2] proposes that a peer uses one cache to store the content which they are watching, and another cache to store the video segments to implement the time-shifted feature. In [4][6], the time-shifted feature is implemented by caching a portion of the video stream at each peer and serving it asynchronously. In a TV system, a DVR records the video which is viewed at a time more convenient to users [7].…”

Section: Introductionmentioning

confidence: 99%

Providing NPR-Style Time-Shifted Streaming in P2P Systems

Ouyang

Ramamurthy

2011

2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN)

View full text Add to dashboard Cite

Abstract-Digital video recorder (DVR) style and nonprerecording (NPR) style are two possible implementations for P2P-based time-shifted streaming, but existing P2P streaming solutions are not suitable for implementing the NPR method. Since peers can view any arbitrary video segments which have been broadcasted, they might cause severe video quality problems and the server bandwidth consumption can become high. In this paper, we focus on minimizing the server bandwidth consumption to maintain smooth streaming service in NPR-style P2P-based time-shifted streaming. To reduce the server cost, peers prefetch segments which are not required for their current viewing. Hence even if they are viewing different parts of the video, they can exchange segments with one another. However, segment prefetching competes for bandwidth with ordinary segment fetching, and it might bring negative impact. A good prefetching solution should not affect a peer's viewing experience. We formulate the problem of finding a prefetching solution as an optimization problem, with the objective to minimize the server bandwidth consumption. Then we propose a heuristic algorithm by decomposing the global optimization problem into a set of smaller problems. Each peer runs this algorithm to determine which segments to prefetch and how to serve other peers. Simulation experiments demonstrate that our design provides P2P-based time-shifted streaming at low server bandwidth consumption.

show abstract

“…Some works have recently sketched a peer-to-peer architecture for time-shifted TV systems. In [6], every client stores all downloaded video parts. A Distributed Hash Table (DHT) is used to keep trace of the owner of every video part, so that a peer that is able to upload a past video part can be found upon a simple request to the DHT.…”

Section: Introduction the Delivery Of Television Over The Internetmentioning

confidence: 99%

Distributed delivery system for time-shifted streaming systems

Liu

Simon

2010

IEEE Local Computer Network Conference

View full text Add to dashboard Cite

To cite this version:Yaning Liu, Gwendal Simon. Distributed delivery system for time-shifted streaming systems. Abstract-In live streaming systems (IPTV, life-stream services, etc.), an attractive feature consists in allowing users to access past portions of the stream. This is called a time-shifted streaming system. We address in this paper the design of a large-scale delivery system for a time-shifted streaming application. We highlight the challenging characteristics of time-shifted applications that prevent known delivery systems to be used. Then, we describe the turntable structure, the first structure that has been specifically designed to cope with the properties of time-shifted systems. A set of preliminary simulations confirm the interest for this structure. I. INTRODUCTIONThe delivery of television over the Internet (IPTV) is expected to offer viewers new ways to enjoy TV content. One of the most promising services, often called catch-up TV or time-shifted TV, consists in allowing viewers to watch their favorite broadcast TV programs within an expanded time window. Let's say that a program is normally broadcasted from a given time t. In a catch-up TV, this program is made available for viewing at any time from t to t + δ hours where δ can be excessively long (several weeks). In this context, a viewer is also able to surf the TV content history using pause, rewind or fast forward commands, hence he/she can switch from a live experience to a shifted one.Today, to enjoy catch-up TV requires to record the stream on a Digital Video Recorder (DVR) connected to Internet. Of course, this is unacceptable for TV providers, which would like to control the delivery of their content. However, building a large-scale time-shifted streaming service is not trivial. Indeed, the disk-based servers that are currently used in ondemand video services (VoD) have not been designed for concurrent read and write operations. In particular, a VoD server can not massively ingest content. Moreover, delivery systems for IPTV can not be utilized because, contrarily to live streaming systems, time-shifted systems can not directly use group communication techniques like multicast protocols, for the reason that clients require distinct portions of the stream. Other obvious differences include the length of a catch-up TV stream, which can be several orders of magnitude longer than a typical movie in VoD, and the dynamicity of chunk request. Contrarily to VoD, the popularity of every chunk is variable in catch-up TV.A few papers have recently addressed the VCR problem in peer-to-peer VoD systems [1,2], but no previous work has assumed that VCR is so massively employed by user.

show abstract

LiveShift: Peer-to-Peer Live Streaming with Distributed Time-Shifting

Cited by 9 publications

References 5 publications

Exploring the optimal chunk selection policy for data-driven P2P streaming systems

Exploring the optimal chunk selection policy for data-driven P2P streaming systems

Providing NPR-Style Time-Shifted Streaming in P2P Systems

Distributed delivery system for time-shifted streaming systems

Contact Info

Product

Resources

About