http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CA-2503597-C
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_d6f84666246eed8af3bdbfa5206acbc6 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F15-16 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F13-36 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L61-5092 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L61-5038 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F15-17343 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-48 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L12-40078 |
| classificationIPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L12-56 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L12-64 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L12-40 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F15-177 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F15-173 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F15-16 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F13-40 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F13-362 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F13-36 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F13-14 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L12-44 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L29-12 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F13-00 |
| filingDate | 1993-12-16-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate | 2010-06-29-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_f3c157b04cb7e05656309c4a13fc963c |
| publicationDate | 2010-06-29-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CA-2503597-C |
| titleOfInvention | Method and apparatus for unique address assignment, node self-identification and topology mapping for a directed acyclic graph |
| abstract | A node identification system is described for use in a computer system in which the various components of the system are interconnected via nodes on a communications bus. Once the topology of the nodes has been resolved into an acyclic directed graph, each node may be assigned a non-predetermined unique address. Each node having a plurality of ports has an a priori assigned priority for port selection. Each child node connected to a parent is allowed to respond in the predetermined sequence depending upon the port through which it is connected to its parent. Each node in the graph will announce its presence according to its location in the graph. Each receives an address incremented from the previous addresses assigned, thereby insuring uniqueness. The same mechanism may be implemented to allow each node in turn to broadcast information on the bus concerning the parameters of its local host. Likewise, additional information may be conveyed from each node concerning connections to other nodes thereby allowing a host system to generate a map of the resolved topology including any information about disabled links which may be used for redundancy purposes. |
| priorityDate | 1992-12-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
| Predicate | Subject |
|---|---|
| isDiscussedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID90479729 http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID447684039 |
Total number of triples: 32.