Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

Time-sensitive networks provide worst-case guarantees for applications in domains such as the automobile, automation, avionics, and the space industries. A violation of these guarantees can cause considerable financial loss and serious damage to human live ...

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

In this work, we carry out the first, in-depth, privacy analysis of Decentralized Learning-a collaborative machine learning framework aimed at addressing the main limitations of federated learning. We introduce a suite of novel attacks for both passive and ...

In-network devices around the world monitor and tamper with connections for many reasons, including intrusion prevention, combating spam or phishing, and country-level censorship. Connection tampering seeks to block access to specific domain names or keywo ...

Weighted Round-Robin (WRR) is often used, due to its simplicity, for scheduling packets or tasks. With WRR, a number of packets equal to the weight allocated to a flow can be served consecutively, which leads to a bursty service. Interleaved Weighted Round ...

Deficit Round-Robin (DRR) is a widespread scheduling algorithm that provides fair queueing with variable-length packets. Bounds on worst-case delays obtained with DRR were found by Boyer et al. They used a rigorous network calculus approach and characteriz ...

This study aims to explore the possibility of estimating a multitude of kinematic and dynamic quantities using subject-specific musculoskeletal models in real-time. The framework was designed to operate with marker-based and inertial measurement units enab ...

In engineering, oscillatory instabilities and resonances are often considered undesirable flow features and measures are taken to avoid them. This may include avoiding certain parametric regions or implementing control and mitigation strategies. However, t ...

Techniques are disclosed for adaptive coding and scheduling of packets in wireless networks. The adaptive coding and scheduling can be achieved by utilizing a discrete water filling (DWF) scheme. In an example, a computer-implemented method to adaptively c ...

The landscape of computing is changing, thanks to the advent of modern networking equipment that allows machines to exchange information in as little as one microsecond. Such advancement has enabled microsecond-scale distributed computing, where entire dis ...

In time-sensitive networks, bounds on worst-case delays are typically obtained by using network calculus and assuming that flows are constrained by bit-level arrival curves. However, in IEEE TSN or IETF DetNet, source flows are constrained on the number of ...

Bioaerosols are emitted from various sources into the indoor environment and can positively and negatively impact human health. Humans are the major source of bioaerosol emissions indoors, specifically for bacteria. However, efficient sampling to guarantee ...

Flow reshaping is used in time-sensitive networks (as in the context of IEEE TSN and IETF Detnet) in order to reduce burstiness inside the network and to support the computation of guaranteed latency bounds. This is performed using per-flow regulators (suc ...

Most network data are collected from partially observable networks with both missing nodes and missing edges, for example, due to limited resources and privacy settings specified by users on social media. Thus, it stands to reason that inferring the missin ...

Counting single photons and measuring their arrival time is of crucial importance for imaging and quantum applications that use single photons to outperform classical techniques. The investigation of the coincidence, i.e. correlation, between photons can b ...

In this thesis, we developed a research direction that combines the theoretical concepts of complex networks with practical needs and applications in the field of transportation engineering. As a first objective we analyzed the phenomenon of congestion pr ...

In order to facilitate and assist the indoor mobility of people with special needs, the classically static objects in the environment, such as furniture, can be rendered mobile. The need for efficient and safe autonomous coordination of a mobile furniture ...

Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

Chat with Graph Search

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

A Network Calculus Analysis of Asynchronous Mechanisms in Time-Sensitive Networks

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

On the (In)security of Peer-to-Peer Decentralized Machine Learning

Global, Passive Detection of Connection Tampering

Interleaved Weighted Round-Robin: A Network Calculus Analysis

Special Issue: Smart Resilient Manufacturing

Deficit Round-Robin: A Second Network Calculus Analysis

Real-Time Musculoskeletal Kinematics and Dynamics Analysis Using Marker- and IMU-Based Solutions in Rehabilitation

Self-sustained dynamics and forced resonant oscillations in flows: cross-junction jets and sloshing liquids

Network coded multipath and related techniques

Reliable Microsecond-Scale Distributed Computing

Improved Network-Calculus Nodal Delay-Bounds in Time-Sensitive Networks

Comparison of two methods for bioaerosol sampling and characterization in a low-biomass chamber environment

Interleaved Weighted Round-Robin: A Network Calculus Analysis

On Time Synchronization Issues in Time-Sensitive Networks with Regulators and Nonideal Clocks

DeepNC: Deep Generative Network Completion

Assessment of the Bundle SNSPD Plus FPGA-Based TDC for High-Performance Time Measurements

A complex networks approach to traffic flow theory: measures and models

A Dynamical System Approach to Decentralized Collision-free Autonomous Coordination of a Mobile Assistive Furniture Swarm