Event Routing Algorithms Using the Reverse Paths of Event Subscription Spanning Trees


The KIPS Transactions:PartA, Vol. 9, No. 1, pp. 19-28, Mar. 2002
10.3745/KIPSTA.2002.9.1.19,   PDF Download:

Abstract

A new class of applications based on event interactions are emerging for the wide-area network such as Internet, which is characterized as loose coupling, heterogeneity, and asynchrony. Content-based publish/subscribe systems are widely being studied to implement the event notification service for wide-area networks. In this paper, we analyze some problems of the content-based routing algorithm in SIENA, a recently developed as a representative event notification service architecture, and develop an enhanced routing algorithm.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. Y. Ryu and J. T. Lee, "Event Routing Algorithms Using the Reverse Paths of Event Subscription Spanning Trees," The KIPS Transactions:PartA, vol. 9, no. 1, pp. 19-28, 2002. DOI: 10.3745/KIPSTA.2002.9.1.19.

[ACM Style]
Ki Yeol Ryu and Jung Tae Lee. 2002. Event Routing Algorithms Using the Reverse Paths of Event Subscription Spanning Trees. The KIPS Transactions:PartA, 9, 1, (2002), 19-28. DOI: 10.3745/KIPSTA.2002.9.1.19.