Reordering heuristics for routing in communications networks-Reference-Cited by-同舟云学术

Reordering heuristics for routing in communications networks

Published:1986-03 Issue:1 Volume:23 Page:130-143
ISSN:0021-9002
Container-title:Journal of Applied Probability
language:en
Short-container-title:Journal of Applied Probability

Author:

Topkis Donald M.

Abstract

Move-to-front and move-to-back heuristics are considered for adaptively reordering routing tables in communications networks. Limiting properties are established for Markov chain models of these heuristics. The limiting distributions of the number of path attempts per call for the two heuristics and for a fixed random permutation are stochastically ordered.

Publisher

Cambridge University Press (CUP)

Subject

Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability

Reference22 articles.

1. The transposition replacement policy with a partial memory

2. Heuristics That Dynamically Organize Data Structures

3. Optimal list order under partial memory constraints

4. A counterexample to a conjecture on optimal list ordering

5. Amortized efficiency of list update and paging rules

Cited by 10 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

2. The List Update Problem: Improved Bounds for the Counter Scheme;Algorithmica;1998-12

3. Applying POS(i) rules to communication problems;Journal of Applied Probability;1998-09

4. Applying POS(i) rules to communication problems;Journal of Applied Probability;1998-09

5. An exact formula for the move-to-front rule for self-organizing lists;Journal of Theoretical Probability;1996-01