2,552 research outputs found
Compact Oblivious Routing
Oblivious routing is an attractive paradigm for large distributed systems in which centralized control and frequent reconfigurations are infeasible or undesired (e.g., costly). Over the last almost 20 years, much progress has been made in devising oblivious routing schemes that guarantee close to optimal load and also algorithms for constructing such schemes efficiently have been designed. However, a common drawback of existing oblivious routing schemes is that they are not compact: they require large routing tables (of polynomial size), which does not scale.
This paper presents the first oblivious routing scheme which guarantees close to optimal load and is compact at the same time - requiring routing tables of polylogarithmic size. Our algorithm maintains the polylogarithmic competitive ratio of existing algorithms, and is hence particularly well-suited for emerging large-scale networks
The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game
The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and/or costs), compared to a centralized system design. However, the PoA relies on strong assumptions about agents\u27 rationality (e.g., resources and information) and interactions, whereas in many distributed systems agents interact locally with bounded resources. They do so repeatedly over time (in contrast to "one-shot games"), and their strategies may evolve.
Using a more realistic evolutionary game model, this paper introduces a realized evolutionary Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection in dynamic distributed systems with multiple equilibria, based on local interactions of simple memoryless agents.
Considering a fundamental game related to virus propagation on networks, we present analytical bounds on the ePoA in basic network topologies and for different strategy update dynamics. In particular, deriving stationary distributions of the stochastic evolutionary process, we find that the Nash equilibria are not always the most abundant states, and that different processes can feature significant off-equilibrium behavior, leading to a significantly higher ePoA compared to the PoA studied traditionally in the literature
Nonparametric tests based on area-statistics
Area statistics are sample versions of areas occuring in a probability plot of two distribution functions F and G. This paper gives a unified basis for five statistics of this type. They can be used for various testing problems in the framework of the two sample problem for independent observations such as testing equality of distributions against inequality or testing stochastic dominance in one or either direction against nondominance. Though three of the statistics considered have already been suggested in literature, two of them are new and deserve our interest. The finite sample distribution of these statistics can be calculated via recursion formulae. Two tables with critical values of the new statistics are added. The asymptotic distribution of the properly normalized versions of the area statistics are functionals of the Brownian Bridge. The distribution functions and quantiles thereof are obtained by Monte-Carlo-Simulation. Finally, the power of two new tests based on area statistics is compared to the power of tests based on corresponding supremum statistics, i.e. statistics of the Kolmogorov-Smirnov type. --Area Statistics,P-P-Plot,Functionals of Brownian Bridge,Monte Carlo Simulation,Nonparametric Tests,Recursion Formulae
Brief Announcement: On Self-Adjusting Skip List Networks
This paper explores the design of dynamic network topologies which adjust to the workload they serve, in an online manner. Such self-adjusting networks (SANs) are enabled by emerging optical technologies, and can be found, e.g., in datacenters. SANs can be used to reduce routing costs by moving frequently communicating nodes topologically closer. This paper presents SANs which provide, for the first time, provable working set guarantees: the routing cost between node pairs is proportional to how recently these nodes communicated last time. Our SANs rely on skip lists (which serve as the topology) and provide additional interesting properties such as local routing
- …