Search results for "Distributed computing"
showing 10 items of 622 documents
An efficient distributed approach for dynamic multicast trees
2005
In this paper we present a distributed algorithm for constructing efficient multicast trees in large networks. The algorithm allows the set up of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that our approach outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of convergence time and communication complexity. Furthermore, we introduce a distributed technique for dynamically updating the multicast tree. The approach monitors the accumulated damage as nodes join or…
From vertical to horizontal architecture
2006
Some of the main challenges related to wireless sensor networks implementation are low-quality communication, energy conservation, resource-constrained computation, distributed network management, data processing and the scalability of the protocols. This combination makes the implementation of software a demanding task and encourages to new approaches when thinking of software architecture.In this paper an architecture combining a low protocol stack with a cross-layer management entity is presented. One of the main ideas behind the architecture presented is to make application programming easier and to simplify the protocol stack in such a way that it would suit better for the limited reso…
On the collision property of chaotic iterations based post-treatments over cryptographic pseudorandom number generators
2018
International audience; There is not a proper mathematical definition of chaos, we have instead a quite big amount of definitions, each of one describes chaos in a more or less general context. Taking in account this, it is clear why it is hard to design an algorithm that produce random numbers, a kind of algorithm that could have plenty of concrete appliceautifat (anul)d bions. However we must use a finite state machine (e.g. a laptop) to produce such a sequence of random numbers, thus it is convenient, for obvious reasons, to redefine those aimed sequences as pseudorandom; also problems arise with floating point arithmetic if one wants to recover some real chaotic property (i.e. propertie…
A Deep Learning Approach for Energy Efficient Computational Offloading in Mobile Edge Computing
2019
Mobile edge computing (MEC) has shown tremendous potential as a means for computationally intensive mobile applications by partially or entirely offloading computations to a nearby server to minimize the energy consumption of user equipment (UE). However, the task of selecting an optimal set of components to offload considering the amount of data transfer as well as the latency in communication is a complex problem. In this paper, we propose a novel energy-efficient deep learning based offloading scheme (EEDOS) to train a deep learning based smart decision-making algorithm that selects an optimal set of application components based on remaining energy of UEs, energy consumption by applicati…
Quadratically Tight Relations for Randomized Query Complexity
2020
In this work we investigate the problem of quadratically tightly approximating the randomized query complexity of Boolean functions R(f). The certificate complexity C(f) is such a complexity measure for the zero-error randomized query complexity R0(f): C(f) ≤R0(f) ≤C(f)2. In the first part of the paper we introduce a new complexity measure, expectational certificate complexity EC(f), which is also a quadratically tight bound on R0(f): EC(f) ≤R0(f) = O(EC(f)2). For R(f), we prove that EC2/3 ≤R(f). We then prove that EC(f) ≤C(f) ≤EC(f)2 and show that there is a quadratic separation between the two, thus EC(f) gives a tighter upper bound for R0(f). The measure is also related to the fractional…
Quantum chemical meta-workflows in MoSGrid
2014
Quantum chemical workflows can be built up within the science gateway Molecular Simulation Grid. Complex workflows required by the end users are dissected into smaller workflows that can be combined freely to larger meta-workflows. General quantum chemical workflows are described here as well as the real use case of a spectroscopic analysis resulting in an end-user desired meta-workflow. All workflow features are implemented via Web Services Parallel Grid Runtime and Developer Environment and submitted to UNICORE. The workflows are stored in the Molecular Simulation Grid repository and ported to the SHIWA repository. © 2014 John Wiley & Sons, Ltd.
Active queue management stability in multiple bottleneck networks
2004
In this paper, we show that the active queue management (AQM) controllers, usually configured on a single bottleneck basis, may not prevent instability in the presence of multiple bottlenecks. We justify this result through a multiple bottleneck model.
Measurement and Modeling of the Origins of Starvation in Congestion Controlled Mesh Networks
2008
Significant progress has been made in understanding the behavior of TCP and congestion-controlled traffic over multi- hop wireless networks. Despite these advances, however, no prior work identified severe throughput imbalances in the basic scenario of mesh networks, in which one-hop flows contend with two-hop flows for gateway access. In this paper, we demonstrate via real network measurements, test-bed experiments, and an analytical model that starvation exists in such a scenario, i.e., the one-hop flow receives most of the bandwidth while the two- hop flow starves. Our analytical model yields a solution consisting of a simple contention window policy that can be implemented via mechanism…
Pilot Prototype of Autonomous Pallets and Employing Little’s Law for Routing
2015
Application of autonomous control for shop-floor scheduling by considering real-time control of material flows is advantageous to those assembly lines with dynamic and uncertain circumstances. Among several potential processors with computing and communication capabilities—for representing autonomous material carriers—wireless sensor nodes seem as promising objects to be applied in practice. For realizing autonomy in making scheduling and routing-control decisions some methodologies need to be embedded in the nodes. Among several experimented methodologies, e.g., artificial intelligence, genetic algorithm, etc., in the context of a doctoral research, in this current special case of assembly…
Proposal of a neuro-fuzzy model of a WWW server
2005
This paper presents the ways of designing simulation models of Web servers. At the beginning queuing network models are introduced, those models are generally known and often used in the initial phase of research on particular technical solutions. Next, an entirely new approach to the issue discussed is presented - neuro-fuzzy models, thanks to which, it is possible to automate the process of designing simulation models. The results of comparative tests of these two models are presented. Based on these results it can be concluded that neuro-fuzzy models are accurate and can be used in simulation research.