scholarly journals Flexible-Segmentation-Jumping Strategy to Reduce User-Perceived Latency for Video on Demand

2011 ◽  
Vol 2011 ◽  
pp. 1-8 ◽  
Author(s):  
Jun Li ◽  
Fengbin Li ◽  
Xiaofeng Jiang
Keyword(s):  
Waiting Time ◽  
Video On Demand ◽  
Point Selection ◽  
Specific Content ◽  
On Demand ◽  
Segmentation Algorithms ◽  
Long Time ◽  
Simulation Results ◽  
Initial Delay

Traditionally, people usually watch a video from the beginning and continuously to the end; this is changed by the concept and application of Video-On-Demand (VOD). Users do not want to wait for a long time when they seek some specific content in a video; they want to instantly watch any part in a video according to their needs. To resolve this challenge, in this paper, we propose a Flexible-Segmentation-Jumping Strategy (FSJS). This scheme considers users' randomly access behaviors, especially concerns the initial delay before watch point selection. By considering these behaviors and flexibly selecting jumping point, our scheme can significantly reduce user waiting time, in most cases can reduce the waiting time to zero. Our simulation implements the proposed FSJS scheme to the uniform segmentation and exponential segmentation algorithms to show how FSJS improves a user's perceived latency and reduces the extra average serving time. The simulation results show that FSJS can have a significant improvement in user-perceived latency.

scholarly journals A Seamless Broadcasting Scheme with Live Video Support

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Zeng-Yuan Yang ◽  
Yi-Ming Chen ◽  
Li-Ming Tseng
Keyword(s):  
Waiting Time ◽  
Real World ◽  
Video On Demand ◽  
Live Video ◽  
The Real ◽  
Bandwidth Requirement ◽  
On Demand ◽  
Constant Bandwidth

Broadcasting schemes, such as the fast broadcasting and harmonic broadcasting schemes, significantly reduce the bandwidth requirement of video-on-demand services. In the real world, some history events are very hot. For example, every year in March, thousands of people connect to Internet to watch the live show of Oscar Night. Such actions easily cause the networks contested. However, the schemes mentioned previously cannot alleviate the problem because they do not support live broadcasting. In this paper, we analyze the requirements for transferring live videos. Based on the requirements, a time skewing approach is proposed to enable the broadcasting schemes to support live broadcasting. However, the improved schemes require extra bandwidth for live broadcasting once the length of live shows exceeds the default. Accordingly, we proposed a scalable binomial broadcasting scheme to transfer live videos using constant bandwidth by increasing clients’ waiting time. When the scheme finds that the length of a video exceeds the default, it doubles the length of to-be-played segments and then its required bandwidth is constant.

scholarly journals An Efficient Periodic Broadcasting with Small Latency and Buffer Demand for Near Video on Demand

2012 ◽  
Vol 2012 ◽  
pp. 1-7 ◽  
Author(s):  
Ying-Nan Chen ◽  
Li-Ming Tseng
Keyword(s):  
Waiting Time ◽  
Video On Demand ◽  
Significant Fraction ◽  
On Demand ◽  
Periodic Broadcasting ◽  
Fixed Delay

Broadcasting Protocols can efficiently transmit videos that simultaneously shared by clients with partitioning the videos into segments. Many studies focus on decreasing clients' waiting time, such as the fixed-delay pagoda broadcasting (FDPB) and the harmonic broadcasting schemes. However, limited-capability client devices such as PDAs and set-top boxes (STBs) suffer from storing a significant fraction of each video while it is being watched. How to reduce clients' buffer demands is thus an important issue. Related works include the staircase broadcasting (SB), the reverse fast broadcasting (RFB), and the hybrid broadcasting (HyB) schemes. This work improves FDPB to save client buffering space as well as waiting time. In comparison with SB, RFB, and HyB, the improved FDPB scheme can yield the smallest waiting time under the same buffer requirements.

