Parallel data transfer over multiple channels with data...

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, C709S217000, C709S224000, C709S226000

Reexamination Certificate

active

07555559

ABSTRACT:
A parallel download system is described to download data from a plurality of source servers in parallel. The system may include a source scheduler, a prioritization scheduler, and an I/O dispatcher. The source scheduler generates a download schedule to control which source servers will be downloaded from at a current point in time. The prioritization scheduler tracks the latency and throughput of all channels to the source servers and dynamically adjusts the download schedule to control download performance. The I/O dispatcher produces an output stream to present the downloaded data to one or more external applications or a user.

REFERENCES:
patent: 4881264 (1989-11-01), Merkle
patent: 6141659 (2000-10-01), Barker et al.
patent: 6339785 (2002-01-01), Feigenbaum
patent: 6477522 (2002-11-01), Young
patent: 6742023 (2004-05-01), Fanning et al.
patent: 6771674 (2004-08-01), Schuster et al.
patent: 6772337 (2004-08-01), Yener
patent: 7047309 (2006-05-01), Baumann et al.
patent: 7133368 (2006-11-01), Zhang et al.
patent: 7251691 (2007-07-01), Boyd et al.
patent: 2001/0051996 (2001-12-01), Cooper et al.
patent: 2002/0003541 (2002-01-01), Boyd et al.
patent: 2002/0049760 (2002-04-01), Scott et al.
patent: 2002/0138443 (2002-09-01), Schran et al.
patent: 2004/0172476 (2004-09-01), Chapweske
patent: 2004/0193900 (2004-09-01), Nair
patent: 2004/0205093 (2004-10-01), Li et al.
patent: 2005/0010792 (2005-01-01), Carpentier et al.
patent: 2005/0021575 (2005-01-01), Boyd et al.
patent: 2006/0026161 (2006-02-01), Henseler
Dessent, Brian, “Bittorrent FAQ and Guide”, May 10, 2003, accessed from [http://www.dessent.net/btfaq].
Koman, Richard, “The Swarmcast Solution”, May 24, 2001, accessed from [http://openp2p.com/lpt/a/883].
Padmanabhan et al., “Distributing Streaming Media Content Using Cooperative Networking”, Proceedings of the 12thInternational Workshop on Network and Operating Systems Support for Digital Audio: NOSSDAV, May 12-14, 2002, pp. 177-186.
Byers et al., “A Digital Fountain Approach to Reliable Distribution of Bulk Data”, Proc. ACM SIGCOMM, ACM Press, New York, 1998, pp. 56-67.
V.K. Goyal, “Multiple Description Coding: Compression Meets the Network”, IEEE Signal Processing Magazine, vol. 18, 2001, pp. 74-93.
Chu et al., “A Case for End System Multicast”, Proceedings ACM Sigmetrics 2000: International Conference on Measurement and Modeling of Computer Systems, Jun. 17-21, 2001, pp. 1-12.
Kaminsky, D., “Vectorcast: A Proposal Regarding the efficient Distribution of Data On High Bandwidth Networks,” Jan. 12, 1998, 4 pages.
Francis, P., “Yallcast: Extending the Internet Multicast Architecture,” Sep. 30, 1999, pp. 1-39.
Byers, J. et al., “Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads,” Apr. 1999, pp. 275-283.
U.S. Appl. No. 11/861,774, entitled “Rate Sensitive Packet Transfer Mechanism Over a Peer-to-Peer Network”, filed Sep. 26, 2007, Justin F. Chapweske.

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

Parallel data transfer over multiple channels with data... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Parallel data transfer over multiple channels with data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel data transfer over multiple channels with data... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4106363

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