Title :
Distances in an array: an alternative description for large scale network topology
Author :
Norwood, Frederick ; Dotson, William P.
Author_Institution :
East Tennessee State Univ., Johnson City, TN, USA
Abstract :
In the complete graph on an (m, n) array, methods are given for finding how many links have a given length and for finding the average length of a link. A method is also given for finding the average length of a link in a graph where there is an upper bound on the length of a link
Keywords :
telecommunication networks; average length; communication network; graph; large scale network topology; upper bound; Communication networks; Contracts; Costs; Intelligent networks; Large-scale systems; Network topology; Robustness; Telecommunication network reliability; Upper bound;
Conference_Titel :
Southeastcon '88., IEEE Conference Proceedings
Conference_Location :
Knoxville, TN
DOI :
10.1109/SECON.1988.194882