IMPROVING BANDWIDTH EFFICIENCY IN DISTRIBUTED VIDEO-ON-DEMAND ARCHITECTURES

2003 ◽  
Vol 13 (04) ◽  
pp. 589-600 ◽  
Author(s):  
F. CORES ◽  
A. RIPOLL ◽  
X. Y. YANG ◽  
B. QAZZAZ ◽  
R. SUPPI ◽  
...  
Keyword(s):  
Load Balancing ◽  
Large Scale ◽  
Video On Demand ◽  
Tree Architecture ◽  
Bandwidth Efficiency ◽  
Crucial Importance ◽  
Efficient System ◽  
On Demand ◽  
Traffic Balancing ◽  
Simulation Results

Distributed Video-on-Demand (DVoD) systems are proposed as a solution to the limited streaming capacity and null scalability of centralized systems. In a previous work, we proposed a fully distributed large-scale VoD architecture, called Double P-Tree, which has shown itself to be a good approach to the design of flexible and scalable DVoD systems. In this paper, we present relevant design aspects related to video mapping and traffic balancing in order to improve Double P-Tree architecture performance. Our simulation results demonstrate that these techniques yield a more efficient system and considerably increase its streaming capacity. The results also show the crucial importance of topology connectivity in improving multicasting performance in DVoD systems. Finally, a comparison among several DVoD architectures was performed using simulation, and the results show that the Double P-Tree architecture incorporating mapping and load balancing policies outperforms similar DVoD architectures.

scholarly journals Video-On-Demand: Towards New Viewing Practices?

1970 ◽  
Vol 1 (3) ◽  
Author(s):  
Wendy Van den Broeck ◽  
Jo Pierson ◽  
Bram Lievens
Keyword(s):  
New Media ◽  
Video On Demand ◽  
Extensive Literature ◽  
Video Content ◽  
Digital Service ◽  
On Demand ◽  
Long Time ◽  
Television Service ◽  
New Research ◽  
Viewing Practices

In this paper, we focus on the user aspects of a specific television service, video-on-demand (VOD), offered on two platforms: TV and computer. The concept of video-on-demand has already for a long time been the subject of new media research, first in its analogue version and more recently as a digital service. The main asset of this functionality, embedded in different devices, is that it offers the ability of video content being watched at any time and thereby enables extensive ways of time shifting. Furthermore, there is a possible expansion in available content, made by professionals as well as amateurs. Therefore VOD has the technical capability to fundamentally change our viewing patterns and practices. The question is however: How does the audience domesticate this new kind of audiovisual content and (how) does it fit in with their everyday viewing practices? Based on an environmental scan consisting of an extensive literature review, this paper synthesises knowledge on existing viewing practices as well as the video on demand’s new affordances. Possible shifts and interactions are investigated and new research questions are being identified.

scholarly journals Modern telecommunications: a playground for physicists?

2018 ◽  
Author(s):  
Aris L. Moustakas
Keyword(s):  
Cloud Computing ◽  
Wireless Networks ◽  
Video On Demand ◽  
Data Traffic ◽  
Disruptive Technologies ◽  
On Demand ◽  
Fiber Optical ◽  
Long Time ◽  
And Mathematics ◽  
Mathematics Community

Data traffic in wireless networks has been increasing exponentially for a long time and is expected to continue this trend. The emerging data-hungry applications, such as video-on-demand and cloud computing, as well as the exploding number of smart user devices demand the introduction of disruptive technologies. An analogous situation appears in the case of wireline (mostly fiber-optical) traffic, where the currently deployed infrastructure is expected to soon reach its limits, leading to the so-called capacity crunch. The aim of this chapter is to introduce the physics and mathematics community to a number of relevant problems in communications research and the types of solutions that have been used to tackle them. In the process, interested readers may be able to further acquaint themselves with research in engineering bibliography cited herein.

Sign in / Sign up

Export Citation Format

Share Document