Location of concentrators in a computer communication network: a stochastic automation search method

Krishnan, R. ; Krishna, G. ; Deekshatulu, B. L. (1976) Location of concentrators in a computer communication network: a stochastic automation search method International Journal of Systems Science, 7 (11). pp. 1201-1207. ISSN 0020-7721

Full text not available from this repository.

Official URL: http://www.informaworld.com/smpp/content~db=all~co...

Related URL: http://dx.doi.org/10.1080/00207727608941997


The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (m K) ways (m > K) or (K m) ways (K > m). (All possible assignments are feasible, i.e. a region can contain 0,1,.., to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Item Type:Article
Source:Copyright of this article belongs to Taylor and Francis Ltd.
ID Code:9723
Deposited On:02 Nov 2010 10:52
Last Modified:31 May 2011 08:53

Repository Staff Only: item control page