Results 1 - 10 of 307

Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload

by Krishna P. Gummadi, Richard J. Dunn, Stefan Saroiu, Steven D. Gribble, Henry M. Levy, John Zahorjan , 2003
"... Peer-to-peer (P2P) file sharing accounts for an astonishing volume of current Internet tra#c. This paper probes deeply into modern P2P file sharing systems and the forces that drive them. By doing so, we seek to increase our understanding of P2P file sharing workloads and their implications for futu ..."
Abstract - Cited by 487 (7 self) - Add to MetaCart
Peer-to-peer (P2P) file sharing accounts for an astonishing volume of current Internet tra#c. This paper probes deeply into modern P2P file sharing systems and the forces that drive them. By doing so, we seek to increase our understanding of P2P file sharing workloads and their implications for future multimedia workloads. Our research uses a three-tiered approach. First, we analyze a 200-day trace of over 20 terabytes of Kazaa P2P tra#c collected at the University of Washington. Second, we develop a model of multimedia workloads that lets us isolate, vary, and explore the impact of key system parameters. Our model, which we parameterize with statistics from our trace, lets us confirm various hypotheses about file-sharing behavior observed in the trace. Third, we explore the potential impact of localityawareness in Kazaa.
(Show Context)

Minimizing Bandwidth Requirements for On-Demand Data Delivery

by Derek Eager, Mary Vernon, John Zahorjan - IEEE Transactions on Knowledge and Data Engineering , 1999
"... Two recent techniques for multicast or broadcast delivery of streaming media can provide immediate service to each client request, yet achieve considerable client stream sharing which leads to significant server and network bandwidth savings. This paper considers (1) how well these recently proposed ..."
Abstract - Cited by 160 (19 self) - Add to MetaCart
Two recent techniques for multicast or broadcast delivery of streaming media can provide immediate service to each client request, yet achieve considerable client stream sharing which leads to significant server and network bandwidth savings. This paper considers (1) how well these recently proposed techniques perform relative to each other, and (2) whether there are new practical delivery techniques that can achieve better bandwidth savings than the previous techniques over a wide range of client request rates. The principal results are as follows. First, the recent partitioned dynamic skyscraper technique is adapted to provide immediate service to each client request more simply and directly than the original dynamic skyscraper method. Second, at moderate to high client request rates, the dynamic skyscraper method has required server bandwidth that is significantly lower than the recent optimized stream tapping/patching/controlled multicast technique. Third, the minimum required ser...

A Hybrid Broadcasting Protocol for Video on Demand

by Jehan-Francois Paris, Steven Carter, Darrell Long , 1999
"... Broadcasting protocols can improve the efficiency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by many viewers. It has been recently shown that broadcasting protocols using a very large number of very low bandwidth streams for each ..."
Abstract - Cited by 139 (15 self) - Add to MetaCart
Broadcasting protocols can improve the efficiency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by many viewers. It has been recently shown that broadcasting protocols using a very large number of very low bandwidth streams for each video required less total bandwidth than protocols using a few high-bandwidth streams shared by all videos. We present a hybrid broadcasting protocol that combines the advantages of these two classes of protocols. Our pagoda broadcasting protocol uses only a small number of high-bandwidth streams and requires only slightly more bandwidth than the best extant protocols to achieve a given maximum waiting time. Keywords: video on demand, video broadcasting, harmonic broadcasting 1. INTRODUCTION Broadcasting protocols for video on demand (VOD) aim at efficiently delivering "hot" videos---that is, videos that are likely to be watched by many viewers. Rather than transmitting one separate data...

oStream: Asynchronous Streaming Multicast in Application-Layer Overlay Networks

by Yi Cui, Baochun Li, Klara Nahrstedt - IEEE Journal on Selected Areas in Communications , 2003
"... Although initially proposed as the deployable alternative to IP multicast, application-layer overlay network actually revolutionizes the way network applications can be built, since each overlay node is an end host, which is able to carry out more functionalities than simply forwarding packets. This ..."
Abstract - Cited by 122 (7 self) - Add to MetaCart
Although initially proposed as the deployable alternative to IP multicast, application-layer overlay network actually revolutionizes the way network applications can be built, since each overlay node is an end host, which is able to carry out more functionalities than simply forwarding packets. This paper addresses the on-demand media distribution problem in the context of overlay network. We take advantage of the strong...
(Show Context)

Efficient schemes for broadcasting popular videos

by Lixin Gao, Jim Kurose, Don Towsley - IN PROC. OF NOSSDAV , 1998
"... We provide a formal framework for studying broadcasting schemes and design a family of schemes for broadcasting popular videos, called the Greedy Diskconserving Broadcasting (GDB) scheme. We analyze the resource requirements for GDB, i.e., the number of server broadcast channels, the client storage ..."
Abstract - Cited by 118 (14 self) - Add to MetaCart
We provide a formal framework for studying broadcasting schemes and design a family of schemes for broadcasting popular videos, called the Greedy Diskconserving Broadcasting (GDB) scheme. We analyze the resource requirements for GDB, i.e., the number of server broadcast channels, the client storage space, and the client I/O bandwidth required by GDB. The analysis shows that GDB exhibits a tradeo between any two of the three resources. We compare our scheme with a recently proposed broadcasting scheme, Skyscraper Broadcasting (SB). With GDB, we can reduce the client storage space by as much as 50 % or the number of server channels by as much as 30 % at the cost of a small additional increase in the amount of client I/O bandwidth. If we require the client I/O bandwidth of GDB to be identical to that of SB, GDB needs only 70 % of the client storage space required by SB or one less server channel than SB does. In addition, we show that with small client I/O bandwidth, the resource requirements of GDB are close to the minimum achievable by any disk-conserving broadcasting scheme.
(Show Context)

