Search Results - "Vocking, B."

Randomized rumor spreading by Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.

“…Investigates the class of epidemic algorithms that are commonly used for the lazy transmission of updates to distributed copies of a database. These algorithms…”
Get full text

Adaptive routing with stale information by Fischer, Simon, Vöcking, Berthold

“…We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this…”
Get full text

Random knapsack in expected polynomial time by Beier, Rene, Vöcking, Berthold

“…We present the first average-case analysis proving a polynomial upper bound on the expected running time of an exact algorithm for the 0/1 knapsack problem. In…”
Get full text

Improved routing and sorting on multibutterflies by MAGGS, B. M, VÖCKING, B

“…This paper shows that an N -node AKS network (as described by Paterson) can be embedded in a ( 3N / 2 ) -node twinbutterfly network (i.e., a multibutterfly…”
Get full text

An experimental study of random knapsack problems by BEIER, Rene, VÖCKING, Berthold

Get full text

Exploiting locality for data management in systems of limited bandwidth by Maggs, B.M., Meyer auf der Heide, F., Vocking, B., Westermann, M.

“…This paper deals with data management in computer systems in which the computing nodes are connected by a relatively sparse network. We consider the problem of…”
Get full text

Universal Continuous Routing Strategies by Scheideler, C., Vöcking, B.

Get full text

Data Management in Networks: Experimental Evaluation of a Provably Good Strategy by Krick, C, Meyer auf der Heide, F, Raecke, H, Voecking, B, Westermann, M

“…This paper deals with data management for parallel and distributed systems. We present the DIVA (Distributed Variables ) library that provides direct access to…”
Get full text

Shortest-Path Routing in Arbitrary Networks by auf der Heide, Friedhelm Meyer, Vöcking, Berthold

“…We introduce an on-line protocol which routes any set ofNpackets along shortest paths with congestionCand dilationDthrough an arbitrary network inO(C+D+logN)…”
Get full text

How asymmetry helps load balancing by Vocking, B.

“…This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation and hashing. Suppose n balls have to be…”
Get full text

Congestion games: Equilibria, convergence and complexity by Vocking, B.

“…Congestion games model the allocation of resources by selfish players. For example, players aim at allocating shortest paths in a network. The cost (delay) of…”
Get full text

On the Impact of Combinatorial Structure on Congestion Games by Ackermann, H., Roglin, H., Vocking, B.

“…We study the impact of combinatorial structure in congestion games on the complexity of computing pure Nash equilibria and the convergence time of best…”
Get full text

Load Balancing for Dynamic Spectrum Assignment with Local Information for Secondary Users by Fischer, S., Mahonen, P., Schongens, M., Vocking, B.

“…In this paper we study an idealized model of load balancing for dynamic spectrum allocation (DSA) for secondary users using only local information. In our…”
Get full text

Transmission Probability Control Game with Limited Energy by Dams, J., Kesselheim, T., Vocking, B.

“…Due to limited batteries in mobile communications, network participants are confronted with a trade-off between transmitting more often or with more power. In…”
Get full text