BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Infinite Networks with Varying Topology - A Mean-Field Approach - 
 Rybko\, AN (Russian Academy of Sciences)
DTSTART:20130812T133000Z
DTEND:20130812T141500Z
UID:TALK46574@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION: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 ha
 s an exit node D(c) which it needs to reach. On the way to its destination
  the customer visits some intermediate nodes\, where it stays in queues. S
 ervice times distributions depend on the customer and on the node types. A
 fter being served at any node v\, the customer c is sent to the server v' 
 which is the closest to the destination server D(c). Once it gets to D(c)\
 , it leaves the network.\nThe main feature of the network is that its node
 s are moving. So while the customer c is waiting in the queue in some node
  v\, this node and its destination node D(c) can move. In such networks wi
 th moving nodes new effects take place\, which are encountered in the situ
 ation with stationary nodes.\n\nMy talk is based on joint paper with Franc
 ois Baccelli and Senya Shlosman. Its main result can be described as follo
 ws: 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 a
 ble to treat them we consider the mean-field version of it\, which consist
 s of N copies of the network\, interconnected in a mean-field manner. We s
 how that as N increases\, the limiting object becomes Non-Linear Markov Pr
 ocess in time. We establish the existence of the NLMP and the convergence 
 to it.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR