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.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A
COMMUNICATION PROBLEM;Probability in the Engineering and Informational Sciences;2006-03-06