Move-Forward Rules And f-SWap Rules Applied To A Communication Problem

  • Authors:

  • King Sing Chong;Kin Lam

  • Affiliations:

  • Department of Finance and Decision Sciences, Hong Kong Baptist University, Kowloon Tong, Hong Kong, E-mail: kschong@hkbu.edu.hk/ lamkin@hkbu.edu.hk;Department of Finance and Decision Sciences, Hong Kong Baptist University, Kowloon Tong, Hong Kong, E-mail: kschong@hkbu.edu.hk/ lamkin@hkbu.edu.hk

  • Venue:
  • Probability in the Engineering and Informational Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.