WO1997034243A1 - Client server network and method of operation - Google Patents

Client server network and method of operation Download PDF

Info

Publication number
WO1997034243A1
WO1997034243A1 PCT/US1997/003383 US9703383W WO9734243A1 WO 1997034243 A1 WO1997034243 A1 WO 1997034243A1 US 9703383 W US9703383 W US 9703383W WO 9734243 A1 WO9734243 A1 WO 9734243A1
Authority
WO
WIPO (PCT)
Prior art keywords
confirmer
address
network
client
key
Prior art date
Application number
PCT/US1997/003383
Other languages
French (fr)
Inventor
Christopher Brandin
Original Assignee
Neo Core L.L.C.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Neo Core L.L.C. filed Critical Neo Core L.L.C.
Priority to EP97908010A priority Critical patent/EP0895622A1/en
Priority to JP9532661A priority patent/JP2000506648A/en
Priority to CA002248354A priority patent/CA2248354C/en
Priority to AU19863/97A priority patent/AU1986397A/en
Publication of WO1997034243A1 publication Critical patent/WO1997034243A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements, protocols or services for addressing or naming
    • H04L61/45Network directories; Name-to-address mapping
    • H04L61/4552Lookup mechanisms between a plurality of directories; Synchronisation of directories, e.g. metadirectories
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements, protocols or services for addressing or naming
    • H04L61/35Network arrangements, protocols or services for addressing or naming involving non-standard use of addresses for implementing network functionalities, e.g. coding subscription information within the address or functional addressing, i.e. assigning an address to a function
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/901Indexing; Data structures therefor; Storage structures
    • G06F16/9014Indexing; Data structures therefor; Storage structures hash tables
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements, protocols or services for addressing or naming
    • H04L61/30Managing network names, e.g. use of aliases or nicknames
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2101/00Indexing scheme associated with group H04L61/00
    • H04L2101/30Types of network names
    • H04L2101/33Types of network names containing protocol addresses or telephone numbers

