Concept

Queueing theory

Related publications (67)

The age of gossip: Spatial mean-field regime

Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossiping, or epidemic algorithms. Similarly, in a network where mobile nodes occasio ...

2009

Cooperative Dynamics of Loyal Customers in Queueing Networks

Max-Olivier Hongler, Olivier Gallay

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 ...

2008

Accounting for congestion and spillbacks in fixed-time traffic signal optimization: an analytical queueing model approach

Michel Bierlaire, Carolina Osorio Pizano

We present and analyze a new aggregate model of urban traffic. The objective is to analytically capture the correlation between the different components of the network while maintaining a tractable model that can be used in an optimization framework. Exist ...

2008

Stability and bounds in aggregate scheduling networks

Gianluca Rizzo

We study networks of FIFO nodes, where flows are constrained by arrival curves. A crucial question with these networks is: Can we derive a bound to the maximum delay that a packet can experience when traversing the network, and to the maximum queue size at ...

EPFL2008

Weariness and Loyalty Loss in Recurrent Service Models

Max-Olivier Hongler, Olivier Gallay

For recurrent service providers (fast-food, entertainment, medical care,...), retaining loyal customers is obviously a key issue. The customers' loyalty essentially depends on their service satisfaction defined via an ad-hoc utility function. Among several ...

2008

Analysis of finite capacity queueing networks

Michel Bierlaire, Carolina Osorio Pizano

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 ...

2007

Describing network congestion and blocking with an analytic queueing network model

Michel Bierlaire, Carolina Osorio Pizano

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

Describing network congestion and blocking with an analytic queueing network model

Michel Bierlaire, Carolina Osorio Pizano

2007

Cooperative dynamics of loyal customers in queueing networks

Max-Olivier Hongler, Olivier Gallay

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 ...

2007

An analytic finite capacity queueing network model capturing blocking, congestion and spillbacks

Michel Bierlaire, Carolina Osorio Pizano

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 ...

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.