A Min-Plus System Theory for Constrained Traffic Regulation and Dynamic Service Guarantees
Publications associées (78)
Graph Chatbot
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.
We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, ...
The framework of complex networks has been shown to describe adequately a wide class of complex systems made up of a large number of interacting units. In this framework, a node is associated to each unit and two nodes are connected by an edge if the two u ...
A novel technique for the recording of large sets of room impulse responses or head-related transfer functions is presented. The technique uses a microphone or a loudspeaker moving with constant speed. Given a setup (e.g. length of the room impulse respons ...
We develop three functions around the MAC layer: (1) Pseudo broadcast is a technique used to improve throughput of broadcast transmissions in case of congested networks. The mechanism consists in sending a packet in unicast to a station using RTS/CTS. Othe ...
The article analyzes the influence of the Internet Protocol (IP) access interface on the packet loss probability and delay times in the optical packet switched network. The network and node model have been proposed, and the structure of the IP access inter ...
This chapter takes a new look at the concept of identifiability and of informative experiments for linear time-invariant systems, both in open-loop and in closed-loop identification. Some readers might think that everything has been said and written about ...
Queueing network models have been widely applied as tools allowing the estimation of performance measures and the behavioural description of systems such as communication, production and software architecture networks. Queueing network models with finite c ...
In a network with capacity constraints congestion effects such as bottlenecks, spillbacks and gridlocks can be observed. These can be described with a queueing network model. The main challenge of such an approach lies in adequately capturing the between-q ...
In a network with capacity constraints congestion effects such as bottlenecks, spillbacks and gridlocks can be observed. These can be described with a queueing network model. The main challenge of such an approach lies in adequately capturing the between-q ...
Reordering the eigenvalues of a periodic matrix pair is a computational task that arises from various applications related to discrete-time periodic descriptor systems, such as pole placement or linear-quadratic optimal control. However, it is also implici ...