Analytic queueing network models constitute a flexible tool for the study of network flow. These aggregate models are simple to manipulate and their analytic aspect renders them suitable for use within an optimization framework. Analytic queueing network m ...
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 ...
2007
Graph Chatbot
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.
We address the problem of delay-constrained streaming of multimedia packets over dynamic bandwidth channels. Efficient streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the media packets to be transmitted, acc ...
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 ...
We consider the rate allocation problem when two users (each one associated with one receiver) send packets through a symmetric broadcast channel. Under the assumption that the packet lengths are exponentially distributed, we establish the delay optimality ...
We address the problem of delay-constrained streaming of multimedia packets over dynamic bandwidth channels. Efficient streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the media packets to be transmitted, acc ...
Analytic queueing network models often assume infinite capacity for all queues. For real systems this infinite capacity assumption does not hold, but is often maintained due to the difficulty of grasping the between-queue correlation structure present in f ...
Analytic queueing network models constitute a flexible tool for the study of network flow. These aggregate models are simple to manipulate and their analytic aspect renders them suitable for use within an optimization framework. Analytic queueing network m ...
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 ...
We consider the following packet coding scheme: The coding node has a fixed, finite memory in which it stores packets formed from an incoming packet stream, and it sends packets formed from random linear combinations of its memory contents. We analyze the ...