145 search results - page 25 / 29 » Weak State Routing for Large-Scale Dynamic Networks |
IFIP
2003
Springer
15 years 2 months ago
2003
Springer
The Java Message Service (JMS) provides a standard asynchronous messaging API, which simplifies the construction of loosely coupled, distributed applications. This paper describes ...
GC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
INFOCOM
1999
IEEE
15 years 1 months ago
1999
IEEE
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
100
click to vote
CN
2008
14 years 9 months ago
2008
The primary feature of cognitive radios for wireless communication systems is the capability to optimize the relevant communication parameters given a dynamic wireless channel env...
106
click to vote
ADHOC
2007
14 years 9 months ago
2007
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...