306 search results - page 12 / 62 » Routing Algorithms for Anycast Messages |
139
click to vote
COMSWARE
2007
IEEE
15 years 10 months ago
2007
IEEE
— In a Delay Tolerant Network (DTN) the nodes may behave autonomously deciding on their own whether to implement or not the rules of a routing algorithm. In this paper, the effec...
121
click to vote
GD
2008
Springer
15 years 5 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
138
click to vote
TON
2010
14 years 11 months ago
2010
In this paper, we present a novel multiperiod spraying algorithm for routing in delay-tolerant networks (DTNs). The goal is to minimize the average copy count used per message unti...
133
click to vote
BROADNETS
2007
IEEE
15 years 10 months ago
2007
IEEE
—Grid computing aims to realize a high-performance computing environment, while increasing the usage efficiency of installed resources. This puts considerable constraints on the...
145
click to vote
CONEXT
2009
ACM
15 years 5 months ago
2009
ACM
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomai...