Strategies of collaboration in multi-channel P2P VoD streaming

As compared to live peer-to-peer (P2P) streaming, modern P2P video-on-demand (VoD) systems have brought much larger volumes of videos and more interactive controls to the Internet users. Nevertheless, the larger number of available videos and the flexibility of allowing users to jump back and forth in a video, have led to much fewer numbers of concurrent peers watching at a similar pace, that reduces the chance for collaborative chunk supply among peers and thus significantly increases the server bandwidth cost [1]. Towards the ultimate goal of maximizing peer resource utilization, in this paper, we design effective strategies for both cross-channel and intra-channel collaborations in multi-channel P2P VoD systems, such that individual peer's resources, including download/upload bandwidths and the cache capacity, are effectively utilized to maximize the streaming qualities in all the channels. In particular, each peer actively and strategically determines the supply-and-demand imbalance in different channels, as well as that among different chunks within each video, makes use of its surplus download capacity to fetch chunks with the most need, and then serves those chunks using its idle upload bandwidth, all without impairing its own streaming quality. Our extensive trace-driven simulations show the effectiveness of our strategies in reducing the server cost while guaranteeing high streaming qualities in the entire system, even during extreme scenarios such as unexpected flash crowds. ©2010 IEEE.published_or_final_versionThe IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM 2010), Miami, FL., 6-10 December 2010. In Proceedings of GLOBECOM, 2010, p. 1-

Video-on-Demand over Internet: a survey of existing systems and solutions

Video-on-Demand is a service where movies are delivered to distributed users with low delay and free interactivity. The traditional client/server architecture experiences scalability issues to provide video streaming services, so there have been many proposals of systems, mostly based on a peer-to-peer or on a hybrid server/peer-to-peer solution, to solve this issue. This work presents a survey of the currently existing or proposed systems and solutions, based upon a subset of representative systems, and defines selection criteria allowing to classify these systems. These criteria are based on common questions such as, for example, is it video-on-demand or live streaming, is the architecture based on content delivery network, peer-to-peer or both, is the delivery overlay tree-based or mesh-based, is the system push-based or pull-based, single-stream or multi-streams, does it use data coding, and how do the clients choose their peers. Representative systems are briefly described to give a summarized overview of the proposed solutions, and four ones are analyzed in details. Finally, it is attempted to evaluate the most promising solutions for future experiments. Résumé La vidéo à la demande est un service où des films sont fournis à distance aux utilisateurs avec u

A Survey on Adaptive Multimedia Streaming

Internet was primarily designed for one to one applications like electronic mail, reliable file transfer etc. However, the technological growth in both hardware and software industry have written in unprecedented success story of the growth of Internet and have paved the paths of modern digital evolution. In today’s world, the internet has become the way of life and has penetrated in its every domain. It is nearly impossible to list the applications which make use of internet in this era however, all these applications are data intensive and data may be textual, audio or visual requiring improved techniques to deal with these. Multimedia applications are one of them and have witnessed unprecedented growth in last few years. A predominance of that is by virtue of different video streaming applications in daily life like games, education, entertainment, security etc. Due to the huge demand of multimedia applications, heterogeneity of demands and limited resource availability there is a dire need of adaptive multimedia streaming. This chapter provides the detail discussion over different adaptive multimedia streaming mechanism over peer to peer network

A Video On Demand System Architecture For Heterogeneous Mobile Ad Hoc Networks For Different Devices.

this paper proposed new system architecture for Mobile Ad Hoc Networks (MANETs) on heterogeneous network to provide optimal Video on Demand (VoD) services to difference types of devices with optimal bandwidth utilization

Data compression and transmission aspects of panoramic videos

Panoramic videos are effective means for representing static or dynamic scenes along predefined paths. They allow users to change their viewpoints interactively at points in time or space defined by the paths. High-resolution panoramic videos, while desirable, consume a significant amount of storage and bandwidth for transmission. They also make real-time decoding computationally very intensive. This paper proposes efficient data compression and transmission techniques for panoramic videos. A high-performance MPEG-2-like compression algorithm, which takes into account the random access requirements and the redundancies of panoramic videos, is proposed. The transmission aspects of panoramic videos over cable networks, local area networks (LANs), and the Internet are also discussed. In particular, an efficient advanced delivery sharing scheme (ADSS) for reducing repeated transmission and retrieval of frequently requested video segments is introduced. This protocol was verified by constructing an experimental VOD system consisting of a video server and eight Pentium 4 computers. Using the synthetic panoramic video Village at a rate of 197 kb/s and 7 f/s, nearly two-thirds of the memory access and transmission bandwidth of the video server were saved under normal network traffic.published_or_final_versio

