Appeal No. 2005-0004
Application No. 09/135,230
On page 7 of the brief, appellants argue that:
Nothing in Little et al. teaches or suggests that connection information
pertaining to a particular network address to be accessed is utilized in making a
network connection between a network browser and a server machine
associated with the particular network address.
We are not convinced as the examiner relies upon Gauvin to teach retrieving
access information. As stated supra we find that Gauvin teaches the connection
information is in a database. A database is defined as “any aggregation of data a file
consisting of a number of records (or tables), each of which is constructed of fields
(columns) of a particular type, together with a collection of operations that facilitate
searching, sorting, recombination, and similar activities.”3 Thus, we find that Gauvin
teaches the information as claimed and that the information is described generically as
in a database, but we find that Gauvin is silent as to the data structure used in the
database and as such does not teach a table indexed by based upon network address.
Little teaches a computer system where a look up table (a form of a database) is used
to determine to which host, of a plurality of hosts, a particular packet of data is to be
sent. (Little, column 6, lines 18-29). The look up table is indexed based upon MAN
number (a host identifier, type of address) to determine a hardware address (see
column 7, lines 4-9). Thus, Little teaches that data for use in establishing network
connection should be indexed based upon address. We find that this suggests to the
skilled artisan that the database of Gauvin should be formatted as tables indexed by
address.
3 Definition taken from Computer Dictionary, The Comprehensive Standard For Business,
School, Library and Home, Microsoft Press, 1991.
-8-
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Next
Last modified: November 3, 2007