2756
`
`Glenn W. Hutton, et al.
`08/533,115
`September 25, 1995
`METHOD AND APPARATUS FOR ESTABLISHING POINT-TO-POINT
`COMMUNICATIONS OVER A COMPUTER NETWORK
`M. Rinehart
`
`Applicant:
`Serial No.
`Filed:
`For:
`
`Examiner:
`Art Unit:
`
`CERTIFICATE OF MAlLlNG UNDER 37 C.F.R. §1.8(a)
`The undersigned hereby certifies that this document is being placed in the United States mail
`with first-class postage attached, addressed to Assistant Commissioner for P
`
`Box Non-Fee Amendment, Washington, DC 20231 on M
`h 1, 1999.
`
`
` Frances M. Cunningham
`
`
`Assistant Commissioner for Patents
`
`Washington, DC 20231
`
`In response to the office communication dated October 28, 1998, please
`amend the above-identified application as follows:
`
`In the Specification:
`
`Page 2, line 13, mag x.xxx.xxx.xxx" to —-xxx.xxx.xxx--;
`line 14, change)X.XXX.XXX.XXX.10” to --XXX.XXX.XXX.10--;
`
`line 15 change “
`
`.XXX.XXX.XXX.11” to --XXX.XXX.XXX.11--;
`
`line 15, Ch n/ge ".XXXXXX.XXXXXX. 12" i0 --XXXXXX.XXX. 12--'
`Page 11 line 10, cha/nge "232“ to --32-bit--.
`
`ln__t—heclaims. /
`
`Please ammend
`
`claims as follows:
`
`Please ca cel claims 1-4 and 6-11, without prejudice.
`
`\
`)1.
`(Amended) A computer program product for use with a computer system,
`0 the computer system executin a first
`rocess and o erativel connectable to a
`
`
`
`3";
`
`Page 1 of 19
`
`Verizon Exhibit 1021
`
`

`

`second process {having first and second processors] and a server [operatively
`
`coupled] over a computer network, the computer program product comprising:
`
`a computer usable medium having program code [means] embodied in the
`
`medium [for establishing a point-to-point communications link between the first
`
`processor and the second processor over the computer network], the [medium I
`
`\
`0
`
`further] program code comprising:
`r0 ram code for transmittin to the server a network rotocol address
`
`
`
`
`received b the first
`rocess foilowin connection to the com uter network;
`
`program code [means] for transmitting, [from the first processor] to the
`
`server, a query as to whether the second [processor] process is connected to the
`
`computer network;
`
`program code [means] for receiving a network protocol address of the
`
`second [processor] process from the server, when the second [processor]
`
`process is connected to the computer network; and
`
`program code [means], responsive to the network protocol address of the
`
`second [processor] process, for establishing a point-to-point communication link
`
`between the first [processor] process and the second [processor] process over
`
`the computer network.
`
`9*
`23’.
`
`(Amended) [A computer server] fl apparatus for enabling point-to-point
`
`07 communications‘between afirst and a second [processor] process overa
`
`computer network, the [server] apparatus comprising:
`
`a [server] processor;
`a network interface [means], operatively coupled to the [server] processor,
`
`for connecting the [server] apparatus to the computer network;
`
`a memory, operatively coupled to the processor, for storing a network
`
`protocol address for selected of a plurality of [processors connected] processes,
`
`
`
`each network rotocol address stored in the memo foilowin connection of a
`
`respective process to the computer network;
`
`means, responsive to a query from the first [processor] process, for
`
`determining the on-line status of the second [processor] process and for
`
`3
`
`Page 2 of 19
`
`

`

