A CORBA Cooperative Cache Approach with Popularity Admission and Routing Mechanism

Tari, Z. and Hamidjadja, H.

    For many distributed data intensive applications, the default remote access to CORBA objects is often not acceptable because of performance degradation. Caching enables clients to invoke operations locally on distributed objects instead of through remote servers. Existing CORBA caching approaches are extension of well-known database and/or WWW techniques to deal with the specific architectural aspects of CORBA systems. As users (of distributed applications) always use the same distributed objects, sharing of these objects between caches become necessary to improve the overall performance of distributed applications. This paper proposes a cooperative cache approach with solutions to two main problems: (i) eviction and (ii) routing. The proposed eviction technique takes into account several parameters, including the rate and cost of object invali8dation. The routing protocol is based on the use of a skipping function (with efficiently determines the appropriate nodes to look up) and a hit factor function (which decides the appropriate routing path to follow based on aggregated probabilities provided at different caches). The proposed approach is implemented in JacOrb system. The performance testings show how a saving of 45%-50% access time can be obtained.
Cite as: Tari, Z. and Hamidjadja, H. (2002). A CORBA Cooperative Cache Approach with Popularity Admission and Routing Mechanism. In Proc. Thirteenth Australasian Database Conference (ADC2002), Melbourne, Australia. CRPIT, 5. Zhou, X., Ed. ACS. 177-186.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS