| Predicate |
Object |
| assignee |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_52cd439c9a2051257abb747c6db09c19 |
| classificationCPCAdditional |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L67-10 |
| classificationCPCInventive |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F9-505
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L67-1023
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F9-5083
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24568
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F9-46 |
| classificationIPCInventive |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-2455
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-50
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L29-08
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-46 |
| filingDate |
2017-06-27^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate |
2021-05-18^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_f059797bd33e2b90af642fcc28bc5102
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_ac2a79fe025fcc63c6a5d411098f3756
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_68b93f82025341ce24416b50f85ee772
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_7279d6c1c69d1fdba6758f986fad993d
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_aa57cfd922e25c75800c6fdd71130e5f |
| publicationDate |
2021-05-18^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber |
US-11012504-B2 |
| titleOfInvention |
Method and apparatus for query selection and admission (QSA) optimization for IoT and other applications |
| abstract |
Various exemplary embodiments relate to a method for determining whether to admit a query in a network, the method including determining a load for a network element type based on an adaptive history for that network element type; determining a cost of admitting the query based on the relative load that the query generates accounting for the amount of traffic the network element has admitted in the past; decreasing a total cost of all queries that can be budgeted during a subsequent interval when the change in load is within a specified range; increasing the total cost of all queries that can be budgeted during a subsequent interval when the change in load is below a threshold; and adding the query to a data structure which keeps track of potentially admittable queries. |
| priorityDate |
2016-06-28^^<http://www.w3.org/2001/XMLSchema#date> |
| type |
http://data.epo.org/linked-data/def/patent/Publication |