Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Evaluating Advanced Routing Algorithms for Content-Based Publish/Subscribe Systems
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
On the modelling of publish/subscribe communication systems: Research Articles
Concurrency and Computation: Practice & Experience - Foundations of Middleware Technologies
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
On the cost and safety of handoffs in content-based routing systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
On adopting Content-Based Routing in service-oriented architectures
Information and Software Technology
Fast track article: Dynamic filter merging and mergeability detection for publish/subscribe
Pervasive and Mobile Computing
Self-stabilizing publish/subscribe systems: algorithms and evaluation
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
In large-scale distributed applications, a loosely-coupled event-based style of communication as in publish-subscribe systems eases the integration of autonomous, heterogeneous components. In a publish-subscribe system, content-based routing - where routing is based on the content of the messages - is an alternative to address-based delivery. In this paper we provide a time-dependent analysis of the identity-based routing scheme. Our analytical approach is based on continuous-time Markov chains and extends the steady-state approach by Jaeger and Mühl [7] to systems with time-fluctuating parameters. For m -ary trees with k levels, with a single publisher at the root and subscribers at the leaves, we obtain explicit closed form solutions for the time-dependent distribution of the traffic rates in the network. The results allow us to investigate, for example, the impact of time-fluctuating request rates versus time-independent request rates, and the switching point between optimality of flooding and identity-based routing.