For an ad hoc IEEE 802.11 WLAN we investigate how the stations' incentives to launch a backoff attack i.e., to configure small minimum and maximum CSMA/CA contention windows in pursuit of a larger-than-fair bandwidth share, affect a proposed capacity-fairness index (CFI). We link CFI to the network size, "power awareness," a station's perception of the other stations' susceptibility to incentiv...

The following paper presents various methods and implementation techniques used to harvest metadata efficiently from a Kademlia Distributed Hashtable (DHT) as used in the BitTorrent P2P network to build an index of publicly available files in the BitTorrent ecosystem. The indexer design makes various tradeoffs between throughput and fairness towards other DHT nodes while also being scaleable in...

In this paper we consider the notions of global-fairness (G-fairness) and bounded-fairness (B-fairness) for arbitrary Petri nets (PNs). G-fairness in a PN guarantees every transition occurs infinitely often in every valid firing sequence of infinite length. B-fairness guarantees a bound on the number of times a transition in the PN can fire without some transition firing at least once. These pr...

Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At implementation level, the question becomes how to implement the underlying fairness which is assumed to be true at the specification level. In this paper, we study four types of fairness, the so-called w-fairness (wea...

In modeling a concurrent system, fairness constraints are usually considered at a specific granularity level of the system, leading to many different variants of fairness: transition fairness, object/process fairness, actor fairness, etc. These different notions of fairness can be unified by making explicit their parametrization over the relevant entities in the system as universal quantificati...

This paper is concerned with a new type of congestion control method that we call anticipative congestion control, which exploits probabilistic information available at a network node about congestion at other nodes. Motivated by the Internet flows behaving according to the Transmission Control Protocol, we consider a flow with time-varying input stream. We design a Markov decision process mode...

be applauded. It is enough to say that in appearance and arrangement it resembles the Index Medicus. One has to be less sanguine over the Beaumont index. The first question it raises is whether a computer is really necessary to produce a guide to a small archive of 400 documents; though one must in fairness recognize that the index is experimental in nature and intended to stir up comment. It i...

This is the first part of a two-part paper in which we discuss the implementability of fairness notions in distributed systems where asynchronous processes interact via synchronous constructs—usually called multiparty interactions. In this part we present a criterion for fairness notions and show that if a fairness notion violates the criterion, then no deterministic algorithm for scheduling mu...

Fairness is a mathematical abstraction used in the modeling of a wide range of phenomena, including concurrency, scheduling, and probability. In this paper, we study fairness in the context of probabilistic systems, and we introduce probabilistic fairness, a novel notion of fairness that is itself deened in terms of probability. The deenition of probabilistic fairness makes it invariant with re...