Time-window-constrained multicast using connection scheduling

Electrical computers and digital processing systems: multicomput – Computer-to-computer protocol implementing – Computer-to-computer data transfer regulating

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S203000, C709S219000, C709S239000, C709S243000

Reexamination Certificate

active

11407606

ABSTRACT:
A method of reducing bandwidth limitations to send events to a set of interested clients within a pre-defined time period as quickly and fairly as possible. The clients can be re-distributed among the servers in a network such that the delay due to server overloading is minimized by moving clients from an overloaded server to a server with available bandwidth. In addition, the latency of client-server communications can be incorporated into an estimation of download times, and the servers can then initiate delivery to respective clients based on those download times. By staggering the send times to account for heterogeneous latencies, more clients can receive the event at the same time, and a fairness of distribution can be achieved.

REFERENCES:
patent: 5920701 (1999-07-01), Miller et al.
patent: 5978381 (1999-11-01), Perlman et al.
patent: 5991306 (1999-11-01), Burns et al.
patent: 6061722 (2000-05-01), Lipa et al.
patent: 6223286 (2001-04-01), Hashimoto
patent: 6275496 (2001-08-01), Burns et al.
patent: 6298373 (2001-10-01), Burns et al.
patent: 6324182 (2001-11-01), Burns et al.
patent: 6370688 (2002-04-01), Hejna
patent: 6718539 (2004-04-01), Cohen et al.
patent: 6842768 (2005-01-01), Shaffer et al.
patent: 2001/0014103 (2001-08-01), Burns et al.
patent: 2001/0018713 (2001-08-01), Takeshi et al.
patent: 2001/0056416 (2001-12-01), Garcia et al.
patent: 2002/0002622 (2002-01-01), Vange et al.
patent: 2002/0018484 (2002-02-01), Kwang et al.
patent: 2002/0042812 (2002-04-01), Spencer
patent: 2002/0056010 (2002-05-01), Lincoln et al.
patent: 2003/0065810 (2003-04-01), Ims et al.
patent: 2003/0121050 (2003-06-01), Kalva et al.
patent: 2005/0021467 (2005-01-01), Franzdonk
patent: 1 035 703 (2000-09-01), None
patent: WO 98/57275 (1998-12-01), None
patent: WO 01/46782 (2001-06-01), None
patent: WO 01/69848 (2001-09-01), None
patent: WO 01/97432 (2001-12-01), None
patent: WO 01/97467 (2001-12-01), None
patent: WO 02/17559 (2002-02-01), None
Akyildiz et al., “Multimedia Group Synchronization Protocols for Integrated Services Networks,” IEEE journal, (14), pp. 162-173, (1996).
Carter et al., “Server Selection Using Dynamic Path Characterization in Wide-Area Networks,” IEEE Journal, pp. 1014-1021, (1997).
Pulido et al., “SM: Real-Time Multticast Protocols For Simultaneous Message Delivery”: in Proceedings of the Fifth International Conference on Real-Time Computing Systems and Applications, Hiroshima, Japan, Oct. 27-29, 1998, pp. 66-73 (IEEE Computing Society, 1998).
Tanaka et al., “A Key Distribution and Rekeying Framework With Totally Ordered Multicast Protocols,” in Proceedings of the 15thInternational Conference on InformationNetworking(ICOIN '01), Beppu City, Japan, Jan. 21-Feb. 2, 2001 pp. 831-838 (2001).
Xu et al., “Synchronized End-To-End Multicast In Real-Time Packet Cellular Networks,” IEEE Journal, pp. 431-435, (1998).

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

Time-window-constrained multicast using connection scheduling does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Time-window-constrained multicast using connection scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Time-window-constrained multicast using connection scheduling will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3728928

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