• DocumentCode
    883200
  • Title

    On optimizing diameter and average distance of directed interconnected networks

  • Author

    Braun, Hans-Georg

  • Author_Institution
    Inst. of Logic, Complexity, & Deductive Syst., Karlsruhe Univ.
  • Volume
    42
  • Issue
    3
  • fYear
    1993
  • fDate
    3/1/1993 12:00:00 AM
  • Firstpage
    353
  • Lastpage
    358
  • Abstract
    A generic approach to constructing the topology of fixed degree directed networks for a given node degree and size is proposed. The topology has minimum diameter and makes it possible to answer Maekawa´s problem partially. In addition, an expansion operator Ex(x,n) is provided to scale the network size. Fast routing algorithms for these networks that have logarithmic time complexity while using constant buffer size are presented
  • Keywords
    computational complexity; directed graphs; minimisation of switching nets; multiprocessor interconnection networks; Maekawa problem; average distance; buffer size; diameter; directed interconnected networks; logarithmic time complexity; routing algorithms; Application software; Artificial intelligence; Concurrent computing; Graph theory; Hardware; Joining processes; Logic; Network topology; Routing;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.210177
  • Filename
    210177
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=883200