WRAS '10最新文献

筛选
英文 中文
Improving validity of query answering in dynamic systems 提高动态系统中查询应答的有效性
WRAS '10 Pub Date : 2010-07-25 DOI: 10.1145/1953563.1953566
R. Baldoni, Silvia Bonomi, A. Cerocchi, Leonardo Querzoni
{"title":"Improving validity of query answering in dynamic systems","authors":"R. Baldoni, Silvia Bonomi, A. Cerocchi, Leonardo Querzoni","doi":"10.1145/1953563.1953566","DOIUrl":"https://doi.org/10.1145/1953563.1953566","url":null,"abstract":"Let us consider a large scale distributed system and a query executed on top of it where every process has to contribute to the result. Informally, a query satisfies the interval validity property if its result has been calculated by retrieving data from a set of processes containing at least all those ones that have been present in the system during the whole query lifetime. If the system is prone to churn, it is easy to show that a query cannot deterministically satisfy interval validity. In this paper we propose a novel algorithm that can be used to support distributed queries by increasing the probability of a query to satisfy interval validity. The algorithm strives to (i) reduce the query calculation time (to reduce the net effect of churn) and to (ii) increase the robustness of the overlay network it builds by clustering nodes into cliques of limited size in order for their implementation to be still practical. The paper provides a set of experiments that show the tradeoff between the churn rate and the number of times the interval validity is satisfied.","PeriodicalId":344749,"journal":{"name":"WRAS '10","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121952170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Purifying data by machine learning with certainty levels 通过机器学习以确定级别净化数据
WRAS '10 Pub Date : 2010-07-25 DOI: 10.1145/1953563.1953567
S. Dolev, G. Leshem, Reuven Yagel
{"title":"Purifying data by machine learning with certainty levels","authors":"S. Dolev, G. Leshem, Reuven Yagel","doi":"10.1145/1953563.1953567","DOIUrl":"https://doi.org/10.1145/1953563.1953567","url":null,"abstract":"A fundamental paradigm used for autonomic computing, self-managing systems, and decision-making under uncertainty and faults is machine learning. Machine learning uses a data-set, or a set of data-items. A data-item is a vector of feature values and a classification. Occasionally these data sets include misleading data items that were either introduced by input device malfunctions, or were maliciously inserted to lead the machine learning to wrong conclusions. A reliable learning algorithm must be able to handle a corrupted data-set. Otherwise, an adversary (or simply a malfunctioning input device that corrupts a portion of the data-set) may lead to inaccurate classifications. Therefore, the challenge is to find effective methods to evaluate and increase the certainty level of the learning process as much as possible. This paper introduces the use of a certainty level measure to obtain better classification capability in the presence of corrupted data items. Assuming a known data distribution (e.g., a normal distribution) and/or a known upper bound on the given number of corrupted data items, our techniques define a certainty level for classifications. Another approach suggests enhancing the random forest techniques to cope with corrupted data items by augmenting the certainty level for the classification obtained in each leaf in the forest. This method is of independent interest, that of significantly improving the classification of the random forest machine learning technique in less severe settings.","PeriodicalId":344749,"journal":{"name":"WRAS '10","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132753967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Robust architectures for open distributed systems and topological self-stabilization: invited paper 开放分布式系统和拓扑自稳定的鲁棒架构:特邀论文
WRAS '10 Pub Date : 2010-07-25 DOI: 10.1145/1953563.1953569
S. Schmid
{"title":"Robust architectures for open distributed systems and topological self-stabilization: invited paper","authors":"S. Schmid","doi":"10.1145/1953563.1953569","DOIUrl":"https://doi.org/10.1145/1953563.1953569","url":null,"abstract":"Distributed systems are often dynamic in the sense that there are frequent membership changes (nodes joining and leaving the network), either due to regular churn or due to an attack. Maintaining availability and full functionality of such a system under continuous topological changes hence constitutes an important algorithmic challenge. This paper reports on some of our recent results on robust distributed systems. We review two randomized architectures that build upon the continuous-discrete approach by Naor and Wieder, namely the SHELL network which allows for fast joins and leaves and organizes more reliable (or stronger) nodes in a core network where their communication is not affected by malicious (or weak) nodes, and the Chameleon network whose replica placement strategy and whose intentional topological updates ensure resiliency against denial-of-service attacks, even from past insiders. To complement our investigations on randomized architectures, we discuss algorithms to maintain hypercubic networks under worst-case churn. Finally, we advocate the design of self-stabilizing topologies---a very appealing and still not well-understood notion of robustness---that converge quickly to a desirable structure from arbitrarily degenerated states. As a use case, graph linearization is examined in more detail. This invited paper complements the WRAS'10 talk and is joint work with Matthias Baumgart, Dominik Gall, Riko Jacob, Fabian Kuhn, Andrea Richa, Stephan Ritscher, Christian Scheideler, Joest Smit, Hanjo Täubig, and Roger Watten-hofer.","PeriodicalId":344749,"journal":{"name":"WRAS '10","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124397250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Conditions for the solvability of fault-tolerant consensus in asynchronous unknown networks: invited paper 异步未知网络中容错共识可解性的条件:特邀论文
WRAS '10 Pub Date : 2010-07-25 DOI: 10.1145/1953563.1953564
F. Greve, S. Tixeuil
{"title":"Conditions for the solvability of fault-tolerant consensus in asynchronous unknown networks: invited paper","authors":"F. Greve, S. Tixeuil","doi":"10.1145/1953563.1953564","DOIUrl":"https://doi.org/10.1145/1953563.1953564","url":null,"abstract":"The consensus problem is at the heart of solutions related to the development of modern reliable distributed systems. This paper studies necessary and sufficient conditions under which fault-tolerant consensus become solvable in dynamic systems and self-organizing networks. Those conditions are related to the synchrony requirements of the environment, to the connectivity of the knowledge graph constructed by the nodes in order to communicate with their peers, as well as to the knowledge about global parameters in the system, such as, the total number of participants and the maximum number of node crashes.","PeriodicalId":344749,"journal":{"name":"WRAS '10","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132386104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Accessing probabilistic quorums in dynamic networks 动态网络中概率群体的访问
WRAS '10 Pub Date : 2010-07-25 DOI: 10.1145/1953563.1953565
O. Denysyuk, L. Rodrigues
{"title":"Accessing probabilistic quorums in dynamic networks","authors":"O. Denysyuk, L. Rodrigues","doi":"10.1145/1953563.1953565","DOIUrl":"https://doi.org/10.1145/1953563.1953565","url":null,"abstract":"Quorums are a fundamental building block for solving various fundamental problems such as consensus, distributed dictionaries, distributed storage, among others. In particular, probabilistic quorums have shown to be scalable, efficient, and suitable for dynamic environments [12]. Unfortunately, most existent analytic results for accessing probabilistic quorums are tailored to static networks [8]. However, we believe that the correct functioning of such systems must be assured in a much wider range of scenarios.\u0000 In this paper, we discuss the random walk based scheme for accessing probabilistic quorums in dynamic networks where an oblivious adversary changes the communication links arbitrarily in each round. We show that O(n3 log n) communication steps are needed to access a probabilistic quorum under these conditions.","PeriodicalId":344749,"journal":{"name":"WRAS '10","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126491202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Optimal exploration of small rings 小环的最佳探索
WRAS '10 Pub Date : 2010-07-25 DOI: 10.1145/1953563.1953571
Stéphane Devismes
{"title":"Optimal exploration of small rings","authors":"Stéphane Devismes","doi":"10.1145/1953563.1953571","DOIUrl":"https://doi.org/10.1145/1953563.1953571","url":null,"abstract":"In [4], the authors look at probabilistic bounds and solutions for the exploration of anonymous unoriented rings of any size by a cohort of robots. Considering identical, oblivious, and probabilistic robots, they show that at least four of them are necessary to solve the problem. Moreover, they give a randomized protocol for four robots working in any ring of size more than eight.\u0000 Here we close the question of optimal (w.r.t. the cohort size) ring exploration by probabilistic robots. Indeed, we propose a protocol for four robots working in any ring of size less or equal to eight. Composing this protocol with the one in [4], we obtain a protocol for any ring-size.","PeriodicalId":344749,"journal":{"name":"WRAS '10","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114664079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Self-stabilizing tiny interaction protocols 自稳定微型交互协议
WRAS '10 Pub Date : 2010-07-25 DOI: 10.1145/1953563.1953572
D. Canepa, M. Potop-Butucaru
{"title":"Self-stabilizing tiny interaction protocols","authors":"D. Canepa, M. Potop-Butucaru","doi":"10.1145/1953563.1953572","DOIUrl":"https://doi.org/10.1145/1953563.1953572","url":null,"abstract":"In this paper we extend a variant of population protocols model with the mobile agents paradigm and discuss their self-stabilization. As study case we present the self-stabilizing implementation of a class of token based algorithms. In the curent work we only consider interactions between weak nodes. They are uniform, they do not have unique identifiers, are static and their interactions are restricted to a subset of nodes called neighbors. While interacting, a pair of neighboring nodes may create mobile agents (mobile computational abstractions) that perform traversals of the network and accelerate the system stabilization. In this work we only explore the power of oblivious stateless agents. Our work shows that the agent paradigm is an elegant distributed tool for achieving self-stabilization in tiny interaction protocols. Nevertheless, in order to reach the full power of classical self-stabilizing algorithms more complex classes of agents have to be considered (e.g. agents with memory or identifiers). Interestingly, our work proposes for the first time a model that unifies the recent studies in mobile robots(agents) that evolve in a discrete space and the already established population protocols paradigm.","PeriodicalId":344749,"journal":{"name":"WRAS '10","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125447883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
An agent exploration in unknown undirected graphs with whiteboards 一个带有白板的未知无向图的智能体探索
WRAS '10 Pub Date : 2010-07-25 DOI: 10.1145/1953563.1953570
Y. Sudo, D. Baba, Junya Nakamura, Fukuhito Ooshita, H. Kakugawa, T. Masuzawa
{"title":"An agent exploration in unknown undirected graphs with whiteboards","authors":"Y. Sudo, D. Baba, Junya Nakamura, Fukuhito Ooshita, H. Kakugawa, T. Masuzawa","doi":"10.1145/1953563.1953570","DOIUrl":"https://doi.org/10.1145/1953563.1953570","url":null,"abstract":"We consider the exploration problem with a single agent in undirected graphs. Starting from an arbitrary node, the agent has to explore all the nodes and edges in the graph and return to the starting node. Our goal is to minimize both the number of agent moves and the memory space of the agent, which dominate the amount of communication during the exploration. In our setting, the agent is allowed to use the local memory called the whiteboard on each node (the whiteboard model), while most of existing exploration algorithms do not use the whiteboard (the no-whiteboard model). In the no-whiteboard model, the agent must memorize in its memory all information needed to explore the graph, and thus designing an exploration algorithm of small agent memory is difficult. In this paper, by allowing the agent to use whiteboards, we present four exploration algorithms such that both the number of agent moves and the agent memory space are small.","PeriodicalId":344749,"journal":{"name":"WRAS '10","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133752111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Trust your social network according to satisfaction, reputation and privacy 根据满意度、声誉和隐私信任你的社交网络
WRAS '10 Pub Date : 2010-07-25 DOI: 10.1145/1953563.1953568
Yann Busnel, Patricia Serrano-Alvarado, Philippe Lamarre
{"title":"Trust your social network according to satisfaction, reputation and privacy","authors":"Yann Busnel, Patricia Serrano-Alvarado, Philippe Lamarre","doi":"10.1145/1953563.1953568","DOIUrl":"https://doi.org/10.1145/1953563.1953568","url":null,"abstract":"Nowadays we are witnessing a massive usage of social networking sites (Facebook, MySpace, etc.). Those systems facilitate user interaction; however, they disregard users' well-being because users are forced to trust the network and to use the system without any guarantees. We consider that this is little satisfactory for systems where the users make the network successful thanks to their interactions.\u0000 In this work, we propose to study how to improve users' trust towards the system in terms of reputation, privacy and satisfaction. Despite former separate studies, we argue that these notions are strongly linked and must be analyzed in a correlated way.","PeriodicalId":344749,"journal":{"name":"WRAS '10","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123643090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书