• DocumentCode
    2980653
  • 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
  • fYear
    1988
  • fDate
    11-13 Apr 1988
  • Firstpage
    383
  • Lastpage
    385
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Southeastcon '88., IEEE Conference Proceedings
  • Conference_Location
    Knoxville, TN
  • Type

    conf

  • DOI
    10.1109/SECON.1988.194882
  • Filename
    194882
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2980653