79 Result(s)
within
Dariusz R. Kowalski
-
Chapter and Conference Paper
Locally Balanced Allocations Under Strong Byzantine Influence
The Power of Two Choices (PoTC) is a commonly used technique to balance the incoming load (balls) into available resources (bins) – for each coming ball, two bins are selected uniformly at random and the one w...
-
Article
Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
-
Article
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
We study a dynamic version of the Multiple-Message Broadcast problem, where packets are continuously injected in network nodes for dissemination throughout the network. Our performance metric is the ratio of t...
-
Chapter and Conference Paper
Stable Scheduling in Transactional Memory
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 impose limits on the average ...
-
Chapter and Conference Paper
Efficient Protective Jamming in 2D SINR Networks
This paper studies how intentional jamming can be used for selective hiding communication in the 2D Signal-to-Interference-plus-Noise-Ratio (SINR) model. We aim to place a set of additional jamming stations to...
-
Chapter and Conference Paper
Disconnected Agreement in Networks Prone to Link Failures
We consider deterministic distributed algorithms for reaching agreement in synchronous networks of arbitrary topologies. Links are bi-directional and prone to failures while nodes stay non-faulty at all times....
-
Article
The structure of the genetic code as an optimal graph clustering problem
The standard genetic code (SGC) is the set of rules by which genetic information is translated into proteins, from codons, i.e. triplets of nucleotides, to amino acids. The questions about the origin and the m...
-
Article
Distributed bare-bones communication in wireless networks
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 coordinate system in the plane, fur...
-
Chapter and Conference Paper
Generic Framework for Optimization of Local Dissemination in Wireless Networks
We present a generic framework to compute transmission schedules for a comprehensive set of well-known local dissemination problems in Wireless Networks. In our framework, we formulate the communication restri...
-
Article
Confidential gossip
Epidemic gossip has proven a reliable and efficient technique for sharing information in a distributed network. Much of this reliability and efficiency derives from processes collaborating, sharing the work of...
-
Chapter and Conference Paper
Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks
Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communication network system is said to be s...
-
Chapter and Conference Paper
The Properties of the Standard Genetic Code and Its Selected Alternatives in Terms of the Optimal Graph Partition
The standard genetic code (SGC) is a system of rules, which assigns 20 amino acids and stop translation signal to 64 codons, i.e triplets of nucleotides. The structure of the SGC shows some properties suggesti...
-
Article
Open AccessOrdered and delayed adversaries and how to work against them on a shared channel
An execution of a distributed algorithm is often seen as a game between the algorithm and a conceptual adversary causing specific distractions to the computation. In this work we define a class of ordered adaptiv...
-
Chapter and Conference Paper
On the Complexity of Fault-Tolerant Consensus
We consider the problem of reaching agreement in a distributed message-passing system prone to crash failures. Crashes are generated by Constrained adversaries - a Weakly-Adaptive adversary, who has to fix, in ad...
-
Chapter and Conference Paper
Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel
We study the problem of scheduling n jobs on m identical, fault-prone machines f of which are prone to crashes by an adversary, where communication takes place via a multiple access channel without collision dete...
-
Chapter and Conference Paper
Reaching Consensus in Ad-Hoc Diffusion Networks
We consider an algorithmic model of diffusion networks, in which n nodes are distributed in a 2D Euclidean space and communicate by diffusing and sensing molecules. Such a model is interesting on its own right, a...
-
Chapter and Conference Paper
Optimal Channel Utilization with Limited Feedback
A channel with multiplicity feedback is a shared channel that in case of collision (two or more stations transmitting simultaneously) returns as a feedback the exact number of stations simultaneously transmitting
-
Article
Fault tolerant scheduling of tasks of two sizes under resource augmentation
Guaranteeing the eventual execution of tasks in machines that are prone to unpredictable crashes and restarts may be challenging, but is also of high importance. Things become even more complicated when tasks ...
-
Article
Open AccessRandomized mutual exclusion on a multiple access channel
In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing. In the classic version of this problem, n process...
-
Article
Measuring the impact of adversarial errors on packet scheduling strategies
In this paper, we explore the problem of achieving efficient packet transmission over unreliable links with worst-case occurrence of errors. In such a setup, even an omniscient offline scheduling strategy cann...