`transmitting [the] a network protocol address of the second [processor] process
`
`to the first [processor] process in response to a positive determination of the on-
`7 line status of the second [processor] process.
`‘
`
`2?.
`
`(Amended) The computer server apparatus of claim ;8 further comprising
`
`a timer [means], operatively coupled to the [server] processor, for time stamping
`
`‘
`
`
`the network protocol addresses stored in the memo .
`
`_T_—————————————-—————‘—-’
`/Z6.’
`(Amended) [In a connection server having a database and a computer
`network operatively coupled thereto, a] A method for enabling point-to-point
`[7 communication between a first [processing unit] process and a second
`0 [processing unit] process over a computer network, the method comprising the
`
`steps of:
`
`A.
`
`receiving and storing into a computer memom [storing in the
`
`database] a respective network protocol address for [each]
`
`selected of a plurality of [processing units] processes that have an
`
`on-line status with respect to the computer network each of the
`
`network protocol addresses received following connection of the
`
`respective process to the computer network;
`
`B.
`
`receiving a query from the first [processing unit] process to
`
`determine the on-line status of the second [processing unit]
`
`process;
`
`C.
`
`determining the on-line status of the second [processing unit]
`
`' process; and
`
`D.
`
`transmitting an indication of the on-Iine status of the second
`
`[processing unit] process to the first [processing unit] process over
`
`the computer network.
`
`Li
`S
`(Amended) The method of claim 96 wherein step C further comprises the
`g1.
`steps of:
`
`Page 3 of 19
`
`

`

`0
`
`Q
`
`c.1
`
`searching the [database] computer memom for an entry relating the
`
`second [processing unit] process; and
`
`0.2
`
`retrieving [the] a network protocol address of the second
`
`[processing unit] process in response to a positive determination of the on-line
`
`status of the second [processing unit] process.
`
`bi
`“P
`(Amended) The method of claimg6 wherein step D further comprises the
`28-)
`{7
`0 steps of:
`
`d.1
`
`transmitting the network protocol address of the second [processing
`
`unit] process to the first [processing unit] process when the second [processing
`
`unit} process is determined in step C to have a positive on-line status with
`
`respect to the computer network.
`
`229’.
`
`'
`
`4
`(Amended) The method ofclaim ;6wherein step D furthercomprises the
`
`steps of:
`
`d.1
`
`generating an off-line message when the second [processing unit]
`
`process is determined in step C to have a negative on-line status with respect to
`
`the computer network; and
`
`d .2
`
`transmitting the off-line message to the first [processing unit]
`
`process.
`
`E5.
`
`vl
`(Amended) The method of claim ;6 further comprising the steps of:
`
`E.
`
`receiving an E-mail signal comprising a first network protocol
`
`address from the first [processing unit] process; and
`
`F.
`
`transmitting the E-mail signal over the computer network to the
`
`second [processing unit] process.
`<6
`q
`(Amended) The method of claim §6wherein the E-mail signal further
`/3/1.
`comprises a session number and wherein step F further comprises the step of:
`
`f.1
`
`transmitting the session number and network protocol address over
`
`the computer network to the second {processor} process.
`
`35
`
`Page 4 of 19
`
`

`

`C
`
`O
`
`\0
`I327
`
`(Amended) In a corn uter s stem 3 [A] method for establishing a point-
`
`to-point communication link from a caller [processor] process to a callee
`
`[processor] process over a computer network, the caller [processor having]
`
`process having a user interface and being operatively [coupled] connectable to
`
`the callee [processor] process and a server over the computer network, the
`
`A7
`
`method comprising the steps of:
`
`A.
`
`[generating an] providing a user interface element representing a
`
`first communication line;
`
`[generating an] providing a user interface element representing a
`,
`B.
`first callee [processor] process; M
`
`I
`
`C.
`establishing a point-to-point communication link from the caller
`[processor] process to the first callee [processor] process, in response to a user
`
`associating the element representing the first callee [processor] process with the
`
`element representing the first communication line.
`i l
`l O
`gf
`(Amended) The method of claim 95wherein step C further comprises the
`
`steps of:
`
`0.1
`’- querying the server as to the on-line status of the first callee
`[processor]! process and
`g
`0.2
`receiving a network protocol address of the first callee [processor]
`
`process over the computer network from the server.
`
`\3
`947.
`
`i0
`(Amended) The method of claim/$2 further comprising the step of:
`D.
`[generating] providing an element representing a second
`
`communication line.
`
`\3
`}6’.
`
`s
`\cgk
`(Amended) The method of claim ,34 further comprising the step( of:
`E.
`terminating the point-to-point communication link from the caller
`
`[processor] 29% to the first callee [processor] ms; in response to the
`
`3??
`
`Page 5 of 19
`
`

`

`user disassociating the element representing the first callee [processor] process
`
`from the element representing the first communication line; and
`
`F.
`
`establishing a different point-to-point communication link from the
`
`caller [processor] process to the first callee [processor] process, in response to
`
`the user associating the element representing the first callee [processor] process
`
`with the element representing the second communication line.
`l4
`i0
`)6.
`(Amended) The method of claim 92’further comprising the steps of:
`D.
`[generating an] providing a user interface element representing a
`
`second callee [processor] process; and
`
`(/7
`
`E.
`
`establishing a conference point-to-point communication link
`
`between the caller [processor] process and the first and second callee
`
`[processors] process, in response to the user associating the element
`
`representing the second callee [processor] process with the element
`
`representing the first communication line.
`
`l 0
`lé
`2% (Amended) The method of claim 3
`further comprising the step of:
`F.
`removing the second callee [processor] process from the
`
`conference point-to-point communication link in response to the user
`
`disassociating the element representing the second Callee [processor] process
`
`from the element representing the first communication line.
`[L0
`(0
`ya.
`(Amended) The method of claim §qurther comprising the steps of:
`D.
`[generating an] providing a user interface element representing a
`
`communication line having a temporarily disabled status; and
`
`E.
`
`temporarily disabling a point-to-point communication link between
`
`the caller [processor] process and the first callee [processor] process, in
`
`response to the user associating the element representing the first callee
`
`[processor] process with the element representing the communication line having
`
`a temporarily disabled status.
`
`3
`
`Page 6 of 19
`
`

`

`\CP
`\7
`(Amended) The method of claim §8’wherein the element [generated]
`/39’_
`provided in step D represents a communication line on hold status.
`
`’7
`
`(Amended) The method of claim ggwherein the element [generated]
`1}}
`{y
`provided in step D represents a communication line on mute status.
`U \0\
`(0
`%.
`(Amended) The method of claim 732 wherein the caller [processor]
`process further comprises a visual display and the user interface comprises a
`
`graphic user interface.
`
`
`wherein the steps of establishing a
`\>\ y (Amended) The method of claim
`U point-to-point link as described in step C is performed in response to [a user
`manipulating] manipulation of the graphic elements on the graphic user interface.
`
`
`9%
`}8(
`
`Q?
`
`comprising:
`
`(Amended) A computer program product for use with a computer system
`
`a computer usable medium having program code [means] embodied in the
`
`medium for establishing a point-to—point communication link from a caller
`
`[processor] process to a callee [processor] process over a computer network, the
`
`caller [processor] process having a user interface and being operatively [coupled]
`
`connectable to the callee [processor] process and a server over the computer
`
`network, the medium further comprising:
`
`program code [means] for generating an element representing a first
`
`communication line;
`
`program code [means] for generating an element representing a first
`
`callee [processor] process;
`
`program code [means], responsive to a user associating the element
`
`representing the first callee [processor] process with the element representing
`the first communication line, for establishing a point-to—point communication link
`
`from the caller [processor] process to the first caliee [processor] process.
`
`3
`
`Page 7 of 19
`
`

`

`.-
`
`O
`
`24
`f4?
`
`2\
`(Amended) The computer program product of claim 58’wherein the
`
`program code [means] for establishing a point-to-point communication link further
`
`comprises:
`
`program code [means] for querying the server as to the on-line status of
`
`the first callee [processor] process; and
`
`program code [means] for receiving a network protocol address of the first
`
`callee [processor] process over the computer network from the server.
`
`(y ff).
`
`(Amended)Acomputerprogram productofclaim7.5furthercomprising:
`
`program code [means] for generating an element representing a second
`
`communication line.
`
`g3
`all
`% (Amended) The computer program product of claim fifurther comprising:
`
`program code [means], responsive to the user disassociating the element
`
`representing the first callee [processor] process from the element representing
`
`the first communication line, for terminating the point-to-point communication link
`
`from the caller [processor] process to the first callee [processor] process; and
`
`program code [means], responsive to the user associating the element
`representing the first callee [processor] process with the element presenting the
`
`second communication line. for establishing a different point-to-point
`
`communication link from the caller [processor] process to the first callee
`
`[processor] process.
`a?)
`44.
`
`4*
`(Amended) The computer program product of claim $37further comprising:
`program code [means] for generating an element representing a second
`
`callee [processor] process; and
`
`program code means, responsive to the user associating the element
`
`representing the second callee [processor] process with the element
`
`representing the first communication line, for establishing a conference
`
`communication link between the caller [processor] process and the first and
`
`second callee [processors] process.
`
`3]
`
`Page 8 of 19
`
`

