1578 search results - page 1 / 316 » Direct Routing: Algorithms and Complexity |
ESA
2004
Springer
13 years 10 months ago
2004
Springer
SLIP
2003
ACM
13 years 10 months ago
2003
ACM
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
PADS
2004
ACM
13 years 10 months ago
2004
ACM
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...