Move-forward rules and f-SWAP rules applied to a communication problem

King Sing Chong*, Kin Lam

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

2 Downloads (Pure)

Abstract

In a communication network, one might attempt to route calls from an origin to a destination through n paths that will be tried one by one, each having a success probability pi ∈ (0,1), i = 1,2,. . . , n. The order of trying is controlled by a routing table. The number of attempts made is defined as the cost of the routing table. Move-forward self-organizing rules are applied to the routing table and comparisons of expected equilibrium costs are performed when p2= p3=⋯ = pn. Stationary distributions for a subset of f-swap rules are obtained for general p i's.

Original languageEnglish
Pages (from-to)271-286
Number of pages16
JournalProbability in the Engineering and Informational Sciences
Volume20
Issue number2
Early online date6 Mar 2006
DOIs
Publication statusPublished - Apr 2006
Externally publishedYes

Scopus Subject Areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'Move-forward rules and f-SWAP rules applied to a communication problem'. Together they form a unique fingerprint.

Cite this