Performance analysis of the CORBA event service using stochastic reward nets
The Event service is the earliest CORBA solution to the message queue model of communication in distributed systems. Typical implementations however suffer from the lack of event delivery guarantees. The loss of messages is aggravated in the presence of burstiness in the input to the Event service, and occurrences of isolated bursts of traffic could also have serious effects. In this paper we develop stochastic reward net (SRN) models that can aid in the study and configuration of the Event service to conform to design specifications. To capture burstiness in the input, Markov modulated Poisson process (MMPP) is used as the input source. Erlang distributed event consumption times are used in the models to accommodate more general distributions and a wider range of variances. The models also take into consideration the FIFO discard policy adopted in many Event service implementations. The SRN models are solved using the tool SPNP. The applicability of the models to the COBRA Notification service is also briefly discussed.
