Method for sending and receiving a boolean function over a network

• US 20030154302A1
• Filed: 07/19/2002
• Published: 08/14/2003
• Est. Priority Date: 08/15/2001
• Status: Active Grant

• Current Assignee: Precache Incorporated
• Original Assignee: Precache Incorporated
• Inventors: Rosenblum, David S.
• Granted Patent: US 7,117,270 B2
• Time in Patent Office: Days
• US Class Current: 709/238
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: H04L 45/302 Route determination based on requested QoS
• CPC Class Codes: H04L 45/306 Route determination based on the nature of the carried application
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context

Abstract

Conversion of subscription predicates for transmission in a publish-subscribe network. Subscriptions include Boolean-valued predicates defining content desired by a subscriber. An agent application converts the predicates into a suitable form for transmission to routers in a network core. The routers process the predicates into filter tables or data structures for use in content-based routing, which involves applying attributes in received packets to the filters. The agent also receives content corresponding with subscriptions and calls applications for presenting the content to a subscriber.

Claims

1. A method for transmitting predicates in a publish-subscribe network, comprising:

receiving an expression including Boolean-valued predicates relating to a subscription;

encoding the expression into a message for transmission in the network for use in content-based routing; and

transmitting the message to at least one router in a network core in order to provide content-based routing for the subscription.

2. The method of claim 1 wherein the encoding step includes converting the expression into a flat message format.

3. The method of claim 1 wherein the receiving step includes receiving for the predicates conjunction, disjunction, or negation terms.

4. The method of claim 1 wherein the encoding step includes converting the expression into a corresponding disjunctive normal form.

5. The method of claim 4 wherein the encoding step includes converting the disjunctive normal form into a corresponding sequence of bit-string encodings of attribute tests.

6. The method of claim 1 wherein the encoding step includes translating not-equal parameters in the expression to positive form.

7. The method of claim 4 wherein the encoding step includes simplifying AND expressions in the disjunctive normal form to contain range filters and membership tests.

8. The method of claim 1, further including:

receiving the subscription; and

creating the expression from the subscription.

9. The method of claim 1, further including parsing the expression in order to detect errors in the subscription.

10. The method of claim 1, further including storing the expression in a data structure.

11. An apparatus for transmitting predicates in a publish-subscribe network, comprising:

a receive module for receiving an expression including Boolean-valued predicates relating to a subscription;

an encode module for encoding the expression into a message for transmission in the network for use in content-based routing; and

a transmit module for transmitting the message to at least one router in a network core in order to provide content-based routing for the subscription.

12. The apparatus of claim 11 wherein the encode module includes a module for converting the expression into a flat message format.

13. The apparatus of claim 11 wherein the receive module includes a module for receiving for the predicates conjunction, disjunction, or negation terms.

14. The apparatus of claim 11 wherein the encode module includes a module for converting the expression into a corresponding disjunctive normal form.

15. The apparatus of claim 14 wherein the encode module includes a module for converting the disjunctive normal form into a corresponding sequence of bit-string encodings of attribute tests.

16. The apparatus of claim 11 wherein the encode module includes a module for translating not-equal parameters in the expression to positive form.

17. The apparatus of claim 14 wherein the encode module includes a module for simplifying AND expressions in the disjunctive normal form to contain range filters and membership tests.

18. The apparatus of claim 11, further including:

a module for receiving the subscription; and

a module for creating the expression from the subscription.

19. The apparatus of claim 11, further including a module for parsing the expression in order to detect errors in the subscription.

20. The apparatus of claim 11, further including a module for storing the expression in a data structure.