102 search results - page 3 / 21 » Compact Forbidden-Set Routing |
WADS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
ICDCN
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
WDAG
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
AINA
2008
IEEE
14 years 5 months ago
2008
IEEE
Motivated by the high cost problem of ternary CAM, we proposed a new technique for providing a compaction routing table. With the comparisons with existing algorithms, our new tec...
MST
2010
13 years 9 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...