2,550 research outputs found
Timely-Throughput Optimal Scheduling with Prediction
Motivated by the increasing importance of providing delay-guaranteed services
in general computing and communication systems, and the recent wide adoption of
learning and prediction in network control, in this work, we consider a general
stochastic single-server multi-user system and investigate the fundamental
benefit of predictive scheduling in improving timely-throughput, being the rate
of packets that are delivered to destinations before their deadlines. By
adopting an error rate-based prediction model, we first derive a Markov
decision process (MDP) solution to optimize the timely-throughput objective
subject to an average resource consumption constraint. Based on a packet-level
decomposition of the MDP, we explicitly characterize the optimal scheduling
policy and rigorously quantify the timely-throughput improvement due to
predictive-service, which scales as
,
where are constants, is the
true-positive rate in prediction, is the false-negative rate, is the
packet deadline and is the prediction window size. We also conduct
extensive simulations to validate our theoretical findings. Our results provide
novel insights into how prediction and system parameters impact performance and
provide useful guidelines for designing predictive low-latency control
algorithms.Comment: 14 pages, 7 figure
Adaptive Network Coding for Scheduling Real-time Traffic with Hard Deadlines
We study adaptive network coding (NC) for scheduling real-time traffic over a
single-hop wireless network. To meet the hard deadlines of real-time traffic,
it is critical to strike a balance between maximizing the throughput and
minimizing the risk that the entire block of coded packets may not be decodable
by the deadline. Thus motivated, we explore adaptive NC, where the block size
is adapted based on the remaining time to the deadline, by casting this
sequential block size adaptation problem as a finite-horizon Markov decision
process. One interesting finding is that the optimal block size and its
corresponding action space monotonically decrease as the deadline approaches,
and the optimal block size is bounded by the "greedy" block size. These unique
structures make it possible to narrow down the search space of dynamic
programming, building on which we develop a monotonicity-based backward
induction algorithm (MBIA) that can solve for the optimal block size in
polynomial time. Since channel erasure probabilities would be time-varying in a
mobile network, we further develop a joint real-time scheduling and channel
learning scheme with adaptive NC that can adapt to channel dynamics. We also
generalize the analysis to multiple flows with hard deadlines and long-term
delivery ratio constraints, devise a low-complexity online scheduling algorithm
integrated with the MBIA, and then establish its asymptotical
throughput-optimality. In addition to analysis and simulation results, we
perform high fidelity wireless emulation tests with real radio transmissions to
demonstrate the feasibility of the MBIA in finding the optimal block size in
real time.Comment: 11 pages, 13 figure
Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks
The power consumption of enormous network devices in data centers has emerged
as a big concern to data center operators. Despite many
traffic-engineering-based solutions, very little attention has been paid on
performance-guaranteed energy saving schemes. In this paper, we propose a novel
energy-saving model for data center networks by scheduling and routing
"deadline-constrained flows" where the transmission of every flow has to be
accomplished before a rigorous deadline, being the most critical requirement in
production data center networks. Based on speed scaling and power-down energy
saving strategies for network devices, we aim to explore the most energy
efficient way of scheduling and routing flows on the network, as well as
determining the transmission speed for every flow. We consider two general
versions of the problem. For the version of only flow scheduling where routes
of flows are pre-given, we show that it can be solved polynomially and we
develop an optimal combinatorial algorithm for it. For the version of joint
flow scheduling and routing, we prove that it is strongly NP-hard and cannot
have a Fully Polynomial-Time Approximation Scheme (FPTAS) unless P=NP. Based on
a relaxation and randomized rounding technique, we provide an efficient
approximation algorithm which can guarantee a provable performance ratio with
respect to a polynomial of the total number of flows.Comment: 11 pages, accepted by ICDCS'1
Finite Horizon Throughput Maximization for a Wirelessly Powered Device over a Time Varying Channel
In this work, we consider an energy harvesting device (EHD) served by an
access point with a single antenna that is used for both wireless power
transfer (WPT) and data transfer. The objective is to maximize the expected
throughput of the EHD over a finite horizon when the channel state information
is only available causally. The EHD is energized by WPT for a certain duration,
which is subject to optimization, and then, EHD transmits its information bits
to the AP until the end of the time horizon by employing optimal dynamic power
allocation. The joint optimization problem is modeled as a dynamic programming
problem. Based on the characteristic of the problem, we prove that a time
dependent threshold type structure exists for the optimal WPT duration, and we
obtain closed form solution to the dynamic power allocation in the uplink
period.Comment: arXiv admin note: substantial text overlap with arXiv:1804.0183
Joint Computation Offloading and Prioritized Scheduling in Mobile Edge Computing
With the rapid development of smart phones, enormous amounts of data are generated and usually require intensive and real-time computation. Nevertheless, quality of service (QoS) is hardly to be met due to the tension between resourcelimited (battery, CPU power) devices and computation-intensive applications. Mobileedge computing (MEC) emerging as a promising technique can be used to copy with stringent requirements from mobile applications. By offloading computationally intensive workloads to edge server and applying efficient task scheduling, energy cost of mobiles could be significantly reduced and therefore greatly improve QoS, e.g., latency. This paper proposes a joint computation offloading and prioritized task scheduling scheme in a multi-user mobile-edge computing system. We investigate an energy minimizing task offloading strategy in mobile devices and develop an effective priority-based task scheduling algorithm with edge server. The execution time, energy consumption, execution cost, and bonus score against both the task data sizes and latency requirement is adopted as the performance metric. Performance evaluation results show that, the proposed algorithm significantly reduce task completion time, edge server VM usage cost, and improve QoS in terms of bonus score. Moreover, dynamic prioritized task scheduling is also discussed herein, results show dynamic thresholds setting realizes the optimal task scheduling. We believe that this work is significant to the emerging mobile-edge computing paradigm, and can be applied to other Internet of Things (IoT)-Edge applications
Energy-Efficient Transmission Schedule for Delay-Limited Bursty Data Arrivals under Non-Ideal Circuit Power Consumption
This paper develops a novel approach to obtaining energy-efficient
transmission schedules for delay-limited bursty data arrivals under non-ideal
circuit power consumption. Assuming a-prior knowledge of packet arrivals,
deadlines and channel realizations, we show that the problem can be formulated
as a convex program. For both time-invariant and time-varying fading channels,
it is revealed that the optimal transmission between any two consecutive
channel or data state changing instants, termed epoch, can only take one of the
three strategies: (i) no transmission, (ii) transmission with an
energy-efficiency (EE) maximizing rate over part of the epoch, or (iii)
transmission with a rate greater than the EE-maximizing rate over the whole
epoch. Based on this specific structure, efficient algorithms are then
developed to find the optimal policies that minimize the total energy
consumption with a low computational complexity. The proposed approach can
provide the optimal benchmarks for practical schemes designed for transmissions
of delay-limited data arrivals, and can be employed to develop efficient online
scheduling schemes which require only causal knowledge of data arrivals and
deadline requirements.Comment: 30 pages, 7 figure
Energy Harvesting Broadband Communication Systems with Processing Energy Cost
Communication over a broadband fading channel powered by an energy harvesting
transmitter is studied. Assuming non-causal knowledge of energy/data arrivals
and channel gains, optimal transmission schemes are identified by taking into
account the energy cost of the processing circuitry as well as the transmission
energy. A constant processing cost for each active sub-channel is assumed.
Three different system objectives are considered: i) throughput maximization,
in which the total amount of transmitted data by a deadline is maximized for a
backlogged transmitter with a finite capacity battery; ii) energy maximization,
in which the remaining energy in an infinite capacity battery by a deadline is
maximized such that all the arriving data packets are delivered; iii)
transmission completion time minimization, in which the delivery time of all
the arriving data packets is minimized assuming infinite size battery. For each
objective, a convex optimization problem is formulated, the properties of the
optimal transmission policies are identified, and an algorithm which computes
an optimal transmission policy is proposed. Finally, based on the insights
gained from the offline optimizations, low-complexity online algorithms
performing close to the optimal dynamic programming solution for the throughput
and energy maximization problems are developed under the assumption that the
energy/data arrivals and channel states are known causally at the transmitter.Comment: published in IEEE Transactions on Wireless Communication
- …