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.

VoDKA: Developing a Video-on-Demand Server using Distributed Functional Programming

2005 ◽  
Vol 15 (3) ◽  
pp. 403-430 ◽  
Author(s):  
VICTOR M. GULIAS ◽  
MIGUEL BARREIRO ◽  
JOSE L. FREIRE
Keyword(s):  
Real World ◽  
Functional Programming ◽  
Building Blocks ◽  
Video On Demand ◽  
Functional Language ◽  
Control Software ◽  
On Demand ◽  
System Requirements ◽  
Cable Company ◽  
Process Composition

In this paper, we present some experience of using the concurrent functional language Erlang to implement a distributed video-on-demand server. For performance reasons, the server is deployed in a cheap cluster made from off-the-shelf components. The demanding system requirements, in addition to the complex and ever-changing domain, suggested a highly flexible and scalable architecture as well as a quite sophisticated control software. Functional programming played a key role in the development, allowing us to identify functional abstractions throughout the system. Using these building blocks, large configurations can be defined using functional and process composition, reducing the effort spent on adapting the system to the frequent changes in requirements. The server evolved from a prototype that was the result of a project supported by a regional cable company, and it is currently being used to provide services for real-world users. Despite our initial concerns, efficiency has not been a major issue.

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.

A NEAR-OPTIMAL BROADCASTING PROTOCOL FOR MOBILE VIDEO-ON-DEMAND

2009 ◽  
Vol 20 (01) ◽  
pp. 45-55
Author(s):  
REGANT Y. S. HUNG ◽  
H. F. TING
Keyword(s):  
Video On Demand ◽  
Constant Factor ◽  
Mobile Video ◽  
Bandwidth Requirement ◽  
On Demand ◽  
Small Constant ◽  
Wide Range ◽  
New Type ◽  
Broadcasting Protocol ◽  
Mobile Clients

The advance of wireless and mobile technology introduces a new type of Video-on-Demand (VOD) systems, namely the mobile VOD systems, that provide VOD services to mobile clients. It is a challenge to design broadcasting protocols for such systems because of the following special requirements: (1) fixed maximum bandwidth requirement: the maximum bandwidth required for broadcasting a movie should be fixed and independent of the number of requests, (2) load adaptivity: the total bandwidth usage should be dependent on the number of requests; the fewer the requests the smaller the total bandwidth usage, and (3) clients sensitivity: the system should be able to support clients with a wide range of heterogeneous capabilities. In the literature, there are some partial solutions that give protocols meeting one or two of the above requirements. In this paper, we give the first protocol that meets all of the three requirements. The performance of our protocol is optimal up to a small constant factor.

Summary

2018 ◽  
pp. 277-306
Keyword(s):  
Real World ◽  
Service Integration ◽  
Service Provisioning ◽  
The Real ◽  
On Demand ◽  
Dynamic Coordination ◽  
Event Driven ◽  
Integration Problem ◽  
Architectural Perspective

In previous chapters, the design of IoT services using the streamlining and integration principle was discussed. In this chapter, a summary is given of how to use these principles to achieve IoT service provisioning, and an example is given. The event streamlining problem is first discussed from an IoT service provisioning perspective, involving how to efficiently disseminate the sensing events among event producers and consumers on demand. The service integration problem is then considered, which requires dynamic coordination of the relevant IoT services based on events occurring in the real world. An EDSOA is abstracted from the perspective of utilizing the advantages of EDA and SOA, and the streamlining and integration principle is viewed from an architectural perspective. A combination of SOA and EDA can easily support the on-demand dissemination of sensing information and event-driven service dynamic coordination. The example used here is a deployed CMCS application.

An analysis of QoS ranking prediction framework techniques

2019 ◽  
Vol 33 (01) ◽  
pp. 1850420 ◽  
Author(s):  
Harsimran Kaur ◽  
Anurag Rai ◽  
Sarvjit Singh Bhatia
Keyword(s):  
Real World ◽  
Cloud Service ◽  
Cloud Services ◽  
Cloud Service Provider ◽  
The Real ◽  
Functional Activities ◽  
On Demand ◽  
The Right ◽  
Demand Service

In the real world, building the high quality cloud computing framework is the challenge for the researcher in the present scenario where on demand service is required. The services which are performing the non-functional activities are referred to as Quality-of Service (QoS). The experience of real-world usage services are generally required to obtain the QoS. Many organizations offer various cloud services, such as Amazon, HP and IBM, to the customers. No technique is available to measure the real-world usage and estimate the ranking of the cloud services. From the customer side, it is a very tough job to choose the right cloud service provider (SP), which fulfills all the requirements of the customers. To avoid the confusion to select the right CSP, this paper proposes QoS ranking prediction methods such as Cloud Rank1, Cloud Rank2 and Cloud Rank3. Various experiments are done on the real-world QoS data by using EC2 services of Amazon and providing healthy results and solutions.

Sign in / Sign up

Export Citation Format

Share Document