Abstract
This paper presents a formal model using the context-free grammar (CFG) for the design and implementation of communication protocols. It is similar to the Backus-Naur Form that has been used to define the syntax of programming languages. The transmission grammar (TG) is used to define the protocol for the communication entities of a computer network. For the hierarchical protocol design, the communication entity of each level is decomposed into more detailed inner-layered components and/or logically independent parts. The local approach is first used to define the TG for each of the decomposed components and logical parts. The shuffle and substitution operations are then applied to integrate the TGs of the logical parts and the TGs of the components, respectively. Examples are given to illustrate the grammatical properties of protocols and the design methodologies of TGs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.