82 search results - page 12 / 17 » Information dissemination in highly dynamic graphs |
IV
2005
IEEE
14 years 1 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
PERCOM
2007
ACM
14 years 7 months ago
2007
ACM
Due to the inherent nature of their heterogeneity, resource scarcity and dynamism, the provision of middleware for future networked embedded environments is a challenging task. In...
NSDI
2004
13 years 9 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
ICDCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose a new genre of overlay network for disseminating information from popular but resource constrained sources. We call this communication primitive as Latency Gradated Ove...
MIDDLEWARE
2004
Springer
14 years 29 days ago
2004
Springer
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...