On Peer-to-Peer Media Streaming

by Dongyan Xu , Mohamed Hefeeda, Susanne Hambrusch, Bharat Bhargava
"... In this paper, we study a peer-to-peer media streaming system with the following characteristics: (1) its streaming capacity grows dynamically; (2) peers do not exhibit serverlike behavior; (3) peers are heterogeneous in their bandwidth contribution; and (4) each streaming session may involve multip ..."
Abstract - Cited by 114 (14 self) - Add to MetaCart
In this paper, we study a peer-to-peer media streaming system with the following characteristics: (1) its streaming capacity grows dynamically; (2) peers do not exhibit serverlike behavior; (3) peers are heterogeneous in their bandwidth contribution; and (4) each streaming session may involve multiple supplying peers. Based on these characteristics, we investigate two problems: (1) how to assign media data to multiple supplying peers in one streaming session and (2) how to fast amplify the system’s total streaming capacity. Our solution to the first problem is an optimal media data assignment algorithm ÇÌËÔ Ô, which results in minimum buffering delay in the consequent streaming session. Our solution to the second problem is a distributed differentiated admission control protocol ���Ô Ô. By differentiating between requesting peers with different outbound bandwidth, ���Ô Ô achieves fast system capacity amplification; benefits all requesting peers in admission rate, waiting time, and buffering delay; and creates an incentive for peers to offer their truly available out-bound bandwidth.

A simple low-bandwidth broadcasting protocol for video on demand

by Jehan-françois Pâris, Steven W. Carter, Darrell D. E. Long - In Proc. 8 th ICCCN Conference (BostonNatick, MA, Oct , 1999
"... Broadcasting protocols can improve the efficiency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by many viewers. We present here a polyharmonic broadcasting protocol that requires less bandwidth than the best extant protocols to ach ..."
Abstract - Cited by 109 (10 self) - Add to MetaCart
Broadcasting protocols can improve the efficiency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by many viewers. We present here a polyharmonic broadcasting protocol that requires less bandwidth than the best extant protocols to achieve the same low maximum access time. We also show how to modify the protocol to accommodate very long videos without increasing the buffering capacity of the set-top box.
(Show Context)

Supplying Instantaneous Video-on-Demand Services Using Controlled Multicast.

by L Gao, D Towsley - In Proceedings of IEEE ICMCS, , 1999
"... ..."
Abstract - Cited by 108 (8 self) - Add to MetaCart
Abstract not found
(Show Context)

Video-on-Demand Broadcasting Protocols: A Comprehensive Study

by Ailan Hu - In Proceedings of IEEE INFOCOM , 2001
"... Broadcasting protocols are proved to be efficient for transmitting most of the popular videos in video-on-demand systems. We propose a generalized analytical approach to evaluate the efficiency of the broadcasting protocols and derive the theoretical lower bandwidth requirement bound for any periodi ..."
Abstract - Cited by 106 (0 self) - Add to MetaCart
Broadcasting protocols are proved to be efficient for transmitting most of the popular videos in video-on-demand systems. We propose a generalized analytical approach to evaluate the efficiency of the broadcasting protocols and derive the theoretical lower bandwidth requirement bound for any periodic broadcasting protocols. By means of the proposed analytical tool - temporal-bandwidth map, the approach can be used to direct the design of periodic broadcasting protocols to achieve different goals, e.g., server bandwidth requirement, client waiting time, client I/O bandwidth requirement etc. As the most important performance index in VOD system is the required server bandwidth, we give the solution to achieve the optimal bandwidth efficiency given client waiting time requirement and the length of the video. To take into account the popular compressed video with variable bit rate, the optimal approach is applied readily to the VBR videos and can achieve zero loss and best bandwidth efficiency. We give proof why existing techniques such as smoothing and prefetching is not necessary and in some cases inefficient in broadcasting protocols. We also discuss how broadcasting schemes can be tailored to support true and interactive VOD service. An insightful comparison between broadcasting and multicasting schemes is also given in this paper. I.
(Show Context)

Dynamic Skyscraper Broadcasts for Video-on-Demand

by Derek L. Eager, Mary K. Vernon , 1998
"... . Skyscraper Broadcasting is a recently proposed statically scheduled broadcast technique for video-on-demand that addresses the network-I/O bottleneck to provide significantly superior performance over previous approaches. This paper defines a scheme for dynamically scheduling the objects that are ..."
Abstract - Cited by 82 (11 self) - Add to MetaCart
. Skyscraper Broadcasting is a recently proposed statically scheduled broadcast technique for video-on-demand that addresses the network-I/O bottleneck to provide significantly superior performance over previous approaches. This paper defines a scheme for dynamically scheduling the objects that are broadcast on the skyscraper channels. The dynamic broadcasting scheme is designed to provide all clients with the precise time at which their requested object will be broadcast, or an upper bound on that time if the delay is small. New segment size progressions are proposed that not only improve dynamic scheduling, but also simplify the server disk layout problem and allow clients with inexpensive (single-tuner, limited storage) settops to receive skyscraper broadcasts. Preliminary simulation results show that the proposed dynamic scheme (1) provides factors of two or more improvement in mean client waiting time, (2) outperforms the static system with respect to variability in client waitin...
(Show Context)