@inproceedings{Waldvogel2003Efficient,

title = {Efficient Buffer Management for Scalable Media-on-Demand},

author = {Marcel Waldvogel and Wei Deng and Ramaprabhu Janakiraman},

url = {https://netfuture.ch/wp-content/uploads/2003/waldvogel03efficient.pdf},

year  = {2003},

date = {2003-01-15},

urldate = {1000-01-01},

booktitle = {SPIE Multimedia Computing and Networking (MMCN 2003)},

address = {Santa Clara, CA, USA},

abstract = {<p>Widespread availability of high-speed networks and fast, cheap computation have rendered high-quality Media-on-Demand (MoD) feasible. Research on scalable MoD has resulted in many efficient schemes that involve segmentation and asynchronous broadcast of media data, requiring clients to buffer and reorder out-of-order segments efficiently for serial playout.</p><p>In such schemes, buffer space requirements run to several hundred megabytes and hence require efficient buffer management techniques involving both primary memory and secondary storage: while disk sizes have increased exponentially, access speeds have not kept pace at all.</p><p>The conversion of out-of-order arrival to in-order playout suggests the use of external memory priority queues, but their content-agnostic nature prevents them from performing well under MoD loads. In this paper, we propose and evaluate a series of simple heuristic schemes which, in simulation studies and in combination with our scalable MoD scheme, achieve significant improvements in storage performance over existing schemes.</p>},

keywords = {Multicast, Video-on-Demand},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Janakiraman2002Fuzzycast:,

title = {Fuzzycast: Efficient Video-on-Demand over Multicast},

author = {Ramaprabhu Janakiraman and Marcel Waldvogel and Lihao Xu},

url = {https://netfuture.ch/wp-content/uploads/2002/janakiraman02fuzzycast.pdf},

year  = {2002},

date = {2002-06-01},

urldate = {1000-01-01},

booktitle = {Proceedings of INFOCOM},

pages = {920-929},

address = {New York, NY, USA},

abstract = { Server bandwidth has been identified as a major bottleneck in large Video-on-Demand (VoD) systems. Using multicast delivery to serve popular content helps increase scalability by making efficient use of server bandwidth. In addition, recent research has focused on proactive schemes in which the server periodically multicasts popular content without explicit requests from clients. Proactive schemes are attractive because they consume bounded server bandwidth irrespective of client arrival rate. In this work, we describe Fuzzycast, a scalable periodic multicast scheme that uses simple techniques to provide video on demand at reasonable client start-up times while consuming optimal server bandwidth. We present a theoretical analysis of its bandwidth and client buffer requirements and prove its optimality. We study the effect of variable bitrate (VBR) media on Fuzzycast performance and propose a simple extension to transmit VBR media over constant rate channels. Finally, we solve the problem of partitioning a transmission over multiple multicast groups by considering it as a specific instance of a more widely encountered resource trade-off. },

keywords = {Multicast, Video-on-Demand},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2001Efficient,

title = {Efficient Media-on-demand over Multiple Multicast Groups},

author = {Marcel Waldvogel and Ramaprabhu Janakiraman},

url = {https://netfuture.ch/wp-content/uploads/2004/norden04routing1.pdf},

year  = {2001},

date = {2001-01-01},

urldate = {1000-01-01},

booktitle = {Proceedings of Globecom 2001},

address = {San Antonio, Texas, USA},

abstract = { Using multicast for serving popular movies on demand reduces load on the server and the network by eliminating redundant packet transmission. To permit clients to arrive at times of their choosing, periodic rebroadcast is necessary. In addition, splitting the transmission over multiple multicast groups reduces the cost of rebroadcasting by allowing clients to unsubscribe from groups in which they are no longer interested.</p><p>The focus of this paper is to develop techniques for efficient Media-on-Demand delivery to asynchronous clients over multiple multicast groups. We start by describing an existing periodic multicast technique that is near-optimal in terms of server bandwidth. Given a small number of groups $alpha$, we then show how to distribute content over these groups in a way that minimizes network impact. We present a theoretical analysis of the performance gains and compare these predictions with simulations over real and generated network topologies. We find that using even a small number of multicast groups provides significant reduction in overall network bandwidth.},

keywords = {Multicast, Video-on-Demand},

pubstate = {published},

tppubtype = {inproceedings}

}