2,868 research outputs found
Asymptotically Optimal Load Balancing Topologies
We consider a system of servers inter-connected by some underlying graph
topology . Tasks arrive at the various servers as independent Poisson
processes of rate . Each incoming task is irrevocably assigned to
whichever server has the smallest number of tasks among the one where it
appears and its neighbors in . Tasks have unit-mean exponential service
times and leave the system upon service completion.
The above model has been extensively investigated in the case is a
clique. Since the servers are exchangeable in that case, the queue length
process is quite tractable, and it has been proved that for any ,
the fraction of servers with two or more tasks vanishes in the limit as . For an arbitrary graph , the lack of exchangeability severely
complicates the analysis, and the queue length process tends to be worse than
for a clique. Accordingly, a graph is said to be -optimal or
-optimal when the occupancy process on is equivalent to that on
a clique on an -scale or -scale, respectively.
We prove that if is an Erd\H{o}s-R\'enyi random graph with average
degree , then it is with high probability -optimal and
-optimal if and as , respectively. This demonstrates that optimality can
be maintained at -scale and -scale while reducing the number of
connections by nearly a factor and compared to a
clique, provided the topology is suitably random. It is further shown that if
contains bounded-degree nodes, then it cannot be -optimal.
In addition, we establish that an arbitrary graph is -optimal when its
minimum degree is , and may not be -optimal even when its minimum
degree is for any .Comment: A few relevant results from arXiv:1612.00723 are included for
convenienc
Bit Allocation Law for Multi-Antenna Channel Feedback Quantization: Single-User Case
This paper studies the design and optimization of a limited feedback
single-user system with multiple-antenna transmitter and single-antenna
receiver. The design problem is cast in form of the minimizing the average
transmission power at the base station subject to the user's outage probability
constraint. The optimization is over the user's channel quantization codebook
and the transmission power control function at the base station. Our approach
is based on fixing the outage scenarios in advance and transforming the design
problem into a robust system design problem. We start by showing that uniformly
quantizing the channel magnitude in dB scale is asymptotically optimal,
regardless of the magnitude distribution function. We derive the optimal
uniform (in dB) channel magnitude codebook and combine it with a spatially
uniform channel direction codebook to arrive at a product channel quantization
codebook. We then optimize such a product structure in the asymptotic regime of
, where is the total number of quantization feedback
bits. The paper shows that for channels in the real space, the asymptotically
optimal number of direction quantization bits should be times
the number of magnitude quantization bits, where is the number of base
station antennas. We also show that the performance of the designed system
approaches the performance of the perfect channel state information system as
. For complex channels, the number of magnitude and
direction quantization bits are related by a factor of and the system
performance scales as as .Comment: Submitted to IEEE Transactions on Signal Processing, March 201
A heuristic approach for the allocation of resources in large-scale computing infrastructures
An increasing number of enterprise applications are intensive in their consumption of IT, but are infrequently used. Consequently, organizations either host an oversized IT infrastructure or they are incapable of realizing the benefits of new applications. A solution to the challenge is provided by the large-scale computing infrastructures of Clouds and Grids which allow resources to be shared. A major challenge is the development of mechanisms that allow efficient sharing of IT resources. Market mechanisms are promising, but there is a lack of research in scalable market mechanisms. We extend the Multi-Attribute Combinatorial Exchange mechanism with greedy heuristics to address the scalability challenge. The evaluation shows a trade-off between efficiency and scalability. There is no statistical evidence for an influence on the incentive properties of the market mechanism. This is an encouraging result as theory predicts heuristics to ruin the mechanism’s incentive properties. Copyright © 2015 John Wiley & Sons, Ltd
- …