Complexity classification for performance characterization of system functions within ATM sub-networks

A definition of a generic model for representing communication system behaviour is presented. Also presented is a general complexity measure for classifying computations represented by such a model. The method is based on modelling communication system functions as wreath products of automata which in turn are represented as transformation groups. Emphasis is placed on developing a methodology that can cope with practical ATM functional architectures being proposed by the International Telecommunications Union. Both recursive function complexity and semigroup decomposition complexity theory are interpreted within a common modelling structure. The rule base for the modelling structure is left open, allowing algorithm designers the flexibility of exploiting relational structures from classical algebra