|
|
|
|
|
Overview
As the Internet grows so does the desire for on-demand streams
of many types: movies, songs, news stories, stock quotes,
and others. The popularity of a specific stream may be so high
that multicasting may be the only way to satisfy the demand.
In addition, clients requesting a stream will want service as quickly
as possible. This may require repeated multicasts of the same stream
to satisfy the startup delay guarantees. In this project we investigate
algorithms to provide media-on-demand that
help solve the bandwidth problems created by heavy, low delay, demand
for the same stream. We have investigated stream merging and windows
scheduling which have that property that several streams can be recieved
simultaneiously: one with the data currently being viewed and others
with data to be
viewed in the future. By receiving multiple streams the bandwidth load
on the server can be reduced exponentially.
Publications
-
A. Bar-Noy, R.E. Ladner, T. Tamir.
Scheduling Techniques for Media-on-Demand.
To appear in Algorithmica.
-
A. Bar-Noy, R.E. Ladner, and T. Tamir.
Windows Scheduling as a Restricted Version of Bin Packing.
To appear in ACM Transactions on Algorithms.
-
A. Bar-Noy, R.E. Ladner, and T. Tamir.
Windows Scheduling as a Restricted Version of Bin Packing.
To appear in ACM Transactions on Algorithms.
-
A. Bar-Noy, J. Goshi, R.E. Ladner.
Off-line and On-line Guaranteed Start-up Delay for Media-on-Demand with
Stream Merging.
Journal of Discrete Algorithms, vol. 4, No. 1, 2006, 72-105 .
-
A. Bar-Noy, R.E. Ladner, T. Tamir, and T. VanDeGrift.
Window Scheduling of Arbitrary Length Jobs on Parallel Machines.
Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms
(SPAA 2005), 56-65.
-
A. Bar-Noy and R.E. Ladner.
Efficient Algorithms for Optimal Stream Merging for Media-on-Demand.
SIAM Journal on Computing, Vol. 33, No. 5, 2004, 1011-1034..
-
A. Bar-Noy, G. Goshi, R.E. Ladner, and K. Tam.
Comparison of Stream Merging Algorithms for Media-on-Demand.
Multimedia Systems Journal , Vol. 9, 2004, 211-223.
- A. Bar-Noy, R.E. Ladner, and T. Tamir.
Windows Scheduling as a Restricted Version of Bin Packing.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorthims,
(SODA 2004), January 2004, 217-226.
- A. Bar-Noy and R.E. Ladner.
Windows Scheduling Problems for Broadcast Systems.
SIAM Journal on Computing, Vol. 32., No. 4, 2003, 1091-1113.
-
A. Bar-Noy and R.E. Ladner.
Competitive On-Line Stream Merging Algorithms for Media-on-Demand.
Journal of Algorithms, Vol. 48, No. 1, 2003, 59-90.
-
A. Bar-Noy, J. Goshi, and R.E. Ladner.
Off-line and On-line Guaranteed Start-up Delay for Media-on-Demand with
Stream Merging.
Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA '03), June 2003, 164-173.
-
A. Bar-Noy, R.E. Ladner, T. Tamir.
Scheduling Techniques for Media-on-Demand.
Thirteenth Annual ACM-SIAM Symposium on Discrete Algorthims,
(SODA 2003), January 2003, 791-800.
-
A. Bar-Noy and R.E. Ladner.
Windows Scheduling Problems for Broadcast Systems.
Thirteenth Annual ACM-SIAM Symposium on Discrete Algorthims,
(SODA 2002), January 2002, 433-442.
-
A. Bar-Noy, G. Goshi, R.E. Ladner, and K. Tam.
Comparison of Stream Merging Algorithms for Media-on-Demand.
Multimedia Computing and Networking (MMCN'02), January 2002.
-
A. Bar-Noy and R.E. Ladner.
Competitive On-Line Stream Merging Algorithms for Media-on-Demand.
Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA 2001), 364-373.
|
CSE Home 
