A Simulation Framework for P2P Queries Routing for E-Business

On-line business transaction processing systems have so far been based on centralized or client-server architectures. The growing interest in Peer-to-Peer centralized or decentralized systems has inspired numerous research activities, though in a schema-based Peer-to-Peer (P2P) system, locating Peers (services) relevant to a given query is a basic problem for which different routing strategies of queries have been proposed. In this paper, the architecture, based on (Super-) Peers, is proposed, with a special focus on query routing. For an efficient query routing, (Super-) Peers having similar interests are grouped together and called SuperSuper-Peers (SSP). Super-Peers submit queries that are often processed by members of this group. A SSP is a specific Super-Peer that contains knowledge about 1) its Super-Peers, and 2) the other SSP. Using data mining techniques knowledge is extracted by processing queries of Peers that transit on the network. The advantage of this distributed knowledge is that it avoids making semantic mapping between heterogeneous data sources owned by (Super-) Peers each time the system decides to route query to other (Super-) Peers. DOI: 10.4018/jeei.2012040103 30 International Journal of E-Entrepreneurship and Innovation, 3(2), 29-50, April-June 2012 Copyright © 2012, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. server and the relevant business data, decrease the risk of a centralized server to become a single point of failure, and diminish the risk of shutting down the centralized server for unfinished business transactions. Second, P2P architectures provide scalable environments. It is able to deal with transient users. The Peer-toPeer computing paradigm is viewed as a novel approach for people to share resources such as files and computing cycles, or to support collaborative tasks. During the past few years, the Internet has been gradually shifting toward a distributed system that supports more than a unique client-server application. Peer-to-Peer (P2P) systems are distributed systems, in which nodes of equal roles and capabilities exchange information and services directly with each other, making it more popular. Peer-to-Peer (P2P) systems’ design, including efficient techniques for search, route queries and retrieval of data, allows the user to share huge volumes of data. However, the major problem in such networks is query routing, i.e., deciding to which other (Super-) Peers the query has to be sent for high efficiency and effectiveness. Traditional P2P systems offer support for richer queries; they provide the option to search by identifier, such as a keyword search with regular expressions. Search techniques for these systems must therefore operate under a different set of constraints than those techniques developed for persistent storage utilities. However, the technique of broadcasting all queries to all Peers suffer from limited efficiency and scalability. In hybrid P2P systems (Ioannidis et al., 2008; Annapureddy et al., 2007) composed of (Super-) Peers, when a Peer submits a query, this Peer becomes the source of this query. Then the query is transmitted to its Super-Peer (SP). The routing policy use semantic mappings between schemas of (Super-) Peers to quickly determine the relevant neighbors (SP), and to which neighbors the query is to be sent. A query received by a SP is processed over its local collection of data sources of different Peers. Once results are found, the SP will send a single response message back to the query source. The time the user must wait for the results to arrive is an important factor; and, it is affected by the mediation process which remains difficult to realize in such a context when the number of (Super-) Peers increases. Several reasons affect response times, such as the time it takes for the query to travel through several SP in the network; and, whenever the SP is forced to look for connections (i.e., mappings) in order to route the query. For these reasons, response times tend to be slow in hybrid P2P networks. Satisfaction time is simply the time that has elapsed between the submission of the query by the user, and the time he receives the overall results. Recently, data mining has gained in popularity due to the emergence of vast quantities of data. In this paper, a practical issue about data mining in P2P network is discussed. The motivations behind P2P data mining include the optimal usage of available computational resources, privacy, and dependability to eliminate critical points of service. In this paper, the effect of data mining in P2P query routing is presented. The proposed method focuses on how the query is routed to relevant Peers with minimum query processing at SP level in order to improve answering time of the queries by using data mining technique. The important advantage of the suggested approach is scalability. The said approach consists of grouping together (Super-) Peers that have similar themes for an efficient query routing. Each obtained group, called Super-Super-Peers (SSP), contains domains composed of Super-Peers (responsible of domains) and their corresponding Peers (the members); the former submit the queries that are often processed by the members of this group. Each SSP operates with an index that is obtained by applying decision tree algorithms; and, it keeps track of locations of contents concerning a query: when an SSP receives a query from a Super-Peer (in its group), it directly consults its index (without making any mappings) in order to determine 1) in its group, all Super-Peers (or domains) that are able to answer this query; and, 2) in other groups (i.e., other SSP), all Super-Peers which are relevant to this query. 20 more pages are available in the full version of this document, which may be purchased using the "Add to Cart" button on the product's webpage: www.igi-global.com/article/simulation-framework-p2pqueries-routing/67541?camid=4v1 This title is available in InfoSci-Journals, InfoSci-Journal Disciplines Business, Administration, and Management. Recommend this product to your librarian: www.igi-global.com/e-resources/libraryrecommendation/?id=2