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

Fingerprint

Network protocols
Computer simulation
Computer program listings
Testing

ASJC Scopus subject areas

  • Engineering(all)

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, .

GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL. / Postel, Jonathan B.; Farber, David.

1976. 66-77 Paper presented at Proc of the Tex Conf on Comput Syst, 5th, Austin, TX, USA, .

Research output: Contribution to conferencePaper

Postel, JB & Farber, D 1976, 'GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL.' Paper presented at Proc of the Tex Conf on Comput Syst, 5th, Austin, TX, USA, 76/10/18 - 76/10/19, pp. 66-77.
Postel JB, Farber D. GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL.. 1976. Paper presented at Proc of the Tex Conf on Comput Syst, 5th, Austin, TX, USA, .
Postel, Jonathan B. ; Farber, David. / GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL. Paper presented at Proc of the Tex Conf on Comput Syst, 5th, Austin, TX, USA, .12 p.
@conference{6c7794b5449841e5a503960aa55909dc,
title = "GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL.",
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.",
author = "Postel, {Jonathan B.} and David Farber",
year = "1976",
month = "1",
day = "1",
language = "English",
pages = "66--77",
note = "Proc of the Tex Conf on Comput Syst, 5th ; Conference date: 18-10-1976 Through 19-10-1976",

}

TY - CONF

T1 - GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL.

AU - Postel, Jonathan B.

AU - Farber, David

PY - 1976/1/1

Y1 - 1976/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0017240815&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0017240815&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0017240815

SP - 66

EP - 77

ER -