Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2005-08-09
2005-08-09
Wossum, Luke S (Department: 2167)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000, C709S203000, C709S219000, C709S229000
Reexamination Certificate
active
06928442
ABSTRACT:
Data files are distributed across a plurality of computers. The computers may form a network such as a content delivery network (CDN) or a peer-to-peer network. The network may operate as a TCP/IP network such as the Internet. Data files may represent may represent digital messages, images, videos or audio signals. For content—data items or files in the system—a name is obtained (or determined), where the name is based, at least in part, on a given function of the data in a data item or file. The given function may be a message digest or hash function, and it may be MD4, MD5, and SHA. A cony of a requested file is only provided to licensed (or authorized) parties. The system may check one or more computers for unauthorized or unlicensed content. Content is served based on a measure of availability of servers.
REFERENCES:
patent: 3668647 (1972-06-01), Evangelisti
patent: 4215402 (1980-07-01), Mitchell
patent: 4290105 (1981-09-01), Cichelli
patent: 4376299 (1983-03-01), Rivest
patent: 4405829 (1983-09-01), Rivest
patent: 4412285 (1983-10-01), Neches
patent: 4414624 (1983-11-01), Summer, Jr.
patent: 4441155 (1984-04-01), Fletcher
patent: 4464713 (1984-08-01), Benhase
patent: 4490782 (1984-12-01), Dixon
patent: 4571700 (1986-02-01), Emry, Jr.
patent: 4577293 (1986-03-01), Matick
patent: 4642793 (1987-02-01), Meaden
patent: 4675810 (1987-06-01), Gruner
patent: 4691299 (1987-09-01), Rivest
patent: 4725945 (1988-02-01), Kronstadt
patent: 4773039 (1988-09-01), Zamora
patent: 4887235 (1989-12-01), Holloway
patent: 4888681 (1989-12-01), Barnes
patent: 4922414 (1990-05-01), Holloway
patent: 4922417 (1990-05-01), Churm et al.
patent: 4972367 (1990-11-01), Burke
patent: 5025421 (1991-06-01), Cho
patent: 5050074 (1991-09-01), Marca
patent: 5050212 (1991-09-01), Dyson
patent: 5057837 (1991-10-01), Colwell
patent: 5077658 (1991-12-01), Bendert
patent: 5129081 (1992-07-01), Kobayashi
patent: 5129082 (1992-07-01), Tirfing
patent: 5144667 (1992-09-01), Pogue, Jr.
patent: 5179680 (1993-01-01), Colwell
patent: 5202982 (1993-04-01), Gramlich et al.
patent: 5208858 (1993-05-01), Vollert
patent: 5276901 (1994-01-01), Howell
patent: 5287499 (1994-02-01), Nemes
patent: 5301286 (1994-04-01), Rajani
patent: 5301316 (1994-04-01), Hamilton
patent: 5341477 (1994-08-01), Pitkin et al.
patent: 5343527 (1994-08-01), Moore
patent: 5357623 (1994-10-01), Megory-Cohen
patent: 5384565 (1995-01-01), Cannon
patent: 5404508 (1995-04-01), Konrad
patent: 5452447 (1995-09-01), Nelson et al.
patent: 5459860 (1995-10-01), Burnett
patent: 5542087 (1996-07-01), Neimat et al.
patent: 5581758 (1996-12-01), Burnett
patent: 5638443 (1997-06-01), Stefik et al.
patent: 5640564 (1997-06-01), Hamilton et al.
patent: 5781629 (1998-07-01), Haber et al.
patent: 5802291 (1998-09-01), Balick et al.
patent: 5809494 (1998-09-01), Nguyen
patent: 5835087 (1998-11-01), Herz et al.
patent: 5907704 (1999-05-01), Gudmundson et al.
patent: 6006018 (1999-12-01), Burnett et al.
patent: 6134603 (2000-10-01), Jones et al.
patent: 0592045 (1994-04-01), None
Gwertzman, James, et al. “The Case for Geographical Push-Caching.” Technical Report HU TR 34-94 (excerpt), Harvard University, DAS, Cambridge, MA 02138, 1994, 2 pgs.
Grigni, Michelangelo, et al. “Tight Bounds on Minimum Broadcasts Networks.” SIAM Journal of Discrete Mathematics, vol. 4, No. 2, May 1991, pp. 207-222.
Devine, Robert. “Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm.” In Proceedings of 4th International Conference on Foundations of Data Organizations and Algorithms, 1993, pp. 101-114.
Deering, Stephen, et al. “Multicast Routing in Datagram Internetworks and Extended LANs.” ACM Transactions on Computer Systems, vol. 8, No. 2, May 1990, pp. 85-110.
Cormen, Thomas H., et al.Introduction to Algorithms,The MIT Press, Cambridge, Massachusetts, 1994, pp. 219-243, 991-993.
Naor, Moni, et al. “The Load, Capacity and Availability of Quorum Systems.” In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, Nov. 1994, pp. 214-225.
Nisan, Noam. “Pseudorandom Generators for Space-Bounded Computation.” In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, May 1990, pp. 204-212.
Palmer, Mark, et al. “Fido: A Cache that Learns to Fetch.” In Proceedings of the 17th International Conference on Very Large Data Bases, Sep. 1991, pp. 255-264.
Peleg, David, et al. “The Availability of Quorum Systems.” Information and Computation 123, 1995, 210-223.
Rabin, Michael. “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance.” Journal of the ACM, vol. 36, No. 2, Apr. 1989, pp. 335-348.
Ravi, R., “Rapid Rumor Ramification: Approximating the Minimum Broadcast Time.” In Proceedings of the 35th IEEE Symposium on Foundation of Computer Science, Nov. 1994, pp. 202-213.
Schmidt, Jeanette, et al. “Chernoff-Hoeffding Bounds for Applications with Limited Independence.” In Proceedings of the 4th ACS-SIAM Symposium on Discrete Algorithms, 1993, pp. 331-340.
Tarjan, Robert Endre, et al. “Storing a Sparse Table.” Communications of the ACM, vol. 22, No. 11, Nov. 1979, pp. 606-611.
Wegman, Mark, et al. “New Hash Functions and Their Use in Authentication and Set Equality.” Journal of Computer and System Sciences vol. 22, Jun. 1981, pp. 265-279.
Vitter, Jeffrey Scott, et al. “Optimal Prefetching via Data Compression.” In Proceedings of 32nd IEEE Symposium on Foundations of Computer Science, Nov. 1991, pp. 121-130.
Fredman, Michael, et al. “Storing a Sparse Table with 0(1) Worst Case Access Time.” Journal of the Association for Computing Machinery, vol. 31, No. 3, Jul. 1984, pp. 538-544.
Yao, Andrew Chi-Chih. “Should Tables be Sorted?” Journal of the Association for Computing Machinery, vol. 28, No. 3, Jul. 1981, pp. 615-628.
Floyd, Sally, et al. “A reliable Multicast Framework for Light-Weight Sessions and Application Level Framing.” In Proceeding of ACM SIGCOMM '95, pp. 342-356.
Feeley, Michael, et al. “Implementing Global Memory Management in a Workstation Cluster.” In Proceedings of the 15th ACM Symposium on Operating Systems Principles, 1995, pp. 201-212.
Carter, J. Lawrence, et al. “Universal Classes of Hash Functions.” Journal of Computer and System Sciences, vol. 18, No. 2, Apr. 1979, pp. 143-154.
Patent Abstracts of Japan, “Electronic Mail Multiplexing System and Communication Control Method in The System.” Jun. 30, 1993, JP 05162529.
Kim et al., “Experiences with Tripwire: Using Integrity Checkers For Intrusion Detection”, COAST Labs. Dept. of Computer Sciences Purdue University, Feb. 22, 1995, pp. 1-12.
Kim et al., “The Design and Implementation of Tripwire: A file System Integrity Checker”, COAST Labs. Dept. of Computer Sciences Purdue University, Nov. 19, 1993, pp. 1-21.
Bert dem Boer et al., Collisions for the compression function of MD5, pp. 292-304.
Sakti Pramanik et al., Multi-Directory Hasing, 1993, Info. Sys., vol. 18, No. 1, pp. 63-74.
Murlidhar Koushik, Dynamic Hashing with Distributed Overflow Space: A File Organization with Good Insertion Performance, 1993, Info. Sys., vol. 18, No. 5, pp. 299-317.
Witold Litwin et al., LH*-Linear Hashing for Distributed Files, HP Labs Tech. Report No. HPL-93-21, Jun. 1993, pp. 1-22.
Yuliang Zheng et al., HAVAL—A One-Way Hashing Algorithm with Variable Length of Output (Extended Abstract), pp. 83-105.
Chris Charnes and Josef Pieprzky, Linear Nonequivalence versus Nonlinearity, Pieprzky, pp. 156-164.
Witold Litwin et al., Linear Hashing for Distributed Files, ACM SIGMOD, May 1993, pp. 327-336.
Ming-Ling Lo et al., On Optimal Processor Allocation to Support Pipelined Hash Joins, ACM SIGMOD, pp. 69-78, May 1993.
Thomas A. Berson, Differential Cryptanalysis Mod 232with Applications to MD5, pp. 69-81.
William Perrizo et al., Distributed Join Processing Per
Farber David A.
Lachman Ronald D.
Davidson Berquist Jackson & Gowdey LLP
Kinetech, Inc.
Pham Khanh
Savvis, Inc.
Wossum Luke S
LandOfFree
Enforcement and policing of licensed content 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 Enforcement and policing of licensed content using..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enforcement and policing of licensed content using... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3471851