Search results for "Distributed"
showing 10 items of 1260 documents
On the design of pervasive computing applications based on Bluetooth and a P2P concept
2006
As an example of implementing the pervasive computing, we developed an application framework to deploy an easy, spontaneous, and infrastructureless network. We selected the Bluetooth technology with the peer-to-peer (P2P) concept to develop an experimental application which enables peers to exchange their resources. Overall network architecture and the prototype application are presented. We selected a small test-bed and simulation to evaluate the overall performance and system behaviour. We measured and present our findings in term of the duration of inquiry procedure and the throughput, according to various experimental parameters such as physical distance between nodes and their speeds.
Detecting faulty wireless sensor nodes through Stochastic classification
2011
In many distributed systems, the possibility to adapt the behavior of the involved resources in response to unforeseen failures is an important requirement in order to significantly reduce the costs of management. Autonomous detection of faulty entities, however, is often a challenging task, especially when no direct human intervention is possible, as is the case for many scenarios involving Wireless Sensor Networks (WSNs), which usually operate in inaccessible and hostile environments. This paper presents an unsupervised approach for identifying faulty sensor nodes within a WSN. The proposed algorithm uses a probabilistic approach based on Markov Random Fields, requiring exclusively an ana…
Asynchronous Runtime Verification of Business Processes
2015
The authors propose a runtime verification mechanism for business processes. This mechanism allows verifying the correctness of business process execution and it runs in parallel with the base processes affecting them insignificantly. The authors have identified the case where the use of business process runtime verification is helpful and applicable. The verification mechanism monitors the business process execution and verifies compliance with the base process description. The verification mechanism prototype was developed and tested in real business processes, as well as limits of runtime verification overhead were evaluated.
ImageRover: A Content-Based Image Browser for the World Wide Web
1997
ImageRover is a search-by-image-content navigation tool for the World Wide Web (WWW). To gather images expediently, the image collection subsystem utilizes a distributed fleet of WWW robots running on different computers. The image robots gather information about the images they find, computing the appropriate image decompositions and indices, and store this extracted information in vector form for searches based on image content. At search time, users can iteratively guide the search through the selection of relevant examples. Search performance is made efficient through the use of an approximate, optimized k-d tree algorithm. The system employs a novel relevance feedback algorithm that se…
Impact of Novel Energy Management Actions on Household Appliances for Money Savings and CO2 Emissions Reduction
2009
In order to obtain CO2 emissions reductions, energy management control actions inside apartments and detached houses have to be carried out. In this work, new control actions devoted to the reduction of electrical energy consumptions inside typical Italian apartments are proposed. These “Distributed on Site” (DoS) actions consist in employing specific control strategies to smartly exploit the hot water provided by a solar panel, the electricity generated by a photovoltaic panel and the delayed starting of appliances.
Gossip
2019
Nowadays, a growing number of servers and workstations feature an increasing number of GPUs. However, slow communication among GPUs can lead to poor application performance. Thus, there is a latent demand for efficient multi-GPU communication primitives on such systems. This paper focuses on the gather, scatter and all-to-all collectives, which are important operations for various algorithms including parallel sorting and distributed hashing. We present two distinct communication strategies (ring-based and flow-oriented) to generate transfer plans for their topology-aware implementation on NVLink-connected multi-GPU systems. We achieve a throughput of up to 526 GB/s for all-to-all and 148 G…
Approximate Algorithm for Fast Capacity Provisioning in WANs with Trade-Off between Performance and Cost under Budget Constraint
2014
Due to the emergence of Software Defined Networking (SDN) with the idea of centralized control over computer networks, the Capacity and Flow Assignment Problem (CFA) may be approached in a classical non-distributed fashion in real-life scenarios. The question arises whether a heuristical approach to this NP-complete problem is of any use in practice.
Generalized centro-invertible matrices with applications
2014
Centro-invertible matrices are introduced by R.S. Wikramaratna in 2008. For an involutory matrix R, we define the generalized centro-invertible matrices with respect to R to be those matrices A such that RAR = A^−1. We apply these matrices to a problem in modular arithmetic. Specifically, algorithms for image blurring/deblurring are designed by means of generalized centro-invertible matrices. In addition, if R1 and R2 are n × n involutory matrices, then there is a simple bijection between the set of all centro-invertible matrices with respect to R1 and the set with respect to R2.
Mutual entity authentication for LTE
2011
In this paper we outline the Authentication and Key Agreement protocol (EPS-AKA) found in Long-Term Evolution (LTE) systems. This architecture is the 3GPP version of a 4G access security architecture. The LTE security architecture is a mature evolved architecture, with both strengths and weaknesses. In this paper we propose an amendment to the EPS-AKA protocol to make it a full mutual (online) entity authentication protocol. We also analyze the proposal, highlighting both the improvements and the drawbacks of the new AKA protocol.
Channel aggregation with guard-band in D-OFDM based CRNs: Modeling and performance evaluation
2016
Channel aggregation (CA) techniques can offer flexible channel allocation and improve overall system performance in multi-channel cognitive radio networks (CRNs). Although many CA techniques have been proposed and studied, the impact of guard-band on CA for channel access has not been addressed in-depth. In this paper, we study the guard-band allocation mechanisms in discontinuous-orthogonal frequency division multiplexing (D-OFDM) based CRNs, and investigate the impact of guard-band sharing on SU flows when CA is enabled. Continuous time Markov chain (CTMC) based models have been developed in order to investigate the stochastic behavior of PU and SU flows. Based on our mathematical analysi…