Symmetric service discipline (${\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.