TY - JOUR
T1 - Move-forward rules and f-SWAP rules applied to a communication problem
AU - Chong, King Sing
AU - Lam, Kin
N1 - The authors would like to acknowledge the support provided by the Hong Kong University Grants Council (grant No. RGC 2011/98H).
PY - 2006/4
Y1 - 2006/4
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33644901356&partnerID=8YFLogxK
U2 - 10.1017/s0269964806060177
DO - 10.1017/s0269964806060177
M3 - Journal article
AN - SCOPUS:33644901356
SN - 0269-9648
VL - 20
SP - 271
EP - 286
JO - Probability in the Engineering and Informational Sciences
JF - Probability in the Engineering and Informational Sciences
IS - 2
ER -