49 search results - page 1 / 10 » Online linear optimization and adaptive routing |
JCSS
2008
13 years 4 months ago
2008
OSDI
2008
ACM
14 years 4 months ago
2008
ACM
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
ICALP
2001
Springer
13 years 8 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
ISPA
2005
Springer
13 years 9 months ago
2005
Springer
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...
COLT
2008
Springer
13 years 6 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...