Distributed caching architecture for computer networks

Electrical computers and digital processing systems: multicomput – Miscellaneous

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C713S154000, C713S177000, C713S190000

Reexamination Certificate

active

09725732

ABSTRACT:
A distributed caching technique for use in computer networks is disclosed. The illustrative embodiment is particularly advantageous in computer networks that comprises a hierarchical topology because it removes some of the computational tasks associated with caching away from the network nodes that act as caches to other network nodes that are less burdened with computational tasks. Furthermore, some embodiments of the present invention use hash tables to facilitate the storage and retrieval of cached resources. The illustrative embodiment of the present invention comprises: hashing at a first processor a first resource identifier to create a hash key, wherein the first resource identifier identifies a first resource; transmitting from the first processor to a second processor the hash key and a request for the first resource; and receiving at the first processor a second resource in response to the transmission of the hash key and the request for the first resource from the first processor to the second processor.

REFERENCES:
patent: 4714996 (1987-12-01), Gladney et al.
patent: 5153591 (1992-10-01), Clark
patent: 5406278 (1995-04-01), Graybill et al.
patent: 5428774 (1995-06-01), Takahashi et al.
patent: 5542087 (1996-07-01), Neimat et al.
patent: 5559979 (1996-09-01), Shiga et al.
patent: 5761531 (1998-06-01), Ohmura et al.
patent: 5781629 (1998-07-01), Haber et al.
patent: 5802590 (1998-09-01), Draves
patent: 5860153 (1999-01-01), Matena et al.
patent: 5924116 (1999-07-01), Aggarwal et al.
patent: 5974421 (1999-10-01), Krishnaswamy et al.
patent: 5987454 (1999-11-01), Hobbs
patent: 6014730 (2000-01-01), Ohtsu
patent: 6061741 (2000-05-01), Murphy et al.
patent: 6084877 (2000-07-01), Egbert et al.
patent: 6135646 (2000-10-01), Kahn et al.
patent: 6144983 (2000-11-01), Klots et al.
patent: 6151676 (2000-11-01), Cuccia et al.
patent: 6151708 (2000-11-01), Pedrizetti et al.
patent: 6212521 (2001-04-01), Minami et al.
patent: 6230231 (2001-05-01), DeLong et al.
patent: 6253225 (2001-06-01), Nakahara et al.
patent: 6279007 (2001-08-01), Uppala
patent: 6289375 (2001-09-01), Knight et al.
patent: 6292880 (2001-09-01), Mattis et al.
patent: 6351772 (2002-02-01), Murphy et al.
patent: 6366950 (2002-04-01), Scheussler et al.
patent: 6381601 (2002-04-01), Fujiwara et al.
patent: 6405315 (2002-06-01), Burns et al.
patent: 6415280 (2002-07-01), Farber et al.
patent: 6421662 (2002-07-01), Karten
patent: 6449657 (2002-09-01), Stanbach et al.
patent: 6507847 (2003-01-01), Fleischman
patent: 6516320 (2003-02-01), Odom et al.
patent: 6532542 (2003-03-01), Thomlinson et al.
patent: 6557024 (2003-04-01), Saito et al.
patent: 6557102 (2003-04-01), Wong et al.
patent: 6567817 (2003-05-01), VanLeer
patent: 6754662 (2004-06-01), Li
patent: 6785714 (2004-08-01), Thompson et al.
patent: 6807632 (2004-10-01), Carpentier et al.
patent: 6823377 (2004-11-01), Wu et al.
patent: 6898618 (2005-05-01), Slaughter et al.
patent: 6965992 (2005-11-01), Joseph et al.
patent: 2002/0049760 (2002-04-01), Scott et al.
patent: 2002/0059364 (2002-05-01), Coulthard et al.
patent: 2002/0083178 (2002-06-01), Brothers
URL forwarding and compression in adaptive Web caching; IEEE, vol. 2 , Mar. 26-30, 2000.
http://iep.water.ca.gov/cgi/cgi-bin/dss/bin/s...p/oobr/hasht.el.
Efficient Parallel Classification Using Dimensional Aggregates—Sanjay Goil Alok (1999); www.cs.rpi.edu/˜zaki/WKDD99/goil.ps.
Linear Spiral Hashing for Expansible Files, IEEE 1999.
A Semantic Search Algorithm for Peer-to-Peer Open.. —Zhou, Dialani, De.. ; www.isi.edu/˜stefan/SemPGRID/proceedings/3.pdf.
New Possibilities Offered by IPv6—Loukola And Skytt ; www.hut.fi/˜mloukola/pub7/p1.pdf.
Privacy And Accountability In Certificate Systems—Aura, Ellison (2000) www.tcs.hut.fi/Publications/papers/aura/HUT-TCS-A61.ps.
Consistent Hashing and Random Trees: Distributed.. —Karger, Lehman.. (1997) theory.lcs.mit.edu/˜karger/Papers/web.ps.g.
Reducing Network Latency Using Subpages in a Global Memory..—Herve Jamrozik (1996) ftp.cs.washington.edu/tr/1996/07/UW-CSE-96-07-03.PS.Z.
Managing Server Load in Global Memory Systems—Geoffrey Voelker (1997) 128.95.4.112/homes/levy/gms/sigmet97.ps.
Cache-Rings for Memory Efficient Isosurface Construction—Weinstein (1997) www.cs.utah.edu/˜sci/publications/cache-rings/cache-rings.ps.gz.
Dynamic Perfect Hashing: Upper and Lower Bounds—Dietzfelbinger, Karlin.. (1990) www.uni-paderbom.de/fachbereich/AG/agmadh/WWW/documents/../../PapersPostscript/DynamicPerfHashing—SICOMP.ps.
Performance of hashing-based schemes for Internet load balancing INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE vol. 1, Mar. 26-30, 2000 pp. 332-341 vol. 1.
Trading packet headers for packet processing□□Chandranmenon, G.P.; Varghese, G.; Networking, IEEE/ACM Transactions on vol. 4, Issue 2, Apr. 1996 pp. 141-152.
Indexing for multiversion locking: alternatives and performance evaluation□□Bober, P.M.; Carey, M.J.; Knowledge and Data Engineering, IEEE Transactions on□□vol. 9, Issue 1, Jan.-Feb. 1997 pp. 68-84.

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

Distributed caching architecture for computer networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Distributed caching architecture for computer networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed caching architecture for computer networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3807314

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