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

King Sing Chong; Kin Lam

doi:10.1017/s0269964806060177

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 journal › Journal article › peer-review

13 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 p_i ∈ (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 p₂= p₃=⋯ = p_n. Stationary distributions for a subset of f-swap rules are obtained for general p _i's.

Original language	English
Pages (from-to)	271-286
Number of pages	16
Journal	Probability in the Engineering and Informational Sciences
Volume	20
Issue number	2
Early online date	6 Mar 2006
DOIs	https://doi.org/10.1017/s0269964806060177
Publication status	Published - Apr 2006
Externally published	Yes

Scopus Subject Areas

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

Access to Document

10.1017/s0269964806060177

Full TextAccepted author manuscript, 8.92 MB

Cite this

@article{bbac30f335d047279d44532315465001,

title = "Move-forward rules and f-SWAP rules applied to a communication problem",

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.",

author = "Chong, {King Sing} and Kin Lam",

note = "The authors would like to acknowledge the support provided by the Hong Kong University Grants Council (grant No. RGC 2011/98H).",

year = "2006",

month = apr,

doi = "10.1017/s0269964806060177",

language = "English",

volume = "20",

pages = "271--286",

journal = "Probability in the Engineering and Informational Sciences",

issn = "0269-9648",

publisher = "Cambridge University Press",

number = "2",

}

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 -

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

Abstract

Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this