stochastic networks

Tuesday, May 15, 2018 - 9:00am - 9:50am
Amarjit Budhiraja (University of North Carolina, Chapel Hill)
We consider resource sharing networks of the form introduced in the work of Massoulié and Roberts(2000) as models for Internet flows. The goal is to study the open problem, formulated in Harrison et al. (2014), of constructing simple form rate allocation policies for broad families of resource sharing networks with associated costs converging to the Hierarchical Greedy Ideal performance in the heavy traffic limit. We consider two types of cost criteria, an infinite horizon discounted cost, and a long time average cost per unit time.
Monday, October 19, 2015 - 3:15pm - 4:05pm
Kavita Ramanan (Brown University)
We develop a general framework for the study of a class of randomized load balancing models in networks with many servers and in the presence of general service distributions. A key ingredient is a convenient Markovian
Monday, October 19, 2015 - 11:30am - 12:20pm
Francois Baccelli (The University of Texas at Austin)
This talk is motivated by the study of geometric routing algorithms used for navigating stationary point processes. The mathematical abstraction for such a navigation is a class of non-measure preserving dynamical systems on counting measures called point-maps. The talk will focus on two objects associated with a point map $f$ acting on a stationary point process $Phi$:
Subscribe to RSS - stochastic networks