A data processing performance model for the OSI application layer protocols

ABSTRACT

The need for data structure analysis of OSI protocols has increased with the development of OSI protocols into Application layer protocols which require a wide variety of data structures. Especially, when using high speed networks such as FDDI and B-ISDN. Application data processing is liable to be the critical performance factor in the communications based on the OSI frameworks. This paper presents a data processing model to analyze the performance of the Application data receiving process in the Presentation layer. The model is based on a finite pushdown automaton. A scheme is proposed that can determine the memory space and processing time needed by the receiving process for any type of data structure. Consequently, an evaluation method is developed for Application protocols data structures in OSI. The method is then used to evaluate sample data structures commonly used for document transmission.

REFERENCES

• 1: I lyas, M,, }buftah, H.T., "Performance EvaJ.uation of Computer Communications Networks"# IF#J.# Commun, Mag., Vol. 23, No. 4, pp18-29, Apr. 1985.
• 2: Reiser, M., "Communication-system models e|ibedded in the OSI reference model, a survey", eds. Hasega#a,T. Takahashi. H., Proc. Internati~#nal Seminar of Computer Networking and Perfor'mance Evaluation, 3-i. Sept. 1085,
• 3: Kritzinger, P.S., #A Performance Model of the OSI Communication Archi tecture", IEEE Trans. Colunun. VOL, COM-34, NO-S, Jun. 1986.
• 4: S~%itou. T,, Shirahata, A., "Performance eva.luation of Multi-layerd protocol", Trans. {EICE, (D-I), J72-D-I, 7, pp. 562-569, Jul. 1989.
• 5: Shiroshlta. T., Nomura, M., "Evaluations or the Common Application Protocols in OSI", Trans. IEICE (B-I), J72-B-{, 7, pp. 172-182, Mar. 1989.
• 6: I nai, H,, Nishida, T., Yokohira, T., Miyahara. H,, '" A Performance Model of Layered Communication Architecture", Trans. IEICE (D-I), J72-D-I, 12, pp. 893-901, Dec. 1989.
• 7: John E. Hopcroft , Jeffrey D. Ullman, Formal languages and their relation to automata, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1969
• 8: John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
• 9: ISO, "ASN, I: Abstract Syntax Notation One", I S08824, &825, 1987.
• 10: {SO. "ODA: Office Document Architecture". {S08613- 1.2,4,5.6,7.8.1988.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Open Systems Interconnection reference model (OSI)

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols
          Subjects: Protocol architecture (OSI model)

  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)

General Terms:
Design, Performance