• DocumentCode
    1556157
  • Title

    Distributed network protocols for changing topologies: a counterexample

  • Author

    Soloway, Stuart R. ; Humblet, Pierre A.

  • Author_Institution
    Digital Equipment Corp., Marlboro, MA, USA
  • Volume
    39
  • Issue
    3
  • fYear
    1991
  • fDate
    3/1/1991 12:00:00 AM
  • Firstpage
    360
  • Lastpage
    361
  • Abstract
    A number of distributed network protocols for reliable data transmission. connectivity test, shortest path, and topology broadcast have been proposed with claims that they operate correctly in the face of changing topology, without the need for unbounded numbers to identify different runs of the algorithms. It is shown that the protocols do not possess all the claimed properties and that they may not terminate, because they all share a basic flaw
  • Keywords
    data communication systems; network topology; protocols; connectivity test; distributed network protocols; reliable data transmission; shortest path; topology broadcast; Access protocols; Clocks; Costs; Data communication; Distributed algorithms; Laboratories; Network topology; Signal processing; Societies; Testing;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/26.79272
  • Filename
    79272
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1556157