48 citations · 152 across the 19 of their papers we have counts for
21 papers
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski
We develop deterministic algorithms for the problems of consensus, gossiping and checkpointing with nodes prone to failing. Distributed systems are modeled as synchronous complete…
Stable Scheduling in Transactional Memory
Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski +1
We study computer systems with transactions executed on a set of shared objects. Transactions arrive continually subjects to constrains that are framed as an adversarial model and…
Broadcasting on Adversarial Multiple Access Channels
Bader A. Aldawsari, Bogdan S. Chlebus, Dariusz R. Kowalski
We study deterministic distributed algorithms for broadcasting on multiple-access channels. Packet injection is modeled by leaky-bucket adversaries. There is a fixed set of station…
Disconnected Agreement in Networks Prone to Link Failures
Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski +1
We consider deterministic distributed algorithms for reaching agreement in synchronous networks of arbitrary topologies. Links are bi-directional and prone to failures while nodes…
Stability of Adversarial Routing with Feedback
Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski
We consider the impact of scheduling disciplines on performance of routing in the framework of adversarial queuing. We propose an adversarial model which reflects stalling of packe…
Energy Efficient Adversarial Routing in Shared Channels
Bogdan S. Chlebus, Elijah Hradovich, Tomasz Jurdzinski +2
We investigate routing on networks modeled as multiple access channels, when packets are injected continually. There is an energy cap understood as a bound on the number of station…
Routing in Wireless Networks with Interferences
Bogdan S. Chlebus, Vicent Cholvi, Pawel Garncarek +2
We consider dynamic routing in multi-hop wireless networks with adversarial traffic. The model of wireless communication incorporates interferences caused by packets' arrivals into…
Deterministic Computations on a PRAM with Static Processor and Memory Faults
Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
We consider Parallel Random Access Machine (PRAM) which has some processors and memory cells faulty. The faults considered are static, i.e., once the machine starts to operate, the…
Broadcasting Spanning Forests on a Multiple-Access Channel
Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski
The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spa…
Maximum Throughput of Multiple Access Channels in Adversarial Environments
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is con…
Randomized Communication in Radio Networks
Bogdan S. Chlebus
A communication network is called a radio network if its nodes exchange messages in the following restricted way. First, a send operation performed by a node delivers copies of the…
Packet Latency of Deterministic Broadcasting in Adversarial Multiple Access Channels
Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski +1
We study broadcasting in multiple access channels with dynamic packet arrivals and jamming. Communication environments are represented by adversarial models that specify constraint…
Naming a Channel with Beeps
Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo
We consider a communication channel in which the only possible communication mode is transmitting beeps, which reach all the nodes instantaneously. Nodes are anonymous, in that the…
Universal Routing in Multi-hop Radio Networks
Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski
In this article we introduce a new model to study stability in multi-hop wireless networks in the framework of adversarial queueing. In such a model, a routing protocol consists of…
Asynchronous Exclusive Selection
Bogdan S. Chlebus, Dariusz R. Kowalski
We consider the task of assigning unique integers to a group of processes in an asynchronous distributed system of a total of processes prone to crashes that communicate throug…
Distributed Bare-Bones Communication in Wireless Networks
Bogdan S. Chlebus, Dariusz R. Kowalski, Shailesh Vaya
We consider wireless networks operating under the SINR model of interference. Nodes have limited individual knowledge and capabilities: they do not know their positions in a coordi…
Anonymous Processors with Synchronous Shared Memory
Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo
We consider synchronous distributed systems in which anonymous processors communicate by shared read-write variables. The goal is to have all the processors assign unique names to…
Scalable Wake-up of Multi-Channel Single-Hop Radio Networks
Bogdan S. Chlebus, Gianluca De Marco, Dariusz R. Kowalski
We consider single-hop radio networks with multiple channels as a model of wireless networks. There are stations connected to radio channels that do not provide collision d…
Doing-it-All with Bounded Work and Communication
Bogdan S. Chlebus, Leszek Gąsieniec, Dariusz R. Kowalski +1
We consider the Do-All problem, where cooperating processors need to complete similar and independent tasks in an adversarial setting. Here we deal with a synchronous messa…
Adversarial Multiple Access Channels with Individual Injection Rates
Lakshmi Anantharamu, Bogdan S. Chlebus, Mariusz A. Rokicki
We study deterministic distributed broadcasting in synchronous multiple-access channels. Packets are injected into nodes by a window-type adversary that is constrained by a win…
Broadcasting in Ad Hoc Multiple Access Channels
Lakshmi Anantharamu, Bogdan S. Chlebus
We study broadcast in multiple access channels in dynamic adversarial settings. There is an unbounded supply of anonymous stations attached to a synchronous channel. There is an ad…