Title :
The state model of communication networks
Author :
Ghozati, Seyed Ali
Author_Institution :
Dept. of Comput. Sci., City Univ. of New York, NY, USA
Abstract :
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
Keywords :
finite automata; graph theory; multiprocessor interconnection networks; network routing; communication networks; finite state automata; initiating node labels; modeling tools; n-Star Graphs; network routing; node-independent algorithms; rule-based algorithms; state model; trees; Algorithm design and analysis; Automata; Communication networks; Computer science; Delay; Educational institutions; Fault tolerance; Multiprocessor interconnection networks; Network topology; Routing;
Conference_Titel :
Performance, Computing, and Communications Conference, 1997. IPCCC 1997., IEEE International
Conference_Location :
Phoenix, Tempe, AZ
Print_ISBN :
0-7803-3873-1
DOI :
10.1109/PCCC.1997.581565
