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

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Dynamical flow networks serve as macroscopic models for, e.g., transportation networks, queuing networks, and distribution networks. While the flow dynamics in such networks follow the conservation of mass on the links, the outflow from each link is often ...

Macroscopic fundamental diagrams (MFDs) have been widely adopted to model the traffic flow of large-scale urban networks. Coupling perimeter control and regional route guidance (PCRG) is a promising strategy to decrease congestion heterogeneity and reduce ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...

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 ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

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 ...

This work addresses the problem of learning the topology of a network from the signals emitted by the network nodes. These signals are generated over time through a linear diffusion process, where neighboring nodes exchange messages according to the underl ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

Ridesourcing has driven a lot of attention in recent years with the expansion of companies like Uber, Lift, and many others around the world. Companies use mobile applications connected through the internet to match drivers and their passengers real-time. ...

Microscopic traffic flow models can be distinguished in lane-based or lane-free depending on the degree of lane-discipline. This distinction holds true only if motorcycles are neglected in lane-based traffic. In cities, as opposed to highways, this is an o ...

Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...

We propose a novel system leveraging deep learning-based methods to predict urban traffic accidents and estimate their severity. The major challenge is the data imbalance problem in traffic accident prediction. The problem is caused by numerous zero values ...

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

The decentralisation and unpredictability of new renewable energy sources require rethinking our energy system. Data-driven approaches, such as reinforcement learning (RL), have emerged as new control strategies for operating these systems, but they have n ...

We are used to defining network neutrality as absence of traffic differentiation, like policing or shaping. These mechanisms, however, are often not what determines end-users’ quality of experience (QoE). Most content today is accessed through edge caches, ...

Maximal subgraph mining is increasingly important in various domains, including bioinformatics, genomics, and chemistry, as it helps identify common characteristics among a set of graphs and enables their classification into different categories. Existing ...

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...

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

Chattez avec Graph Search

A ride time-oriented scheduling algorithm for dial-a-ride problems

The Strong Integral Input-to-State Stability Property in Dynamical Flow Networks

An Iterative Adaptive Dynamic Programming Approach for Macroscopic Fundamental Diagram-Based Perimeter Control and Route Guidance

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Learning to Remove Cuts in Integer Linear Programming

Succinct ordering and aggregation constraints in algebraic array theories

Global, Passive Detection of Connection Tampering

Results on Sparse Integer Programming and Geometric Independent Sets

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

Estimating the Topology of Preferential Attachment Graphs Under Partial Observability

Approximation Algorithms for Allocation and Network Design

Modeling and Optimization of Ridesplitting Operations

A hybrid microscopic model for multimodal traffic with empirical observations from aerial footage

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

From Prediction to Prevention: Leveraging Deep Learning in Traffic Accident Prediction Systems

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Reinforcement Learning for Joint Design and Control of Battery-PV Systems

Caching and Neutrality

Scalable maximal subgraph mining with backbone-preserving graph convolutions

Extractable Witness Encryption for the Homogeneous Linear Equations Problem