1391 search results - page 97 / 279 » Distributed routing in networks using affinity propagation |
154
click to vote
GLOBECOM
2008
IEEE
16 years 24 days ago
2008
IEEE
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
222
click to vote
DBISP2P
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
151
click to vote
PDCAT
2007
Springer
16 years 14 days ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
161
click to vote
PDP
2008
IEEE
16 years 22 days ago
2008
IEEE
The scalability properties of DHT based overlay networks is considered satisfactory. However, in large scale systems this might still cause a problem since they have a logarithmic...
182
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
—Content-based service, which dynamically routes and delivers events from sources to interested users, is extremely important to network services. However, existing content-based...