Connecting a computer to a packet-switched network by means of a finite-state automaton

https://doi.org/10.1016/0140-3664(81)90015-3Get rights and content

Abstract

Many data networks offer the X.25 network access protocol. The users of such networks must support X.25 in order to take advantage of the packet-switching facilities. When a finite-state automaton is used as the architecture for the user's support, several advantages accrue. The directed graph which defines the actions of the automaton coincides with the state-change diagram that describes X.25. This leads to straightforward design and testing of the X.25 support software. Also the varying types of user's equipment that attach to the network can have compatible subsets of the X.25 support, depending on their power requirements.

The paper outlines the X.25 protocol proposed by the CCITT and discussed the use of a finite-state automaton as the architectural model for the level 3 support software.

The ‘funnel machine’ method of software construction and the implementation of support software are also discussed.

References (2)

  • E Mumprecht

    The funnel, a new and practical presentation method for program building blocks

  • CCITT

    Series X recommendation

Cited by (0)

Presented at ICS 1981, London, UK (March 1981)

View full text