Summary-based routing for content-based event distribution networks -> Monitor Keywords
Fresh Patents
Monitor Patents Patent Organizer File a Provisional Patent Browse Inventors Browse Industry Browse Agents Browse Locations
site info Site News  |  monitor Monitor Keywords  |  monitor archive Monitor Archive  |  organizer Organizer  |  account info Account Info  |  
07/19/07 - USPTO Class 709 |  29 views | #20070168550 | Prev - Next | About this Page  709 rss/xml feed  monitor keywords

Summary-based routing for content-based event distribution networks

USPTO Application #: 20070168550
Title: Summary-based routing for content-based event distribution networks
Abstract: A system arid method for enabling highly scalable multi-node event distribution networks through the use of summary-based routing, particularly event distribution networks using a content-based publish/subscribe model to distribute information. By allowing event routers to use imprecise summaries of the subscriptions hosted by matcher nodes, an event router can eliminate itself as a bottleneck thus improving overall event distribution network throughput even though the use of imprecise summaries results in some false positive event traffic. False positive event traffic is reduced by using a filter set partitioning that provides for good subscription set locality at each matcher node, while at the same time avoiding overloading any one matcher node. Good subscription set locality is maintained by routing new subscriptions to a matcher node with a subscription summary that best covers the new subscription. Where event space partitioning is desirable, an over-partitioning scheme is described that enables load balancing without repartitioning. (end of abstract)



Agent: Wolf Greenfield (microsoft Corporation) C/o Wolf, Greenfield & Sacks, P.C. - Boston, MA, US
Inventors: Yi-Min Wang, Lili Qiu, Chad E. Verbowski, Demetrios Achlioptas, Gautam Das, Per-Ake Larson
USPTO Applicaton #: 20070168550 - Class: 709238000 (USPTO)

Related Patent Categories: Electrical Computers And Digital Processing Systems: Multicomputer Data Transferring, Computer-to-computer Data Routing

Summary-based routing for content-based event distribution networks description/claims


The Patent Description & Claims data below is from USPTO Patent Application 20070168550, Summary-based routing for content-based event distribution networks.

Brief Patent Description - Full Patent Description - Patent Application Claims
  monitor keywords

FIELD OF THE INVENTION

[0001] This invention pertains generally to computer networks, and, more particularly, to computer networks that use a publish/subscribe model to distribute information.

BACKGROUND OF THE INVENTION

[0002] Today's computer data networks span the globe and provide an ever increasing variety of information and types of information. A popular model for retrieving information is the request-response model. This is a model used, for example, by the World Wide Web: a Web client requests a Web page from a Web server and then waits until the Web server responds. This model is adequate for basic access to information, but as information consumers become more sophisticated, it quickly becomes inefficient for information consumers or information providers or both. As a general example, under the request-response model, a consumer only interested in changes to an item of information (e.g., a stock price) may be required to request the information over and over again until a change is detected in the response.

[0003] A model complimentary to request-response that is becoming increasingly popular is publish/subscribe. Under a publish/subscribe model, information consumers submit subscriptions covering events of interest to a publish/subscribe service. Then, whenever information providers publish events to the service, consumers are notified of those events to which they have subscribed. News alerts and stock quotes are classic examples of information suited to distribution via a publish/subscribe model. Examples of other applications that use a publish/subscribe model include instant messaging, online auctions and electronic commerce price databases.

[0004] In addition, new applications are emerging where software agents play the role of information consumer, for example, in communicating with sensors and devices to perform automation tasks, and in monitoring and executing routine business-to-business transactions. Software agents present additional scalability challenges to the design of a publish/subscribe system because they are able to significantly increase the total number of subscribers, they are able to handle very complex subscriptions, and they are able to receive and process notifications at a very high rate.

[0005] Early publish/subscribe systems used a flat channel subscription model. Information consumers subscribed to a named channel and received only events that an information provider published to that particular channel. An improvement over the flat channel subscription model is to arrange the channels into a hierarchy of topics and subtopics so that a subscriber to a topic receives any events published to the topic and any of its subtopics. Modern publish/subscribe systems are able to allow even more fine-grained selection of events by enabling subscriptions to events based on the content of an event.

[0006] A content-based publish/subscribe system specifies an event schema for a topic, which lists the names and types of attributes that appear in an event. A subscription filter associated with a subscription may then be specified as a conjunction of predicates on a subset of those attributes. For example, a "stock quotes" topic specifies an event schema with three attributes: Symbol, Price, and Volume. An example event is (Symbol=MSFT and Price=79.30 and Volume=40,000,000); an example subscription filter is (Symbol=MSFT and Price>80.00). In a further example, the topic is itself an attribute of the event schema, e.g., Topic, Symbol, Price and Volume, so that subscribing to a topic and/or subtopic is then an aspect of the more general content-based subscription mechanism.

[0007] A new content-based publish/subscribe service will typically begin with a single physical server that receives and stores subscriptions from each service subscriber, receives events from each service publisher, performs matching of each event against the subscriptions, and sends notifications to subscribers with matching subscriptions. However, a successful service will eventually require performance beyond the capabilities of a single physical server. For such a service, a network of physical servers and/or a distributed system architecture is required.

