Advertisement

On Disconnection Node Failure and Stochastic Static Resilience of P2P Communication Networks

  • F. Safaei
  • M. Fathy
  • A. Khonsari
  • N. Talebanfard
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4707)

Abstract

There exist a large number of graph optimization problems in the literature, which arise in network design and analysis. Our objective in this paper is to highlight the disconnection probability which can arise in interconnect networks of large-scale parallel processors systems. Although traditional measures of fault-tolerance such as reliability and availability are applicable to such systems, these measures were designed mostly for mission-oriented applications or repairable systems. They fail to account for the high redundancy levels typical in peer-to-peer (P2P) communication and distributed systems. For these systems, new measures have been introduced that can evaluate the capability of a system for graceful degradation. In the design of such systems, one of the most fundamental considerations is the reliability of their interconnected networks, which can be usually characterized by connectivity of the topological structure of the network. In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how static patterns of node failure affect the resilience of such networks. Simulation results based on the network topology confirm the validity of the analytical approximation and demonstrate the localizer efficiency.

Keywords

Topological Structure Random Graph Mesh Network Node Failure Distribute Hash Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Xu, J.: Topological structure and analysis of interconnection networks. Kluwer Academic Publishers, Dordrecht (2001)zbMATHGoogle Scholar
  2. 2.
    Suh, Y.J., et al.: Software-based rerouting for fault-tolerant pipelined communication. IEEE Trans. On Parallel and Distributed Systems 11(3), 193–211 (2000)CrossRefGoogle Scholar
  3. 3.
    Go’mez, M.E., et al.: A Routing Methodology for Achieving Fault Tolerance in Direct Networks. IEEE Trans. On Comput. 55(4), 400–415 (2006)CrossRefGoogle Scholar
  4. 4.
    Mejia, A., et al.: Segment-Based Routing: An Efficient Fault-Tolerant Routing Algorithm for Meshes and Tori. In: IEEE International Parallel & Distributed Processing Symposium (IPDPS) (2006) Google Scholar
  5. 5.
    Montanana, J.M., et al.: A Transition-Based Fault-Tolerant Routing Methodology for InfiniBand Networks. In: IEEE International Parallel & Distributed Processing Symposium (IPDPS) (2004) Google Scholar
  6. 6.
    Boppana, R.V., Chalasani, S.: Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks. IEEE Trans. Computers 44(7), 848–864 (1995)zbMATHCrossRefGoogle Scholar
  7. 7.
    Chakravorty, S., Kale, L.V.: A Fault Tolerant Protocol for Massively Parallel Systems, IEEE International Parallel & Distributed Processing Symposium (IPDPS) (2004) Google Scholar
  8. 8.
    Najjar, W., Gaudiot, J.L: Network resilience: A measure of network fault-tolerance. IEEE Transactions on Computers 39(2), 174–181 (1990)CrossRefGoogle Scholar
  9. 9.
    Leonard, D., et al.: On static and dynamic partitioning behavior of large-scale networks, ICNP05, pp. 345–357 (2005)Google Scholar
  10. 10.
    Leonard, D., et al.: On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks. In: SIGMETRICS, pp. 26–37 (2005)Google Scholar
  11. 11.
    Stoica, I., et al.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of ACM SIGCOMM’01, San Diego (2001)Google Scholar
  12. 12.
    Bollobas, B.: Random graphs. Cambridge Univ. Press, Cambridge (2001)zbMATHGoogle Scholar
  13. 13.
    Gummadi, K.: The impact of DHT routing geometry on resilience and proximity. In: ACM SIGCOMM, pp. 381–394 (2003)Google Scholar
  14. 14.
    Kaashoek, F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)Google Scholar
  15. 15.
    Massoulié, L., Ganesh, A.J., Kermarrec, A.M.: Network Awareness and Failure Resilience in Self-Organizing Overlay Networks. In: IEEE Symposium on Reliable and Distributed Systems, Florence (2003)Google Scholar
  16. 16.
    Fiat, A., Saia, J.: Censorship Resistant Peer-to-Peer Content Addressable Networks. In: Proceedings of Symposium on Discrete Algorithms, ACM-SIAM SODA (2002)Google Scholar
  17. 17.
    Sutner, K., Satyanarayana, A., Suffel, C.: The complexity of the residual node connectedness reliability problem. SIAM Journal on Computing 20(1), 149–155 (1991)zbMATHCrossRefGoogle Scholar
  18. 18.
    Avezienis, A.: Fault-tolerant computing- an overview. IEEE Transactions on Computers 4, 5–8 (1971)Google Scholar
  19. 19.
    Zimmerman, G.W., Esfahanian, A.H.: A New Approach to System-Level Fault-Tolerance in Message-Passing Multicomputers. In: Great Lakes Computer Science Conference 38(11), 357–363 (1989)Google Scholar
  20. 20.
    Hayes, J.P.: A Graph Model for Fault-Tolerant Computing Systems. IEEE Transactions on Computers 25(9), 875–884 (1976)zbMATHGoogle Scholar
  21. 21.
    Erdös, P., Rényi, A.: On the evolution of random graphs. Publications of the Math. Inst. of the Hungarian Academy of Sci. 5, 17–61 (1960)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • F. Safaei
    • 1
    • 2
  • M. Fathy
    • 1
  • A. Khonsari
    • 3
    • 2
  • N. Talebanfard
    • 4
  1. 1.Dept. of Computer Eng., Iran Univ. of Science and Technology, TehranIran
  2. 2.IPM School of Computer Science, TehranIran
  3. 3.Dept. of ECE, Univ. of Tehran, TehranIran
  4. 4.Faculty of Mathematical Sciences, Shahid Beheshti Univ., TehranIran

Personalised recommendations