Article: A novel performance measure for characterising efficient immunisation strategies in computer networks and populations Journal: International Journal of Computer Applications in Technology (IJCAT) 2017 Vol.56 No.1 pp.27 - 44 Abstract: In this paper, an efficient immunisation strategy is devised for different types of networks, ranging from peer-to-peer computer networks to scale-free and small-world social networks. This strategy, named I-ring (I-chain), is proposed in order to immunise the random acquaintance between the independent nodes. As long as the data flow is not halted by failures, they are routed minimally through the network. However, if the information flow is blocked by failures, the routing restrictions may be relaxed by rerouting the message flow such that it bypasses the failed nodes and faulty region. The proposed strategy requires no knowledge of node degrees or general information about the network and its topology. Most importantly, a novel performance measure is evolved to assess the reliability and robustness of networks, that is the probability of messages facing the I-ring (I-chain). The experimental results of simulations testify the accuracy and practicability of the proposed measure. Inderscience Publishers - linking academia, business and industry through research

Title: A novel performance measure for characterising efficient immunisation strategies in computer networks and populations

Authors: Farshad Safaei; Iman Pakravan; Reza Akbar; Maryam Rahimkhani

Addresses: Faculty of Computer Science and Engineering, Shahid Beheshti University, GC, Evin 1983963113, Tehran, Iran ' School of Computer Science, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ' Faculty of Computer Science and Engineering, Shahid Beheshti University, GC, Evin 1983963113, Tehran, Iran ' Faculty of Computer Science and Engineering, Shahid Beheshti University, GC, Evin 1983963113, Tehran, Iran

Abstract: In this paper, an efficient immunisation strategy is devised for different types of networks, ranging from peer-to-peer computer networks to scale-free and small-world social networks. This strategy, named I-ring (I-chain), is proposed in order to immunise the random acquaintance between the independent nodes. As long as the data flow is not halted by failures, they are routed minimally through the network. However, if the information flow is blocked by failures, the routing restrictions may be relaxed by rerouting the message flow such that it bypasses the failed nodes and faulty region. The proposed strategy requires no knowledge of node degrees or general information about the network and its topology. Most importantly, a novel performance measure is evolved to assess the reliability and robustness of networks, that is the probability of messages facing the I-ring (I-chain). The experimental results of simulations testify the accuracy and practicability of the proposed measure.

Keywords: fault tolerance; network theory; complex networks; network robustness; performance evaluation.

DOI: 10.1504/IJCAT.2017.086568

International Journal of Computer Applications in Technology, 2017 Vol.56 No.1, pp.27 - 44

Received: 13 Feb 2016
Accepted: 29 Oct 2016
Published online: 12 Sep 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: A novel performance measure for characterising efficient immunisation strategies in computer networks and populations

Keep up-to-date