= Symmetric service discipline
{title2=$\delta_i(n)=\gamma_i(n)$}
In an ordered queue, let $\gamma_i(n)$ be the fraction of service capacity assigned to position $i$ when $n$ customers are present. A symmetric discipline inserts an arrival into position $i$ with probability $\gamma_i(n+1)$. The same position rule for service and insertion makes transitions satisfy <detailed balance> for the word weights $\prod_i\alpha_{c_i}/\mu_{c_i}$. It accommodates class-dependent exponential service rates; <processor sharing> is an example.
Back to article page
