Browse Prior Art Database

A Method For Efficiently Generating Electronic Product Code For Auto-ID Center’s RFID Solution Architecture

IP.com Disclosure Number: IPCOM000146739D
Original Publication Date: 2007-Feb-20
Included in the Prior Art Database: 2007-Feb-20
Document File: 5 page(s) / 84K

Publishing Venue

IBM

Abstract

Described is a practical, distributed and efficient method and system that can generate an EPC (Electronic Product Code) that is unique across an enterprise.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 53% of the total text.

Page 1 of 5

A Method For Efficiently Generating Electronic Product Code For Auto -ID Center's RFID Solution Architecture

The following definitions, assumptions and implications are made in the context of this disclosure.

Definitions

1. EPC Policy: An EPC policy consists of the following information,

a. Header information (H)
b. Manager Number (M)
c. Object Class (O)
d. Instance number range (I)

Generally the first two numbers are constant but the third and especially the fourth number is what needs special attention for uniqueness. An EPC policy will be denoted by the following ordered quartet, EP = (H, M, O, I).

2. EPC Servers: These constitute a set of servers S = {S1,S2,..., Sk} in the distributed environment which will generate EPC for the entire enterprise.

Assumptions:

1. All EPC Servers are interconnected so that for any two Sj, Sk cS, Sj and Sk can communicate with each other.

2. The network connection among the EPC Servers can go down. Thus, for any two Sj, Sk cS, Sj and Sk can communicate with each other but not all the time.

3. Network connection between all EPC Servers is functional for the entire duration when an EPC policy from a server is being updated across all the remaining servers.

4. The network connection speed between any two EPC Servers can vary. For any server Si cS, it is possible to request an EPC policy update by inputting in Si a single EPC policy or a set of EPC Policies E = {EP1,EP2,..., EPk} such that the EPC Policy EPr correspond to the EPC Server Sr , r < k, and making it effective globally across all the member servers in S in an automatic manner.

5. More than one server can be used at the same time for inputting an EPC Policy change. Also these EPC Policy changes do not have to be the same. The method should provide a way to mediate among updates requested by more than one EPC server at once.

Implications: From the above the following implications can be derived,

1. From Assumption# 2 above it follows that, when an EPC generation is needed at a certain server Sm, it cannot always assume that a particular server or any server S

1

Page 2 of 5

 cS, m g n, for that matter, is available for help. Thus, in essence, each server has to manage its EPC generation locally or in other words, each EPC Server should contain its own copy of the latest EPC policy so that it can generate its own EPC independently of any other servers.
2. Implication#1 implies that the problem of distributed EPC generation will consist of the following two parts,
a. Ge...