AC-RDVT: Acyclic Resource Distance Vector Routing Tables for Dynamic Grid Resource Discovery

Since the objective of grid is sharing the numerous and heterogeneous resources, resource discovery is a challenging issue. Recently appeared, Ontosum, is a resource discovery method based on semantically linked organizations and a routing algorithm Resource Distance Vector (RDV), has been presented to forward resource discovery queries into the clusters. Although this framework is efficient for large-scale grids and nodes are clustered automatically based on semantic attributes to constitute a semantically linked overlay network, but the dynamic behavior of grid isn’t considered. In this method, deceptive information is stored in RDV tables (RDVT) which cause some problems in routing process. In this paper, a method is proposed to improve the dynamism of RDV routing algorithm, so the consistency with grid environments is increased. The developed algorithm is assessed by investigating the success probability, number of hops and routing time of resource discovery.DOI:http://dx.doi.org/10.11591/ijece.v3i1.183

A PROFITLESS DATA UTILIZATION THEORY FOR HIERARCHICAL STRUCTURES

Internet recognition bakes an essential motivation towards peer to determine file talking about. For understanding the peer to determine file talking about system, an important qualifying criterion to is efficiency of file location.  Inside our work we submit a peer to determine file talking about system that's closeness-aware additionally to Interest-clustered based on structured peer to determine system. It forms close nodes to cluster after which groups general interest nodes into sub-cluster that is founded on hierarchical topology and apply a wise file replication to boost file query effectiveness. The forecasted system can keep each and every advantage of distributed hash tables above unstructured peer to determine systems. It's closeness-aware additionally to Interest-clustered utilizes an intellectual file replication to boost file research competence and places files sticking with the same interests with one another which makes them available through routing function. The device will progress intra-sub-cluster file searching completely through several approaches. It evolves an overlay for every group that bond lesser capacity nodes towards advanced capacity nodes for spread file querying during remaining from of node overload. Recommended system utilizes range of positive file data to make sure that file requester can recognize whether requested for file reaches its close by nodes

A NEAREST-ALERT NOTICE-COLLECTED P2P FOLDER DISTRIBUTION SCHEME

Internet recognition bakes an important motivation towards peer to find out file discussing. For comprehending the peer to find out file discussing system, an essential qualifying criterion to is efficiency of file location.  Within our work we submit a peer to find out file discussing system that's closeness-aware furthermore to Interest-clustered according to structured peer to find out system. It forms close nodes to cluster then groups general interest nodes into sub-cluster that draws on hierarchical topology and use a good file replication to improve file query effectiveness. The forecasted system will keep every single benefit of distributed hash tables above unstructured peer to find out systems. It's closeness-aware furthermore to Interest-clustered utilizes an intellectual file replication to improve file lookup competence and places files with just one interests with each other causing them to be available through routing function. The unit will progress intra-sub-cluster file searching completely through several approaches. It builds an overlay for each group that bond lesser capacity nodes towards advanced capacity nodes for spread file querying during remaining from of node overload. Suggested system utilizes selection of positive file data to make certain that file requester can recognize whether requested file reaches its near by nodes

A New Approach to Intra-Sub-Cluster File Searching implemented in p2p File System

In internet p2p file sharing system generates more traffic. To get better file query performance cluster the common interested peers based on physical proximity. In this project proposing a proximity aware interest –clustered p2p file sharing system implemented in structured p2p file system. It forms a cluster based on node proximity as well as groups the nodes which having common interest into sub-cluster. A narrative lookup function named as DHT and file replication algorithm which supports resourceful file lookup and access. To diminish overhead and file searching delay it keeps up file information collection. Bloom filter technique is used to cut file sharing delay. Finally proposed approach shows competence in file search, sharing and overhead

Quickly routing searches without having to move content

Abstract. A great deal of work has been done to improve peer-to-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer architecture might be appropriate, but in which content movement is not feasible. We argue that even in such applications, progress can be made in developing techniques that ensure efficient searches. We present several such techniques. First, we show that organizing the network into a square-root topology, where peer degrees are proportional to the square root of the popularity of their content, provides much better performance than power-law networks. Second, we present routing optimizations based on the amount of content stored at peers, and tracking the “best ” peers, that can further improve performance. These and other techniques can make searches efficient, even when content movement or replication is not feasible.

Toward Self-Organising Service Communities

This paper discusses a framework in which catalog service communities are built, linked for interaction, and constantly monitored and adapted over time. A catalog service community (represented as a peer node in a peer-to-peer network) in our system can be viewed as domain specific data integration mediators representing the domain knowledge and the registry information. The query routing among communities is performed to identify a set of data sources that are relevant to answering a given query. The system monitors the interactions between the communities to discover patterns that may lead to restructuring of the network (e.g., irrelevant peers removed, new relationships created, etc.)

Розподілене управління знаннями на основі архітектури Peer-to-Peer

In this paper we extended the standard representation P2P networks as three-level entities for use in distributed knowledge management systems. Also we suggested the fourth, information level. Introduced the concept of global virtual ontology.В роботі розширено стандартне представлення P2P мереж як трирівневих сутностей для використання в розподілених системах управління знаннями. Запропоновано до розгляду четвертий рівень – інформаційний. Введено поняття глобальної віртуальної онтології