`

`o
`
`o
`
`930
`/8./
`
`25
`(Amended) The computer program product of claimfi’? further comprising:
`program code [means], responsive to the user disassociating the element
`
`representing the second callee [processor] process from the element
`
`representing the first communication line, for removing the second callee
`
`[processor] process from the conference communication link.
`31’)
`all
`99.
`(Amended) The computer program product of claim 56 further comprising:
`program code [means] for generating an element representing a
`
`communication line having a temporarily disabled status; and
`
`C}
`
`program code [means], responsive [to user associating] association of the
`
`element representing the first callee [processor] process with the element
`
`representing the communication line having a temporarily disabled status, for
`
`temporarily disabling the point-to-point communication link between the caller
`
`[processor] process and the first callee [processor] process.
`f6
`37
`)50/.
`The computer program product of claimf9,wherein the communication
`line having a temporarily disabled status comprises a communication line on hold
`status.
`
`a? The computerprogram productofclaim?wherein the communication
`
`line having a temporarily disabled status comprises a communication line on
`
`mute status.
`
`9‘
`30
`(Amended) A computer program product of claim [4/3) wherein the
`)5’5.
`
`com uter s stem [caller processor] further comprises a visual display and the
`
`user interface comprises a graphic user interface.
`
`30
`}\
`(Amended) The computer program product of claim §2 wherein the
`33.
`element representing the first communication line and the element representing
`
`the first callee [processor] process are graphic elements and wherein the
`
`(:10
`
`Page 9 of 19
`
`

`

