Oreste Verta

Bio: Oreste Verta is an academic researcher from University of Calabria. The author has contributed to research in topics: Grid & Web service. The author has an hindex of 7, co-authored 9 publications receiving 401 citations.

Weka4WS: a WSRF-enabled weka toolkit for distributed data mining on grids

Abstract: This paper presents Weka4WS, a framework that extends the Weka toolkit for supporting distributed data mining on Grid environments. Weka4WS adopts the emerging Web Services Resource Framework (WSRF) for accessing remote data mining algorithms and managing distributed computations. The Weka4WS user interface is a modified Weka Explorer environment that supports the execution of both local and remote data mining tasks. On every computing node, a WSRF-compliant Web Service is used to expose all the data mining algorithms provided by the Weka library. The paper describes the design and the implementation of Weka4WS using a first release of the WSRF library. To evaluate the efficiency of the proposed system, a performance analysis of Weka4WS for executing distributed data mining tasks in different network scenarios is presented.

A super-peer model for building resource discovery services in grids: design and simulation analysis

Abstract: As deployed Grids increase from tens to thousands of nodes, Peer-to-Peer (P2P) techniques and protocols can be used to implement scalable services and applications. The super-peer model is a novel approach that helps the convergence of P2P models and Grid environments and can be used to deploy a P2P information service in Grids. A super-peer serves a single Virtual Organization (VO) in a Grid, and manages metadata associated to the resources provided by the nodes of that VO. Super-peers connect to each other to form a peer network at a higher level. This paper examines how the super-peer model can be used to handle membership management and resource discovery services in a multi-organizational Grid. A simulation analysis evaluates the performance of a resource discovery protocol; simulation results can be used to tune protocol parameters in order to increase search efficiency.

Designing an information system for Grids: Comparing hierarchical, decentralized P2P and super-peer models

Abstract: As deployed Grids increase from 10s to 1000s of nodes, the construction of an efficient and scalable information system is a key issue, as it is vital for providing querying and discovery services. Today most Grids adopt a centralized or hierarchical model for their information system, but this model is characterized by poor scalability, resiliency and load-balancing features. Nowadays the research and development community is heading towards the use of scalable information systems based on distributed models such as the decentralized peer-to-peer (P2P) model and the super-peer model. If the former is adopted, each node can act both as a client and a server as it can generate discovery requests and also respond to requests issued by other peers. Requests and responses are forwarded with a hop-by-hop mechanism by ad hoc Grid Services hosted by Grid nodes. The super-peer model is a recently proposed approach that combines features of centralized and P2P models. A super-peer acts as a server for a single Grid organization, and publishes metadata describing the resources provided by the nodes of that organization. At the same time, super-peers connect to each other to form a P2P network at a higher level. This paper analyzes information systems based on three alternative models: the hierarchical, the decentralized P2P, and the super-peer model. A performance evaluation of such models is reported, and afterwards a performance comparison is discussed in order to analyze the pros and cons of each solution.

The Weka4WS framework for distributed data mining in service-oriented Grids

Abstract: The service-oriented architecture paradigm can be exploited for the implementation of data and knowledge-based applications in distributed environments. The Web services resource framework (WSRF) has recently emerged as the standard for the implementation of Grid services and applications. WSRF can be exploited for developing high-level services for distributed data mining applications. This paper describes Weka4WS, a framework that extends the widely used open source Weka toolkit to support distributed data mining on WSRF-enabled Grids. Weka4WS adopts the WSRF technology for running remote data mining algorithms and managing distributed computations. The Weka4WS user interface supports the execution of both local and remote data mining tasks. On every computing node, a WSRF-compliant Web service is used to expose all the data mining algorithms provided by the Weka library. The paper describes the design and implementation of Weka4WS using the WSRF libraries and services provided by Globus Toolkit 4. A performance analysis of Weka4WS for executing distributed data mining tasks in different network scenarios is presented. Copyright © 2008 John Wiley & Sons, Ltd.

The WEKA data mining software: an update

Abstract: More than twelve years have elapsed since the first public release of WEKA. In that time, the software has been rewritten entirely from scratch, evolved substantially and now accompanies a text on data mining [35]. These days, WEKA enjoys widespread acceptance in both academia and business, has an active community, and has been downloaded more than 1.4 million times since being placed on Source-Forge in April 2000. This paper provides an introduction to the WEKA workbench, reviews the history of the project, and, in light of the recent 3.6 stable release, briefly discusses what has been added since the last stable version (Weka 3.4) released in 2003.

Designing an Super-Peer Network

Abstract: A super-peer is a node in a peer-to-peer network that operates both as a server to a set of clients, and as an equal in a network of super-peers. Super-peer networks strike a balance between the efficiency of centralized search, and the autonomy, load balancing and robustness to attacks provided by distributed search. Furthermore, they take advantage of the heterogeneity of capabilities (e.g., bandwidth, processing power) across peers, which recent studies have shown to be enormous. Hence, new and old P2P systems like KaZaA and Gnutella are adopting super-peers in their design. Despite their growing popularity, the behavior of super-peer networks is not well understood. For example, what are the potential drawbacks of super-peer networks? How can super-peers be made more reliable? How many clients should a super-peer take on to maximize efficiency? we examine super-peer networks in detail, gaming an understanding of their fundamental characteristics and performance tradeoffs. We also present practical guidelines and a general procedure for the design of an efficient super-peer network.

Euro-Par 2006 Parallel Processing

Abstract: A Network Monitoring system is a vital component of a Grid; however, its scalability is a challenge. We propose a network monitoring approach that combines passive monitoring, a domain oriented overlay network, and an attitude for demand driven monitoring sessions. In order to keep into account the demand for extreme scalability, we introduce a solution for two problems that are inherent to the proposed approach: security and group membership maintenance.