Steady state queue depth probabilities are critical for evaluating average waiting times in computer networks. An improvement to the analytical approach of Srimani and Mishra is presented in this paper, and then compa...
详细信息
Steady state queue depth probabilities are critical for evaluating average waiting times in computer networks. An improvement to the analytical approach of Srimani and Mishra is presented in this paper, and then compared to empirical simulation evidence. The proposed expressions are demonstrated to be superior to Srimani and Mishra's.
A number of mutual exclusion algorithms are studied by representing them as agents in the Calculus of Communicating Systems and using an automated tool embodying some of the theory of the Calculus to analyse the repre...
详细信息
暂无评论