The state model of communication networks
S.A. Ghozati · 2002
Finite state automata (FSA) are frequently used as modeling tools to describe the essential characteristics of a wide variety of communication networks. This paper presents a state model for the class of n-Star Graphs (n-SG). The primary application of modeling n-SG's by FSA is the development of node-independent algorithms for mapping various topologies into the n-SG network. These algorithms are rule-based and their outputs are not influenced by the initiating node labels.