No CrossRef data available.
Article contents
MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM
Published online by Cambridge University Press: 06 March 2006
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 pi's.
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 20 , Issue 2 , April 2006 , pp. 271 - 286
- Copyright
- © 2006 Cambridge University Press