TY - JOUR
T1 - Novel Distributed Dynamic Backbone-based Flooding in Unstructured Networks
AU - Saeedvand, Saeed
AU - Aghdasi, Hadi S.
AU - Mohammad Khanli, Leili
N1 - Publisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2020/5/1
Y1 - 2020/5/1
N2 - Resource discovery on different unstructured and dynamic networks such as grid, peer-to-peer, and cloud networks is an inevitable challenging issue. The primary method for resource discovery on the unstructured networks is flooding a query on the network. All existing flooding algorithms for unstructured networks generate almost high additional duplicated queries. This high duplication of the unstructured networks causes a lot of network traffic. This paper, therefore, proposes a novel flexible Distributed Dynamic backbone-based Flooding (DDBF) algorithm for distributed unstructured networks. This paper explores Grid middleware, Peer-to-Peer (P2P) paradigm, and cloud networks resource discovery requirements and it proposes flooding algorithm based on the P2P networks using simulation. To evaluate and prove DDBF algorithm we, first, evaluated it on four fixed network topologies along with two different query flooder distributions, then we evaluated it with one dynamic network topology. The performance of the proposed DDBF algorithm was assessed with five different metrics. The result showed a dramatic decrease in the number of engaged flooder nodes, the number of duplicated queries and consequently, network delay compared with the state-of-the-art algorithms.
AB - Resource discovery on different unstructured and dynamic networks such as grid, peer-to-peer, and cloud networks is an inevitable challenging issue. The primary method for resource discovery on the unstructured networks is flooding a query on the network. All existing flooding algorithms for unstructured networks generate almost high additional duplicated queries. This high duplication of the unstructured networks causes a lot of network traffic. This paper, therefore, proposes a novel flexible Distributed Dynamic backbone-based Flooding (DDBF) algorithm for distributed unstructured networks. This paper explores Grid middleware, Peer-to-Peer (P2P) paradigm, and cloud networks resource discovery requirements and it proposes flooding algorithm based on the P2P networks using simulation. To evaluate and prove DDBF algorithm we, first, evaluated it on four fixed network topologies along with two different query flooder distributions, then we evaluated it with one dynamic network topology. The performance of the proposed DDBF algorithm was assessed with five different metrics. The result showed a dramatic decrease in the number of engaged flooder nodes, the number of duplicated queries and consequently, network delay compared with the state-of-the-art algorithms.
KW - Distributed Algorithm
KW - Flooding
KW - Peer-to-Peer Networks
KW - Resource Discovery
KW - Unstructured Dynamic Networks
UR - http://www.scopus.com/inward/record.url?scp=85075335315&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85075335315&partnerID=8YFLogxK
U2 - 10.1007/s12083-019-00817-0
DO - 10.1007/s12083-019-00817-0
M3 - Article
AN - SCOPUS:85075335315
SN - 1936-6442
VL - 13
SP - 872
EP - 889
JO - Peer-to-Peer Networking and Applications
JF - Peer-to-Peer Networking and Applications
IS - 3
ER -