• DocumentCode
    1209276
  • Title

    The Chaos router

  • Author

    Konstantinidou, Smaragda ; Snyder, Lawrence

  • Author_Institution
    IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
  • Volume
    43
  • Issue
    12
  • fYear
    1994
  • fDate
    12/1/1994 12:00:00 AM
  • Firstpage
    1386
  • Lastpage
    1397
  • Abstract
    The Chaos router, a randomizing, nonminimal adaptive packet router is introduced. Adaptive routers allow messages to dynamically select paths, depending on network traffic, and bypass congested nodes. This flexibility contrasts with oblivious packet routers where the path of a packet is statically determined at the source node. A key advancement of the Chaos router over previous nonminimal routers is the use of randomization to eliminate the need for livelock protection. This simplifies adaptive routing to be of approximately the same complexity along the critical decision path as an oblivious router. The primary cost is that the Chaos router is probabilistically livelock free rather than being deterministically livelock free, but evidence is presented implying that these are equivalent in practice. The principal advantage is excellent performance for nonuniform traffic patterns. The Chaos router is described, it is shown to be deadlock free and probabilistically livelock free, and performance results are presented for a variety of work loads
  • Keywords
    computational complexity; multiprocessor interconnection networks; parallel processing; Chaos router; adaptive routing; deadlock free; network traffic; nonminimal adaptive packet router; probabilistically livelock free; Adaptive systems; Chaos; Chaotic communication; Communication networks; Computer science; Costs; Protection; Routing; System recovery; Telecommunication traffic;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.338098
  • Filename
    338098