Applying POS(i) rules to communication problems

Abstract

A spectrum of self-organizing rules including the move-to-front rule and the transposition rule are applied to the communication problem. The stationary distributions under these rules are obtained. Cost comparison between them is considered. In the special case of three paths, it is shown that the transposition rule always outperforms the move-to-front rule.