Sciweavers

710 search results - page 9 / 142
» Distributed Algorithms for the Placement of Network Services
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
GRID
2008
Springer
13 years 7 months ago
Replica Placement Strategies in Data Grid
Replication is a technique used in Data Grid environments that helps to reduce access latency and network bandwidth utilization. Replication also increases data availability thereb...
Rashedur M. Rahman, Ken Barker, Reda Alhajj
ICDCS
2010
IEEE
13 years 11 months ago
Publisher Placement Algorithms in Content-Based Publish/Subscribe
—Many publish/subscribe systems implement a policy for clients to join to their physically closest broker to minimize transmission delays incurred on the clients’ messages. How...
Alex King Yeung Cheung, Hans-Arno Jacobsen
DEBS
2008
ACM
13 years 9 months ago
Replica placement for high availability in distributed stream processing systems
A significant number of emerging on-line data analysis applications require the processing of data streams, large amounts of data that get updated continuously, to generate output...
Thomas Repantis, Vana Kalogeraki
HIPC
2009
Springer
13 years 5 months ago
Automatic data placement and replication in grids
Data grids provide geographically distributed storage and computing resources for large data-intensive applications. To support fast data access and processing, effective data man...
Ying Ding, Ying Lu