Sciweavers

269 search results - page 13 / 54
» Online oblivious routing
Sort
View
ORL
2007
112views more  ORL 2007»
13 years 7 months ago
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
Enrico Angelelli, Martin W. P. Savelsbergh, Maria ...
ALT
2010
Springer
13 years 9 months ago
A Regularization Approach to Metrical Task Systems
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder...
SIGMOD
2010
ACM
204views Database» more  SIGMOD 2010»
13 years 7 months ago
Positional update handling in column stores
In this paper we investigate techniques that allow for on-line updates to columnar databases, leaving intact their high read-only performance. Rather than keeping differential str...
Sándor Héman, Marcin Zukowski, Niels...
INFOCOM
2009
IEEE
14 years 2 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
ACISP
2006
Springer
13 years 11 months ago
Online/Offline Signatures and Multisignatures for AODV and DSR Routing Security
Efficient authentication is one of important security requirements in mobile ad hoc network (MANET) routing systems. The techniques of digital signatures are generally considered a...
Shidi Xu, Yi Mu, Willy Susilo