Abstract
This paper studies the problem of identifying performance bottlenecks in communication protocols. The model used is a Finite State Machine extended with time and transition probabilities known as PEFSM. A definition of PEFSM is given and the bottleneck identification methods proposed are based on this performance model. Informally, a bottleneck with respect to a performance metric is defined as the transition among all the transitions in a PEFSM which would produce the largest marginal improvement of the performance metric if the time of the transitions were reduced by the same small amount. We present two methods to locate the bottleneck transitions with respect to two of the most important performance metrics, i.e., throughput and queue wait time. These methods are partially validated by simulation.
Chapter PDF
Similar content being viewed by others
References
Arnold O. Allen. Probability, Statistics, and Queueing Theory with Computer Science Applications. Academic Press, Inc., second edition edition, 1990.
Domenicao Ferrari. Computer Systems Performance Eval- uation. Prentice-Hall, INC., Englewood Cliffs, New Jersey, 1978.
Ronald A. Howard. Dynamic Probabilistic Systems, volume Volume 1: Markov Models; Volume 2: SemiMarkov and Decision Processes. John Wiley and Sons, Inc., 1971.
ISO TC97/SC16 N2576. Formal specification of Transport protocol in Estelle. ISO, 1986.
ISO/TC 97, Information processing systems. Information processing systems - Data communication - High-level data link control procedures - Discription of the of the X.25 LA PB-compatible DTE data link procedures. ISO 7776–1986. ISO, first edition, 12, 1986.
ISO TC 97/SC 21. Information processing systems - Open systems Interconnection - LOTOS - A formal description technique based on the temporal ordering of observational behaviour. ISO 8807. Interational Organization for Standardization, 1989.
Clement H.C. Leung. Quantitative analysis of computer systems. Chichester; New York: Wiley, 1988.
K.G. Lockyer. Critical path analysis and other project network techniques. Pitman Publishing, 1984.
CCITT. Specification and Description Language - Recommendation Z.100. Geneva, Switzerland: CCITT press, 1986.
Andrew S. Tanenbaum. Computer Networks. Pretice-Hall, Inc., 1988.
A. Wagner, J. Jiang, and S. Chanson. TMON–A Transputer Performance Monitor. Concurrency: Practice and Experience, 5 (6): 511–526, 1993.
Cui-Qing Yang and Barton P. Miller. Performance Measurement for Parallel and Distributed Programs: A Structured and Automatic Approach. IEEE Transactions on Software Engineering, 15(12), 12 1989.
Sijian Zhang. Performance Modelling and Evaluation of Protocols based on Formal Specifications. PhD thesis, The Univ. of British Columbia, 1995.
John A. Zinky and Joshua Etkin. Troubleshooting throughput bottlenecks using executable models. Computer Networks and ISDN Systems, 24 (1), 3 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Zhang, S., Chanson, S.T. (1997). Analyzing performance bottlenecks in protocols based on finite state specifications. In: Kim, M., Kang, S., Hong, K. (eds) Testing of Communicating Systems. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35198-8_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-35198-8_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6701-8
Online ISBN: 978-0-387-35198-8
eBook Packages: Springer Book Archive