E-Net; a theory of response-time optimizing network

This paper deals with an equi-response-time network (E-Net) as the optimal information network for “groupware” and its properties. Extreme equi-response-time tree-shaped networks (E-Tree) with respect to vertices of a graph are derived, then the E-Net is obtained by the union of E-Trees with respect to all vertices of the network. An effective algorithm for finding E-Trees and E-Nets are described. The concept of central vertices in E-Net and their application to practical systems are also discussed