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.
It is well known that a simple binary feedback rate--based congestion avoidance scheme cannot ensure a fairness goal of the Available Bit Rate (ABR) service, namely, max--min fairness. In this paper we show how the rates are distributed for the network con ...
We explore the scheduling rules and the hedging levels that can be obtained by using a restless bandit problem formulation of a make-to-stock production. The underlying dynamics are a Markov chain in continuous time and the associated rewards are piecewise ...
We explore the scheduling rules and the hedging levels that can be obtained by using a Restless Bandit Problem formulation of a make-to-stock production. The underlying dynamics are markov chain in continuous lime and the associate reward are piecewise lin ...
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair allocation; in most, but not all cases, they are based on the notion ...
