Search results for "Tribute"
showing 10 items of 1455 documents
Negotiation mechanisms for capacity allocation in distributed enterprises
2003
Abstract The paper proposes an agent based approach for the capacity allocation in distributed enterprises, characterized by complex and articulated organizations and by geographically distributed production capacities contended by many product families. In such a scenario the process of allocating the production capacity to the single customer order is one the major bottlenecks of the production planning activity as far as many organizational decisional levels are involved and market turbulence implies a continuous retuning of the capacity allocation plan. A high grade of reactiveness is needed. Agent based approaches and negotiation models, by decentralizing the decisional control and sim…
The linear saturated decentralized strategy for constrained flow control is asymptotically optimal
2013
We present an algorithm for constrained network flow control in the presence of an unknown demand. Our algorithm is decentralized in the sense that it is implemented by a team of agents, each controlling just the flow on a single arc of the network based only on the buffer levels at the nodes at the extremes of the arc, while ignoring the actions of other agents and the network topology. We prove that our algorithm is also stabilizing and steady-state optimal. Specifically, we show that it asymptotically produces the minimum-norm flow. We finally generalize our algorithm to networks with a linear dynamics and we prove that certain least-square optimality properties still hold.
Quantized Dissensus in switching networks with nodes death and duplication* *Research supported by MURST-PRIN “Robust Techniques for uncertain system…
2009
Abstract In this paper we discuss agents exchanging quantized flows to diverge one from the others according to a dissensus protocol. A Quantized Gossip algorithm is considered. Evolutions of the states during switching intervals and at switching instants and their property are described and analyzed. The modeling of switching systems describing networks where death and duplication processes occur is described. Some properties of the topology reached by the network when different rules of duplication and inheritance are implemented.
A Dynamic Distributed Algorithm for Multicast Path Setup
2005
In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outp…
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…
A Constructive Arboricity Approximation Scheme
2020
The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.
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…
On the Influence of PRNGs on Data Distribution
2012
The amount of digital information produced grows rapidly and constantly. Storage systems use clustered architectures designed to store and process this information efficiently. Their use introduces new challenges in storage systems development, like load-balancing and data distribution. A variety of randomized solutions handling data placement issues have been proposed and utilized. However, to the best of our knowledge, there has not yet been a structured analysis of the influence of pseudo random number generators (PRNGs) on the data distribution. In the first part of this paper we consider Consistent Hashing [1] as a combination of two consecutive phases: distribution of bins and distrib…
Load match and grid interaction optimization of a net zero energy building through electricity storage: An Italian case-study
2016
The study aims at applying of Load Match and Grid Interaction indexes to a Net Zero Energy Building in order to optimize the performances of its energy systems. The case study is a modular prefabricated house that uses solar energy (photovoltaic) and natural gas (Fuel Cell) as energy sources and equipped with an Energy Management System addressing the optimal energy use.