417 search results - page 14 / 84 » A randomized algorithm for the joining protocol in dynamic d... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
EDCC
2010
Springer
14 years 11 days ago
2010
Springer
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
IPTPS
2005
Springer
14 years 1 months ago
2005
Springer
In Peer-to-Peer networks based on consistent hashing and ring topology each server is responsible for an interval chosen (pseudo-)randomly on a circle. The topology of the network...
ICPPW
1999
IEEE
13 years 12 months ago
1999
IEEE
As group applications become more prevalent, efficient network utilization becomes a major concern. Multicast transmission may use network bandwidth more efficiently than multiple...
WWCA
1998
Springer
13 years 11 months ago
1998
Springer
In an open network such as the Internet, multicast security services typically start with group session-key distribution. Considering scalability for group communication among wide...