Dynamic Primary Copy with Piggy-Backing Mechanism for Replicated UDDI Registry

Abstract

As the community using web services grows, the UDDI registry is a crucial entry point that needs to provide high throughput, high availability and access to accurate data. Replication is often used to satisfy such requirements. In this paper, we propose dynamic primary copy method, a variant of primary copy method to handle the replicated UDDI registry, and two algorithms implementing this method. In this method, the update is done at the site where the request is submitted. The algorithms use a simple mechanism to handle the conflicting requests on UDDI entities in an efficient fashion. Due to a large volume of update and inquiry requests to UDDI, the number and size of the messages are critical in any replication solution for UDDI registry. Our algorithms reduce both the number and the size of messages significantly. The main difference between the two algorithms is that one of the algorithms handles high degree of conflicting update requests in an efficient fashion without transmitting unnecessary intermediate results.