GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL.

Jonathan B. Postel, David Farber

Research output: Contribution to conferencePaper

13 Citations (Scopus)

Abstract

Many of the problems in designing communications protocols, which involve asynchronous parallel processes, are due to the difficulty in recognizing all of the possible orderings in which the significant events can occur and the possible execution sequences which arise from these orderings. The modeling technique examined in this paper is derived from the UCLA Graph Model of Computation and experience with the development of ARPANET. One especially attractive aspect of this modeling technique is the existence of a computer program for testing for the property of proper termination. Proper termination indicates that the process modeled by the graph is in a certain sense well behaved; for example it has no deadlocks. These developments suggest that communications protocols can be modeled by the UCLA Graph Model in a useful and revealing way.

Original languageEnglish
Pages66-77
Number of pages12
Publication statusPublished - 1976 Jan 1
Externally publishedYes
EventProc of the Tex Conf on Comput Syst, 5th - Austin, TX, USA
Duration: 1976 Oct 181976 Oct 19

Conference

ConferenceProc of the Tex Conf on Comput Syst, 5th
CityAustin, TX, USA
Period76/10/1876/10/19

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL.'. Together they form a unique fingerprint.

  • Cite this

    Postel, J. B., & Farber, D. (1976). GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL.. 66-77. Paper presented at Proc of the Tex Conf on Comput Syst, 5th, Austin, TX, USA, .