Modeling robust asynchronous communication protocols with finite-state machines

Author

Wu, Michael M. ; Loui, Michael C.

Author_Institution

Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA

Volume

41

Issue

3

fYear

1993

fDate

3/1/1993 12:00:00 AM

Firstpage

492

Lastpage

500

Abstract

A.V. Aho et al. (Comput. Math. Applic., vol.8, p.205-14, 1982) used communicating finite-state machines to model synchronous protocols for reliable communication across unreliable channels. Their ideas are extended to modeling asynchronous protocols for communication across unreliable channels using finite-state machines communicating via an unreliable shared memory. Lower bounds on the size of machines and the number of symbols in the transmission alphabet required to achieve reliable communication are established. Two types of finite-state machines and two fault models for the shared memory are considered. In each case it is shown that there are robust protocols for deletion and insertion errors. It is also shown that there are no robust protocols for mutation errors. In contrast, in the synchronous case, robust protocols exist for all of these types of errors

Keywords

finite state machines; protocols; shared memory systems; telecommunication channels; asynchronous protocols; communication protocols; compulsive machines; deletion errors; fault models; finite-state machines; insertion errors; lower bounds; mutation errors; reliable communication; robust protocols; selective machines; unreliable channels; unreliable shared memory; Asynchronous communication; Communications Society; Computer errors; Computer network reliability; Data communication; Genetic mutations; Protocols; Robustness; System recovery; Transmitters;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.221080

Filename

221080