Cloud media video encoding:review and challenges

In recent years, Internet traffic patterns have been changing. Most of the traffic demand by end users is multimedia, in particular, video streaming accounts for over 53%. This demand has led to improved network infrastructures and computing architectures to meet the challenges of delivering these multimedia services while maintaining an adequate quality of experience. Focusing on the preparation and adequacy of multimedia content for broadcasting, Cloud and Edge Computing infrastructures have been and will be crucial to offer high and ultra-high definition multimedia content in live, real-time, or video-on-demand scenarios. For these reasons, this review paper presents a detailed study of research papers related to encoding and transcoding techniques in cloud computing environments. It begins by discussing the evolution of streaming and the importance of the encoding process, with a focus on the latest streaming methods and codecs. Then, it examines the role of cloud systems in multimedia environments and provides details on the cloud infrastructure for media scenarios. After doing a systematic literature review, we have been able to find 49 valid papers that meet the requirements specified in the research questions. Each paper has been analyzed and classified according to several criteria, besides to inspect their relevance. To conclude this review, we have identified and elaborated on several challenges and open research issues associated with the development of video codecs optimized for diverse factors within both cloud and edge architectures. Additionally, we have discussed emerging challenges in designing new cloud/edge architectures aimed at more efficient delivery of media traffic. This involves investigating ways to improve the overall performance, reliability, and resource utilization of architectures that support the transmission of multimedia content over both cloud and edge computing environments ensuring a good quality of experience for the final user

Interactivity And User-heterogeneity In On Demand Broadcast Video

Video-On-Demand (VOD) has appeared as an important technology for many multimedia applications such as news on demand, digital libraries, home entertainment, and distance learning. In its simplest form, delivery of a video stream requires a dedicated channel for each video session. This scheme is very expensive and non-scalable. To preserve server bandwidth, many users can share a channel using multicast. Two types of multicast have been considered. In a non-periodic multicast setting, users make video requests to the server; and it serves them according to some scheduling policy. In a periodic broadcast environment, the server does not wait for service requests. It broadcasts a video cyclically, e.g., a new stream of the same video is started every t seconds. Although, this type of approach does not guarantee true VOD, the worst service latency experienced by any client is less than t seconds. A distinct advantage of this approach is that it can serve a very large community of users using minimal server bandwidth. In VOD System it is desirable to provide the user with the video-cassette-recorder-like (VCR) capabilities such as fast-forwarding a video or jumping to a specific frame. This issue in the broadcast framework is addressed, where each video and its interactive version are broadcast repeatedly on the network. Existing techniques rely on data prefetching as the mechanism to provide this functionality. This approach provides limited usability since the prefetching rate cannot keep up with typical fast-forward speeds. In the same environment, end users might have access to different bandwidth capabilities at different times. Current periodic broadcast schemes, do not take advantage of high-bandwidth capabilities, nor do they adapt to the low-bandwidth limitation of the receivers. A heterogeneous technique is presented that can adapt to a range of receiving bandwidth capability. Given a server bandwidth and a range of different client bandwidths, users employing the proposed technique will choose either to use their full reception bandwidth capability and therefore accessing the video at a very short time, or using part or enough reception bandwidth at the expense of a longer access latency

Cache location for distributed media service

Continuous media delivery services such as video have grown significantly in recent years and continue to consume more and more bandwidth of the Internet. To achieve efficient network utilization, multicasting has been employed to share the bandwidth among a group of clients who request the same media stream, as opposed to having a separate unicast connection for each client from the server. Though multicast based media streaming can achieve efficient network utilization, it either increases the service latency (e.g., batching) or it requires the clients to cooperate with the media server (e.g., chaining and patching). To overcome these problems, Cache Multicast Protocol (CMP) was proposed, wherein media stream can be cached at intermediate routers along the path. This thesis proposes algorithms for cache location problem in intermediate router caching scheme and studies their performance. The first protocol, called Static Cache Location Protocol (CLP) that finds a set of k best locations (routers) for caching the media stream for a given set of clients, in such a way that bandwidth sharing is maximized, and service latency and server load are minimized. To achieve this goal, CLP associates a weight to each router along the path, which depends on the number of clients supported by that router and distance between clients and that router. Two weight functions have been proposed and their performance is evaluated through simulation studies for various network parameters. Our studies show that small number of caches is sufficient to achieve good service latency. Since the client group is mostly dynamic, the cache locations should be changed dynamically to improve the performance. To this effect, we propose anther algorithm, called Dynamic CLP. The studies show that Dynamic CLP\u27s service latency is comparable to that of CMP using only 40% cache space of CMP. The future work includes adjusting the cache size along with cache replacement policy in CLP