Deriving a Protocol Converter: A Top-Down Method

A protocol converter mediates the communication between implementations of different protocols, enabling them to achieve some form of useful interaction. The problem of deriving a protocol converter from specifications of the protocols and a desired service can be viewed as the problem of finding the “quotient” of two specifications. We define a class of finite-state specifications and present an algorithm for solving “quotient” problems for the class. The algorithm is applied to an example conversion problem. We also discuss its application in the context of layered network architectures.

[1]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[2]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[3]  Michael A. Padlipsky.  Gateways, architectures, and heffalumps , 1982, RFC.

[4]  Gregor von Bochmann,et al.  On the Construction of Submodule Specifications and Communication Protocols , 1983, TOPL.

[5]  Günter Karjoth,et al.  A Specification of the OSI Transport Service in LOTOS , 1984, PSTV.

[6]  Paul E. Green.  Protocol Conversion , 1986, IEEE Trans. Commun..

[7]  Simon S. Lam.  Protocol conversion—correctness problems , 1986, SIGCOMM '86.

[8]  Kaoru Okumura.  A formal protocol conversion method , 1986, SIGCOMM '86.

[9]  Kenneth L. Calvert,et al.  An exercise in deriving a protocol conversion , 1987, Computer Communication Review.

[10]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[11]  Lixia Zhang,et al.  NETBLT: a high throughput transport protocol , 1987, Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication.

[12]  Andrew P. Black,et al.  Interconnecting heterogeneous computer systems , 1988, CACM.

[13]  Simon S. Lam.  Protocol Conversion , 1988, IEEE Trans. Software Eng..

[14]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[15]  Joachim Parrow,et al.  Submodule Construction as Equation Solving in CCS , 1989, Theor. Comput. Sci..