A Theory of Traffic Regulators for Deterministic Networks with Application to Interleaved Regulators

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.

Miniswys motor (property of Miniswys SA) is a piezoelectric, ultrasonic, linear motor intended to be integrated in an optical system for mobile phones. With the aim of continually optimizing their product, Miniswys SA has signed a collaboration agreement with the EPFL. This practical Master project is a first study realized within the framework of this collaboration.

Nodes that build a mobile ad-hoc network participate in a common routing protocol in order to provide multi-hop radio communication. Routing defines how control information is exchanged between nodes in order to find the paths between communication pairs, and how data packets are relayed. Such networks are vulnerable to routing misbehavior, due to faulty, selfish or malicious nodes. Misbehavior disrupts communication, or even makes it impossible in some cases. Misbehavior detection systems aim at removing t

The min-plus theory of greedy shapers has been developed after Cruz`s results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket controller. The theory of greedy shapers establishes a number of properties such as the series decomposition of shapers or the conservation of arrival constraints by re-shaping. It applies in all rigor either to fluid systems, or to packets of constant size such as ATM. For variable length packets, the distortion introduced by packetization

Load balancing apparatus for a data communications network comprises hash logic for computing a hash function on incoming data packets. A threshold detector is connected to the hash logic for triggering, in response to utilization of the downstream objects exceeding a predefined threshold, redefinition in the hash logic of parameters of the hash function from a first set of parameters to a second set of parameters for redistributing the data packets amongst the downstream objects. In use, the hash logic, di

We present Asymmetric Best-Effort, a novel service to provide a throughput versus delay jitter differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-time applications such as interactive audio, receive more losses during bouts of congestion than blue ones. In return, they receive less delay jitter. Both green and blue services are best-effort. The incentive to choose one or other is based on the nature

Alternative Best-Effort (ABE) is a novel service for IP networks which offers applications the choice between receiving a lower end-to-end delay and receiving more overall throughput. Every best effort packet is marked as either green or blue. Green packets receive a low, bounded queueing delay. To ensure blue packets do not suffer as a result, green flows receive less throughput during bouts of congestion. The unique combination of lower delay with reduced throughput for green makes it different from recen

By extending the system theory under the (min,+)-algebra to the time varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic service guarantees. For a constrained traffic regulation problem with maximum tolerable delay d and maximum buffer size q, the optimal regulator that generates the output traffic conforming to a subadditive envelope f and minimizes the number of discarded packets is a concatenation of the g-clipper with g(t) = min[f(t+d), f(t)+q] and

We investigate the interactionof congestion control with the partitioning of source information into components of varying importance for variable bit-rate packet voice and packet video. High-priority transport for the more important signal components results in substantially increased objective service quality. Using a Markov chain voice source model with simple PCM speech encoding and a priority queue, simulation results show a signal-to=noise ratio improvement of 45 dB with two priorities over unprioriti

A Theory of Traffic Regulators for Deterministic Networks with Application to Interleaved Regulators

Chat with Graph Search

Study and optimization of a linear piezoelectric actuator

An Artificial Immune System for Misbehavior Detection in Mobile Ad-Hoc Networks with Virtual Thymus, Clustering, Danger Signal and Memory Detectors

Some Properties Of Variable Length Packet Shapers

Load Balancing in Data Networks

A protection-based approach to QoS in Packet over fiber networks

The Asymmetric Best-Effort Service

The Alternative Best-Effort Service

A Min-Plus System Theory for Constrained Traffic Regulation and Dynamic Service Guarantees

Joint source/channel coding of statistically multiplexed real-time services on packet networks