[0008] Some prior art systems have incorporated a network of physical servers by propagating each event published to the service to each of the physical servers in the network, but this technique has inherent inefficiencies. Some prior art systems have achieved better efficiency by using a precise subscription filter summary. In such systems, each physical server that hosts subscriptions calculates a precise summary of the subscription filters associated with the subscriptions. The precise filter summary is then propagated against the flow of events and used by upstream event routers to block unnecessary event traffic as early in the route as possible.

[0009] There are problems with prior art systems that use precise subscription filter summaries. One problem is that in practice a precise subscription filter summary becomes so complex that event routers become a system bottleneck, degrading overall system throughput. Another problem is that subscription filters associated with subscriptions hosted by a server sometimes have poor locality. When that is the case,a summary of the subscription filter is too broad to be effective in reducing event traffic.

[0010] To ensure continuing success for content-based publish/subscribe services, there is a need in the art to solve such problems.

BRIEF SUMMARY OF THE INVENTION

[0011] The invention provides a system and method that address shortcomings of the prior art described herein above. These and other advantages of the invention, as well as additional inventive features, will be apparent from the description of the invention provided herein with reference to an exemplary embodiment. The invention provides a system and method for summary-based routing in an event distribution network. More particularly, the invention is directed to enabling highly scalable multi-node event distribution networks through the use of summary-based routing. The invention has a particular relevance to an event distribution network using a content-based publish/subscribe model to distribute information.

[0012] An event router node of an event distribution network maintains an imprecise summary of the set of subscriptions hosted by each matcher node. If the event router node is overloaded, it reduces the precision of the imprecise summaries. Reducing the precision of the imprecise summaries allows the event router to process each event faster. If the event router load falls beneath some high threshold, then it increases the precision of the imprecise summaries. Increasing the precision of the imprecise summaries reduces the amount of false positive traffic routed to a matcher node. False positive traffic makes a matcher node work harder. There is a balance point at some level of imprecision that optimizes the throughput of the event distribution network as a whole.

[0013] Subscriptions to be hosted by an event distribution network are divided among the matcher nodes of the event distribution network so as to provide good subscription locality to the set of subscriptions hosted by each matcher node, while at the same time avoiding overloading any one matcher node (i.e., ensuring that each set of subscriptions cover a corresponding area of event space). If a set of subscriptions has poor locality, the imprecise summary of the set of subscriptions will result in more false positive event traffic than if the set of subscriptions has good locality. Providing for good subscription locality further enhances the throughput of the event distribution network as a whole. Good subscription locality is maintained by routing new subscriptions to the matcher node with the subscription summary that best covers the new subscription.

[0014] Event space partitioning is sometimes desirable but event space partitioning is used in circumstances where subscription locality isn't applicable in the same way. When event space partitioning is desirable, the event space is over-partitioned and a set of event space partitions is assigned to each matcher node in order to provide for more fine-grained load balancing without repartitioning and, ultimately, to provide for enhanced event distribution network throughput, particularly when combined with event routing using imprecise summaries.

[0015] An event distribution network node is incorporated in highly scalable multi-node event distribution networks that use summary-based routing. Finally, an event distribution network node in accordance with particular embodiments of the invention is implemented in the context of an extended Web Services framework built around XML and SOAP standards and technologies.

BRIEF DESCRIPTION OF THE DRAWINGS

[0016] While the appended claims set forth the features of the present invention with particularity, the invention and its advantages are best understood from the following detailed description taken in conjunction with the accompanying drawings, of which:

[0017] FIG. 1 is a schematic diagram generally illustrating an exemplary computer system usable to implement an embodiment of the invention.

[0018] FIG. 2 is a schematic diagram of a publish/subscribe system in accordance with an embodiment of the invention.

[0019] FIG. 3 is a schematic diagram of a multi-node publish/subscribe service in accordance with an embodiment of the invention.

[0020] FIG. 4 is a schematic diagram of an event distribution network (EDN) in accordance with an embodiment of the invention.

Continue reading about Summary-based routing for content-based event distribution networks...
Full patent description for Summary-based routing for content-based event distribution networks

Brief Patent Description - Full Patent Description - Patent Application Claims

Click on the above for other options relating to this Summary-based routing for content-based event distribution networks patent application.
###
monitor keywords

How KEYWORD MONITOR works... a FREE service from FreshPatents
1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored.
3. Each week you receive an email with patent applications related to your keywords.  
Start now! - Receive info on patent apps like Summary-based routing for content-based event distribution networks or other areas of interest.
###


Previous Patent Application:
Method and system for performing multi-cluster application-specific routing
Next Patent Application:
Ad hoc wireless network create/join user experience
Industry Class:
Electrical computers and digital processing systems: multicomputer data transferring or plural processor synchronization

###

FreshPatents.com Support
Thank you for viewing the Summary-based routing for content-based event distribution networks patent info.
IP-related news and info


Results in 0.36044 seconds


Other interesting Feshpatents.com categories:
Software:  Finance AI Databases Development Document Navigation Error 174
filepatents (1K)

* Protect your Inventions
* US Patent Office filing
patentexpress PATENT INFO