Jitterapproximation tradeoff for periodic scheduling We consider an asymmetric wireless communication setting, where a server periodically broadcasts data items to different mobile clients. The goal is to serve items into a prescribed rate, while minimizing the energy consumption of the mobile users. Abstractly, we are presented with a set of jobs, each with a known execution time and a requested period, and the task is to design a schedule for these jobs over a single shared resource without preemption. Given any solution schedule, its period approximation is the maximal factor by which the average period of a job in the schedule is blown up w.r.t. its requested period, and the jitter is roughly the maximal variability of times between two consecutive occurrences of the same job. Schedules with low jitter allow the mobile devices to save power by having their receivers switched off longer. In this paper we consider a scenario where clients may be willing to settle for nonoptimal period approximation so that the jitter is improved. We present a parametric jitterapproximation tradeoff algorithm that allows us to choose various combinations between jitter optimality and period optimality for any given set of jobs.

A Scheduling Algorithm for Low Jitter in EthernetBased Fronthaul Due to the low cost, high bandwidth and compatibility of Ethernet, Ethernetbased fronthaul has been utilized to carry sampled radio frequency (RF) signals from radio equipment (RE) to the radio equipment controller (REC). Meeting the stringent performance requirements regarding jitter for the Common Public Radio Interface (CPRI) over Ethernet is challenging. In this paper, a time division multiplexing (TDM) slotbased scheduling (TSS) algorithm is proposed to minimize the jitter; this algorithm consists of two main modules: slot greedy allocation and lowdelay collaboration. Specifically, lowcomplexity slot greedy allocation aims to solve the NPhard problem caused by the optimal slot allocation, and the lowdelay collaboration among different switches is employed to avoid the large delays caused by a strict slot assignment. In the Ethernetbased fronthaul network, the simulation results demonstrate that, compared with the conventional benchmark algorithm, the TSS algorithm ensures lower jitter, and this significant decrease is achieved without incurring a large delay.