Mechanisms for semantics publishing and discovery

• US 10,635,663 B2
• Filed: 10/12/2017
• Issued: 04/28/2020
• Est. Priority Date: 07/02/2013
• Status: Active Grant

• Current Assignee: Convida Wireless LLC
• Original Assignee: Convida Wireless LLC
• Inventors: Dong, Lijun, Mladin, Catalina M., Seed, Dale N., Lu, Guang
• Primary Examiner(s): Le, Debbie M
• Application Number:
  US15/782,521
• Publication Number:
  US 20180032572A1
• Time in Patent Office: 929 Days
• Field of Search: None
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/955 using information identifiers, e.g. uniform resource locators [URL]
• CPC Class Codes: H04W 4/70 Services for machine-to-machine communication [M2M] or machine type communication [MTC]

Abstract

Methods, devices, and systems may be used for semantics publishing and discovery. In an embodiment, a method for publishing semantics related resource identifiers may include adding a key word to an identifier of a semantics related resource and publishing the identifier to at least one of a sibling node and a child node. In another embodiment, a method may include using a Bloom filter to publish a semantics related resource. In another embodiment, a method may include publishing, by a semantics node, an identifier of a semantics related resource to a sibling node, while publishing a digest of the semantics node to a child node.

Claims

1. A device for semantics related resources, the device comprising:

a processor; and

a memory coupled with the processor, the memory comprising executable instructions that when executed by the processor cause the processor to effectuate operations comprising;

constructing identifiers for each of a plurality of semantics related resources, at least a first identifier of identifiers comprising;

a type, and

keywords;

representing the keywords of the first identifier in an aggregated format, the aggregated format based on a Bloom filter, wherein the Bloom filter is defined by at least parameters K or N, wherein K is the number of hash functions, and wherein N is the number of keywords; and

publishing a message to a semantic node, wherein the message comprises the first identifier.

2. The device of claim 1, wherein the first identifier further comprises a host address.

3. The device of claim 1, further operations comprising publishing a maximum hop count with the first identifier.

4. The device of claim 1, further comprising:

determining that a threshold amount of semantics related resources or identifiers of semantics related resources has been reached; and

providing instructions for the publishing of the message based on reaching the threshold amount.

5. The device of claim 1, further operations comprising publishing the Bloom filter and a hash function associated with the Bloom filter when the hash function is updated.

6. The device of claim 1, wherein the publishing of the message is based on a hybrid approach, wherein the hybrid approach comprises restricting dissemination of the message comprising the first identifier to a sibling semantics node or parent semantics node.

7. The device of claim 1, wherein the publishing of the message is based on a hybrid approach, wherein the hybrid approach comprises restricting dissemination of the message to a sibling semantics node.

8. A method for semantics related resources, the method comprising:

constructing identifiers for each of a plurality of semantics related resources, at least a first identifier of the identifiers comprising;

a type, and

keywords;

representing the keywords of the first identifier in an aggregated format, the aggregated format based on a Bloom filter, wherein the Bloom filter is defined by at least parameters K or N, wherein K is the number of hash functions, and wherein N is the number of keywords; and

publishing a message to a semantic node, wherein the message comprises the first identifier.

9. The method of claim 8, wherein the first identifier further comprises a host address.

10. The method of claim 8, further comprising publishing a maximum hop count with the first identifier.

11. The method of claim 8, further comprising:

determining that a threshold amount of semantics related resources or identifiers of semantics related resources has been reached; and

providing instructions for the publishing of the message based on reaching the threshold amount.

12. The method of claim 8, further comprising publishing the Bloom filter and a hash function associated with the Bloom filter when the hash function is updated.

13. The method of claim 8, wherein the publishing of the message is based on a hybrid approach, wherein the hybrid approach comprises restricting dissemination of the message comprising the first identifier to a sibling semantics node or parent semantics node.

14. The method of claim 8, wherein the publishing of the message is based on a hybrid approach, wherein the hybrid approach comprises restricting dissemination of the message to a sibling semantics node.

15. A computer readable storage medium storing computer executable instructions that when executed by a computing device cause said computing device to effectuate operations comprising:

constructing identifiers for each of a plurality of semantics related resources, at least a first identifier of the identifiers comprising;

a type, and

keywords;

representing the keywords of the first identifier in an aggregated format, the aggregated format based on a Bloom filter, wherein the Bloom filter is defined by at least parameters K or N, wherein K is the number of hash functions, and wherein N is the number of keywords; and

publishing a message to a semantic node, wherein the message comprises the first identifier.

16. The computer readable-storage medium of claim 15, further operations comprising publishing a maximum hop count with the first identifier.

17. The computer readable storage medium of claim 15, wherein the first identifier further comprises a host address.

18. The computer readable storage medium of claim 15, further operations comprising:

determining that a threshold amount of semantics related resources or identifiers of semantics related resources has been reached; and

providing instructions for the publishing of the message based on reaching the threshold amount.