Comparison of UDDI Registry Replication Strategies

Authors:
Chenliang Sun;Yi Lin;Bettina Kemme
Affiliations:
McGill University, Montreal, Canada;McGill University, Montreal, Canada;McGill University, Montreal, Canada
Venue:
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Year:
2004

Citing 0
Cited 6

WS-replication: a framework for highly available web services

Proceedings of the 15th international conference on World Wide Web
Enabling ad-hoc collaboration between mobile users in the $\mathcal{MESSENGER}$ project

Cluster Computing
Tree-Based Dynamic Primary Copy Algorithms for Replicated Databases

ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
An Information Brokering Service Provider (IBSP) for Virtual Clusters

OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Dynamic primary copy with piggy-backing mechanism for replicated UDDI registry

ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
GRFM: an efficient grid-based replication and fault tolerant middleware

International Journal of Computational Science and Engineering

Quantified Score

Hi-index	0.02

Visualization

Abstract

UDDI registries are intended to become the world-widelookup mechanism for web-services. As such, the registryhas to provide high throughput, low response times, highavailability, and access to accurate data. Replication is oftenused to satisfy such requirements. Various replicationstrategies exist, favoring different subsets of the above performancemetrics. In this paper, we have a closer look attwo very different replication strategies. One strategy followsthe UDDI speci拢cation, the second uses a middlewarebased replication tool. In this paper, we provide a comparisonof these two approaches focusing on performance andease of integration with an existing UDDI implementation.