2808 search results - page 42 / 562 » Routing betweenness centrality |
156
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
158
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
122
Voted
DATE
2008
IEEE
15 years 11 months ago
2008
IEEE
To achieve minimum signal propagation delay, the nonuniform wire width routing architecture has been widely used in modern VLSI design. The non-uniform routing architecture exploi...
148
click to vote
SIROCCO
2001
15 years 6 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
127
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— Consider a large wireless ad hoc network that facilitates communication between random pairs of network nodes. The paper investigates the size of routing tables as the number o...