306 search results - page 20 / 62 » Routing Algorithms for Anycast Messages |
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
ICDCIT
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a n...
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
In this paper, we propose three different parallel algorithms based on a state-of-the-art global router called TimberWolfSC. The parallel algorithms have been implemented by using...
105
click to vote
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
106
Voted
CCR
2008
14 years 12 months ago
2008
With steady improvement in the reliability and performance of communication devices, routing instabilities now contribute to many of the remaining service degradations and interru...