306 search results - page 41 / 62 » Routing Algorithms for Anycast Messages |
ISPA
2005
Springer
15 years 5 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
FGCS
2010
14 years 10 months ago
2010
Scalable and fault tolerant runtime environments are needed to support and adapt to the underlying libraries and hardware which require a high degree of scalability in dynamic larg...
107
click to vote
DMSN
2004
ACM
15 years 5 months ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
WWW
2004
ACM
16 years 14 days ago
2004
ACM
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intellig...
110
click to vote
ISPA
2007
Springer
15 years 6 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...