4,115 research outputs found
Automatic fault detection on BIPV systems without solar irradiation data
BIPV systems are small PV generation units spread out over the territory, and
whose characteristics are very diverse. This makes difficult a cost-effective
procedure for monitoring, fault detection, performance analyses, operation and
maintenance. As a result, many problems affecting BIPV systems go undetected.
In order to carry out effective automatic fault detection procedures, we need a
performance indicator that is reliable and that can be applied on many PV
systems at a very low cost. The existing approaches for analyzing the
performance of PV systems are often based on the Performance Ratio (PR), whose
accuracy depends on good solar irradiation data, which in turn can be very
difficult to obtain or cost-prohibitive for the BIPV owner. We present an
alternative fault detection procedure based on a performance indicator that can
be constructed on the sole basis of the energy production data measured at the
BIPV systems. This procedure does not require the input of operating conditions
data, such as solar irradiation, air temperature, or wind speed. The
performance indicator, called Performance to Peers (P2P), is constructed from
spatial and temporal correlations between the energy output of neighboring and
similar PV systems. This method was developed from the analysis of the energy
production data of approximately 10,000 BIPV systems located in Europe. The
results of our procedure are illustrated on the hourly, daily and monthly data
monitored during one year at one BIPV system located in the South of Belgium.
Our results confirm that it is possible to carry out automatic fault detection
procedures without solar irradiation data. P2P proves to be more stable than PR
most of the time, and thus constitutes a more reliable performance indicator
for fault detection procedures.Comment: 7 pages, 8 figures, conference proceedings, 29th European
Photovoltaic Solar Energy Conference and Exhibition, Amsterdam, 201
Self-Healing Protocols for Connectivity Maintenance in Unstructured Overlays
In this paper, we discuss on the use of self-organizing protocols to improve
the reliability of dynamic Peer-to-Peer (P2P) overlay networks. Two similar
approaches are studied, which are based on local knowledge of the nodes' 2nd
neighborhood. The first scheme is a simple protocol requiring interactions
among nodes and their direct neighbors. The second scheme adds a check on the
Edge Clustering Coefficient (ECC), a local measure that allows determining
edges connecting different clusters in the network. The performed simulation
assessment evaluates these protocols over uniform networks, clustered networks
and scale-free networks. Different failure modes are considered. Results
demonstrate the effectiveness of the proposal.Comment: The paper has been accepted to the journal Peer-to-Peer Networking
and Applications. The final publication is available at Springer via
http://dx.doi.org/10.1007/s12083-015-0384-
Exploiting the Synergy Between Gossiping and Structured Overlays
In this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale distributed systems. Despite the common goals, the two areas have, however, been relatively isolated. We focus on three problem domains where there is an untapped potential of using gossiping combined with SONs. We argue for applying gossip-based membership for ring-based SONs---such as Chord and Bamboo---to make them handle partition mergers and loopy networks. We argue that small world SONs---such as Accordion and Mercury---are specifically well-suited for gossip-based membership management. The benefits would be better graph-theoretic properties. Finally, we argue that gossip-based algorithms could use the overlay constructed by SONs. For example, many unreliable broadcast algorithms for SONs could be augmented with anti-entropy protocols. Similarly, gossip-based aggregation could be used in SONs for network size estimation and load-balancing purposes
Self-organising management of Grid environments
This paper presents basic concepts, architectural principles and algorithms for efficient resource and security management in cluster computing environments and the Grid. The work presented in this paper is funded by BTExacT and the EPSRC project SO-GRM (GR/S21939)
Recommended from our members
Self-organizing peer-to-peer social networks
This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ 2008 The Authors.Peer-to-peer (P2P) systems provide a new solution to distributed information and resource sharing because of its outstanding properties in decentralization, dynamics, flexibility, autonomy, and cooperation, summarized as DDFAC in this paper. After a detailed analysis of the current P2P literature, this paper suggests to better exploit peer social relationships and peer autonomy to achieve efficient P2P structure design. Accordingly, this paper proposes Self-organizing peer-to-peer social networks (SoPPSoNs) to self-organize distributed peers in a decentralized way, in which neuron-like agents following extended Hebbian rules found in the brain activity represent peers to discover useful peer connections. The self-organized networks capture social associations of peers in resource sharing, and hence are called P2P social networks. SoPPSoNs have improved search speed and success rate as peer social networks are correctly formed. This has been verified through tests on real data collected from the Gnutella system. Analysis on the Gnutella data has verified that social associations of peers in reality are directed, asymmetric and weighted, validating the design of SoPPSoN. The tests presented in this paper have also evaluated the scalability of SoPPSoN, its performance under varied initial network connectivity and the effects of different learning rules.National Natural Science of Foundation of Chin
Enhanced Failure Detection Mechanism in MapReduce
The popularity of MapReduce programming model has increased interest in the research community for its improvement. Among the other directions, the point of fault tolerance, concretely the failure detection issue seems to be a crucial one, but that until now has not reached its satisfying level. Motivated by this, I decided to devote my main research during this period into having a prototype system architecture of MapReduce framework with a new failure detection service, containing both analytical (theoretical) and implementation part. I am confident that this work should lead the way for further contributions in detecting failures to any NoSQL App frameworks, and cloud storage systems in general
- âŠ