Fault-tolerant servers for anycast communication

被引:0
|
作者
Yu, S [1 ]
Zhou, W [1 ]
Jia, W [1 ]
机构
[1] Deakin Univ, Sch Informat Technol, Burwood, VIC 3125, Australia
关键词
algorithm; anycast; fault-tolerant; performance;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Plenty of research has been done for anycast service, but few research touches the fault-tolerant problem based on the best of our knowledge. In this paper, we propose and analyse a fault-tolerant model, called twin server model, for anycast communication to provide reliable and continuous anycast services. We select a twin server in an anycast group for a given anycast server, the primary server. If the twin server suspects that its primary server is dead, it will take the unfinished job(s) of its primary server. We propose two algorithms: the server failure detecting algorithm and the server failure broadcasting algorithm. We then analyse the performance change when a primary server fails using queue theory and obtain some interesting conclusions. At the end, we summary the paper and present the future work.
引用
收藏
页码:1244 / 1250
页数:7
相关论文
共 50 条
  • [21] Communication complexity of fault-tolerant information diffusion
    Gargano, L
    Rescigno, AA
    THEORETICAL COMPUTER SCIENCE, 1998, 209 (1-2) : 195 - 211
  • [22] Minimizing the buffer size in fault-tolerant video servers for VBR streams
    Song, M
    Shin, H
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005, E88D (06) : 1294 - 1298
  • [23] Fault-tolerant Communication in Invasive Networks on Chip
    Heisswolf, Jan
    Weichslgartner, Andreas
    Zaib, Aurang
    Friederich, Stephanie
    Masing, Leonard
    Stein, Carsten
    Duden, Marco
    Kloepfer, Roman
    Teich, Juergen
    Wild, Thomas
    Herkersdorf, Andreas
    Becker, Juergen
    2015 NASA/ESA CONFERENCE ON ADAPTIVE HARDWARE AND SYSTEMS (AHS), 2015,
  • [24] COMMUNICATION STRUCTURES IN FAULT-TOLERANT DISTRIBUTED SYSTEMS
    PRADHAN, DK
    MEYER, FJ
    NETWORKS, 1993, 23 (04) : 379 - 389
  • [25] Fault-tolerant communication algorithms in toroidal networks
    Almohammad, B
    Bose, B
    TWENTY-EIGHTH ANNUAL INTERNATIONAL SYMPOSIUM ON FAULT-TOLERANT COMPUTING, DIGEST PAPERS, 1998, : 186 - 194
  • [26] Hardware support for CAN fault-tolerant communication
    Rufino, Jose
    Pedrosa, Nuno
    Monteiro, Jose
    Verissimo, Paulo
    Arroz, Guilherme
    Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems, 1998, 1 : 263 - 266
  • [27] A new fault-tolerant multicast communication in multicomputers
    Wang, GC
    Chen, J
    PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, 2003, : 1251 - 1254
  • [28] Improved communication complexity of fault-tolerant consensus
    Hajiaghayi, Mohammad T.
    Kowalski, Dariusz R.
    Olkowski, Jan
    Proceedings of the Annual ACM Symposium on Theory of Computing, 2022, : 488 - 501
  • [29] Improved Communication Complexity of Fault-Tolerant Consensus
    Hajiaghayi, Mohammad T.
    Kowalski, Dariusz R.
    Olkowski, Jan
    PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 488 - 501
  • [30] Energy-Efficient Redundant Execution of Processes in a Fault-Tolerant Cluster of Servers
    Enokido, Tomoya
    Aikebaier, Ailixier
    Takizawa, Makoto
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2014, 42 (05) : 798 - 819