MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM

DOI10.1017/S0269964806060177zbMath1141.90347MaRDI QIDQ3431062

Kin-Tak Lam, King Sing Chong

Publication date: 5 April 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Comparison of self-organizing linear search rules
• Reordering heuristics for routing in communications networks
• Optimal list order under partial memory constraints
• On Optimal Performance in Self-Organizing Paging Algorithams
• Two Spectra of Self-Organizing Sequential Search Algorithms
• Stochastic reversibility in self-organizing systems
• On self-organizing sequential search heuristics
• An Account of Self-Organizing Systems
• Applying POS(i) rules to communication problems
• Cost comparison of a spectrum of self-organizing rules
• The stationary distribution of an interesting Markov chain

This page was built for publication: MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM