Novel Distributed Dynamic Backbone based Flooding in Unstructured Networks
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.
Peer to Peer Netw. Appl.