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 consider queueing networks (QN) with feedback loops roamed by ``intelligent'' agents, able to select their routing on the basis of their measured waiting times at the QN nodes. This is an idealized model to discuss the dynamics of customers who stay loy ...
The last decade has witnessed a fundamental change in the role of network theory. Side by side with the increasing relevance of interdisciplinarity, this ensemble of mathematical tools and methods has known such a success and such a wide range of different ...
Many sociological networks, as well as biological and technological ones, can be represented in terms of complex networks with a heterogeneous connectivity pattern. Dynamical processes taking place on top of them can be very much influenced by this topolog ...
We consider queueing networks (QN) with feedback loops roamed by "intelligent" agents, able to select their routing on the basis of their measured waiting times at the QN nodes. This is an idealized model to discuss the dynamics of customers who stay loyal ...
The paper presents a procedure for fault location in distribution networks, based on the use of the integrated time-frequency wavelet decompositions of the voltage transients associated with the fault-originated travelling waves. The proposed analysis of t ...
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 ...
Waiting time in any network is often a costly and hence a bad experience. Therefore, to avoid jamming regions becomes essential in the optimization of traffic flows. In this regard, the conception and the control of complex networks supporting flows of uni ...
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 ...
Analytic queueing network models often assume infinite capacity queues due to the difficulty of grasping the between-queue correlation. This correlation can help to explain the propagation of congestion. We present an analytic queueing network model which ...
We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages -matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009