Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing
Reexamination Certificate
1999-03-25
2002-02-05
Follansbee, John A. (Department: 2154)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
C709S250000, C709S219000
Reexamination Certificate
active
06345304
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates to techniques for obtaining network addresses from identifiers.
BACKGROUND OF THE INVENTION
Various techniques have been proposed for operating a machine such as a router to obtain network addresses. A network address can then be used to obtain an associated action, such as access to a World Wide Web page.
SUMMARY OF THE INVENTION
The invention addresses problems that arise in using identifiers to obtain network addresses.
Examples of such identifiers are described in copending, coassigned U.S. Pat. application No. 09/276,085, entitled “Marking Medium Area With Encoded Indentifier for Producing Action Through Network”, incorporated herein by reference. As described there, a substrate, such as a sheet or sticker of paper or a document, can bear visible or invisible markings that encode an identifier or the substrate and, in some cases, can also encode locations or zones within the substrate. The markings can, for example, be Xerox DataGlyphs. Such substrates are referred to hereinafter as “coded substrates”.
Each coded substrate can have a digitally-stored counterpart, or “digital page”, accessible through a network using an address. The encoded substrate can bear a pid-code (pid stands for page-identifier) that identifies it uniquely world-wide and that could therefore also be used to locate the digital page. In general, the digital page can sit anywhere on a global network. The pid can be encoded in DataGlyphs (visibly or invisibly) on the surface of the page in such a way that a “pointer” equipped with a small camera can recover the pid by looking at a small circular area anywhere on the page. With coded substrates, however, the space needed for encoding on a physical page the network address of the digital page counterpart may be at a high premium.
For a coded substrate implementation, because the pid must be recovered from a small area, it is important that:
1. The pid is encoded using a small number of bits; and
2. The pid can address unambiguously any of a large number of digital pages.
The theoretically optimal scheme that satisfies these conditions is to use a small number of bits for the pid, say 64, and to use the pid to address 2
64
different digital pages. (To give an idea of how big this figure is: If every inhabitant of the Earth produced 80 thousand encoded substrates a day for the next century, a 64-bit pid would be sufficient to uniquely identify each encoded substrate and its counterpart digital page.)
Obviously, with such a scheme, there must be a way to map the pid recovered by the pointer into the network address of the counterpart digital page. Copending, coassigned U.S. Pat. application No. 09/276,085, entitled “Marking Medium Area With Encoded Identifier for Producing Action Through Network”, describes a central router that contains a table of pairs (pid, address). The pointer can send a pid to the router and the router can send back the address to which the pointer can then connect to retrieve the relevant digital page.
Centralized routing schemes like this have two problems: First, the router may require huge tables for storing the (pid, address) pairs. Second, the number of requests per day to the router can be very large.
As a result of these problems, centralized routing can incur unrealistic address-storage and traffic-frequency costs at the central router's site.
The present invention provides techniques that alleviate these problems. The techniques obtain a network address using an identifier. The identifier, which could be a page identifier as described above or any other appropriate identifier, indicates a value that identifies an action that can be produced through the network, and is therefore referred to herein as an “action identifier”. The techniques employ at least first and second machines. The first machine uses the action identifier to obtain a first network address for a set of two or more identifier values that includes the action identifier's value. The first network address can be used to provide the action identifier to the second machine, which uses the action identifier to obtain a second network address for the action identifier's value. The second network address, when provided on the network, produces the action identified by the value of the action identifier.
In one technique, a method provides the action identifier to the first machine, operates the first machine to obtain the first network address, uses the first network address to provide the action identifier to the second machine, and then operates the second machine to obtain the second network address. This technique divides the address storage requirement between the two machines, and can thus be used to alleviate the problem of address storage costs at a central router site. The first machine need only store sufficient data to obtain a network address for each set of identifier values, and the second machine need only store sufficient data to obtain a network address for its set of identifier values. The first machine can be a router and the second machine can be a server.
In one implementation, the action identifier can be a substrate identifier of a coded substrate, such as a page identifier, and the method can be implemented with a third machine that receives signals from image input circuitry, such as the pointer described above. To provide the action identifier to the first machine, the method can operate the image input circuitry to provide image signals defining an image of a region of the substrate to the third machine, where the region bears markings that encode the substrate identifier. The method can then operate the third machine to use the image signals to obtain the action identifier and use a third network address to provide the action identifier and a return network address to the router; the third network address can be the address of the router. The router can use the return network address to provide the first network address to the third machine, and the method can then operate the third machine to use the first network address to provide the action identifier and the return network address to the server. The server can use the return network address to provide the second network address to the third machine, and the third machine can then use the second network address to produce the action identified by the identifier's value.
In another technique, which also divides the address storage requirement, an apparatus includes connection circuitry for providing a connection to the network and processing circuitry connected for providing signals to and receiving signals from the network through the connection circuitry. The processing circuitry operates to provide the action identifier through the connection circuitry to the first machine connected to the network. In response, the first machine uses the action identifier to obtain the first network address. The processing circuitry then uses the first network address to provide the action identifier through the connection circuitry to the second machine connected to the network. In response, the second machine uses the action identifier to obtain the second network address.
In these techniques, each set of identifier values can be a range of consecutive values, with lower and upper bounds indicated by data in the first machine.
The invention further provides techniques that allow data from the first machine to be stored for subsequent use without again providing an action identifier to the first machine. One such technique provides a method as described above, but in which the first machine also provides set data defining the set of identifier values that includes the action identifier; the third machine stores the set data and the first network address in memory so that it can subsequently access the first network address using any identifier value in the set of identifier values that includes the action identifier. Another such technique provides apparatus as described above, but further including memory; the first machine,
Copperman Max
Dymetman Marc
Follansbee John A.
Xerox Corporation
LandOfFree
Obtaining network addresses from identifiers does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Obtaining network addresses from identifiers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Obtaining network addresses from identifiers will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2970466