10 search results - page 2 / 2 » Size and Weight of Shortest Path Trees with Exponential Link... |
ALGORITHMICA
2005
13 years 5 months ago
2005
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
DATE
2002
IEEE
13 years 10 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
CORR
2010
Springer
13 years 5 days ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
MMB
2010
Springer
13 years 7 months ago
2010
Springer
We present a tool for the analysis of fault-tolerance in packet-switched communication networks. Network elements like links or routers can fail or unexpected traffic surges may o...