Expected slowdown has been proposed as a criterion to evaluate queue fairness. In this work we examine how the constant slowdown principle can be used as a basis for a queueing fairness measure. We propose the Slowdown Queueing Fairness (SQF) measure based on the principle that customers’ waiting time should be proportional to their service time. We analyze its properties and examine how they r...

Abstract Multimodal transportation systems require an effective journey planner to allocate multiple passengers transport operators. One example is mobility-as-a-service, a new mobility service that integrates various modes through single platform. In such multimodal and diverse planning problem, accommodating heterogeneous with different dynamic preferences can be challenging. Furthermore, may...

The use of relays is seen as a promising way to extend cell coverage and increase rates in LTE Advanced networks. Instead of increasing the number of base stations (BS), relays with lower cost could provide similar gains. A relay will have a wireless link to the closest BS as only connection to the core network and will cover areas close to the cell edge or other areas with limited rates. Perfo...

Scheduling plays an important role in wireless data communication systems where a common medium is shared to achieve a desired Quality of Service (QoS) for the users as well as the system. The new generation of wireless data systems, such as HRPD, deploy a scheduling algorithm to ensure proportional fairness in midst of varying channel environment. While proportionally fair scheduler attempts t...

We consider the problem of scheduling a group of heterogeneous, distributed processes, with different relative priorities and service preferences, to a group of heterogeneous virtual machines. Assuming linearly elastic IT resource needs, we extend prior results on proportional fair and max-min fair scheduling to a constrained multiresource case for a fam- ily of fairness criteria (including our...

As flows of traffic traverse a network, they share with other flows a variety of resources such as links, buffers and router CPUs in their path. Fairness is an intuitively desirable property in the allocation of resources in a network shared among flows of traffic from different users. While fairness in bandwidth allocation over a shared link has been extensively studied, overall end-to-end fai...

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...

Cognitive radio and Dynamic Spectrum Access (DSA) enable wireless users to share a wide range of available spectrums. In this paper, we study joint spectrum allocation and scheduling problems in cognitive radio wireless networks with the objectives of achieving fair spectrum sharing. A novel Multi-Channel Contention Graph (MCCG) is proposed to characterize the impact of interference under the p...

Orthogonal Frequency Division Multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and Long Term Evolution (LTE). Resource allocation mechanisms in LTE are very critical issues, because scheduling algorithms have the main responsibility for determining how to allocate radio resources for differen...