Dept. of computer Science and Mathematics My Ismail University Meknes FSM, Morocco This paper proposes a resource allocation algorithm for MIMO-OFDM systems (LTE standard). The algorithm is developed for orthogonal frequency division multiple access (OFDMA) system with frequency hopping and adaptive subcarrier-based assignment. The best subcarriers are assigned to each user by applying multiuse...

We consider a fairness problem in resource allocation where multiple groups demand resources from common source with the total fixed amount. show that for many distributions satisfying sharp lower-tail inequalities, natural provides proportional to each group's average performs very well. More specifically, this is approximately fair and efficient (i.e., it near maximum utilization). also that,...

How to distribute welfare in a society is a key issue in the subject of distributional justice, which is deeply involved with notions of fairness. Following a thought experiment by Dworkin, this work considers a society of individuals with different preferences on the welfare distribution and an official to mediate the coordination among them. Based on a simple assumption that an individual's w...

In this paper, a Scalable Proportional Integral (SPI) active queue management (AQM) algorithm for High Speed TCP (HSTCP) is proposed. Based on the linearization model for HSTCP, we give a stability analysis for the closed loop interconnection systems (HSTCP and SPI AQM). Then, an adaptive parameters setting method for SPI AQM is presented. Using ns2 simulation, we illustrate that SPI shows sati...

In this paper, we exploit the uplink radio resource allocation considering proportional fairness among users in heterogeneous wireless networks. Meanwhile, multi-mode user terminals are assumed to have the capability of using multiple radio access technologies simultaneously. To this end, a joint optimization problem is formulated for power and bandwidth allocation for uplink transmission. Sinc...

Dong-Yong Kwak et al. 475 In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the...

We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social welfare) are the most critical criteria to satisfy and optimize, respectively. We study computational complexity of computing an efficiency optimal division given the conditions that the allocation satisfies proportional f...

We have proposed a high-speed fluid-flow rate allocation scheme. We show that this method is well suited for ephemeral web-like traffic which is proliferating as network speed is increasing. We look at the flow level properties and packet level algorithm. We further discuss the equilibrium properties and show that this algorithm can achieve proportional fairness. The simulation results for both...

In this paper, we consider the sum α-fair utility maximization problem for joint downlink (DL) and uplink (UL) transmissions of a wireless powered communication network (WPCN) via time and power allocation. In the DL, the users with energy harvesting receiver architecture decode information and harvest energy based on simultaneous wireless information and power transfer. While in the UL, the us...