pith. sign in

arxiv: 1212.3231 · v3 · pith:KGNDLCU7new · submitted 2012-12-13 · 🧮 math.PR

A quantitative differential equation approximation for a routing model

classification 🧮 math.PR
keywords alongcalldifferentialendpointsequationmodelnetworkapproximated
0
0 comments X
read the original abstract

We consider a Markovian load balancing model on a fully-connected network, where calls have Poisson arrivals and exponential durations. The endpoints of each call are uniform over all the links of the network. Each call is routed either along the link connecting its endpoints, or, if the direct route is unavailable, along a two-link path between them, via an intermediate node. We use an explicit and simple coupling to show a strong concentration of measure property, and deduce that the evolution of the process may be approximated by a differential equation. The technique is likely to be useful in other settings.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.