`program code [means] for establishing a point-to-point communication link from
`
`the caller [processor] process to the first callee [processor] process further
`
`comprises:
`
`()7
`
`program code [means], responsive to [a user manipulating] manipulation
`
`o_f the graphic elements on the graphic user interface, for establishing the point-
`
`to-point communication link from the caller [processor] process to the first callee
`
`[processor] process.
`
`5&4/
`(Amended) A method of locating a [user] process over a computer
`
`\9
`C/
`
`network comprising the steps of :
`
`a.
`
`maintaining an Internet accessible list having a plurality of selected
`
`entries, each entry comprising an [electronic mail address] identifier and a
`
`corresponding Internet protocol address [for] of a process currently connected to
`the Internet, the Internet Protocol address added to the list following connection
`
`of the process to the computer network; and
`
`b.
`
`in response to identification of one of the list entries by a requesting
`
`process, providing one of the [electronic mail address] identifier and the ‘
`
`corresponding Internet protocol address of the identified entry to the requesting
`
`process.
`
`at}?
`
`(Amended) A method for locating [users] processes having dynamically
`
`assigned network protocol addresses over a computer network, the method
`
`comprising the steps of:
`
`a.
`
`maintaining] in a computer memory, a network accessible
`
`compilation of entries, [each entry] selected of the entries comprising a network
`
`protocol address and a corresponding identifier [for a user] of a process
`
`connected to the computer network[;] the network rotocol address of the
`
`
`rocess assi ned to thecorres ondin rocessu on connection to the com uter
`
`network‘ and
`
`49]]
`
`Page 10 of 19
`
`

`

`b.
`
`in response to identification of one of the entries by a requesting
`
`process providing one of the identifier and the network protocol address to the
`
`requesting process.
`. 3“}
`(56'
`
`“b3
`(Amended) The method of claim 55 further comprising the step of:
`
`c.
`
`modifying the compilation of entries.
`
`if (Amended) The method ofclaim givherein step c furthercomprises:
`adding an entry to the compilation upon the occurrence of a
`0.1
`V0
`U predetermined event.
`39
`39’
`.
`/58’.
`(Amended) The method of claim/5’7 wherein the predetermined event
`comprises notification by a user process of an assigned network protocol
`
`address.
`
`a4
`99/.
`
`34
`(Amended) The method of claim;6wherein step 0 further comprises:
`c.1
`deleting an entry from the compilation upon the occurrence of a
`
`predetermined event.
`
`(Amended) A computer program product for use with a [server apparatus}
`$0.
`
`com uters stem havin a memo and bein operatively [coupled] connectable
`
`over a computer network to one or more computer processes, the computer
`
`program product comprising a computer usable medium having program code
`
`embodied in the medium the program code comprising:
`
`a.
`
`program code configured to maintain, in [a] th_e computer memory.
`
`a network accessible compilation of entries, [each entry] selected of the entries
`
`' comprising a network protocol address and a corresponding identifier {for} of a
` process connected to the computer networlgthe network rotocoi address of the
`
`corres ondin rocess assi necl t0 the rocess u on connection to the com uter
`
`network; and
`
`Li?
`
`Page 11 of 19
`
`

