Advertisement

On the existence and construction of robust communication protocols for unreliable channels

  • Saumya K. Debray
  • Ariel J. Frank
  • Scott A. Smolka
Session 2 Distributed Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 181)

Abstract

A simple necessary and sufficient condition for the existence of robust communication protocols for arbitrary alphabets and a large class of transmission errors is presented. This class of errors, called transformation errors, consists of those errors where symbols (messages) may be lost or corrupted to other symbols. The proof is used as the basis of a procedure for automatically constructing robust protocols for transformation errors. The protocols generated are small in size, despite not being custom-designed. The results presented generalize and expand upon those of Aho et al. [AUY79]. Two protocols are constructed to illustrate our technique, and are contrasted with those of Aho et al.

Keywords

Communication Protocol Transmission Error Data Symbol Input Buffer Parity Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [AUY79]
    A. V. Aho, J. D. Ullman and M. Yannakakis, “Modeling Communications Protocols by Automata”, 20th Annual Symp. on Foundations of Computer Science, San Juan, Puerto Rico, Oct. 1979.Google Scholar
  2. [AWY82]
    A. V. Aho, A. D. Wyner, M. Yannakakis and J. D. Ullman, “Bounds on the Size and Transmission Rate of Communications Protocols”, Comp. & Maths. with Appls., 8, 3 (1982), 205–214, Pergamon Press Ltd.Google Scholar
  3. [Aho84]
    A. Aho, in Personal Communication, June 1984.Google Scholar
  4. [Boc80]
    G. V. Bochmann, “A General Transition Model for Protocols and Communication Services”, IEEE Trans. on Computers, COM-28, 4 (Apr. 1980), 643–650.Google Scholar
  5. [BoS80]
    G. V. Bochmann and C. A. Sunshine, “Formal Methods in Communication Protocol Design”, IEEE Trans. on Computers, COM-28, 4 (Apr. 1980), 624–631.Google Scholar
  6. [Dan80]
    A. A. S. Danthine, “Protocol Representation with Finite-State Models”, IEEE Trans. on Communications, COM-28, 4 (April 1980), 632–643. Reprinted in “Communication Protocol Modeling”, ed. C. A. Sunshine, Artech House, Dedham, Mass., 1981.Google Scholar
  7. [Fra84]
    A. J. Frank, Modeling Communication Protocols by Synchronous/ Asynchronous Automata, Dept. of Computer Science, SUNY at Stony Brook, Feb. 1984. Unpublished Manuscript.Google Scholar
  8. [Fra79]
    A. G. Fraser, “Datakit — A Modular Network for Synchronous and Asynchronous Traffic”, Proc. IEEE Int. Conf. on Communications, Boston, June 1979.Google Scholar
  9. [Hai81]
    B. T. Hailpern, “A Simple Protocol Whose Proof Isn't”, IBM Research Report RC8800(#38567), IBM Thomas J. Watson Research Center, Apr. 1981.Google Scholar
  10. [Har77]
    J. Harangozo, “An Approach to Describing a Link-Level Protocol with a Formal Language”, in Proc. 5th. Data Communication Symp., Snowbird, Utah, Sept. 77. Reprinted in “Communication Protocol Modeling”, ed. C. A. Sunshine, Artech House, Dedham, Mass., 1981.Google Scholar
  11. [Lam84]
    L. Lamport, “Using Time instead of Timeout for Fault-Tolerant Distributed Systems”, ACM Trans. Prog. Lang. and Systems, 6, 2 (Apr. 1984), 254–280.Google Scholar
  12. [Mil80]
    R. Milner, “A Calculus of Communicating Systems”, in Lecture Notes in Computer Science, 92, Springer Verlag, New York, 1980.Google Scholar
  13. [Pac82]
    J. K. Pachl, “Reachability Problems for Communicating Finite State Machines”, CS-82-12, Dept. of Computer Science, Univ. of Waterloo, Waterloo, Ontario, Canada, May 1982.Google Scholar
  14. [Sch82]
    F. B. Schneider, “Synchronization in Distributed Programs”, ACM Trans. Prog. Lang. and Systems, April 1982, 1–24.Google Scholar
  15. [SFD84]
    S. A. Smolka, A. J. Frank and S. K. Debray, “Proving Protocol Robustness the CCS Way”, Technical Report #84/071, Dept. of Computer Science, SUNY at Stony Brook, April 1984. Proc. 4th. International Workshop on Protocol Specification, Testing and Verification, Mt. Pocono, PA, June 1984.Google Scholar
  16. [Sun79]
    C. A. Sunshine, “Formal Techniques for Protocol Specification and Verification”, Computer, 12 9 (Sep. 1979), 20–27.Google Scholar
  17. [ZWR80]
    P. Zafiropulo, C. H. West, H. Rudin, D. D. Cowan and D. Brand, “Towards Analyzing and Synthesizing Protocols”, IEEE Trans. Commun., COM-28, 4 (April 1980), 651–661.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Saumya K. Debray
    • 1
  • Ariel J. Frank
    • 1
  • Scott A. Smolka
    • 1
  1. 1.Department of Computer ScienceSUNY at Stony BrookStony BrookU.S.A.

Personalised recommendations