4,107 research outputs found
Reliable Transmission of Short Packets through Queues and Noisy Channels under Latency and Peak-Age Violation Guarantees
This work investigates the probability that the delay and the peak-age of
information exceed a desired threshold in a point-to-point communication system
with short information packets. The packets are generated according to a
stationary memoryless Bernoulli process, placed in a single-server queue and
then transmitted over a wireless channel. A variable-length stop-feedback
coding scheme---a general strategy that encompasses simple automatic repetition
request (ARQ) and more sophisticated hybrid ARQ techniques as special
cases---is used by the transmitter to convey the information packets to the
receiver. By leveraging finite-blocklength results, the delay violation and the
peak-age violation probabilities are characterized without resorting to
approximations based on large-deviation theory as in previous literature.
Numerical results illuminate the dependence of delay and peak-age violation
probability on system parameters such as the frame size and the undetected
error probability, and on the chosen packet-management policy. The guidelines
provided by our analysis are particularly useful for the design of low-latency
ultra-reliable communication systems.Comment: To appear in IEEE journal on selected areas of communication (IEEE
JSAC
Recommended from our members
Efficient Memory-Protected Integration of Add-On Software Subsystems in Small Embedded Automotive Applications
Current innovations in the automotive industry
evolve mainly in the electronics and software domain. This leads
to an increasing integration of additional software subsystems
into already existing electronic control units (ECUs) to cope with
the raised amount and complexity of present ECUs in modern
high-end vehicles. This paper discusses different approaches
which are required to integrate such add-on software subsystems
in an isolated memory domain, and considers particularly the
special needs of small embedded systems—including the limited
hardware support. Special focus is brought to the efficient detection
of malicious memory accesses, as well as the benefits of
a thereupon possible and adaptable failure-handling strategy.
All investigations are based on a developed memory-protection
framework which has been tailored to the special needs of a sample
vehicle dynamics control system. Its usage allows the combination
of. integrating additional subsystems without reducing the main
application’s availability
Emergency vehicle traffic signal preemption system
An emergency vehicle traffic light preemption system for preemption of traffic lights at an intersection to allow safe passage of emergency vehicles. The system includes a real-time status monitor of an intersection which is relayed to a control module for transmission to emergency vehicles as well as to a central dispatch office. The system also provides for audio warnings at an intersection to protect pedestrians who may not be in a position to see visual warnings or for various reasons cannot hear the approach of emergency vehicles. A transponder mounted on an emergency vehicle provides autonomous control so the vehicle operator can attend to getting to an emergency and not be concerned with the operation of the system. Activation of a priority-code (i.e. Code-3) situation provides communications with each intersection being approached by an emergency vehicle and indicates whether the intersection is preempted or if there is any conflict with other approaching emergency vehicles. On-board diagnostics handle various information including heading, speed, and acceleration sent to a control module which is transmitted to an intersection and which also simultaneously receives information regarding the status of an intersection. Real-time communications and operations software allow central and remote monitoring, logging, and command of intersections and vehicles
Predictable migration and communication in the Quest-V multikernal
Quest-V is a system we have been developing from the ground up, with objectives focusing on safety, predictability and efficiency. It is designed to work on emerging multicore processors with hardware virtualization support. Quest-V is implemented as a ``distributed system on a chip'' and comprises multiple sandbox kernels. Sandbox kernels are isolated from one another in separate regions of physical memory, having access to a subset of processing cores and I/O devices. This partitioning prevents system failures in one sandbox affecting the operation of other sandboxes. Shared memory channels managed by system monitors enable inter-sandbox communication.
The distributed nature of Quest-V means each sandbox has a separate physical clock, with all event timings being managed by per-core local timers. Each sandbox is responsible for its own scheduling and I/O management, without requiring intervention of a hypervisor. In this paper, we formulate bounds on inter-sandbox communication in the absence of a global scheduler or global system clock. We also describe how address space migration between sandboxes can be guaranteed without violating service constraints. Experimental results on a working system show the conditions under which Quest-V performs real-time communication and migration.National Science Foundation (1117025
A Novel Side-Channel in Real-Time Schedulers
We demonstrate the presence of a novel scheduler side-channel in preemptive,
fixed-priority real-time systems (RTS); examples of such systems can be found
in automotive systems, avionic systems, power plants and industrial control
systems among others. This side-channel can leak important timing information
such as the future arrival times of real-time tasks.This information can then
be used to launch devastating attacks, two of which are demonstrated here (on
real hardware platforms). Note that it is not easy to capture this timing
information due to runtime variations in the schedules, the presence of
multiple other tasks in the system and the typical constraints (e.g.,
deadlines) in the design of RTS. Our ScheduLeak algorithms demonstrate how to
effectively exploit this side-channel. A complete implementation is presented
on real operating systems (in Real-time Linux and FreeRTOS). Timing information
leaked by ScheduLeak can significantly aid other, more advanced, attacks in
better accomplishing their goals
- …