Search results for " distributed"

showing 10 items of 235 documents

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.

Production-distribution systemsOptimizationMathematical optimizationRobust controlUncertain systemsMinimum normNetwork topologyMinimum norm flowControl theoryElectric network topologyConstrained flowUncertain systemsElectrical and Electronic EngineeringMathematicsFlow control (data)Network topologyAsymptotically optimalRobust control; OptimizationUncertain systemEthernet flow controlAsymptotically optimal Constrained flow Distributed flow control Minimum norm Network optimization Network topology Production-distribution systems Steady-state optimal; Algorithms Electric network topology Flow control Uncertain systems; OptimizationProduction-distribution systemFlow controlAsymptotically optimal algorithmControl and Systems EngineeringSteady-state optimalMinimum-cost flow problemDistributed flow controlRobust controlNetwork optimization; Distributed flow control; Production-distribution systems; Uncertain systems; Minimum norm flowNetwork optimizationAlgorithms
researchProduct

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…

Pseudorandom number generator020203 distributed computingSequenceFinite-state machineDynamical systems theoryComputer science010102 general mathematicsChaotic[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]02 engineering and technology[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation01 natural sciences[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR][INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]0202 electrical engineering electronic engineering information engineering[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]0101 mathematicsBoolean functionAlgorithmRandomnessGenerator (mathematics)2018 IEEE Middle East and North Africa Communications Conference (MENACOMM)
researchProduct

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…

Quadratic growth[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]0209 industrial biotechnology0102 computer and information sciences02 engineering and technologyMeasure (mathematics)Upper and lower bounds01 natural sciencesACM: F.: Theory of ComputationSquare (algebra)Computation Theory & MathematicsTheoretical Computer ScienceCombinatoricsQuadratic equation020901 industrial engineering & automationComputational Theory and Mathematics010201 computation theory & mathematicsTheory of computationInformation complexity[INFO]Computer Science [cs]0102 Applied Mathematics 0802 Computation Theory and Mathematics 0805 Distributed ComputingCommunication complexityBoolean functionComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Radiation and Hydrogen-Loading effects on Raman fiber-based temperature sensors

2013

We present experimental studies on how Raman based temperature sensors undergone two different treatments: gamma-radiation and H-loading. Unfortunately, gamma radiation and hydrogen release in harsh nuclear environment can affect the temperature measurements based on this technology of sensor, limiting the sensor performances. Moreover, the Raman device response in both cases changes with the different classes of multimode fibers that are used by the engineers.

Raman spectroscopy distributed temperature sensor optical fibers hydrogen loading radiation
researchProduct

A new Scheme for RPL to handle Mobility in Wireless Sensor Networks

2017

Mobile wireless sensor networks (WSNs) are characterised by dynamic changes in the network topology leading to route breaks and disconnections. The IPv6 routing protocol for low power and lossy networks (RPL), which has become a standard, uses the Trickle timer algorithm to handle changes in the network topology. However, neither RPL nor Trickle timer are well adapted to mobility. This paper investigates the problem of supporting mobility when using RPL. It enhances RPL to fit with sensors' mobility by studying two cases. Firstly, it proposes to modify RPL in order to fit with a dynamic and hybrid topology in the context of medical applications. Secondly, it investigates a more general case…

Routing protocol020203 distributed computingComputer Networks and CommunicationsComputer sciencebusiness.industryNetwork packetComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsContext (language use)02 engineering and technologyNetwork topologyIPv6Key distribution in wireless sensor networksHardware and Architecture0202 electrical engineering electronic engineering information engineeringTimerbusinessWireless sensor networkSoftwareComputer networkInternational Journal of Ad Hoc and Ubiquitous Computing
researchProduct

Broadband Internet Access via Multi-Hop Wireless Mesh Networks: Design, Protocol and Experiments

2010

Published version of an article from the journal: Wireless Personal Communications. The original publication is available at Spingerlink. http://dx.doi.org/10.1007/s11277-009-9907-9 While bandwidth for Internet access in urban areas is steadily increasing in recent years, many rural areas are still suffering from the effect of the digital divide. This paper presents a broadband Internet access paradigm developed in the context of the ADHOCSYS project, which was financed by the European Commission under the 6th Framework Program Information and Society Technologies, within the strategic objective of Broadband for All. Aiming at providing reliable Internet access in rural and mountainous regi…

Routing protocolbusiness.product_categoryBroadband networksComputer scienceMesh networkingHop (networking)law.inventionlawVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552BroadbandInternet accessWi-FiElectrical and Electronic EngineeringVDP::Mathematics and natural science: 400::Information and communication science: 420::Communication and distributed systems: 423Network architectureWireless mesh networkbusiness.industryWireless networkQuality of serviceWireless WANOrder One Network ProtocolComputer Science ApplicationsInternet Connection SharingDigital subscriber lineNetwork access pointHazy Sighted Link State Routing ProtocolRural areabusinessTelecommunicationsMunicipal wireless networkComputer network
researchProduct

Checkpointing Workflows for Fail-Stop Errors

2017

International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…

ScheduleComputer scienceworkflowDistributed computing[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]010103 numerical & computational mathematics02 engineering and technologyParallel computing[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]01 natural sciencesTheoretical Computer Science[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]checkpointfail-stop error0202 electrical engineering electronic engineering information engineeringOverhead (computing)[INFO]Computer Science [cs]0101 mathematicsresilienceClass (computer programming)020203 distributed computingJob shop schedulingProbabilistic logic020206 networking & telecommunications[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationDynamic programmingTask (computing)[INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]WorkflowComputational Theory and MathematicsHardware and Architecture[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Task analysis[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Software
researchProduct

Experimental Performance Evaluation of Cloud-Based Analytics-as-a-Service

2016

An increasing number of Analytics-as-a-Service solutions has recently seen the light, in the landscape of cloud-based services. These services allow flexible composition of compute and storage components, that create powerful data ingestion and processing pipelines. This work is a first attempt at an experimental evaluation of analytic application performance executed using a wide range of storage service configurations. We present an intuitive notion of data locality, that we use as a proxy to rank different service compositions in terms of expected performance. Through an empirical analysis, we dissect the performance achieved by analytic workloads and unveil problems due to the impedance…

Service (business)FOS: Computer and information sciencesDistributed databaseComputer sciencebusiness.industryReliability (computer networking)Distributed computingRank (computer programming)020206 networking & telecommunicationsCloud computing02 engineering and technologyData modelingperformance evaluationstorageComputer Science - Distributed Parallel and Cluster ComputingAnalytics0202 electrical engineering electronic engineering information engineeringDistributed Parallel and Cluster Computing (cs.DC)business
researchProduct

A methodology for assessing the impact of salinity gradient power generation in urban contexts

2018

Abstract The paper proposes a methodology to assess the potential impact of salinity gradient power technology in urban contexts. The idea to employ such energy source in urban contexts derives from the observation that, among the energy districts outputs, low-salinity treated wastewater can be used to produce electricity if a suitable source of high salinity feed (seawater of a salt-works) is also available. The methodology uses the HOMER software for assessing the district’s electric energy production, consumption and exchange with the main grid. Then, starting from the total gross surface and the number of inhabitants of the district, some possible realistic scenarios characterized by di…

Settore ING-IND/26 - Teoria Dello Sviluppo Dei Processi ChimiciRenewable Energy Sustainability and the Environmentbusiness.industry020209 energyGeography Planning and DevelopmentPhotovoltaic systemEnvironmental engineeringUrban densityTransportation02 engineering and technologyGridSettore ING-IND/33 - Sistemi Elettrici Per L'EnergiaSalinitySettore ING-IND/31 - Elettrotecnica0202 electrical engineering electronic engineering information engineeringOsmotic powerEnvironmental scienceSeawaterElectricitybusinessEnergy sourceSalinity gradient power Urban energy hub Sustainable cities Distributed generation HOMERCivil and Structural EngineeringSustainable Cities and Society
researchProduct

Financial Measures for Supporting Wind Power Systems in Europe: A Comparison between Green Tags and Feed’in Tariffs

2008

Distributed Generation demonstrates to be able to significantly influence the electric power system, bringing considerable benefits to the quality of service and improving the energetic efficiency of the distribution network. In particular, in the last few years, Distributed Generation from renewable energy sources is considerably increased thanks to the many support policies promoted worldwide with the aim of facing the environmental issue and the problem of the permanent rise of prices of the fossil energy. In this contest, after a brief review on the financing strategies carried out in Europe in the last decade for promoting the recourse to renewable energy, the paper presents a comparis…

Settore ING-IND/33 - Sistemi Elettrici Per L'EnergiaFeed-in Tariffs Green Tags Distributed Generation Wind Farms
researchProduct