Bedrock Computer Technologies, LLC v. Softlayer Technologies, Inc. et al

Filing 846

Additional Attachments to Main Document: #845 MOTION for Judgment as a Matter of Law Regarding Invalidity (Renewed) MOTION for Judgment as a Matter of Law Regarding Invalidity (Renewed) MOTION for Judgment as a Matter of Law Regarding Invalidity (Renewed) MOTION for Judgment as a Matter of Law Regarding Invalidity (Renewed) MOTION for Judgment as a Matter of Law Regarding Invalidity (Renewed).. (Attachments: #1 Exhibit 13 - U.S. Patent 5,893,120 - PX-1, #2 Exhibit 14 - 1996 NRL IPv6 code key.c - DX-36, #3 Exhibit 15 - NRL Source Code - key.h - DX-35, #4 Exhibit 16 - Information Disclosure Statement - 6/2010 - DX-147C, #5 Exhibit 17 - Information Disclosure Statement -12-2010 - DX-147E, #6 Exhibit 18 - Transaction History for Patent Application - DX-147G, #7 Exhibit 19 - USPTO Notice of Intent to Issue - DX-147F, #8 Exhibit 20 - Ex Parte Reexamination Certificate for the '120 Patent - DX-147H, #9 Exhibit 21 - US. Patent 5,287,499 - DX-66, #10 Exhibit 22 - Telcordia documents re: patent application - DX-56, #11 Exhibit 23 - Yahoo!'s 2004 10K Annual Statement - PX-248)(Doan, Jennifer)

Exhibit 20

US 5,893,120 Cl
Page 2

OTHER PUBLICATIONS
Van Wyk, C. J., et al.; Algorithmica-The Complexity of
Hashing with Lazy Deletion; 1986; pp. 17-29.
Szymanski, T. G., et al.; Special Feature: Goalie: A Space
Efficient System for VLSI Artwork Analysis; 1985; pp.
64-72.

van Rijsbergen, C. J.; Department of Computing ScienceUniversity of Glasgow; Information Retrieval; pp. 1-147.
Jannick, J.; Sigmond Record, vol. 24, No.1; Implementing
Deletion in B+-Trees; Mar. 1995; pp. 33-38.
Rusling; D. A.; The Linux Kernel; Version 0.8-3; pp. 1-176.
Chandranmenon, G. P.; et al.; IEEEJACM Transactions on
Networking, vol. 4, No.2; Trading Packet Headers for
Packet Processing; pp. 141-152; 1996.
Ramakrishna, M. Y.; Hashing in Practice, Analysis of Hashing and Universal Hashing; 1988; pp. 191-199.
Varghese, G., et al.; Hashed and Hierarchical Timing
Wheels: Data Structures for the Efficient Implementation of
a Timer Facility; 1987; pp. 25-38.
Waldvogel, M., et al.; Scalable High Speed IP Routing
Lookups; 1997;pp. 25-36.
Fagin, R., et al.; ACM Transactions on Database Systems,
vol. 4, No.3; Extendible Hashing-A Fast Access Method
for Dynamic Files; Sep. 1979; pp. 315-344.
Schimdt, J.P., et al.; On Aspects of Universality and Performance for Closed Hashing; 1989; pp. 355-366.
Larson, P. A; Algorithms and Data Structures; Dynamic
Hash Tables, vol. 31, No.4; Apr. 1988; pp. 446-457.
Chiang, K. w., et al.; Time Efficient VLSI Artwork Analysis
Algorithms in GOALIE2; 1988; pp. 471-476.
Maurer, W. D. et al; Computing Surveys, vol, 7, No.1; Hash
Table Methods; Mar. 1975; pp. 5-19.
Deutsch, L. P., et al.; Communications of the ACM, vol. 19,
No.9; An Efficient, Incremental, Automatic Garbage Collector; Sep. 1976; pp. 522-525.
Graham, S. L., et al.; Communications ofthe ACM, vol. 21,
No.7; Pseudochaining in Hash Tables; Jul. 1978; pp.
554-557.
Yao, A.; Journal of the Association for Computing Machinery, vol. 28, No.3; Should Tables be Sorted!; Jul. 1981; pp.
615-628.
Karger, D., et al; Consistent Hasing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the
World Wide Web; 1997; pp. 654-663.
Celis, P., et al; Information Sciences 62, The Analysis of
Hashing with Lazy Deletions; 1992; pp.13-36.
Albers, S., et al.; Self-Drganizing Data Structures; pp. 1-39.
Seltzer, M.; A New Hashing Package for UNIX; Winter' 91;
pp. 173-184.

