Distributed control methods

Author

Tung, Brian ; Kleinrock, Leonard

Author_Institution

Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA

fYear

1993

fDate

20-23 Jul 1993

Firstpage

206

Lastpage

215

Abstract

The distributed system is becoming increasingly popular, and this produces the need for more sophisticated distributed control techniques. The authors present a method for distributed control using simple finite state automata. Each of the distributed entities is `controlled´ by its associated automaton, in the sense that the entity examines the state of the automaton to determine its behavior. The result of the collective behavior of all of the entities is fed back to the automata, which change their state as a result of this feedback. They give a new method of analysis which derives the steady state behavior of this system as a whole, by decomposing it into two parts: describing and solving an imbedding auxiliary Markov chain, and analyzing the behavior of the system within each of the states of this auxiliary chain

Keywords

Markov processes; distributed algorithms; finite automata; queueing theory; distributed control; distributed system; entities; finite state automata; imbedding auxiliary Markov chain; steady state behavior; Automata; Communication system control; Costs; Distributed algorithms; Distributed control; Queueing analysis; Robot kinematics; State feedback; Steady-state; Voting;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Distributed Computing, 1993., Proceedings the 2nd International Symposium on

Conference_Location

Spokane, WA

Print_ISBN

0-8186-3900-8

Type

conf

DOI

10.1109/HPDC.1993.263840

Filename

263840