A0305
Title: Heterogeneous Graphon JSQ(d) model
Authors: Arka Ghosh - (United States) [presenting]
Yan-Han Chen - Iowa State University (United States)
Ruoyu Wu - Iowa State University (United States)
Abstract: A variation of the supermarket model is considered in which a task arriving at a dispatcher is routed to one of its neighborhood servers based on the JSQ(d) strategy. Both heterogeneous dispatchers and servers are considered whose neighborhood relationships are described by a deterministic graphon. The evolution of the queue length for each server is described in the form of stochastic differential equations in which the interaction between servers exists. The law of large number results, both locally and globally, are established as the size of the system grows and the underlying graphons converge. The interacting system is proven to converge to an independent but heterogeneous system.
