23,388 research outputs found
Spectrum Trading: An Abstracted Bibliography
This document contains a bibliographic list of major papers on spectrum
trading and their abstracts. The aim of the list is to offer researchers
entering this field a fast panorama of the current literature. The list is
continually updated on the webpage
\url{http://www.disp.uniroma2.it/users/naldi/Ricspt.html}. Omissions and papers
suggested for inclusion may be pointed out to the authors through e-mail
(\textit{[email protected]})
Enhanced Cluster Computing Performance Through Proportional Fairness
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 is a stochastic
process. In random traffic the strategy-proof property of DRF proves
unimportant while PF is shown by analysis and simulation to offer a
significantly better efficiency-fairness tradeoff.Comment: Submitted to Performance 201
Heart-like fair queuing algorithms (HLFQA)
We propose a new family of fair, work conserving traffic scheduling mechanisms that imitate the behavior of the human heart in the cardiovascular system. The algorithms have MAX (where MAX is the maximum packet size) fairness and O(log N) complexity and thus compare favorably with existing algorithms. The algorithms are simple enough to be implemented in hardwar
Ruin Theory for Dynamic Spectrum Allocation in LTE-U Networks
LTE in the unlicensed band (LTE-U) is a promising solution to overcome the
scarcity of the wireless spectrum. However, to reap the benefits of LTE-U, it
is essential to maintain its effective coexistence with WiFi systems. Such a
coexistence, hence, constitutes a major challenge for LTE-U deployment. In this
paper, the problem of unlicensed spectrum sharing among WiFi and LTE-U system
is studied. In particular, a fair time sharing model based on \emph{ruin
theory} is proposed to share redundant spectral resources from the unlicensed
band with LTE-U without jeopardizing the performance of the WiFi system.
Fairness among both WiFi and LTE-U is maintained by applying the concept of the
probability of ruin. In particular, the probability of ruin is used to perform
efficient duty-cycle allocation in LTE-U, so as to provide fairness to the WiFi
system and maintain certain WiFi performance. Simulation results show that the
proposed ruin-based algorithm provides better fairness to the WiFi system as
compared to equal duty-cycle sharing among WiFi and LTE-U.Comment: Accepted in IEEE Communications Letters (09-Dec 2018
- …