In this paper, we study rate allocation for a set of end-to-end communication sessions in multi-radio wireless mesh networks. We propose cross-layer schemes to solve the joint rate allocation, routing, scheduling, power control and channel assignment problems with the goals of maximizing network throughput and achieving certain fairness. Fairness is addressed using both a simplified max-min fai...

The important research issue that is to be tackled in multihop ad hoc wireless network is the guarantee of fairness for concurrent flows in rate based transport protocol (Radunovic et al 2004). In this chapter, throughput unfairness of concurrent flow is analyzed. The end-to-end throughput of a packet flow degrades significantly with the increase in the number of its transmission hops. Fairness...

In this paper, a generalized fairness criterion referred to as the Generalized Weighted Fairness Criterion (GWFC) for flow control on ABR service is presented. Within the GWFC framework, a weight is assigned to each ABR connection and bandwidth is allocated to it in proportion to the corresponding weight. The GWFC can generalize fairness sub-criteria for prioritized services, and in particular,...

We present a set of five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Well-known notions such as αfairness, Jain’s index and entropy are shown to be special cases. Properties of fairness measures satisfying the axioms are proven, including Schur-concavity. Among the engineering implications is a new understanding of α-f...

Interconnection networks of parallel systems are used for servicing traffic generated by different applications, often belonging to different users. When multiple traffic flows contend for channel bandwidth, the scheduling algorithm regulating the access to that channel plays a key role in ensuring that each flow obtains the required quality of service. Fairness is a highly desirable property f...

We study the problem of learning classifiers with a fairness constraint, with three main contributions towards the goal of quantifying the problem’s inherent tradeoffs. First, we relate two existing fairness measures to cost-sensitive risks. Second, we show that for cost-sensitive classification and fairness measures, the optimal classifier is an instance-dependent thresholding of the class-pro...

Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficult to define and so it has been studied only sporadically. This has changed over the last decade a...

In this paper we study resource allocation problems that involve multiple self-interested parties or players, and a central decision maker. We introduce and study the price of fairness, which is the relative system efficiency loss under a “fair” allocation assuming that a fully efficient allocation is one that maximizes the sum of player utilities. We focus on two well accepted, axiomatically j...

The fairness hierarchy and conspiracies, the notions introduced by Best, are studied in the context of elementary nets. Proving that sequential as well as persistent systems are conspiracy-free, we indicate two main roots of conspiracies: distributed memory and conflicts. Using the notion of markingfairness, due to Merceron, we prove that T0-fairness + M0-fairness = T∞fairness. This result give...

Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications. Service time variability across jobs is an important factor affecting both system performance and scheduling rules (for example, computer systems that prioritize short jobs over long jobs). Service time variability and its effects on mean response times have been studied exte...