Tamassia, R.; ACM Computing Surveys, vol. 28, No.1; Data
Structures; Mar. 1996; pp. 23-26
Morrison, J. A., et al., et al; SIAM J. Compo vol. 16, No.
6-A Queuing Analysis of Hashing with Lazy Deletion;
Dec. 1987; pp. 1155-1164.
Dietzfelbinger, M., et al.; Dynamic Perfect Hashing: Upper
and Lower Bounds, Revised Version; Jan. 7, 1990; pp. 1-33.
Kenyon-Mathieu, C.M., et al.; General Methods for the
Analysis of the Maximum Size of Dynamic Data Structures;
pp. 473-487.
Aldous, D., et al.; SIAM J Comp., vol. 21, No.4, Maximum
Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited*; Aug. 1992; pp. 713-732.
Printout-Ethernet Address Resolution Protocol; 7 Pgs.
Printout-Copyright (c) 1989, 1993-The Regents of University of California; Copyright (c) 1995-Paul Henning
Kamp; 6 Pgs.
Printout-Copyright (c) 1994 by Florian La Roche; pp.
1-20.
Brown, E. W.; Execution Performance Issues in Full-Text
Information Retrieval-Technical Report 95-81; Oct. 1995;
179 Pgs.
Costello, A. M. et al.; Redesigning the BSD Callout and
Timer Facilities; Nov. 2, 1995; 12 Pgs.
Foster, 1.M.-Senior Research Fellow, Dept. of Engineering, Aberdeen University; List Processing; 1967; 54 Pgs.
Printout-Wavelan Pomcia driver, Jean II-HPLB '96; pp.
1-78.
Van Wyk, C. J.; Data Structures & C Programs; 1988; 30
Pgs.
Sessions, R., Reusable Data Structures For C; 1989; 33 Pgs.
Frakes, W. B., et al.; Information Retrieval Data Structures
& Algorithms, Chapter 13; 1992; pp. 293-305.
Xu, 1.; IEEE Transactions on Computers, vo. 51, No.9;
Cost-Effective Flow Table Designs for High-Speed Routers: Architecture and Performance Evaluation; Sep. 2002;
pp. 1089-1099.
Keshav, S.; On the Efficient Implementation of Fair Queuing; Pgs. 1-20.
Kruse, R. L.; Data Structures and Program Design 2nd Edition, Chapter 4; 1987, 1984; pp. 104-155.
Vanghese, G., et al.; Hashed and Hierarchical Timing and
Wheels: Data Structures for the Efficient Implementation of
a Time Facility; 1987; pp. 25-38.
Xu, J.; IEEE Transactions on Computers, vO. 51, No.9;
Cost-Effective Flow Table Designs for High-Speed Routers: Architecture and Performance Evaluation; Sep. 2002;
pp. 1089-1099.

YAH0000525599

US 5,893,120 C1

2

1
EX PARTE
REEXAMINATION CERTIFICATE
ISSUED UNDER 35 U.S.C. 307
THE PATENT IS HEREBY AMENDED AS
INDICATED BELOW.

Matter enclosed in heavy brackets [ ] appeared in the
patent, but has been deleted and is no longer a part of the
patent; matter printed in italics indicates additions made
to the patent.

5

10

AS A RESULT OF REEXAMINATION, IT HAS BEEN
DETERMINED THAT:
15

The patentability of claims 1,2,5 and 6 is confinned.
Claims 3 and 7 are detennined to be patentable as
amended.
Claims 4 and 8, dependent on an amended claim, are 20
determined to be patentable.
New claims 9-12 are added and determined to be patentable.

25

3. A method for storing and retrieving infonnation records
using a linked list to store and provide access to the records,
at least some of the records automatically expiring, the
method comprising the steps of:
30
accessing the linked list of records 10 search for a largel
record,
identifying at least some of the automatically expired ones
of the records while searching for the target record, and

removing at least some of the automatically expired
records from the linked list when the linked list is
accessed.
7. A method for storing and retrieving information records
using a hashing technique to provide access to the records
and using an external chaining technique to store the records
with same hash address, at least some of the records automatically expiring, the method comprising the steps of:
accessing a linked list of records having same hash
address to search for a target record,
identifying at least some of the automatically expired ones
of the records while searching for the target record,
removing at least some of the automatically expired
records from the linked list when the linked list is
accessed, and
inserting, retrieving or deleting one of the records from
the system following the step of removing.
9. The method of claim 3, further comprising: .
deallocating memory of the at least some of the automatically expired records.
10. The method of claim 9, further comprising:
inserting the target record into the linked list if the target
record was not found during the searching.
11. The method of claim 7, further comprising:
deallocating memory of the at least some of the automatically expired records.
12. The method of claim 11, wherein the inserting, retrieving or deleting includes inserting the target record into the
linked list if the target record was not found during the
searching.

* * * * *

YAH0000525600