Sciweavers

502 search results - page 32 / 101
» Partial Lookup Service
Sort
View
JNW
2006
145views more  JNW 2006»
13 years 7 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman
SIGACT
2002
61views more  SIGACT 2002»
13 years 7 months ago
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all ...
Seth Gilbert, Nancy A. Lynch
EJC
2008
13 years 9 months ago
An Efficient Method for Quick Construction of Web Services
With the development of the Internet, Web services, such as Google Maps API and YouTube Data API, become more important and convenient for the Web knowledge distribution and integr...
Hao Han, Yohei Kotake, Takehiro Tokuda
AIPS
2006
13 years 9 months ago
Automated Web Service Composition by On-the-Fly Belief Space Search
Composition of stateful web services expressed in BPEL4WS can be recasted as a problem of planning in asynchronous domains. In (PTB05), this is pursued by encoding the asynchronou...
Piergiorgio Bertoli, Marco Pistore, Paolo Traverso
P2P
2005
IEEE
152views Communications» more  P2P 2005»
14 years 1 months ago
On Overlay Schemes to Support Point-in-Range Queries for Scalable Grid Resource Discovery
A resource directory is a critical component of a Grid architecture. P2P computing paradigm could address some of the scalability issues that make distributed resource discovery s...
Liping Chen, K. Selçuk Candan, Jun'ichi Tat...