Computing and storage utilities must control resource usage to meet contractual performance targets for hosted customers under dynamic conditions, including flash crowds and unexpected resource failures. This paper explores properties of proportional share resource schedulers that are necessary for stability and responsiveness under feedback control. It shows that the fairness properties common...

In this paper we introduce Burst Round Robin, a proportional-share scheduling algorithm as an attempt to combine the low scheduling overhead of round robin algorithms and favor shortest jobs. As being documented that weight readjustment enables existing proportional share schedulers to significantly reduce, but not eliminate, the unfairness in their allocations. We present a novel weight adjust...

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

The paper describes an original approach for the ABR service in the ATM network. It belongs to the explicite rate (ER) class and assumes that the ER parameter corresponds to the instant queue size. More specifically, the ER value calculated by the switch is proportional to the difference between predefined threshold and the actual state of the queue. Therefore, the algorithm can be regarded as ...

This article presents a practical scheduler algorithm – Multiple Carrier Proportional Fairness (MCPF), to dynamically allocate resource for the Orthogonal Frequency Division Multiplex (OFDM) system in both frequency and time domain. We analyze its performance on the Doppler fading multi-path channel with CoCentric System Studio and find that the throughput of MCPF is more than 60% greater compa...

In this study, the authors consider a delay control problem with proportional fair scheduling in time-varying wireless channels. For proportional fairness of transmission rates among users, a congestion control scheme is proposed for guaranteeing both throughput and delay of the wireless network. Specifically, a scheduling weight is introduced to control queue lengths without degrading the thro...

The fifth-generation (5G) and beyond networks are designed to efficiently utilize the spectrum resources meet various quality of service (QoS) requirements. unlicensed frequency bands used by WiFi mainly deployed for indoor applications not always fully occupied. cellular industry has been working enable coexistence. In particular, 5G New Radio in channel (NR-U) supports uplink downlink transmi...

TCP is known to have bandwidth fairness problems for flows of different RTT. HighSpeed TCP, which adapts TCP’s congestion avoidance to grow faster, and thus be able to scale to high bandwidth environments, aggravates the RTT fairness problem since the congestion window increases at a rate proportional to the RTT and the current window size. We propose a method to eliminate the RTT fairness prob...

Driven by surging demands for high data rate services and better user experiences, there is an increasing capacity demand in heterogeneous cellular networks. As one of the promising solutions for capacity enhancement, densely deployed small cells are proposed to provide a huge capacity gain and improve the user experience with high data rate services. However, the inter-cell interference among ...