12659 search results - page 121 / 2532 » The distributed breakout algorithms |
106
click to vote
CLUSTER
2001
IEEE
15 years 1 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
102
click to vote
TMC
2008
14 years 9 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
PRDC
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper introduces the Sigma algorithm that solves fault-tolerant mutual exclusion problem in dynamic systems where the set of processes may be large and change dynamically, pr...
INFOCOM
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
TPDS
2002
14 years 9 months ago
2002