Latency (engineering)

About: Latency (engineering) is a research topic. Over the lifetime, 7278 publications have been published within this topic receiving 115409 citations. The topic is also known as: lag.

Improving lookup latency in distributed hash table systems using random sampling

Abstract: Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will support the rapid development of a wide variety of Internet-scale applications ranging from naming systems and file systems to application-layer multicast. DHT systems essentially build an overlay network, but a path on the overlay between any two nodes can be significantly different from the unicast path between those two nodes on the underlying network. As such, the lookup latency in these systems can be quite high and can adversely impact the performance of applications built on top of such systems. In this paper, we discuss a random sampling technique that incrementally improves lookup latency in DHT systems. Our sampling can be implemented using information gleaned from lookups traversing the overlay network. For this reason, we call our approach lookup-parasitic random sampling (LPRS). LPRS converges quickly, and requires relatively few modifications to existing DHT systems. For idealized versions of DHT systems like Chord, Tapestry, and Pastry, we analytically prove that LPRS can result in lookup latencies proportional to the average unicast latency of the network, provided the underlying physical topology has a power-law latency expansion. We then validate this analysis by implementing LPRS in the Chord simulator. Our simulations reveal that LPRS-Chord exhibits a qualitatively better latency scaling behavior relative to unmodified Chord. The overhead of LPRS is one sample per lookup hop in the worst case. Finally, we provide evidence which suggests that the Internet router-level topology resembles power-law latency expansion. This finding implies that LPRS has significant practical applicability as a general latency reduction technique for many DHT systems. This finding is also of independent interest since it might inform the design of latency-sensitive topology models for the Internet.

Effects of simulated high altitude exposure on long-latency event-related brain potentials and performance.

Abstract: The N100, P200, N200 and P300 components of the auditory event-related potential were recorded from 10 male subjects at 0900, 1600, and 1830 hours at sea level and again following a rapid ascent to simulated 4300 m altitude. Amplitude and latency of components, ear oximetry, and concurrent performance measures (reaction time and counting errors) were assessed. Amplitude of P300 decreased, while P300 latency and reaction time increased, following ascent to altitude. However, the time course of altitude effects differed for amplitude versus latency. Components N100, P200, N200, and counting errors were unaffected by altitude. The results indicate that central measures of cognitive capacities are differentially sensitive to high altitude. The time course of altitude effects on P300 amplitude versus P300 latency suggests that the two measures reflect different aspects of a response to hypobaric hypoxia exposure.

AI-Assisted Low Information Latency Wireless Networking

Abstract: The 5G Phase-2 and beyond wireless systems will focus more on vertical applications such as autonomous driving and the Industrial Internet of Things, many of which are categorized as uRLLC. In this article, an alternative view of uRLLC is presented, information latency, measuring the distortion of information resulting from time lag of its acquisition process, which is more relevant than conventional communication latency of uRLLC in wireless networked control systems. An AI-assisted SMART is presented to address the information latency optimization challenge. Case studies of typical applications (i.e., dense platooning and intersection management) in AD are demonstrated, which show that SMART can effectively optimize information latency, and more importantly, information latency-optimized systems outperform conventional uRLLC-oriented systems significantly in terms of AD performance such as traffic efficiency, thus pointing out a new research and system design paradigm.

Supporting network coordinates on PlanetLab

Abstract: Large-scale distributed applications need latency information to make network-aware routing decisions. Collecting these measurements, however, can impose a high burden. Network coordinates are a scalable and efficient way to supply nodes with up-to-date latency estimates. We present our experience of maintaining network coordinates on PlanetLab. We present two different APIs for accessing coordinates: a per-application library, which takes advantage of application-level traffic, and a stand-alone service, which is shared across applications. Our results show that statistical filtering of latency samples improves accuracy and stability and that a small number of neighbors is sufficient when updating coordinates.