• DocumentCode
    1410727
  • Title

    Fault-tolerant scaleable multicast algorithm with piggybacking approach on logical process ring

  • Author

    Jia, W. ; Zhao, W.

  • Author_Institution
    Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong
  • Volume
    145
  • Issue
    4
  • fYear
    1998
  • fDate
    7/1/1998 12:00:00 AM
  • Firstpage
    292
  • Lastpage
    300
  • Abstract
    A novel reliable, totally ordered multicast protocol on a single logical process ring (called FTSM) is presented. It guarantees totally ordered and atomic delivery of multicast messages in the presence of message loss, site crashes and network partitioning. By placing sequence numbers on messages, a process holding a virtual token multicasts totally ordered messages. Atomic delivery of multicast messages is achieved by piggybacking stable and acknowledged information on the part of both sender and receivers. Virtual token passing and transmission of control messages are piggybacked onto ordered data messages without requiring additional communication overhead. Individual processes handle token passing and control information by applying a local heuristic. FTSM is scaleable because its overhead on achieving total ordering and atomicity does not depend on the size of the process group. Implementation demonstrates that FTSM achieves superior performance over existing protocols in the same hardware setting
  • Keywords
    fault tolerant computing; protocols; atomic delivery; communication overhead; fault-tolerant scaleable multicast algorithm; logical process ring; piggybacking approach; single logical process ring; totally ordered multicast protocol; virtual token;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Proceedings -
  • Publisher
    iet
  • ISSN
    1350-2387
  • Type

    jour

  • DOI
    10.1049/ip-cdt:19982094
  • Filename
    705694