Algorithms for the reduction of timed finite state graphs

  • Authors:

  • G. H. Masapati;G. M. White

  • Affiliations:

  • Univ. of Ottawa, Ontario, Canada;Univ. of Ottawa, Ontario, Canada

  • Venue:
  • SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

A set of algorithms to reduce the size of timed finite state graphs are presented. In particular, we develop a more general algorithm for vertex folding than those presently existing. It is based on the law of conservation of transition time. We demonstrate the application of these reduction algorithms to a version of the stop-and-wait protocol.We have also developed a graph reduction software package incorporating all these algorithms which can be used in automated performance prediction. Graph reduction software tools such as these are important and form an integral part of automated protocol performance prediction tools[RUD 83].