Search results for "Distributed System"

showing 10 items of 48 documents

A Simulation Software for the Evaluation of Vulnerabilities in Reputation Management Systems

2019

Multi-agent distributed systems are characterized by autonomous entities that interact with each other to provide, and/or request, different kinds of services. In several contexts, especially when a reward is offered according to the quality of service, individual agents (or coordinated groups) may act in a selfish way. To prevent such behaviours, distributed Reputation Management Systems (RMSs) provide every agent with the capability of computing the reputation of the others according to direct past interactions, as well as indirect opinions reported by their neighbourhood. This last point introduces a weakness on gossiped information that makes RMSs vulnerable to malicious agents’ intent …

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniGeneral Computer ScienceDistributed algorithmComputer scienceMulti-agent systemQuality of servicemedia_common.quotation_subjectNetwork simulation020206 networking & telecommunications02 engineering and technologycomputer.software_genreVariety (cybernetics)Simulation softwareDistributed systems security.Risk analysis (engineering)Software deploymentRobustness (computer science)020204 information systems0202 electrical engineering electronic engineering information engineeringDisseminationcomputerReputationmedia_common
researchProduct

Modeling and Mitigating Errors in Belief Propagation for Distributed Detection

2021

We study the behavior of the belief-propagation (BP) algorithm affected by erroneous data exchange in a wireless sensor network (WSN). The WSN conducts a distributed multidimensional hypothesis test over binary random variables. The joint statistical behavior of the sensor observations is modeled by a Markov random field whose parameters are used to build the BP messages exchanged between the sensing nodes. Through linearization of the BP message-update rule, we analyze the behavior of the resulting erroneous decision variables and derive closed-form relationships that describe the impact of stochastic errors on the performance of the BP algorithm. We then develop a decentralized distribute…

hajautetut järjestelmätFOS: Computer and information sciencesfactor graphsComputer scienceComputer Science - Information TheoryBinary number02 engineering and technologycommunication errorsBelief propagationcomputation errorslangaton tiedonsiirtooptimointiLinearizationalgoritmit0202 electrical engineering electronic engineering information engineeringlikelihood-ratio testmessage-passing algorithmsElectrical and Electronic EngineeringStatistical hypothesis testingdistributed systemsMarkov random fieldsignaalinkäsittelyInformation Theory (cs.IT)linear data-fusionsensoriverkot020206 networking & telecommunicationscooperative communicationsData exchange020201 artificial intelligence & image processingblind signal processingRandom variableWireless sensor networkAlgorithm
researchProduct

Reputation management in distributed systems

2008

Several distributed applications, implemented over today’s Internet, are based on the assumption that participating agents collaborate in order to achieve their own goal. However, when these applications are modelled as unstructured distributed systems, the greater autonomy and decentralization encourage antisocial behaviours, which are likely to cause performance degradation for the whole system. This paper presents a fully distributed reputation management system that allows the evaluation of agent reputation in unstructured environments without any centralized coordination. The proposed approach is based on game theory and is capable of capturing the highly dynamic nature of the involved…

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniExploitbusiness.industryComputer scienceDistributed computingmedia_common.quotation_subjectComputer securitycomputer.software_genreDecentralizationFree ridingDistributed SystemIncentiveOrder (exchange)The InternetbusinessGame theorycomputerReputationReputationmedia_common2008 3rd International Symposium on Communications, Control and Signal Processing
researchProduct

A survey on peer-to-peer SIP based communication systems

2010

Published version of an article from the journal: Peer-to-Peer Networking and Applications. The original publication is available at Spingerlink. http://dx.doi.org/10.1007/s12083-009-0064-4 Recently, both academia and industry have initiated research projects directed on integration of P2PSIP paradigm into communication systems. In this paradigm, P2P network stores most of the network information on each participating peer without help of the central servers. The concept of self-configuration, self-establishment greatly improves the robustness of the network system compared with the traditional Client/Server based systems. In this paper, we survey P2PSIP solutions proposed recently both in …

VDP::Mathematics and natural science: 400::Information and communication science: 420::Communication and distributed systems: 423Computer Networks and Communicationsbusiness.industryComputer scienceMessage routingPeer-to-peerCommunications systemcomputer.software_genrePeer reviewWorld Wide WebNAT traversalRobustness (computer science)ServerVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552businessChord (peer-to-peer)computerSoftwareComputer networkPeer-to-Peer Networking and Applications
researchProduct

Identification of Distributed Systems with Logical Interaction Structure

2012