`

`b.
`
`program code responsive to identification of one of the entries by a
`
`requesting process and configured to provide one of the identifier and the
`
`\63
`network protocol address to the requesting process.
`2? (Amended) The computer program product of claim §6further comprising:
`
`'
`
`c.
`
`program code configured to modify the compilation of entries.
`
`.561
`40
`(Amended) The computer program product of claim/64 wherein program
`pf
`code configured to modify comprises:
`c.1
`program code configured to add an entry to the compilation upon
`
`KP
`
`(/
`
`the occurrence of a predetermined event.
`
`()0
`ill
`(Amended) The computer program product of claim/Ed wherein the
`£3.
`predetermined event comprises notification by a process of an assigned network
`
`protocol address.
`
`u?
`’64.
`
`5%
`(Amended) The computer program product of claimfi6wherein step 0
`
`further comprises:
`
`c.1
`
`program code configured to delete an entry from the compilation
`
`upon the occurrence of a predetermined event.
`
`’5
`
`(Amended) A computer program product for use with a computer system,
`<\ &.
`U
`the computer system [including] executing a first process operatively coupled
`
`over a computer network to a second process and a server process . the
`
`computer program product comprising a computer usable medium having
`
`computer readable program code embodied therein, the program code [means]
`
`comprising:
`
`a.
`
`program code configured to access a directory database, the
`
`database having a network protocol address for a selected plurality of processes
`
`having on-Iine status with respect to the computer network, the network protocol
`
`Page 12 of 19
`
`

`

`
`
`address of each res ective rocess forwarded to the database followin
`
`connection to the com uter network; and
`
`b.
`
`program code responsive to one of the network protocol addresses
`
`and configured to establish a point-to—point communication link from the first
`
`process to the second process over the computer network.
`
`<\
`O
`
`,67’.
`(Amended) In a first computer process operatively coupled over a
`computer network to a second process and an address server, a method of
`establishing a point-to-point communication between the first and second
`
`processes comprising the steps of:
`
`Ii
`
`following connection of the first process to the computer network
`
`fonivarding to the address server a network protocol address at which the first
`
`process is connected to the computer network;
`
`[A.] ; querying the address server as to whether the second process is
`
`connected to the computer network;
`
`[8.] Q receiving a network protocol address of the second process from
`
`the address server, when the second process is connected to the computer
`
`network; and
`
`[C.] gin [responsive] response to the network protocol address of the
`
`second process, establishing a point-to-point communication link with the second
`
`process over the computer network.
`
`
`
`Remarks
`
`Applicants have considered carefully the Office Action dated October 28,
`
`1998 and the references cited therein.
`
`In response, the claims have been
`
`amended. Applicants respectfully request reexamination and reconsideration of
`
`the application.
`
`Claims 1-4, 6-11, 21, 23-24, 26-64, 66 and 67 have been examined and
`
`are rejected over Various combinations of US. Patent 5,608,786(Gordon); US.
`
`Patent 5,740,231 (Cohn); US. Patent 5,524,254 (Morgan); and excerpts from
`The World Wide Web Unleashed (December). Before responding to the
`,
`
`C74
`
`Page 13 of 19
`
`

`

`individual rejections set forth in the Office Action (Paper No. 23), Applicants
`
`request that the Examiner consider the following remarks.
`
`In the office action, the Examiner has repeatedly stated that "[l]t would
`have been obvious to one of ordinary skill in the art at the time the invention was
`
`made to include a database and search retrieval mechanism to locate the
`
`needed network address because such mechanism permits the database to be
`
`modified over time to allow dynamic address assignment thus reducing the need
`
`to large address identifiers and thus the amount of data that needs to be
`
`transmitted with each packet of data."( Paper No. 23, paragraph 11).
`
`Applicants respectfully note that this mischaracterization of the motivation for the
`
`invention was first introduced by the prior Examiner (Paper 18. paragraph 7).
`
`Applicants’ invention solves a fundamental problem associated with the lnternet.
`The problem is not reducing the need for larger address identifiers. The problem
`
`is not the amount of data which needs to be transmitted with each packet over
`
`the network. The problem is: How can a global network user be located if
`he/she has no permanent network address?
`‘
`
`Applicants have disclosed a solution to the above-described problem. The
`
`solution utilizes a client! server system.
`
`In the disclosed system, a client process
`
`contacts a dedicated address directory server and forwards to the server the
`
`network protocol address to which it has been assigned upon connection to the
`
`computer network, along with other identification information. The dedicated
`
`address directory server maintains a compilation or list of entries, each of which
`
`contain a process identifier and the corresponding network protocol address
`
`forwarded to the server by the process itself. Other processes wishing to contact
`
`a desired target process simply query the address directory server to determine
`
`whether the target process is on-line and the current network protocol address at
`
`which the target process is located. The server forwards the network protocol
`
`address of the target process to the querying process. The querying process
`
`utilizes the information to establish a point-to-point communication with the target
`
`process.
`
`14-
`
`Page 14 of 19
`
`

`

`The Examiner is relying primarily on Morgan to disclose a database
`
`containing one or more network addresses. The Examiner will note that although
`
`a database may be programmable or contain writable memory, such a database
`does not teach or suggest Applicants’ inventive’clientlservice system in which the
`
`client processes themselves update the database with their current information.
`
`This aspect distinguishes Applicants' system from the art of record.
`
`Applicants have cancelled claims 1-4, and 6-11 without prejudice.
`
`Accordingly, any rejections of those claims are hereby deemed moot.
`
`Applicants have made global amendments to the claims to ensure
`
`consistent use terminology throughout the claims and to conform the claims to 35
`
`U.S.C. Section 112, 2nd paragraph. Specifically, the term “means" has been
`
`eliminated from the remaining pending claims. Also, all occurrences of
`
`“processors" have been changed to “process”. Various other claims have been
`
`made for clarity sake. Such amendments are not necessitated by any reference
`
`cited by the Examiner but are offered to clarify the claim language and to more
`
`particularly point out and distinctly claim the subject matter which Applicants
`
`regard as their invention.
`
`The Examiner has rejected the remaining pending claims under 35 USC
`
`§103 as being unpatentable over US. Patent 5,740,231 (Cohn et al.) in View of
`
`US. Patent 5,524,254 (Morgan et al.). Applicants respectfully assert that the
`
`claims, as amended, patentably distinguishes over the combined teachings of
`
`Cohn and Morgan for the following reasons. As stated by the Examiner, Cohn
`
`does not specify searching a database to match an address with a destination
`
`node. Although the sections of Morgan cited by the Examiner disclose an
`
`address recognition engine which reads each request and uses the address
`
`contained in the request as an index into an information database for look-up of a
`
`corresponding entry (Morgan, column 4, lines 44-56), the Examiner has failed to
`
`show where Morgan discloses a database in which the client process supply the
`
`database with their respective network addresses.
`
`Claim 21 is directed to a computer program product for use with a
`
`computer system functioning as a client process in the inventive client/server
`
`-15-
`
`Page 15 of 19
`
`

`

`system of the subject application. Claim 21 has been amended to recite
`
`“program code for transmitting to the server a network protocol address received
`
`by the first process following connection to the computer network “ (claim 21,
`
`lines 9-10). None of the references cited by the Examiner, whether considered
`
`singularly or in combination, disclose, teach or suggest a process or client
`
`process which forwards its network protocol address received upon connection to
`
`the computer network to a server. As discussed previously, the reporting or
`
`“logging-in" of a client process with an address directory server to provide the
`
`server with the current network protocol address at which the process can be
`
`located is not shown in the prior art.
`
`Claim 23 is an apparatus claim directed to the server portion of Applicants’
`
`inventive system. Claim 23 has been amended to now recite an apparatus
`
`comprising a processor, a network interface and “a memory
`
`for storing a
`
`network protocol address for selected of a plurality of processes, each network
`
`protocol address stored in the memory following connection of the respective
`
`process to the computer network" (claim 23, lines 7-10). Claim 23 is believed
`
`patentable over the art of record, particularly the Morgan reference, as none of
`
`the references disclose or suggest, whether considered singularly or in
`
`combination the subject matter now claimed. Claim 24 includes all the limitations
`
`of claim 23 and is likewise believed patentable over the cited references for the
`
`same reasons as claim 23.
`
`_
`
`Claim 26 recites a method and has been amended similarly to claim 23.
`
`Specifically, claim 26 now recites a method for enabling point-to-point
`
`communication between a first process and a second process over a computer
`
`network including the step of “receiving and storing in a computer memory a
`
`respective network protocol address for selected of a plurality of processes that
`
`have an on-line status with respect to the computer network, each of the network
`
`protocol addresses received following connection of the respective process to the
`
`computer network" (claim 26, lines 6-11). As stated previously, none of the
`
`references of record, particularly Morgan et al., are believed to disclose a
`
`process for storing network protocol address in which the network protocol
`
`-15-
`
`Page 16 of 19
`
`

`

`address are received following connection of the process to the computer
`
`network. Claims 27-31 include all the limitations of claim 26 and are likewise
`
`believed patentable over the art of record for the same reasons as claim 26.
`
`Applicants are puzzled by Examiner’s assertion in Paragraphs 16 and 17
`
`of the Office Action that claims 32-42 and 43-53 fail to teach or define beyond the
`
`subject matter of claims 1-4. Claims 32-42 are directed to a method for
`
`establishing a point-to-point communication link with the user interface of a client
`
`process by associating elements representing a communication line and various
`
`processes. None of the references cited by the Examiner, including Gordon,
`
`Morgan, Cohn and December disclose or suggest a user interface or a technique
`
`for establishing communications by manipulation of user interface elements.
`
`Claims 43-53 are computer program product claims and are directed to a
`computer program product containing program code for performing a process
`
`similarto the method defined in claims 32-42. Applicants respectfully assert that
`
`claims 32-53 with, or without the current amendments patentably distinguish over
`
`the cited references, whether considered singularly or in combination. Applicants
`
`respectfully assert that the Examiner has failed to disclose where any of the cited
`
`references teach or suggest a user interface for establishing point-to-point
`
`communications by associating user interface elements representing various
`
`processes and communication lines.
`
`Claim 54 recites a method of locating a process over a computer network
`
`comprising the step of “maintaining an Internet accessible list having a plurality of
`
`selected entries, each entry comprising an identifier and a corresponding Internet
`
`protocol address of a process currently connected to the Internet, the Internet
`
`protocol address added to the list following connection of the process to the
`
`computer network” (claim 54, lines 3-7). For reasons similar to those stated with
`
`reference to claims 23 and 26, claim 54 is believed patentable over the art of
`
`record.
`
`Claim 55 also recites a method of locating processes over a computer
`
`network. Claim 55 has been amended to include the step of "maintaining, in a
`
`computer memory, a network accessible compilation of entries, selected of the
`
`-17-
`
`Page 17 of 19
`
`

`

`,
`
`.
`
`, .
`
`.n.
`
`entries comprising a network protocol address and a corresponding identifier of a
`
`process connected to the computer network, the network protocol address of the
`
`corresponding process assigned to the process upon connection to the computer
`
`network (claim 55, lines 4-9). Claim 60 is a computer program product claim
`
`having similar limitations to claim 55. Specifically, claim 60 recites a computer
`
`program product comprising “program code configured to maintain the computer
`
`memory, a network accessible compilation of entries, selected of the entries
`
`comprising a network protocol address and a corresponding identifier of a
`
`process connected to the computer network, the network protocol address of the
`
`corresponding process assigned to the process upon connection to the computer
`
`network” (claim 60, lines 6-11). Claims 55 and 60 and their subsequent
`
`dependent claims are believed patentable over the art of record. The Examiner
`
`has not shown where any of the cited references disclose or suggest a database
`
`for storing network protocol addresses where the network protocol addresses
`
`have been assigned to a proces