Search Results - "Bienkowski, Marcin"

An Optimal Lower Bound for Buffer Management in Multi-Queue Switches by Bienkowski, Marcin

“…In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device…”
Get full text

The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach by Bienkowski, Marcin, Feldmann, Anja, Grassler, Johannes, Schaffrath, Gregor, Schmid, Stefan

“…Today's trend toward network virtualization and software-defined networking enables flexible new distributed systems where resources can be dynamically…”
Get full text

Randomized competitive algorithms for online buffer management in the adaptive adversary model by Bienkowski, Marcin, Chrobak, Marek, Jeż, Łukasz

“…In the problem of buffer management with bounded delay, packets with weights and deadlines arrive at a network switch over time, and the goal is to send those…”
Get full text

Collecting Weighted Items from a Dynamic Queue by Bienkowski, Marcin, Chrobak, Marek, Dürr, Christoph, Hurand, Mathilde, Jeż, Artur, Jeż, Łukasz, Stachowiak, Grzegorz

“…We consider online competitive algorithms for the problem of collecting weighted items from a dynamic queue S . The content of S varies over time. An update to…”
Get full text

Online Aggregation of the Forwarding Information Base: Accounting for Locality and Churn by Bienkowski, Marcin, Sarrar, Nadi, Schmid, Stefan, Uhlig, Steve

“…This paper studies the problem of compressing the forwarding information base (FIB), but taking a wider perspective. Indeed, FIB compression goes beyond sheer…”
Get full text

Learning Minimum Linear Arrangement of Cliques and Lines by Dallot, Julien, Pacut, Maciej, Bienkowski, Marcin, Melnyk, Darya, Schmid, Stefan

“…In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the nodes of an undirected graph into a permutation so that the total…”
Get full text

New results on multi-level aggregation by Bienkowski, Marcin, Böhm, Martin, Byrka, Jaroslaw, Chrobak, Marek, Dürr, Christoph, Folwarczný, Lukáš, Jeż, Łukasz, Sgall, Jiří, Thang, Nguyen Kim, Veselý, Pavel

“…In the Multi-Level Aggregation Problem (MLAP ), requests for service arrive at the nodes of an edge-weighted rooted tree T. Each service is represented by a…”
Get full text

Deterministic Self-Adjusting Tree Networks Using Rotor Walks by Avin, Chen, Bienkowski, Marcin, Salem, Iosif, Sama, Robert, Schmid, Stefan, Schmidt, Pawel

“…We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees,…”
Get full text

Distributed Alarming in the On-Duty and Off-Duty Models by Bienkowski, Marcin, Gasieniec, Leszek, Klonowski, Marek, Korzeniowski, Miroslaw, Mans, Bernard, Schmid, Stefan, Wattenhofer, Roger

“…Decentralized monitoring and alarming systems can be an attractive alternative to centralized architectures. Distributed sensor nodes (e.g., in the smart…”
Get full text

The k-resource problem in uniform metric spaces by Bienkowski, Marcin, Kutyłowski, Jarosław

“…We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in a metric space with some integer demands given at…”
Get full text

Logarithmic price of buffer downscaling on line metrics by Bienkowski, Marcin, Böhm, Martin, Jeż, Łukasz, Laskoś-Grabowski, Paweł, Marcinkowski, Jan, Sgall, Jiří, Spyra, Aleksandra, Veselý, Pavel

“…We consider the reordering buffer problem on a line consisting of n equidistant points. We show that, for any constant δ, an (offline) algorithm that has a…”
Get full text

A Subquadratic Bound for Online Bisection by Bienkowski, Marcin, Schmid, Stefan

“…The online bisection problem is a natural dynamic variant of the classic optimization problem, where one has to dynamically maintain a partition of $n$…”
Get full text

Randomized mutual exclusion on a multiple access channel by Bienkowski, Marcin, Klonowski, Marek, Korzeniowski, Miroslaw, Kowalski, Dariusz R.

“…In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed…”
Get full text

An Improved Algorithm For Online Min-Sum Set Cover by Bienkowski, Marcin, Mucha, Marcin

“…We study a fundamental model of online preference aggregation, where an algorithm maintains an ordered list of $n$ elements. An input is a stream of preferred…”
Get full text

Approximation algorithms for the joint replenishment problem with deadlines by Bienkowski, Marcin, Byrka, Jarosław, Chrobak, Marek, Dobbs, Neil, Nowicki, Tomasz, Sviridenko, Maxim, Świrszcz, Grzegorz, Young, Neal E.

“…The Joint Replenishment Problem ( JRP ) is a fundamental optimization problem in supply-chain management, concerned with optimizing the flow of goods from a…”
Get full text

Competitive FIB Aggregation without Update Churn by Bienkowski, Marcin, Sarrar, Nadi, Schmid, Stefan, Uhlig, Steve

“…This paper attends to the well-known problem of compressing the Forwarding Information Base of a router or switch, while preserving a correct forwarding. In…”
Get full text

Online Disjoint Set Covers: Randomization is not Necessary by Bienkowski, Marcin, Byrka, Jarosław, Jeż, Łukasz

“…In the online disjoint set covers problem, the edges of a hypergraph are revealed online, and the goal is to partition them into a maximum number of disjoint…”
Get full text

Optimizing Reconfigurable Optical Datacenters: The Power of Randomization by Bienkowski, Marcin, Fuchssteiner, David, Schmid, Stefan

“…Reconfigurable optical topologies are a promising new technology to improve datacenter network performance and cope with the explosive growth of traffic. In…”
Get full text

A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue by Bienkowski, Marcin, Chrobak, Marek, Dürr, Christoph, Hurand, Mathilde, Jeż, Artur, Jeż, Łukasz, Stachowiak, Grzegorz

“…The bounded-delay packet scheduling (or buffer management) problem is to schedule transmissions of packets arriving in a buffer of a network link. Each packet…”
Get full text

Provable fairness for TDMA scheduling by Bienkowski, Marcin, Byrka, Jaroslaw, Chrobak, Krzysztof, Jurdzinski, Tomasz, Kowalski, Dariusz

“…We consider the task of assigning time slots on a user-dependent and time-varying wireless channel. This scheduling problem occurs in cellular networks due to…”
Get full text