Definitions

  • the present invention relates generally to the computers and more particularly to a client server network and method of operation.
  • Client server networks for computers have become very common.
  • the server is used as a central repository for information that is then available to all the clients on the network.
  • the bottlenecks in using such an architecture include the limited transmission bandwidth of the local area network or wide area network that connects the plurality of clients to the server.
  • the second bottleneck is the limited access speed of the server when presented with a request for information it has stored.
  • the majority of traffic on any network are simple queries as opposed to write or read instructions. For instance, in a bank's client server network an automatic teller machine (client) will commonly ask the server is XXX-John Doe's account number or verify that John Doe's account number is XXX.
  • the client has to send both the account number and person's name in order for the server to determine the answer to this query.
  • the server receives the information it has to determine the address where the information related to John Doe's account is stored, retrieve the information and make a comparison. The server then sends a reply that may also contain the account number, person's name and the answer. This process involves sending information that is duplicated at both the client and server. As a result, the network is largely carrying information that is duplicated at both the client and the server.
  • a client server network that overcomes these problems has a number of clients, each having a client transform generator.
  • the clients transmit a number of messages each of which containing an address and a confirmer.
  • the clients are all connected to a communication network that carries the messages.
  • a server has a server transform generator and is coupled to the communication network. The server receives the messages containing the address and the confirmer.
  • FIG. 1 is a block diagram of a client server network
  • FIG. 2 is a schematic diagram of the process of converting a key to an address and a confirmer
  • FIG. 3 is a flow chart of a method of operating a client server network.
  • FIG. 1 is a block diagram of a client server network 10.
  • the network 10 has a plurality of clients 12- 16.
  • the clients are office or personal computers, but they can also be computer terminals. In other embodiments the clients are a wide variety of other network devices such as automatic teller machines, printers, fax machines and industrial terminals.
  • Each of the clients 12- 16 has a transform generator (client transform generator) 18-22 to take full advantage of the invention.
  • the clients 12-16 are connected to a communication network 24, 26.
  • the communication network can be a local area network 24 or a wide area network 26.
  • the local area network 24 can be ethernet, token ring or any other protocol.
  • the local area network can use coaxial cable, twisted pair, fiber optic cable or wireless.
  • the wide area network is not limited to any particular protocol or transmission medium.
  • a server 28 is also connected to the communication network 24, 26.
  • the server 28 has a controller that receives a plurality of messages from the clients 12-16.
  • the controller 30 might access a catalog 32 and using the information from the catalog 32 can access other information in a store 34.
  • the catalog 32 has a plurality of addresses 36 and each of the addresses 36 is capable of containing an association 38, a confirmer 40 and a link pointer address list (linked pointer list) 42.
  • the server 28 also includes a transform generator (server transform generator) 44.
  • One reason for having the transform generator 36 at the server 28 is in case one of the clients does not have a transform generator.
  • Another reason for the server transform generator 36 is to be able to perform manipulations of the addresses and the confirmers (i.e., transforms). These manipulations include combining transforms, combine multiple transforms and removing individual transforms from combined transforms.
  • the controller 30 can be a standard microprocessor or could be a hardware circuit specifically designed for this function.
  • the transform generator 18-22, 36 can be implemented in software, firmware or as a specially designed digital circuit.
  • the catalog 32 can be implemented in a random access memory or any other memory chip or system.
  • the store 34 is not required for every embodiment of the invention and can be implemented using a computer mass storage system.
  • the clients are computers, the server is a computer and the functions necessary to operate a client server network according to the invention is accomplished by a software package installed on the network.
  • This embodiment requires that a computer readable storage medium 46 (e.g., diskette, ROM, RAM, hard drive) containing computer readable instruction be installed (e.g., disk drive 48) on the network.
  • a computer readable storage medium 46 e.g., diskette, ROM, RAM, hard drive
  • the transform generators 18-22 converts a key 50 of a block of data 52 (See FIG. 2) to an address 54, a confirmer 56 and in one embodiment a key length 58.
  • the client determines that the key 50 is the person's name (e.g., Brandin) and converts the name to a unique address and confirmer.
  • the client then sends a message 60 containing the address 54, the confirmer 56 and the street address (data) 62 to the server 28.
  • the controller 30 at the server 28 accesses the calculated address 54 at the catalog 32 and determines if the address 36 is empty. When the address 36 is empty the controller 30 determines which of a plurality of blocks in the store 34 to store the data associated with the key.
  • the location of the block where the data is stored (written) is an association 38.
  • the association 38 and the confirmer 56 are written to the address 36 of the catalog 32.
  • the controller 30 assigns a new address (link pointer) 36 for the information.
  • the new address or link pointer 36 is stored in the link pointer list 42 of the calculated address 54.
  • One of the properties of the transform generator 18-22, 44 is that it can handle a key of any length (indeterminate length). As a result the keys do no have to have arcane hard to remember names.
  • Another property of the transform generator 18-22, 44 is that it converts all keys to an address and confirmer having a fixed defined length (determinant length). As a result the network traffic is reduced, as most descriptive keys are longer than necessary to uniquely define an item.
  • by sending the address and the confirm the server eliminates the search process of trying to determine where a plurality of information associated with the key is stored. In a typical server the controller has a complex search routine that identifies where the key is stored in the catalog.
  • the transform generator allows the controller to go directly to the correct address in the catalog in most cases and only requires interrogating a second address in a minority of cases. This significantly speeds up the process of the server finding the required information.
  • the client server network 10 performs the simple query of whether a user had a certain account number by converting the user's name (key) to an address and a confirmer at the client transform generator.
  • the client then sends a message including the address (calculated address), confirmer and the account number to the server.
  • the controller accesses the address in the catalog and compares the confirmer to an address confirmer (the confirmer stored at the address in the catalog). When they match the controller accesses the block of the store 24 indicated by the association 38 at the address.
  • the block contains a plurality of information connected to the key including in this example the user's account number.
  • the controller compares the stored account number to the transmitted account and if they match the sends a message back to the client indicating a match.
  • the controller 30 determines if the link pointer list 42 contains a link pointer. When the link pointer list is empty the controller responds with a not found message. When the link pointer list is not empty, the controller finds a link pointer address confirmer at the link pointer address and compares this to the confirmer. When there is a match the controller searches the store at the association indicated by the link pointer address.
  • the client knows the user's name and needs to access the user's account balance.
  • the user's account balance is stored under a key of the user's name and account number (e.g., JOHNDOE534678800).
  • the client converts the key (user's name) to an address and a confirmer.
  • the server finds the user's account number (associated key).
  • the server's transform generator can determine the second address and second confirmer for the new key of the user's name and account number (e.g., JOHNDOE534678800).
  • the server's transform generator uses the old key's key length (e.g., number of bits in user's name) to determine the second address and second confirmer.
  • the server responds to the client by sending a second address and second confirmer. This saves the client from having to calculate a new transform (i.e., address and confirmer) to determine the account balance.
  • FIG. 3 is a flow chart of a method of operating a client server network.
  • the process starts, step 100, by converting a key to an address and a confirmer at step 102.
  • a query plus the address and confirmer are transmitted, at step 104.
  • the confirmer is compared to the address confirmer at step 106.
  • the confirmer is equal to the address confirmer determining a match has occurred at step 108.
  • Once it is determined a match has occurred data related to the key can be found in the store. In other examples the only relevant information will be that there is a match and this information can be sent to the client.
  • step 106 determining if a link point address exists at step 1 10.
  • the link pointer address does not exists, sending a not found message at step 1 12 .
  • the link pointer address does exists, jumping to a link pointer address (first link pointer address) at step 1 14.
  • the link address confirmer is compared to the confirmer.
  • the link address confirmer is equal to the confirmer determining a match has occurred at step 1 18.
  • the link address confirmer (first link address confirmer) is not equal to the confirmer at step 116, returning to step 110.
  • the process of FIG. 3 describes the basic functions that allow the client server network to speed up the flow of information across the network.
  • the processing load of transforming the keys is spread across all the clients instead of centralized at the server.
  • the server can immediately determine which address in the catalog to search. In a standard client server network the server has to search the address of the catalog using, for instances an alphabetical search routine. This usually requires the server to search multiple addresses.
  • sending the address and confirmer is generally fewer bits than sending a key (e.g., wordprocessor/documents/legal/1995/brandin-report), thus reducing the demand on the networks bandwidth.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Computer And Data Communications (AREA)
  • Multi Processors (AREA)
  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A client server network (10) has a number of clients (12, 14, 16), each having a client transform generator (18, 20, 22). The clients (12, 14, 16) transmit a number of messages each of which contains an address (38, 54) and a confirmer (40, 56). The clients (12, 14, 16) are all connected to a communication network (24, 26) that carries the messages. A server (28) has a server transform generator (44) and is coupled to the communication network (24, 26). The server (28) receives the messages containing the address (38, 54) and the confirmer (40, 56).

Description

CLIENT SERVER NETWORK AND METHOD OF OPERATION
Field of the Invention
The present invention relates generally to the computers and more particularly to a client server network and method of operation.
Background of the Invention
Client server networks for computers have become very common. The server is used as a central repository for information that is then available to all the clients on the network. The bottlenecks in using such an architecture include the limited transmission bandwidth of the local area network or wide area network that connects the plurality of clients to the server. The second bottleneck is the limited access speed of the server when presented with a request for information it has stored. The majority of traffic on any network are simple queries as opposed to write or read instructions. For instance, in a bank's client server network an automatic teller machine (client) will commonly ask the server is XXX-John Doe's account number or verify that John Doe's account number is XXX. The client has to send both the account number and person's name in order for the server to determine the answer to this query. Once the server receives the information it has to determine the address where the information related to John Doe's account is stored, retrieve the information and make a comparison. The server then sends a reply that may also contain the account number, person's name and the answer. This process involves sending information that is duplicated at both the client and server. As a result, the network is largely carrying information that is duplicated at both the client and the server.
One solution that has been used to cut down on overhead traffic is to limit the length of the key (filename) that tells the server where the information is stored. This results in the users of the network having to remember arcane key names (filenames). For instance, if the account information is stored under the persons name the key might be "JSDoe" (John Smith Doe). While limiting the key lengths reduces traffic somewhat on the network it does nothing to speed up the access at the server to the information.
Thus there exists a need for client server network that does not waste network bandwidth by sending repeated information and speeds the server's access to the information.
Summarv of the Invention
A client server network that overcomes these problems has a number of clients, each having a client transform generator. The clients transmit a number of messages each of which containing an address and a confirmer. The clients are all connected to a communication network that carries the messages. A server has a server transform generator and is coupled to the communication network. The server receives the messages containing the address and the confirmer.
Brief Description of the Drawings
FIG. 1 is a block diagram of a client server network;
FIG. 2 is a schematic diagram of the process of converting a key to an address and a confirmer; and
FIG. 3 is a flow chart of a method of operating a client server network.
Detailed Description of the Drawings
FIG. 1 is a block diagram of a client server network 10. The network 10 has a plurality of clients 12- 16. Typically, the clients are office or personal computers, but they can also be computer terminals. In other embodiments the clients are a wide variety of other network devices such as automatic teller machines, printers, fax machines and industrial terminals. Each of the clients 12- 16 has a transform generator (client transform generator) 18-22 to take full advantage of the invention. The transform generator 18-
22 is described in more detail in US Patent Application Serial No. 08/631 ,037 filed on March 8, 1996 by the same. In other embodiments not every client would have a transform generator. The clients 12-16 are connected to a communication network 24, 26. The communication network can be a local area network 24 or a wide area network 26. The local area network 24 can be ethernet, token ring or any other protocol. The local area network can use coaxial cable, twisted pair, fiber optic cable or wireless. Similarly, the wide area network is not limited to any particular protocol or transmission medium. A server 28 is also connected to the communication network 24, 26. The server 28 has a controller that receives a plurality of messages from the clients 12-16. On the basis of these messages the controller 30 might access a catalog 32 and using the information from the catalog 32 can access other information in a store 34. The catalog 32 has a plurality of addresses 36 and each of the addresses 36 is capable of containing an association 38, a confirmer 40 and a link pointer address list (linked pointer list) 42. The server 28 also includes a transform generator (server transform generator) 44. One reason for having the transform generator 36 at the server 28 is in case one of the clients does not have a transform generator. Another reason for the server transform generator 36 is to be able to perform manipulations of the addresses and the confirmers (i.e., transforms). These manipulations include combining transforms, combine multiple transforms and removing individual transforms from combined transforms.
The controller 30 can be a standard microprocessor or could be a hardware circuit specifically designed for this function. The transform generator 18-22, 36 can be implemented in software, firmware or as a specially designed digital circuit. The catalog 32 can be implemented in a random access memory or any other memory chip or system. The store 34 is not required for every embodiment of the invention and can be implemented using a computer mass storage system. In one embodiment the clients are computers, the server is a computer and the functions necessary to operate a client server network according to the invention is accomplished by a software package installed on the network. This embodiment requires that a computer readable storage medium 46 (e.g., diskette, ROM, RAM, hard drive) containing computer readable instruction be installed (e.g., disk drive 48) on the network.
The transform generators 18-22 converts a key 50 of a block of data 52 (See FIG. 2) to an address 54, a confirmer 56 and in one embodiment a key length 58. For example the client determines that the key 50 is the person's name (e.g., Brandin) and converts the name to a unique address and confirmer. The client then sends a message 60 containing the address 54, the confirmer 56 and the street address (data) 62 to the server 28. The controller 30 at the server 28 accesses the calculated address 54 at the catalog 32 and determines if the address 36 is empty. When the address 36 is empty the controller 30 determines which of a plurality of blocks in the store 34 to store the data associated with the key. The location of the block where the data is stored (written) is an association 38. The association 38 and the confirmer 56 are written to the address 36 of the catalog 32. When the address 36 is not empty, the controller 30 assigns a new address (link pointer) 36 for the information. The new address or link pointer 36 is stored in the link pointer list 42 of the calculated address 54.
One of the properties of the transform generator 18-22, 44 is that it can handle a key of any length (indeterminate length). As a result the keys do no have to have arcane hard to remember names. Another property of the transform generator 18-22, 44 is that it converts all keys to an address and confirmer having a fixed defined length (determinant length). As a result the network traffic is reduced, as most descriptive keys are longer than necessary to uniquely define an item. In addition, by sending the address and the confirm the server eliminates the search process of trying to determine where a plurality of information associated with the key is stored. In a typical server the controller has a complex search routine that identifies where the key is stored in the catalog. The transform generator allows the controller to go directly to the correct address in the catalog in most cases and only requires interrogating a second address in a minority of cases. This significantly speeds up the process of the server finding the required information.
The client server network 10 performs the simple query of whether a user had a certain account number by converting the user's name (key) to an address and a confirmer at the client transform generator. The client then sends a message including the address (calculated address), confirmer and the account number to the server. The controller accesses the address in the catalog and compares the confirmer to an address confirmer (the confirmer stored at the address in the catalog). When they match the controller accesses the block of the store 24 indicated by the association 38 at the address. The block contains a plurality of information connected to the key including in this example the user's account number. The controller compares the stored account number to the transmitted account and if they match the sends a message back to the client indicating a match. When the confirmer and the address confirmer do not match the controller 30 determines if the link pointer list 42 contains a link pointer. When the link pointer list is empty the controller responds with a not found message. When the link pointer list is not empty, the controller finds a link pointer address confirmer at the link pointer address and compares this to the confirmer. When there is a match the controller searches the store at the association indicated by the link pointer address.
In another example the client knows the user's name and needs to access the user's account balance. In this case the user's account balance is stored under a key of the user's name and account number (e.g., JOHNDOE534678800). The client converts the key (user's name) to an address and a confirmer. Using this information the server finds the user's account number (associated key). The server's transform generator can determine the second address and second confirmer for the new key of the user's name and account number (e.g., JOHNDOE534678800). In one embodiment the server's transform generator uses the old key's key length (e.g., number of bits in user's name) to determine the second address and second confirmer. The server responds to the client by sending a second address and second confirmer. This saves the client from having to calculate a new transform (i.e., address and confirmer) to determine the account balance.
FIG. 3 is a flow chart of a method of operating a client server network. The process starts, step 100, by converting a key to an address and a confirmer at step 102. Next, a query plus the address and confirmer are transmitted, at step 104. The confirmer is compared to the address confirmer at step 106. When the confirmer is equal to the address confirmer determining a match has occurred at step 108. Once it is determined a match has occurred data related to the key can be found in the store. In other examples the only relevant information will be that there is a match and this information can be sent to the client.
When the confirmer is not equal to the address confirmer at step 106, determining if a link point address exists at step 1 10. When the link pointer address does not exists, sending a not found message at step 1 12 . When the link pointer address does exists, jumping to a link pointer address (first link pointer address) at step 1 14. At step 1 16 the link address confirmer is compared to the confirmer. When the link address confirmer is equal to the confirmer determining a match has occurred at step 1 18. When the link address confirmer (first link address confirmer) is not equal to the confirmer at step 116, returning to step 110. The process of FIG. 3 describes the basic functions that allow the client server network to speed up the flow of information across the network. By having the clients convert the keys to addresses and confirmers, the processing load of transforming the keys is spread across all the clients instead of centralized at the server. In addition, by sending the address and confirmer to the server, the server can immediately determine which address in the catalog to search. In a standard client server network the server has to search the address of the catalog using, for instances an alphabetical search routine. This usually requires the server to search multiple addresses. Finally, sending the address and confirmer is generally fewer bits than sending a key (e.g., wordprocessor/documents/legal/1995/brandin-report), thus reducing the demand on the networks bandwidth.
Thus there has been described a client server network and method of operation that reduces network traffic and speeds up the server's access to the requested information. While the invention has been described in conjunction with specific embodiments thereof, it is evident that many alterations, modifications, and variations will be apparent to those skilled in the art in light of the foregoing description. Accordingly, it is intended to embrace all such alterations, modifications, and variations in the appended claims.

Claims

Claims
What is claimed is:
1 . A client server network, comprising:
a plurality of clients, each having a client transform generator and transmitting a plurality of messages each containing an address and a confirmer; a communication network coupled to each of the plurality of clients for carrying the plurality of messages; and a server having a server transform generator and coupled to the communication network and receiving the plurality of messages containing the address and the confirmer.
2. The client server network of claim 1 , wherein the server comprises: a controller coupled to the communication network and the client transform generator; and a catalog coupled to the controller and converting the address to an association.
3. The client server network of claim 2, wherein the catalog has a plurality of addresses and each of the plurality of addresses is capable of holding the association, the confirmer and a linked pointer list connected to one of the plurality of addresses.
4. The client server network of claim 2, wherein the server includes a store coupled to the catalog and the controller and containing a plurality of information connected to the address and the confirmer. 5. The client server network of claim 4, wherein the store is divided into a plurality of blocks and each of the plurality of blocks is uniquely correlated to one of a plurality of associations.
6. The client server network of claim 1, wherein the client transform generator converts a key for a data block to an address and a confirmer.
7. The client server network of claim 6, wherein the key has an indeterminate length.
8. The client server network of claim 6, wherein a length of the address and the confirmer have a determinate length.
9. The client server network of claim 6, wherein the client transform generator further converts the key to a key length.
10. The client server network of claim 1, wherein the communications network is a local area network.
1 1 . The client server network of claim 1, wherein the communications network is a wide area network.
12. The client server network of claim 1, wherein the server transform generator is capable of manipulating a plurality of addresses and confirmer. - il ¬
l s . A method of operating a client server network, comprising the steps of:
(a) converting a key of a block of data to an address and a confirmer;
(b) transmitting a query, the address and the confirmer;
(c) determining if the confirmer is equal to an address confirmer; and
(d) when the confirmer is equal to the address confirmer, determining a match has occurred.
14. The method of claim 13, further including the steps of:
(e) when the confirmer is not equal to the address confirmer, searching a first link pointer address;
(f) determining if the confirmer is equal to a first link pointer address confirmer;
(g) when the confirmer is equal to the first link address confirmer, determining a match has occurred.
1 5. The method of claim 13, further including the steps of:
(e) when the confirmer is not equal to the address confirmer, determining if a first link pointer address exists; (f) when the first link pointer address does not exists, responding with a not found message.
1 6. The method of claim 13, further including the step of:
(e) responding with a second address and a second confirmer. 17. The method of claim 13, wherein the step (a) includes the step of converting the key to a key length.
1 8. The method of claim 17, further including the step of:
(e) determining a second address and a second confirmer based on the address, the confirmer, the key length and an associated key; (f) responding with the second address and the second confirmer.
19. The method of claim 18, wherein step (f) includes the step of:
(fl) manipulating a first address and a first confirmer and the address and confirmer, to form the second address and the second confirmer.
20. A computer readable storage medium containing computer readable instructions that when inserted into a computer connected to a client server network performs the following steps of:
(a) converting a key of a block of data to an address and a confirmer;
(b) transmitting a query, the address and the confirmer;
(c) determining if the confirmer is equal to an address confirmer; and
(d) when the confirmer is equal to the address confirmer, determining a match has occurred. 21 . The computer readable storage medium of claim 20, further including the steps of:
(e) when the confirmer is not equal to the address confirmer, searching a first link pointer address;
(f) determining if the confirmer is equal to a first link pointer address confirmer;
(g) when the confirmer is equal to the first link address confirmer, determining a match has occurred.
22. The computer readable storage medium of claim 20, further including the steps of:
(e) when the confirmer is not equal to the address confirmer, determining if a first link pointer address exists;
(f) when the first link pointer address does not exists, responding with a not found message.
PCT/US1997/003383 1996-03-18 1997-03-04 Client server network and method of operation WO1997034243A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP97908010A EP0895622A1 (en) 1996-03-18 1997-03-04 Client server network and method of operation
JP9532661A JP2000506648A (en) 1996-03-18 1997-03-04 Client / server network and operation method
CA002248354A CA2248354C (en) 1996-03-18 1997-03-04 Client server network and method of operation
AU19863/97A AU1986397A (en) 1996-03-18 1997-03-04 Client server network and method of operation

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US08/617,135 1996-03-18
US08/617,135 US5742611A (en) 1996-03-18 1996-03-18 Client server network and method of operation

Publications (1)

Publication Number Publication Date
WO1997034243A1 true WO1997034243A1 (en) 1997-09-18

Family

ID=24472406

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1997/003383 WO1997034243A1 (en) 1996-03-18 1997-03-04 Client server network and method of operation

Country Status (7)

Country Link
US (1) US5742611A (en)
EP (1) EP0895622A1 (en)
JP (1) JP2000506648A (en)
CN (1) CN1260057A (en)
AU (1) AU1986397A (en)
CA (1) CA2248354C (en)
WO (1) WO1997034243A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6327577B1 (en) * 1997-12-19 2001-12-04 Checkfree Services Corporation Electronic bill payment system with account-number scheming
US7296004B1 (en) 1997-12-19 2007-11-13 Checkfree Corporation Electronic bill payment system with merchant identification
US7711690B1 (en) 1998-01-21 2010-05-04 Checkfree Corporation Dual source remittance processing

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI102936B1 (en) * 1996-03-04 1999-03-15 Nokia Telecommunications Oy Improving security of packet transmission in a mobile communication system
US6047376A (en) * 1996-10-18 2000-04-04 Toshiba Information Systems (Japan) Corporation Client-server system, server access authentication method, memory medium stores server-access authentication programs, and issuance device which issues the memory medium contents
TW422953B (en) * 1998-01-19 2001-02-21 Accton Technology Corp User database with tree structure in Ethernet and the configuration method for the database
US6167400A (en) * 1998-07-31 2000-12-26 Neo-Core Method of performing a sliding window search
US6157617A (en) * 1998-07-31 2000-12-05 Neo-Core, L.L.C. Method and system of network packet accounting
WO2000020993A1 (en) * 1998-10-05 2000-04-13 Motorola Inc. Method and apparatus for efficiently encoding wireless data packet headers
US6862588B2 (en) 2001-07-25 2005-03-01 Hewlett-Packard Development Company, L.P. Hybrid parsing system and method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5341499A (en) * 1992-04-02 1994-08-23 International Business Machines Corporation Method and apparatus for processing multiple file system server requests in a data processing network
US5446736A (en) * 1993-10-07 1995-08-29 Ast Research, Inc. Method and apparatus for connecting a node to a wireless network using a standard protocol
US5524253A (en) * 1990-05-10 1996-06-04 Hewlett-Packard Company System for integrating processing by application programs in homogeneous and heterogeneous network environments

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4527239A (en) * 1983-11-28 1985-07-02 Brandin Christopher L Digital data storage methods and apparatus
US4945475A (en) * 1986-10-30 1990-07-31 Apple Computer, Inc. Hierarchical file system to provide cataloging and retrieval of data
US5237678A (en) * 1987-05-08 1993-08-17 Kuechler William L System for storing and manipulating information in an information base
US5341483A (en) * 1987-12-22 1994-08-23 Kendall Square Research Corporation Dynamic hierarchial associative memory
CA2067633C (en) * 1991-07-24 1996-10-01 Eric Jonathan Bauer Method and apparatus for accessing a computer-based file system
US5418947A (en) * 1992-12-23 1995-05-23 At&T Corp. Locating information in an unsorted database utilizing a B-tree
US5563878A (en) * 1995-01-05 1996-10-08 International Business Machines Corporation Transaction message routing in digital communication networks

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5524253A (en) * 1990-05-10 1996-06-04 Hewlett-Packard Company System for integrating processing by application programs in homogeneous and heterogeneous network environments
US5341499A (en) * 1992-04-02 1994-08-23 International Business Machines Corporation Method and apparatus for processing multiple file system server requests in a data processing network
US5446736A (en) * 1993-10-07 1995-08-29 Ast Research, Inc. Method and apparatus for connecting a node to a wireless network using a standard protocol

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6327577B1 (en) * 1997-12-19 2001-12-04 Checkfree Services Corporation Electronic bill payment system with account-number scheming
US7296004B1 (en) 1997-12-19 2007-11-13 Checkfree Corporation Electronic bill payment system with merchant identification
US7490063B2 (en) 1997-12-19 2009-02-10 Checkfree Corporation Remittance payment processing with account scheming and/or validation
US7996311B2 (en) 1997-12-19 2011-08-09 Checkfree Corporation Remittance payment processing with account scheming and/or validation
US7711690B1 (en) 1998-01-21 2010-05-04 Checkfree Corporation Dual source remittance processing

Also Published As

Publication number Publication date
US5742611A (en) 1998-04-21
CA2248354A1 (en) 1997-09-18
AU1986397A (en) 1997-10-01
CA2248354C (en) 2002-02-05
JP2000506648A (en) 2000-05-30
CN1260057A (en) 2000-07-12
EP0895622A1 (en) 1999-02-10

Similar Documents

Publication Publication Date Title
EP0329779B1 (en) Session control in network for digital data processing system which supports multiple transfer protocols
US6553368B2 (en) Network directory access mechanism
US5227778A (en) Service name to network address translation in communications network
US5459717A (en) Method and apparatus for routing messagers in an electronic messaging system
US6865605B1 (en) System and method for transparently redirecting client requests for content using a front-end indicator to preserve the validity of local caching at the client system
US20040078457A1 (en) System and method for managing network-device configurations
JP2002512411A (en) Access control method and device
JPH077524A (en) Method for accessing of communication subscriber to address identifier
JPH0612532B2 (en) Method and system for preventing unauthorized service in LAN
WO2001031512A2 (en) Fast indexing of web objects
US5809254A (en) Data communication mechanism capable of producing data packet having optimal segment size in communication system
US5742611A (en) Client server network and method of operation
US7187683B1 (en) Statistics data collection mechanism for distributed, high-speed data processing environments
US6148305A (en) Data processing method for use with a coupling facility
US5146560A (en) Apparatus for processing bit streams
JPH06290090A (en) Remote file accessing system
JP5332488B2 (en) Map-based communication of multiple functional entities
KR100445784B1 (en) How to send and process group messages in an email system
MXPA98007458A (en) Customer network server and operating method
EP0344915B1 (en) Apparatus and method for processing bit streams
KR102571783B1 (en) Search processing system performing high-volume search processing and control method thereof
JPH10222449A (en) Data server access method and lan
JP3910013B2 (en) Communication method and method
CN116614555A (en) Transplantable message pushing assembly system
CN112543179A (en) Unified compatibility method and system for roadside intelligent equipment

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 97193142.9

Country of ref document: CN

AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BB BG BR BY CA CH CN CZ DE DK EE ES FI GB GE HU IL IS JP KE KG KP KR KZ LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK TJ TM TR TT UA UG US UZ VN AM AZ BY KG KZ MD RU TJ TM

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH KE LS MW SD SZ UG AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
ENP Entry into the national phase

Ref document number: 2248354

Country of ref document: CA

Ref document number: 2248354

Country of ref document: CA

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: PA/a/1998/007458

Country of ref document: MX

WWE Wipo information: entry into national phase

Ref document number: 1997908010

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWP Wipo information: published in national office

Ref document number: 1997908010

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 1997908010

Country of ref document: EP