744 research outputs found
A Delay-Optimal Packet Scheduler for M2M Uplink
In this paper, we present a delay-optimal packet scheduler for processing the
M2M uplink traffic at the M2M application server (AS). Due to the
delay-heterogeneity in uplink traffic, we classify it broadly into
delay-tolerant and delay-sensitive traffic. We then map the diverse delay
requirements of each class to sigmoidal functions of packet delay and formulate
a utility-maximization problem that results in a proportionally fair
delay-optimal scheduler. We note that solving this optimization problem is
equivalent to solving for the optimal fraction of time each class is served
with (preemptive) priority such that it maximizes the system utility. Using
Monte-Carlo simulations for the queuing process at AS, we verify the
correctness of the analytical result for optimal scheduler and show that it
outperforms other state-of-the-art packet schedulers such as weighted round
robin, max-weight scheduler, fair scheduler and priority scheduling. We also
note that at higher traffic arrival rate, the proposed scheduler results in a
near-minimal delay variance for the delay-sensitive traffic which is highly
desirable. This comes at the expense of somewhat higher delay variance for
delay-tolerant traffic which is usually acceptable due to its delay-tolerant
nature.Comment: Accepted for publication in IEEE MILCOM 2016 (6 pages, 7 figures
Selective Fair Scheduling over Fading Channels
Imposing fairness in resource allocation incurs a loss of system throughput,
known as the Price of Fairness (). In wireless scheduling, increases
when serving users with very poor channel quality because the scheduler wastes
resources trying to be fair. This paper proposes a novel resource allocation
framework to rigorously address this issue. We introduce selective fairness:
being fair only to selected users, and improving by momentarily blocking
the rest. We study the associated admission control problem of finding the user
selection that minimizes subject to selective fairness, and show that
this combinatorial problem can be solved efficiently if the feasibility set
satisfies a condition; in our model it suffices that the wireless channels are
stochastically dominated. Exploiting selective fairness, we design a stochastic
framework where we minimize subject to an SLA, which ensures that an
ergodic subscriber is served frequently enough. In this context, we propose an
online policy that combines the drift-plus-penalty technique with
Gradient-Based Scheduling experts, and we prove it achieves the optimal .
Simulations show that our intelligent blocking outperforms by 40 in
throughput previous approaches which satisfy the SLA by blocking low-SNR users
Fluid flow queue models for fixed-mobile network evaluation
A methodology for fast and accurate end-to-end KPI, like throughput and delay, estimation is proposed based on the service-centric traffic flow analysis and the fluid flow queuing model named CURSA-SQ. Mobile network features, like shared medium and mobility, are considered defining the models to be taken into account such as the propagation models and the fluid flow scheduling model. The developed methodology provides accurate computation of these KPIs, while performing orders of magnitude faster than discrete event simulators like ns-3. Finally, this methodology combined to its capacity for performance estimation in MPLS networks enables its application for near real-time converged fixed-mobile networks operation as it is proven in three use case scenarios
Active Queue Management for Fair Resource Allocation in Wireless Networks
This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a common access point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP New Reno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit, and this allows the scheduler to allocate bandwidth fairly between the users
- âŚ