This paper focuses on the structure identification problem for a class of networked systems, where the interaction among components or agents is described through logical maps. In particular, agents are heterogeneous cooperating systems, i.e. they may have different individual dynamics and different interaction rules depending on input events. While we assume that the individual agents' dynamics are known, each agent has partial knowledge of the logical map encoding the interaction of another agent with its neighbors. Based on the so-called algebraic normal form for binary functions, we present a technique by which the network structure described by a logical function can be dynamically est…

Partial knowledgeTheoretical computer scienceInteraction ruleDistributed computingBinary numberClass (philosophy)Individual dynamicAlgebraic normal formLogical functionAlgebraic normal forms; Binary functions; Cooperating systems; Distributed systems; Individual agent; Individual dynamics; Interaction rules; Interaction structures; Logical functions; Logical maps; Lower approximation; Network structures; Networked systems; Partial knowledge; Real systems; Structure identification; Truth tablesBinary functionSettore ING-INF/04 - AutomaticaLogical mapMathematicsCooperating systemStructure (mathematical logic)Networked systemStructure identificationTruth tablesTruth tableMobile robotReal systemParameter identification problemAlgebraic normal formIdentification (information)Lower approximationInteraction structureIndividual agentDistributed systemNetwork structure
researchProduct

Cooperative MAC design in multi-hop wireless networks: Part I: When source and destination are within the transmission range of each other

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-010-0072-y Cooperative communication is regarded as a promising technology in future 5G wireless networks to enhance network performance by exploiting time and/or space diversity via distributed terminals. In this paper, we propose a cooperative medium access protocol which addresses three key aspects of cooperative communications from MAC layer perspective, namely, when to cooperate, whom to cooperate with and how to protect ongoing cooperative transmissions. To further improve the protocol performance in dense networks, …

VDP::Mathematics and natural science: 400::Information and communication science: 420::Communication and distributed systems: 423VDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552
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

The Quest for available bandwidth measurement techniques for large-scale distributed systems

2009

In recent years the research community has developed many techniques to estimate the end-to-end available bandwidth of an Internet path. This important metric can be potentially exploited to optimize the performance of several distributed systems and, even, to improve the effectiveness of the congestion control mechanism of TCP. Thus, it has been suggested that some existing estimation techniques could be used for this purpose. However, existing tools were not designed for large-scale deployments and were mostly validated in controlled settings, considering only one measurement running at a time. In this paper, we argue that current tools, while offering good estimates when used alone, migh…

Distributed SystemsSettore ING-INF/03 - TelecomunicazioniBandwidth Estimation
researchProduct

Mobile-to-mobile fading channels in amplify-and-forward relay systems under line-of-sight conditions: statistical modeling and analysis

2010

Published version of an article from the journal:Annales des Telecommunications/Annals of Telecommunications. The original publication is available at Springerlink. http://dx.doi.org/10.1007/s12243-010-0169-z This paper deals with the modeling and analysis of narrowband mobile-to-mobile (M2M) fading channels for amplify-and-forward relay links under line-of-sight (LOS) conditions. It is assumed that a LOS component exists in the direct link between the source mobile station (SMS) and the destination mobile station (DMS), as well as in the links via the mobile relay (MR). The proposed channel model is referred to as the multiple-LOS second-order scattering (MLSS) channel model. The MLSS chan…

VDP::Mathematics and natural science: 400::Information and communication science: 420::Communication and distributed systems: 423Computer scienceCommunications systemlaw.inventionNon-line-of-sight propagationNarrowbandRelaylawMobile stationVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552Computer Science::Networking and Internet ArchitectureElectronic engineeringFadingElectrical and Electronic EngineeringRelay channelComputer Science::Information TheoryCommunication channel
researchProduct

Statistical properties of the capacity of double Nakagami-m channels

2010

paper presented at the 2010 5th IEEE International Symposium on Wireless Pervasive Computing (ISWPC), Modena, Italy. (c) 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. Paper also available from the publisher: http://dx.doi.org/10.1109/ISWPC.2010.5483776 In this article, we have presented an extensive statistical analysis of the capacity of double1 Nakagami-m channels. The double Nakagami-m c…

VDP::Mathematics and natural science: 400::Information and communication science: 420::Communication and distributed systems: 423Spatial correlationbusiness.industryComputer scienceCumulative distribution functionNakagami distributionProbability density functionCommunications systemTopologylaw.inventionChannel capacityRelaylawVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552FadingTelecommunicationsbusiness
researchProduct