Methods and apparatus for scheduling, serving, receiving...

Interactive video distribution systems – User-requested video program system – Video-on-demand

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C725S090000, C725S091000, C725S114000, C709S203000, C709S231000, C341S050000, C341S055000

Reexamination Certificate

active

09768843

ABSTRACT:
A media object is scheduled for transmission between a server and a client. The media object is partitioned into segments of blocks, wherein each block is a unit of media for which a client will wait to receive an entire block before playing out the block, and wherein each segment includes an integer number of blocks. One or more channels on which to serve each segment are determined, and a rate at which to serve each segment is determined. Additionally, a schedule pair for each channel is determined. The schedule pair includes a time at which the client may start receiving on the channel and a time at which the client may stop receiving on the channel.

REFERENCES:
patent: 5371532 (1994-12-01), Gelman et al.
patent: 5379297 (1995-01-01), Glover et al.
patent: 5421031 (1995-05-01), De Bey
patent: 5617541 (1997-04-01), Albanese et al.
patent: 5659614 (1997-08-01), Bailey, III
patent: 5701582 (1997-12-01), DeBey
patent: 5751336 (1998-05-01), Aggarwal et al.
patent: 5757415 (1998-05-01), Asamizuya et al.
patent: 5835165 (1998-11-01), Keale et al.
patent: 5903775 (1999-05-01), Murray
patent: 5926205 (1999-07-01), Krause et al.
patent: 5936659 (1999-08-01), Viswanathan et al.
patent: 5936949 (1999-08-01), Pasternak et al.
patent: 6011590 (2000-01-01), Saukkonen
patent: 6018359 (2000-01-01), Kermode et al.
patent: 6073250 (2000-06-01), Luby et al.
patent: 6081909 (2000-06-01), Luby et al.
patent: 6134596 (2000-10-01), Bolosky et al.
patent: 6141053 (2000-10-01), Saukkonen
patent: 6163870 (2000-12-01), Luby et al.
patent: 6185265 (2001-02-01), Campanella
patent: 6195777 (2001-02-01), Luby et al.
patent: 6307487 (2001-10-01), Luby
patent: 6320520 (2001-11-01), Luby
patent: 6732325 (2004-05-01), Tash et al.
patent: 6882618 (2005-04-01), Sakoda et al.
patent: WO 01/57667 (2001-08-01), None
patent: WO 01/58130 (2001-08-01), None
patent: WO 01/58131 (2001-08-01), None
Wong, J. W., “Broadcast delivery”,Proceedings of the IEEE, 76(12):1566-1577, (1988).
Viswanathan, et al., “Metropolitan area video-on-demand services using pyramid broadcasting”,Multimedia Systems, 4(4):197-208 (1996).
Aggarwal, et al., “On optimal batching policies for video-on-demand storage servers”,Proc. Intl. Conf. on Multimedia Computing and Systems, pp. 253-258, Hiroshima, Japan, (1996).
Almeroth, et al., “The use of multicast delivery to provide a scalable and interactive video-on-demand service”,IEEE Journal on Selected Areas in Communication, 14(6):110-1122, (1996).
Dan, et al., “Scheduling policies for an on-demand video server with batching”,Proc. ACM Multimedia, pp. 391-398 (1998).
Bar-Noy, et al., “Competitive on-line stream merging algorithms for media-on-demand”, Draft (Jul. 2000).
Bar-Noy, et al., “Efficient algorithms for optimal stream merging for media-on-demand”, Draft (Aug. 2000).
Eager, et al., “Minimizing bandwidth requirements for on-demand data delivery”,Proc. Intl. Workshop on Advances in Multimedia Information Systems, pp. 80-87, (Indian Wells, CA, Oct. 1999).
Eager, et al., “Optimal and efficient merging schedules for video-on-demand servers”,Proc. ACM Multimedia, vol. 7, pp. 199-203 (1999).
Aggarwal, et al., “A permutation-based pyramid broadcasting scheme for video-on-demand systems”,Proc. IEEE Int'l Conf. on Multimedia Systems, (Hiroshima, Japan, Jun. 1996).
Hua, et al., “Skyscraper broadcasting: A new broadcasting system for metropolitan video-on demand systems”,Proc. ACM SIGCOMM, pp. 89-100 (Cannes, France, 1997).
Gao, et al., “Efficient schemes for broadcasting popular videos”,Proc. Inter. Workshop on Network and Operating System Support for Digital Audio and Video, (Jul. 1998).
Juhn, et al., “Harmonic broadcasting for video-on-demand service”,IEEE Trans. on Broadcasting, 43:268-271 (1997).
Juhn, et al., “Adaptive fast data broadcasting scheme for video-on-demand service”,IEEE Trans. on Broadcasting, 44:182-185 (1998).
Paris, et al., “Efficient broadcasting protocols for video on demand”,International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems(MASCOTS), vol. 6, pp. 127-132 (Jul. 1998).
Paris, et al., “A low bandwidth broadcasting protocol for video on demand”,Proc. International Conference on Computer Communications and Networks, vol. 7, pp. 690-697 (Oct. 1998).
Sincoskie, W. D., “System Architecture for Large Scale Video on Demand Service,”Computer Network and ISDN Systems, pp. 155-162. (1991).
Rangan, et al., “Designing an On-Demand Multimedia Service,”IEEE Communication Magazine, vol. 30, pp. 5-65, (Jul. 1992).
Ozden, et al, “A Low-cost Storage Service for Movie on Demand Databases,”Proceedings of the 20th Very Large DataBases(VLDB)Conference(Santiago, Chile 1994).
Viswanathan, et al., “Pyramid Broadcasting for Video-on-Demand Service”, Proceedings of the SPIE Multimedia Computing and Networking Conference, vol. 2417, pp. 66-77 (San Jose, CA, Feb. 1995).
Viswanathan, S.R., “Publishing in Wireless and Wireline Environments”, Ph.D. Thesis, Rutgers, The State University of New Jersey (Nov. 1994).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Methods and apparatus for scheduling, serving, receiving... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Methods and apparatus for scheduling, serving, receiving..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and apparatus for scheduling, serving, receiving... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3785947

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.