Method and apparatus for minimizing network congestion...

Multiplex communications – Data flow congestion prevention or control

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S254000

Reexamination Certificate

active

09681668

ABSTRACT:
Large payload files are selectively partitioned in blocks and the blocks distributed to a plurality of distribution stations at the edge of the network qualified to have the data. Each qualified station decides how much and what portion of the content to save locally, based on information such as network location and environment, usage, popularity, and other distribution criteria defined by the content provider. Different pieces of a large payload file may be available from different nodes, however, when a user requests access to the large payload file, for example, through an application server, a virtual file control system creates an illusion that the entire file is present at the connected node. However, since only selective portions of the large payload file may actually be resident at that node's storage at the time of request, a cluster of distribution servers at the distribution station may download the non-resident portions of the file as the application server is servicing the user. The download may be in parallel and usually from the least congested nodes. New nodes added to the network learn from other nodes in the network what content they should have and download the required content, in a desired amount, onto their local storage devices from the nearest and least congested nodes without interrupting network operation. Each node manages its local storage and decides what content to prune based on information such as usage patterns.

REFERENCES:
patent: 4466060 (1984-08-01), Riddle
patent: 4914571 (1990-04-01), Baratz et al.
patent: 5079767 (1992-01-01), Perlman
patent: 5367698 (1994-11-01), Webber et al.
patent: 5630184 (1997-05-01), Roper et al.
patent: 5751968 (1998-05-01), Cohen
patent: 5812773 (1998-09-01), Norin
patent: 5872773 (1999-02-01), Katzela et al.
patent: 5903566 (1999-05-01), Flammer, III
patent: 5905847 (1999-05-01), Kobayashi et al.
patent: 5924094 (1999-07-01), Sutter
patent: 5924116 (1999-07-01), Aggarwal et al.
patent: 5926101 (1999-07-01), Dasgupta
patent: 5991804 (1999-11-01), Bolosky et al.
patent: 6014701 (2000-01-01), Chaddha
patent: 6038061 (2000-03-01), Sugaya
patent: 6038601 (2000-03-01), Lambert et al.
patent: 6081840 (2000-06-01), Zhao
patent: 6105209 (2000-08-01), Maddalozzo, Jr. et al.
patent: 6108703 (2000-08-01), Leighton et al.
patent: 6145089 (2000-11-01), Le et al.
patent: 6212240 (2001-04-01), Scheibel et al.
patent: 6222530 (2001-04-01), Sequeira
patent: 6269080 (2001-07-01), Kumar
patent: 6356903 (2002-03-01), Baxter et al.
patent: 6363416 (2002-03-01), Naeimi et al.
patent: 6370146 (2002-04-01), Higgins et al.
patent: 6374336 (2002-04-01), Peters et al.
patent: 6415373 (2002-07-01), Peters et al.
patent: 6427212 (2002-07-01), Frey, Jr.
patent: 6456599 (2002-09-01), Elliott
patent: 6460087 (2002-10-01), Saito et al.
patent: 6498795 (2002-12-01), Zhang et al.
patent: 6502125 (2002-12-01), Kenner et al.
patent: 6515967 (2003-02-01), Wei et al.
patent: 6523069 (2003-02-01), Luczycki et al.
patent: 6535869 (2003-03-01), Housel, III
patent: 6587866 (2003-07-01), Modi et al.
patent: 6647408 (2003-11-01), Ricart et al.
patent: 6691165 (2004-02-01), Bruck et al.
patent: 6691312 (2004-02-01), Sen et al.
patent: 6708217 (2004-03-01), Colson et al.
patent: 6711607 (2004-03-01), Goyal
patent: 6718361 (2004-04-01), Basani et al.
patent: 6718486 (2004-04-01), Roselli et al.
patent: 6748447 (2004-06-01), Basani et al.
patent: 6760765 (2004-07-01), Asai et al.
patent: 6765868 (2004-07-01), Dunn et al.
patent: 6772209 (2004-08-01), Chernock et al.
patent: 6772217 (2004-08-01), Baumann et al.
patent: 6772337 (2004-08-01), Yener
patent: 6785704 (2004-08-01), McCanne
patent: 6842896 (2005-01-01), Redding et al.
patent: 6845396 (2005-01-01), Kanojia et al.
patent: 6922724 (2005-07-01), Freeman et al.
patent: 6931397 (2005-08-01), Sundaresan
patent: 2002/0040479 (2002-04-01), Ehrman et al.
patent: 2002/0073086 (2002-06-01), Thompson et al.
patent: 2002/0112069 (2002-08-01), Sim
patent: 2002/0138640 (2002-09-01), Raz et al.
patent: 2003/0099202 (2003-05-01), Lear et al.
Dilly et al. “Enhancement and Validation of Squid's Cache Replacement Policy”, HP Labs Technical Reports, HPL-1999-69, pp. 1-18, May 1999. http://www.hpl.hp.com/techreports/1999/HPL-1999-69.pdf.
Gruber, S. et al., “Design Considerations for an RTSP-Based Prefix-Caching Proxy for Multimedia Streams”, AT&T Labs Research, Sep. 7, 1999, 21 pgs.
Mui, Allen et al., “Performance Analysis of a Dynamic Parallel Downloading Scheme from Mirror Sites Throughout the Internet”, 6892 Term Paper, Dec. 1999, pp. 1-13.
Noghami, B. et al., “A Novel Approach to Reduce Latency on the Internet: Component-Based Download”, Dept. of Electrical and Computer Engineering, University of Manitoba, Jun. 2000, 6 pgs.
Rodriguez, P. et al., “Parallel-Access for Mirror Sites in the Internet”, Infocom 2000, 19thAnnual Joint Conference of the IEEE Computer and Communications Societies, IEEE Tel Aviv, Israel, Mar. 26-30, 2000, pp. 864-873.
Search Report for PCT/US01/42816; mailed Dec. 8, 2002; 2 pages.
Search Report for PCT/US01/32638; mailed Jan. 30, 2003; 3 pages.

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

Method and apparatus for minimizing network congestion... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for minimizing network congestion..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for minimizing network congestion... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3834996

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