University of Cambridge > > Isaac Newton Institute Seminar Series > Infinite Networks with Varying Topology - A Mean-Field Approach

Infinite Networks with Varying Topology - A Mean-Field Approach

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Stochastic Processes in Communication Sciences

We consider a model of a queuing network, containing infinite moving servers (nodes). The customers of different types are getting into the network in corresponding entrance nodes and each of the customer c has an exit node D© which it needs to reach. On the way to its destination the customer visits some intermediate nodes, where it stays in queues. Service times distributions depend on the customer and on the node types. After being served at any node v, the customer c is sent to the server v’ which is the closest to the destination server D©. Once it gets to D©, it leaves the network. The main feature of the network is that its nodes are moving. So while the customer c is waiting in the queue in some node v, this node and its destination node D© can move. In such networks with moving nodes new effects take place, which are encountered in the situation with stationary nodes.

My talk is based on joint paper with Francois Baccelli and Senya Shlosman. Its main result can be described as follows: we start with the definition of the class of the networks with jumping nodes. The network can be finite or infinitely extended. In order to be able to treat them we consider the mean-field version of it, which consists of N copies of the network, interconnected in a mean-field manner. We show that as N increases, the limiting object becomes Non-Linear Markov Process in time. We establish the existence of the NLMP and the convergence to it.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2021, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity