Proportional Fair (PF) is a scheduling technique to maintain a balance between maximizing throughput and ensuring fairness to users. Dual Connectivity (DC) technique was introduced by the 3rd Generation Partnership Project (3GPP) to improve the mobility robustness and system capacity in heterogeneous networks. In this paper, we demonstrate the utility of DC in improving proportional fairness in the system. We propose a low complexity centralized PF scheduling scheme for DC and show that it outperforms the standard PF scheduling scheme. Since the problem of dual association of users for maximizing proportional fairness in the system is NP-hard, we propose three heuristic user association schemes for DC. We demonstrate that DC, along with the proposed PF scheme, gives remarkable gains on PF utility over single connectivity and performs almost close to the optimal PF scheme in heterogeneous networks.
This paper considers proportional fairness amongst ACs in an EDCA WLAN for provision of distinct QoS requirements and priority parameters. A detailed theoretical analysis is provided to derive the optimal station attempt probability which leads to a proportional fair allocation of station throughputs. The desirable fairness can be achieved using a centralised adaptive control approach. This approach is based on multivariable statespace control theory and uses the Linear Quadratic Integral (LQI) controller to periodically update CWmin till the optimal fair point of operation. Performance evalua…
This letter proposes a control theoretic approach to achieve proportional fairness amongst access categories (ACs) in an error-prone EDCA WLAN for provision of distinct QoS requirements and priority parameters. The approach adaptively adjusts the minimum contention window of each AC to derive the station attempt probability to its optimum which leads to a proportional fair allocation of station throughputs. Evaluation results demonstrate that the proposed control approach has high accuracy performance and fast convergence speed for general network scenarios.
This paper presents a radio resource block allocation optimization problem for cellular communications systems with users running delay-tolerant and real-time applications, generating elastic and inelastic traffic on the network and being modelled as logarithmic and sigmoidal utilities respectively. The optimization is cast under a utility proportional fairness framework aiming at maximizing the cellular systems utility whilst allocating users the resource blocks with an eye on application quality of service requirements and on the procedural temporal and computational efficiency. Ultimately, …
This paper considers the deployment of a hybrid wireless data/power access point in an 802.11-based wireless powered IoT network. The proportionally fair allocation of throughputs across IoT nodes is considered under the constraints of energy neutrality and CPU capability for each device. The joint optimization of wireless powering and data communication resources takes the CSMA/CA random channel access features, e.g. the backoff procedure, collisions, protocol overhead into account. Numerical results show that the optimized solution can effectively balance individual throughput across nodes, …
This paper presents a modified proportional fairness (PF) criterion suitable for mitigating the \textit{rate anomaly} problem of multirate IEEE 802.11 Wireless LANs employing the mandatory Distributed Coordination Function (DCF) option. Compared to the widely adopted assumption of saturated network, the proposed criterion can be applied to general networks whereby the contending stations are characterized by specific packet arrival rates, $λ_s$, and transmission rates $R_d^{s}$. The throughput allocation resulting from the proposed algorithm is able to greatly increase the aggregate throughput…
Time Slotted Channel Hopping (TSCH) is a Medium Access Control (MAC) protocol introduced in IEEE802.15.4e standard, addressing low power requirements of the Internet of Things (IoT) and Low Power Lossy Networks (LLNs). The 6TiSCH Operation sublayer (6top) of IEEE802.15.4e defines the schedule that includes sleep, transmit and receive routines of the nodes. However, the design of schedule is not specified by the standard. In this paper, we propose a contention based proportional fairness (CBPF) transmission scheme for TSCH networks to maximize the system throughput addressing fair allocation of…
Spectrum sharing is an elegant solution to addressing the scarcity of the bandwidth for wireless communications systems. This research studies the feasibility of sharing the spectrum between sectorized cellular systems and stationary radars interfering with certain sectors of the communications infrastructure. It also explores allocating optimal resources to mobile devices in order to provide with the quality of service for all running applications whilst growing the communications network spectrally coexistent with the radar systems. The rate allocation problem is formulated as two convex opt…
This paper presents a modified proportional fairness (PF) criterion suitable for mitigating the \textit{rate anomaly} problem of multirate IEEE 802.11 Wireless LANs employing the mandatory Distributed Coordination Function (DCF) option. Compared to the widely adopted assumption of saturated network, the proposed criterion can be applied to general networks whereby the contending stations are characterized by specific packet arrival rates, $λ_s$, and transmission rates $R_d^{s}$. The throughput allocation resulting from the proposed algorithm is able to greatly increase the aggregate throughput…
This paper focuses on multirate IEEE 802.11 Wireless LAN employing the mandatory Distributed Coordination Function (DCF) option. Its aim is threefold. Upon starting from the multi-dimensional Markovian state transition model proposed by Malone \textit{et.al.} for characterizing the behavior of the IEEE 802.11 protocol at the Medium Access Control layer, it presents an extension accounting for packet transmission failures due to channel errors. Second, it establishes the conditions under which a network constituted by $N$ stations, each station transmitting with its own bit rate, $R^{(s)}_d$, a…
A challenging problem in multi-band multi-cell self-organized wireless systems, such as multi-channel Wi-Fi networks, femto/pico cells in 3G/4G cellular networks, and more recent wireless networks over TV white spaces, is of distributed resource allocation. This involves four components: channel selection, client association, channel access, and client scheduling. In this paper, we present a unified framework for jointly addressing the four components with the global system objective of maximizing the clients throughput in a proportionally fair manner. Our formulation allows a natural dissocia…
The performance of cluster computing depends on how concurrent jobs share multiple data center resource types like CPU, RAM and disk storage. Recent research has discussed efficiency and fairness requirements and identified a number of desirable scheduling objectives including so-called dominant resource fairness (DRF). We argue here that proportional fairness (PF), long recognized as a desirable objective in sharing network bandwidth between ongoing flows, is preferable to DRF. The superiority of PF is manifest under the realistic modelling assumption that the population of jobs in progress i…
Dual Connectivity (DC) is an important lower-layer feature accelerating the transition from 4G to 5G that also is expected to play an important role in standalone 5G radio networks. However, even though the packet reordering introduced by DC can significantly impact the performance of upper-layer protocols, no prior work has studied the impact of DC on QUIC. In this paper, we present the first such performance study. Using a series of throughput and fairness experiments, we show how QUIC is affected by different DC parameters, network conditions, and whether the DC implementation aims to impro…
The number of users adopting Tor to protect their online privacy is increasing rapidly. With a limited number of volunteered relays in the network, the number of clients' connections sharing the same relays is increasing to the extent that it is starting to affect the performance. Recently, Tor's resource allocation among circuits has been studied as one cause of poor Tor network performance. In this paper, we propose two scheduling approaches that guarantee proportional fairness between circuits that are sharing the same connection. In our evaluation, we show that the average-rate-base schedu…
Millimeter wave (mmWave) will play a significant role as a 5G candidate in facing the growing demand of enormous data rate in the near future. The conventional mmWave standard, IEEE 802.11ad, considers establishing only one mmWave link in wireless local area network (WLAN) to provide multi Gbps data rate. But, mmWave has a tenuous channel which hinders it from providing such rate. Hence, it's necessary to establish multiple mmWave links simultaneously by deploying a multiple number of mmWave access points (APs) in 5G networks. Unfortunately, applying conventional standard without any modificat…
In this paper, we consider fair privacy in a shared network subject to traffic analysis attacks by an eavesdropper. We initiate the study of the joint trade-off between privacy, throughput and delay in such a shared network as a utility fairness problem and derive the proportional fair rate allocation for networks of flows subject to privacy constraints and delay deadlines.
This paper investigates the adaptive subcarrier and bit allocation algorithm for OFDMA systems. To minimize overall transmitted power, we propose a novel adaptive subcarrier and bit allocation algorithm based on channel state information (CSI) and quality state information (QSI). A suboptimal approach that separately performs subcarrier allocation and bit loading is proposed. It is shown that a near optimal solution is obtained by the proposed algorithm which has low complexity compared to that of other conventional algorithm. We will study the problem of finding an optimal sub-carrier and pow…
This is Part II of a two-part paper series that studies the use of the proportional fairness (PF) utility function as the basis for capacity allocation and scheduling in multi-channel multi-rate wireless networks. The contributions of Part II are twofold. (i) First, we extend the problem formulation, theoretical results, and algorithms to the case of time-varying channels, where opportunistic capacity allocation and scheduling can be exploited to improve system performance. We lay down the theoretical foundation for optimization that "couples" the time-varying characteristic of channels with t…
In this document we study the application of weighted proportional fairness to data flows in the Internet. We let the users set the weights of their connections in order to maximise the utility they get from the network. When combined with a pricing scheme where connections are billed by weight and time, such a system is known to maximise the total utility of the network. Our study case is a national Web cache server connected to long distance links. We propose two ways of weighting TCP connections by manipulating some parameters of the protocol and present results from simulations and prototy…
Millimeter wave (mmWave) communication has recently attracted significant attention from both industrial and academic communities. The large bandwidth availability as well as low interference nature of mmWave spectrum is particularly attractive for industrial communication. However, inherent challenges such as coverage and blockage of mmWave communication cause highly fluctuated channel quality. This paper explores wireless medium access control (MAC) schedulers for mmWave-based industrial wireless applications. Our objective is to design a high-performance and enhanced fairness MAC scheduling…
In this paper, Long-Term Proportional Fair (LTPF) resource allocation algorithm in dynamic OFDMA system is presented, which provides long-term QoS guarantee (mainly throughput requirement satisfaction) to individual user and follows every user's QoS profile at long-term by incremental optimization of proportional fairness and overall system rate maximization. The LTPF algorithm dynamically allocates the OFDMA sub-carriers to the users in such a way that in long-term the individual QoS requirement is achieved as well as fairness among the users is maintained even in a heterogeneous traffic cond…
This paper first presents a parallel solution for the Flowshop Scheduling Problem in parallel environment, and then proposes a novel load balancing strategy. The proposed Proportional Fairness Strategy (PFS) takes computational performance of computing process sets into account, and assigns additional load to computing nodes proportionally to their evaluated performance. In order to efficiently utilize the power of parallel resource, we also discuss the data structure used in communications among computational nodes and design an optimized data transfer strategy. This data transfer strategy co…
This is Part I of a two-part paper series that studies the use of the proportional fairness (PF) utility function as the basis for capacity allocation and scheduling in multi-channel multi-rate wireless networks. The contributions of Part I are threefold. (i) First, we lay down the theoretical foundation for PF. Specifically, we present the fundamental properties and physical/economic interpretation of PF. We show by general mathematical arguments that PF leads to equal airtime allocation to users for the single-channel case; and equal equivalent airtime allocation to users for the multi-chann…
We consider two elementary (max-flow and uniform-flow) and two realistic (max-min fairness and proportional fairness) congestion control schemes, and analyse how the algorithms and network structure affect throughput, the fairness of flow allocation, and the location of bottleneck edges. The more realistic proportional fairness and max-min fairness algorithms have similar throughput, but path flow allocations are more unequal in scale-free than in random regular networks. Scale-free networks have lower throughput than their random regular counterparts in the uniform-flow algorithm, which is fa…
In this paper, we revisit the widely known performance anomaly that results in severe network utility degradation in WiFi networks when nodes use diverse modulation and coding schemes. The proportional-fair allocation was shown to mitigate this anomaly and provide a good throughput to the stations. It can be achieved through the selection of contention window values based on the explicit solution of an optimization problem or, as proposed recently, by following a learning-based approach that uses a centralized gradient descent algorithm. In this paper, we leverage our recent theoretical work o…
In this paper, we introduce an approach for application-aware resource block scheduling of elastic and inelastic adaptive real-time traffic in fourth generation Long Term Evolution (LTE) systems. The users are assigned to resource blocks. A transmission may use multiple resource blocks scheduled over frequency and time. In our model, we use logarithmic and sigmoidal-like utility functions to represent the users applications running on different user equipments (UE)s. We present an optimal problem with utility proportional fairness policy, where the fairness among users is in utility percentage…
This work aims at combining adaptive protocol design, utility maximization and stochastic geometry. We focus on a spatial adaptation of Aloha within the framework of ad hoc networks. We consider quasi-static networks in which mobiles learn the local topology and incorporate this information to adapt their medium access probability (MAP) selection to their local environment. We consider the cases where nodes cooperate in a distributed way to maximize the global throughput or to achieve either proportional fair or max-min fair medium access. In the proportional fair case, we show that nodes can …
In this paper, we analyze some local stability and local bifurcation properties of the Proportionally fair, TCP fair, and the Delay-based dual algorithms in the presence of two distinct time delays. In particular, our focus is on the interplay between different notions of fairness, stability, and bifurcation theoretic properties. Different notions of fairness give rise to different non-linear models for the class of Dual algorithms. One can devise conditions for local stability, for each of these models, but such conditions do not offer clear design recommendations on which fairness criteria i…
This paper investigates the system spectral efficiency (SE) in reconfigurable intelligent surface (RIS)-aided multiuser multiple-input single-output (MISO) systems, where RIS can reconfigure the propagation environment via a large number of controllable and intelligent phase shifters. In order to explore the system SE performance behavior with user proportional fairness for such a system, an optimization problem is formulated to maximize the SE by jointly considering the power allocation at the base station (BS) and phase shift at the RIS, under nonlinear proportional rate fairness constraints…
In networking and computing, resource allocation is typically addressed using classical sharing protocols as, for instance, the proportional division rule, the max-min fair allocation , or other solutions inspired by cooperative game theory. In this paper, we argue that, describing the resource allocation problem as a cooperative game, such classical resource allocation approaches, as well as associated notions of fairness, show important limitations. We identify in the individual satisfaction rate the key aspect of the challenge of defining a new notion of fairness and, consequently, a resour…
Information-centric networking extensively uses universal in-network caching. However, developing an efficient and fair collaborative caching algorithm for selfish caches is still an open question. In addition, the communication overhead induced by collaboration is especially poorly understood in a general network setting such as realistic ISP and Autonomous System networks. In this paper, we address these two problems by modeling the in-network caching problem as a Nash bargaining game. We show that the game is a convex optimization problem and further derive the corresponding distributed alg…
We integrate a wireless powered communication network with a cooperative cognitive radio network, where multiple secondary users (SUs) powered wirelessly by a hybrid access point (HAP) help a primary user relay the data. As a reward for the cooperation, the secondary network gains the spectrum access where SUs transmit to HAP using time division multiple access. To maximize the sum-throughput of SUs, we present a secondary sum-throughput optimal resource allocation (STORA) scheme. Under the constraint of meeting target primary rate, the STORA scheme chooses the optimal set of relaying SUs and …
We consider network utility maximization problems over heterogeneous cellular networks (HetNets) that permit dual connectivity. Dual connectivity (DC) is a feature that targets emerging practical HetNet deployments that will comprise of non-ideal (higher latency) connections between transmission nodes, and has been recently introduced to the LTE-Advanced standard. DC allows for a user to be simultaneously served by a macro node as well as one other (typically micro or pico) node and requires relatively coarser level coordination among serving nodes. For such a DC enabled HetNet we comprehensiv…
