http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CA-2123441-C
Outgoing Links
| Predicate | Object |
|---|---|
| classificationCPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/Y04S40-00 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-04 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L41-0803 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-46 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L12-56 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L12-24 |
| filingDate | 1994-05-12-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate | 1999-02-16-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_935779f02078fdad9b9bb33268cdd647 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_7d4d85fdb8b3ee1a6aae11e987923316 |
| publicationDate | 1999-02-16-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CA-2123441-C |
| titleOfInvention | Method and apparatus for an automatic decomposition of a network topology into a backbone and subareas |
| abstract | The object of the invention is to perform an automatic decomposition of a packet switching network in backbone nodes and subareas nodes to speed up the routing path search without degrading the optimization criterion of the routing algorithm and without generating additional control messages on the network. Currently, routing algorithms compute all the available paths in the network, from the source node to the destination node before to select an optimal route. However, networks are rarely fully meshed. They are usually built around a hierarchical structure: a set of nodes, interconnected by high throughput lines,are used to build a backbone with a high degree of meshing and then, local nodes are grouped in geographical subareas themselves attached to the backbone. Routing algorithms can take advantage of this particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are defined as usable and are taken in account by the algorithm in its path calculation. |
| priorityDate | 1993-07-30-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 24.