Applying pos(i) rules to communication problems

King Sing Chong; King Chung Lam

doi:10.1239/jap/1032265223

Applying pos(i) rules to communication problems

King Sing Chong, King Chung Lam

Research output: Contribution to journal › Journal article › peer-review

1 Citation (Scopus)

Abstract

A spectrum of self-organizing rules including the move-to-front rule and the transposition rule are applied to the communication problem. The stationary distributions under these rules are obtained. Cost comparison between them is considered. In the special case of three paths, it is shown that the transposition rule always outperforms the moveto- front rule.

Original language	English
Pages (from-to)	762-769
Number of pages	8
Journal	Journal of Applied Probability
Volume	35
Issue number	3
DOIs	https://doi.org/10.1239/jap/1032265223
Publication status	Published - 1 Jan 1998
Externally published	Yes

Scopus Subject Areas

Statistics and Probability
General Mathematics
Statistics, Probability and Uncertainty

User-Defined Keywords

Communication networks
Comparison of search costs
Linear search
Markov chain models

Access to Document

10.1239/jap/1032265223

Cite this

@article{8628d701c02941b7b34f76a14a493857,

title = "Applying pos(i) rules to communication problems",

abstract = "A spectrum of self-organizing rules including the move-to-front rule and the transposition rule are applied to the communication problem. The stationary distributions under these rules are obtained. Cost comparison between them is considered. In the special case of three paths, it is shown that the transposition rule always outperforms the moveto- front rule.",

keywords = "Communication networks, Comparison of search costs, Linear search, Markov chain models",

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

year = "1998",

month = jan,

day = "1",

doi = "10.1239/jap/1032265223",

language = "English",

volume = "35",

pages = "762--769",

journal = "Journal of Applied Probability",

issn = "0021-9002",

publisher = "Cambridge University Press",

number = "3",

}

TY - JOUR

T1 - Applying pos(i) rules to communication problems

AU - Chong, King Sing

AU - Lam, King Chung

PY - 1998/1/1

Y1 - 1998/1/1

N2 - A spectrum of self-organizing rules including the move-to-front rule and the transposition rule are applied to the communication problem. The stationary distributions under these rules are obtained. Cost comparison between them is considered. In the special case of three paths, it is shown that the transposition rule always outperforms the moveto- front rule.

AB - A spectrum of self-organizing rules including the move-to-front rule and the transposition rule are applied to the communication problem. The stationary distributions under these rules are obtained. Cost comparison between them is considered. In the special case of three paths, it is shown that the transposition rule always outperforms the moveto- front rule.

KW - Communication networks

KW - Comparison of search costs

KW - Linear search

KW - Markov chain models

UR - http://www.scopus.com/inward/record.url?scp=0032281976&partnerID=8YFLogxK

U2 - 10.1239/jap/1032265223

DO - 10.1239/jap/1032265223

M3 - Journal article

AN - SCOPUS:0032281976

SN - 0021-9002

VL - 35

SP - 762

EP - 769

JO - Journal of Applied Probability

JF - Journal of Applied Probability

IS - 3

ER -

Applying pos(i) rules to communication problems

Abstract

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this