Browse Prior Art Database

Data Structure for SNA Communications Finite State Machines

IP.com Disclosure Number: IPCOM000034976D
Original Publication Date: 1989-May-01
Included in the Prior Art Database: 2005-Jan-28

Publishing Venue

IBM

Related People

Authors:
Allsen, JK Liu, JM Stewart, GG [+details]

Abstract

In System Network Architecture (SNA) communications, Finite State Machines (FSMs) are used in several protocol layers to verify the correctness of sending/receiving requests and responses. This process occupies a significant portion of the time, since every request/ response unit must be verified. This structure allows the FSMs to be driven efficiently and maintained easily. FSMs have been applied in many areas, such as lexical analyzers, string searching algorithms, etc. In compilers, two-dimensional arrays indexed by states and characters were considered as the fastest way to implement the FSMs. However, in SNA communications, to simply use two-dimensional arrays to represent the FSMs is not efficient. This is because the inputs to the FSMs are usually combinations of different attributes, i.e.