33 search results - page 2 / 7 » A Random Walk Topology Management Solution for Grid |
TC
2008
13 years 4 months ago
2008
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
ISPDC
2008
IEEE
13 years 11 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
ASPDAC
2007
ACM
13 years 8 months ago
2007
ACM
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
CCS
2009
ACM
13 years 11 months ago
2009
ACM
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
TSP
2008
13 years 4 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...