| Predicate |
Object |
| assignee |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_f0fac92f31147b882de53fafad42de20
http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_e893acf93ad95b5a2bc74580c1d1feae
http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_2e281a6b091260071802c294933d7dad
http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_38ac9a462aa0a6e155462df9431a59bd |
| classificationCPCInventive |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-48
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-04
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-122
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-18
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-16
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-66 |
| classificationIPCInventive |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L12-56
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L45-16
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L45-122
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L45-741 |
| filingDate |
2009-10-26-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_5bc49cfb25dfc9d9ef35c50b66ea8062
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_d696f7c5ef047f4fb38e6caa9e98d5e0
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_c1f600511a8ea00a17fb2c8ceba7e856 |
| publicationDate |
2010-05-06-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber |
WO-2010048698-A1 |
| titleOfInvention |
Provider link state bridging (plsb) computation method |
| abstract |
A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to e\ en other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbour node of the first node and an} nodes of the network subtending the neighbour node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node. |
| priorityDate |
2008-10-28-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type |
http://data.epo.org/linked-data/def/patent/Publication |