Replication Strategies for Streaming Media

WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420), 2000

Communication technologies have made multimedia on demand services technically and economically feasible. An important aspect of such systems is the resource sharing technique, which allow the contemporaneous service of a large number of user requests with a considerable saving in terms of network bandwidth and server resources. In this paper, we report the results of a study which analyzes batching and buffering techniques to group and serve together video requests. The mathematical model allows the evaluation of the main system performance (probability distribution of the number of streams, percentage reduction of resources, etc.) as a function of load and batching interval duration. Simulation experiments confirm the analytical model in the whole range of considered conditions. Abstract Recent advances in Information and Communication technologies have made multimedia on demand services technically and economically feasible. An important aspect of such systems is the resource sharing technique, which allow the simultaneous service of a large number of user requests with a considerable saving in terms of network bandwidth and server resources. In this paper, we report the results of a study which analyzes batching and buffering techniques, that is grouping and serving together video requests. The mathematical model allows the evaluation of the main system performance (probability distribution of the number of streams, percentage reduction of resources, etc.) as a function of load and batching interval duration. Simulation experiments confirm the analytical model in the whole range of considered conditions.

Proceedings of the IEEE, 2000

Systems designed to provide television quality viewing in peer-to-peer computer networks, and the tools to measure their effectiveness, are now being developed.

2007 International Conference on IP Multimedia …, 2007

2006 IEEE International Conference on Multimedia and Expo, 2006

In traditional overlay multicast network, all peers are treated as equal regardless of their importance and contribution to the network. In this paper, we consider that each user may have different cost function depending on his privilege, delay to source, available bandwidth, etc. We propose a fully distributed and scalable protocol to construct an overlay tree to minimize the overall cost of the users. It uses aggregation to account for the total cost of one's descendants, and reduces tree cost by a continuous improvement process. Through simulation, we show that our protocol converges reasonably fast. By comparing with other schemes, our resultant overlay tree offers differentiated services to users by appropriately taking into account individual user cost functions.

Computer Communications, 2011

As an evolution of peer-to-peer (p2p) file-sharing applications, overlay-based networks are also adopted to efficiently distribute content with real-time constraints to a wide user population. In addition, they can be utilized to exploit application level strategies to overcome limitations imposed by the underlying network infrastructure, e.g., the lack of multicast support.

Proceedings of the IEEE, 2000

Streaming media on the internet has experienced rapid growth over the last few years and will continue to increase in importance as broadband technologies and authoring tools continue to improve. As the internet becomes an increasingly popular alternative to traditional communications media, internet streaming will become a significant component of many content providers' communications strategy. Internet streaming, however, poses significant challenges for content providers since it has significant distribution problems. Scalability, quality, reliability, and cost are all issues that have to be addressed in a successful streaming media offering.

International journal of Computer Networks & Communications, 2011

1 In the immediate future video distribution applications will increase their diffusion thanks to the ever-increasing user capabilities and improvements in the Internet access speed and performance. The target of this paper is to propose a content delivery system for real-time streaming services based on a peer-to-peer approach that exploits multicast overlay organization of the peers to address the challenges due to bandwidth heterogeneity. To improve reliability and flexibility, video is coded using a scalable multiple description approach that allows delivery of sub-streams over multiple trees and allows rate adaptation along the trees as the available bandwidth changes. Moreover, we have deployed a new algorithm for tree-based topology management of the overlay network. In fact, tree based overlay networks better perform in terms of end-to-end delay and ordered delivery of video flow packets with respect to mesh based ones. We also show with a case study that the proposed system works better than similar systems using only either multicast or multiple trees.

23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings., 2003

The architecture of overlay networks should encourage high-performance, high-scalability and reduced costs. This becomes more crucial when communication, storage costs as well as service latencies grow with the exploding amounts of data exchanged and with the size and span of the overlay network. For that end, multicast methodologies can be used to deliver content from regional servers to end users, as well as for the timely and economical synchronization of content among the distributed servers. Another important architectural problem is the efficient allocation of objects to servers to minimize storage, delivery and update costs.

2009 Eighth IEEE International Symposium on Network Computing and Applications, 2009

We propose Streamline, a two-layered architecture designed for media streaming in overlay networks. The first layer is a generic, customizable and lightweight protocol which is able to construct and maintain different types of meshes, exhibiting different properties. We discuss two types of overlay networks and explain how the first layer protocol builds these networks in a distributed manner. The second layer is responsible for data propagation to the nodes in the mesh by constructing an optimized diffusion tree. In order to cover the vulnerabilities of the diffusion tree, we propose a masking mechanism which enables the nodes to instantly switch to alternative data paths when necessary. Our simulations reveal that, the structure and properties of the underlying mesh are key to the performance of the system and Streamline can tolerate high node churn without degrading delivery rate.

One major issue in multimedia streaming over the Internet is the large bandwidth that is required to serve good quality content to a large audience. In this paper we describe a protocol especially designed for peer-to-peer data distribution to a large number of users. The protocol is suited for the efficient distribution of live multimedia and it can exploit even the limited resources of residential users. Special care was paid to make the protocol back-compatible with existent multimedia tools and protocols, so that software and protocols already multicastenabled require only minor changes to be adapted to the new protocol. The flexibility, the openess and the features of the proposed protocol makes it an interesting solution for streaming content to large audiences.