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

  • V. S. Ananthanarayana
  • K. Vidyasankar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4317)


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.


Request Message Primary Copy Acknowledgment Phase Service Broker UDDI Registry 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alonso, G., Casati, F., Machiraju, V.: Web Services: Concepts, Architectures and Applications. Springer, Heidelberg (2004)MATHGoogle Scholar
  2. 2.
    Ananthanarayana, V.S., Vidyasankar, K.: Dynamic Primary Copy with Piggy-backing Mechanism for Replicated UDDI Registry, Technical Report, Dept. of Computer Science, Memorial University, NL, Canada (under preparation)Google Scholar
  3. 3.
    Anderson, T.A., Breitbart, Y., Korth, H.F., Wool, A.: Replication, Consistency and Practicality: Are these Mutually Exclusive? In: ACM SIGMOD 1998, pp. 485–495 (1998)Google Scholar
  4. 4.
    Bernstein, P., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley Publishing Company, Reading (1987)Google Scholar
  5. 5.
    Breitbart, Y., Komondoor, R., Rastogi, R., Seshadri, S.: Update Protocols for Replicated Databases. In: ACM SIGMOD (1999)Google Scholar
  6. 6.
    Chundi, P., Rosenkrantz, D.J., Ravi, S.S.: Deferred Updates and Data Placement in Distributed Databases. In: Int’l Conf. on Data Engg., pp. 469–476 (1996)Google Scholar
  7. 7.
    Lamport, L.: Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM 21(7), 558–565 (1978)MATHCrossRefGoogle Scholar
  8. 8.
    Kreger, H.: Web Services Conceptual Architecture (WSCA 1.0) IBM, Available from
  9. 9.
    Jimènez-Periz, R., Patiño-Martìnez, M., Kemme, B., Alonso, G.: Improving Scalability of Fault-tolerant Database Clusters. In: Int. Conf. on Distributed Computing Systems (2002)Google Scholar
  10. 10.
    Sun, C., Lin, Y., Kemme, B.: Comparison of UDDI Registry Replication Strategies. In: ICWS 2004, pp. 218–225 (2004)Google Scholar
  11. 11., UDDI Version 3.0 Specification, available from
  12. 12.
    Wolski, A.: Applying Replication to Data Recharging in Mobile Systems. Solid Information Technology 7(2) (2001),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • V. S. Ananthanarayana
    • 1
  • K. Vidyasankar
    • 2
  1. 1.Department of Information TechnologyNational Institute of Technology KarnatakaMangaloreIndia
  2. 2.Department of Computer ScienceMemorial University of NewfoundlandCanada

Personalised recommendations