This paper describes an algorithm that achieves delay and throughput decoupling in distributed fair scheduling in multihop ad-hoc wireless networks. The solution allows to support both low-bandwidth, low-delay and high-bandwidth, high delay applications in a single framework, without wasting much bandwidth to realize the low-delay requirement. We demonstrate the effectiveness of our algorithm i...

A lot of work has been done addressing issues of fair scheduling in wireline packet networks. Most techniques developed have not effectively address the unique constraints post by a wireless packet network. This report reviews [1], a paper which proposes a model for wireless packet network fair scheduling and provides a protocol that attempts to implement such a model.

Many research teams are developing technologies to turn the Internet into a QoS-capable network, which is one of the biggest challenges that this communication system currently faces. Naturally, at the core of such a challenge are IP routers and the technology they use. It is a well known fact that the common packet scheduling discipline that is used in routers (first come first served) makes t...

We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possi...

The performance of various GFR (Guaranteed Frame Rate) implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. In this paper we describe and evaluate a scheduling algorithm to provide the GFR service guarantees. The evaluation is performed by simulation using TCP connections. The proposed scheduling is...

Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on Superposition Coding (SC) which maximizes the achievable sum-rate under a Proportional Fairness (PF) constraint. Unlike most relaying schemes where users are allocated orthogonally, our scheme...

Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarantees a deterministic quality of service to connections with real-time constraints is proposed { this algorithm is a generalization of some recent multiprocessor scheduling algorithms, and o ers realtime performance guar...

BACKGROUND Clinical examinations are subjective and often show a low validity and reliability. Objective and highly reliable quantitative assessments are available in laboratory settings using 3D motion analysis, but these systems are too expensive to use for simple clinical examinations. Qinematic™ is an interactive movement analyses system based on the Kinect camera and is an easy-to-use clin...

As Artificial Intelligence (AI) is used in more applications, the need to consider and mitigate biases from learned models has followed. Most works developing fair learning algorithms focus on offline setting. However, many real-world applications data comes an online fashion needs be processed fly. Moreover, practical application, there a trade-off between accuracy fairness that accounted for,...

We revisit the problem of fair clustering, first introduced by Chierichetti et al., that requires each protected attribute to have approximately equal representation in every cluster; i.e., a balance property. Existing solutions clustering are either not scalable or do achieve an optimal trade-off between objective and fairness. In this paper, we propose new notion fairness, which call $tau$-fa...