• DocumentCode
    839171
  • Title

    Some shortest path algorithms with decentralized information and communication requirements

  • Author

    Abram, Jeffrey M. ; Rhodes, Ian B.

  • Author_Institution
    Advanced Information and Decision Systems, Mountain View, CA, USA
  • Volume
    27
  • Issue
    3
  • fYear
    1982
  • fDate
    6/1/1982 12:00:00 AM
  • Firstpage
    570
  • Lastpage
    582
  • Abstract
    This paper presents several decentralized algorithms for finding all shortest paths in a network. Both static and dynamic networks are discussed. Each algorithm has localized information and communication requirements, operates asynchronously, and converges to the optimum in finite time.
  • Keywords
    Communication system control; Graph theory; Networks; Application software; Control systems; Convergence; Heuristic algorithms; Large-scale systems; Network topology; Optimal control; Routing; Shortest path problem; Stability;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/TAC.1982.1102987
  • Filename
    1102987
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=839171