UNCERTAINITY PROCESS USING DEPENDABLE PEER TO PEER NETWORKS

One of the key functions of these systems is to solve queries efficiently or find files. This is the problem that is addressed in this document. In organized systems, the files are organized to create overlays with specific topology attributes. It is very difficult to locate a document or resource within an unregulated peer-to-peer network. It has been shown that this approach leads to a stable query load that is affected by information and service restriction, that is, it ensures that the query routes meet the pre-defined limits by category, according to the possibility of linking the search. The deficiencies of partially disorganized systems can be addressed in part by hybrid P2P Systems. Additional aspects associated with the reduction of complexity, the estimation of parameters and the adaptability to query precision based on queries and traffic loads are studied. The function suggests a strategy where colleagues store the final results of previous queries, as shown by redirecting the reverse route. This method includes a huge amount of data and has not yet provided performance guarantees. An explicit image of the capacity area of ​​these systems is provided and numerically co-related with random searches based on hikes