An excellent example of scholarship in the affirmation of techniques addressing insensitivity in processor-sharing networks is presented in this paper. The authors clearly state the purpose of the paper: to show that the stationary distribution of the network state is insensitive to the distribution of service times, if and only if the service capabilities are balanced. After this introduction, the authors painstakingly present their research.

The model and the balance property that characterize whittle networks are described in the first part of the paper. Insensitivity results and performance results are detailed. The paper ends with a presentation of two examples that illustrate the beneficial results of the research. The definitions and theorems presented are sophisticated. They deal with whittle networks, conditional expected sojourn time, closed networks, state-dependent arrival rates and routing, and application of the research to communication networks.

This paper is certainly not bedtime reading, but if you are a professional concerned with processor-sharing networks, it will be of significant interest.