Probabilistic flooding has been proposed as a means of reducing the excessive message overheads induced by plain flooding in unstructured peer-to-peer network search. We propose here Advanced Probabilistic Flooding (apf), a novel strategy which operates differently from other known strategies. In particular, the decision of a node to propagate a message (or not) is based on both the popularity ...

With many different sensor networks being deployed, there will be an increased need to facilitate their uniform and efficient access at a large, perhaps even global, scale. To this end, we present an overlay-based architecture for organizing and querying multiple sensor networks based on their geographical area. The nodes of the system, representing query processors and individual sensor networ...

web search engines are one of the most popular tools on the internet which are widely-used by expert and novice users. constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. query expansion is a way to reduce this concern and increase user satisfaction. in this paper, a new method of query expa...

Grid computing environments include heterogeneous resources shared by a large number of computers to handle the data and process intensive applications. In these environments, the required resources must be accessible for Grid applications on demand, which makes the resource discovery as a critical service. In recent years, various techniques are proposed to index and discover the Grid resource...

DHT based peer to peer network system is a general range of query scheme. These schemes can support the range of query without modifying the underlying DHTs and they cannot guarantee to return the query results with bounded delay. The query delay in these schemes depends on both the scale of the system and the size of the query space. This paper, proposed Armada, an efficient range of query pro...

Gnutella-like peer-to-peer file -sharing systems have been widely deployed on the Internet. However, current search techniques used in existing Gnutella -like peer-to-peer systems are often inefficient. We demonstrated the strong “small-world” property of Gnutella systems and proposed an efficient search approach CSTM to utilize the property. In CSTM, each peer maintains a local state table, wh...

Forwarding information base (FIB) scalability is a fundamental problem of numerous new network architectures that propose to use location-independent network names. We propose Concise, a FIB design that uses very little memory to support fast query of a large number of location-independent names. Concise makes use of minimal perfect hashing and relies on the SDN framework and supports fast name...