Electrical computers and digital processing systems: multicomput – Computer-to-computer protocol implementing – Computer-to-computer data streaming
Reexamination Certificate
2005-02-22
2005-02-22
Cuchlinski, Jr., William A. (Department: 2144)
Electrical computers and digital processing systems: multicomput
Computer-to-computer protocol implementing
Computer-to-computer data streaming
C725S097000, C725S087000, C725S090000
Reexamination Certificate
active
06859839
ABSTRACT:
A method of efficiently transmitting streamed data of a program to multiple clients requesting the program at different times ranks the requests in a multilevel hierarchy, which describes merging of data streams servicing the requests. The multilevel hierarchy changes dynamically as new requests arrive or existing data streams are merged to reduce the bandwidth or other costs required to serve the requests. The hierarchy may be established by simple rules or by a modeling of the actual cost of possible hierarchies.
REFERENCES:
patent: 5357276 (1994-10-01), Banker et al.
patent: 5453779 (1995-09-01), Dan et al.
patent: 5461415 (1995-10-01), Wolf et al.
patent: 5477263 (1995-12-01), O'Callaghan et al.
patent: 5512934 (1996-04-01), Kochanski
patent: 5915094 (1999-06-01), Kouloheris et al.
patent: 6311161 (2001-10-01), Anderson et al.
patent: 6543053 (2003-04-01), Li et al.
patent: 6598228 (2003-07-01), Hejna, Jr.
Zhao et al, “Bandwidth-Efficient Continuous Media Streaming Through Optimal Multiplexing”, In ACM Sigmetrics (Atlanta, GA, Jun. 1999), pp. 13-22.*
P. Basy et al, “An Implementation of Dynamic Service Aggregation for Interactive Video Delivery”, Proc. SPIE Multimedia Computing and Networking '98, San Jose, CA, USA, pp. 110-122, Jan. 1998.*
P. Basu et al, “Optimal Stream Clustering Problems in Video-on-Demand”, Proc. Parallel and Distributed Computing and Systems '98—Special Session on Distributed Multimedia Computing, Las Vegas, NV, USA, pp . 220-225, Oct. 1998.*
M.Y.Y. Leung et al, “Buffer and I/O Resource Pre-allocation for Implementing Batching and Buffering Techniques for Video-on-Demand Systems”, In Proc. of the 13th Intl. Conf. on Data Engineering, Birmingham, U.K., Apr. 1997.*
Krishnan, et al, “Service aggregation through rate adaptation using a single storage format”, Network and Operating System Support for Digital Audio and Video, 1997, Proceedings of the IEEE 7th International Workshop on, May 19-21, 1997, pp: 197-206.*
Xiaoye et al, “Stream scheduling algorithms for multimedia storage servers”, Parallel Proceedings. 1998 International Conference on Aug. 10-14, 1998, pp.: 321-328.*
Poon et al, “New batching policy for providing true video-on-demand (T-VoD) in multicast system”, Communications, 1999. ICC '99. 1999 IEEE International Conference on, vol. : 2, Jun. 21-23, 1999, pp.: 132-139.*
Poon et al, “Design and analysis of multicast delivery to provide VCR functionality in video-on-demand systems”, ATM, 1999. ICATM ′99. 1999 2nd International Conference on, Jun. 21-23, 1999, pp.: 132-139.*
Skyscraper Broadcasting: A New Broadcasting Scheme For Metropolitan Video-on-Demand Systems, Kien A. Hua et al., SIGCOMM '97 Cannes, France.
A Low Bandwidth Broadcasting Protocol for Video on Demand, Jehan-Francois Paris et al., Int'l Conference on Computer Communication and Networks (ICCCN), Oct. 1998.
Efficient Broadcasting Protocols for Video Demand, Jehan-Francois Paris et al., Proc. Mascots '98, Montreal, Jul. 1998.
Efficient Schemes for Broadcasting Popular Videos, Lixin Gao, et al.
Metropolitan area video-on-demand service using pyramid broadcasting, S. Viswanathan et al., Multimedia Systems (1996) 4:197-208.
A Permutation-Based Pyramid Broadcasting Scheme for Video-on-Demand Systems, Charu C. Aggarwal et al.
Design and Analysis of Permutation-Based Pyramid Broadcasting, Charu C. Aggarwal et al., U of S Computer Science, RC 20620, Nov. 8, 1996.
Tailored transmissions for efficient Near-Video-On-Demand service*, Yitzhak Birk et al.
Reducing I/O Demand in Video-On-Demand Storage Servers, Leana Golubchik et al., Sigmetrics '95 Ottawa, Ontario, Canada.
On Optimal Piggyback Merging Policies for Video-On-Demand Systems, Charu Aggarwal et al., Sigmetrics '96, 5/96 PA.
Adaptive Piggybacking Schemes for Video-on-Demand Systems, Charu C. Aggarwal et al., RC 20635 (Nov. 19, 1996) IBM Research Division.
Merging video streams in a multimedia storage server: complexity and heuristics, Siu-Wah Lau et al., Multimedia Systems (1998) 6:29-42.
Patching: A Multicast Technique for True Video-on-Demand Services, Kien A. Hua et al., ACM Multimedia 98—Electronic Proceedings.
Improving Video-on-Demand Server Efficiency Through Stream Tapping, Steven W. Carter, et al., Proc. Int'l Conf. On Computer Communication and Networks (ICCCN), Las Vegas, Sep. 1997, pp. 200-207.
Stream Tapping: a System for Improving Efficiency on a Video-on-Demand Server, Steven w. Carter et al., UCSC-CRL-97-11, Nov. 2, 1997.
Supplying Instantaneous Video-on-Demand Services Using Controlled Multicast, Lixin Gao et al.
Optimal Patching Schemes for Efficient Multimedia Streaming*, Subhabrata Sen et al.
Dynamic batching policies for an on-demand video server, Asit Dan et al., Multimedia Systems (1996) 4:112-121.
On Optimal Batching Policies for Video-on-Demand Storage Servers, Charu C. Aggarwal et al., IEEE Multimedia Computing & Systems Conf., Hiroshima, Japan, Jun. 1996.
Group-Guaranteed Channel Capacity in Multimedia Storage Servers, Athanassios K. Tsiolis et al., Sigmetrics 1997 Conference.
Eager Derek L.
Vernon Mary K.
Zahorjan John
Cuchlinski Jr. William A.
Gerezgiher Yemane M.
Quarles & Brady LLP
Wisconsin Alumni Research Foundation
LandOfFree
Bandwidth reduction of on-demand streaming data using... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Bandwidth reduction of on-demand streaming data using..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bandwidth reduction of on-demand streaming data using... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3444488