Proceedings of the 17th International Conference on Distributed Computing and Networking最新文献_第4页

Tight self-stabilizing mobile byzantine-tolerant atomic register 严密的自稳定移动拜占庭容忍原子寄存器

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833320

Silvia Bonomi, Antonella del Pozzo, M. Potop-Butucaru

{"title":"Tight self-stabilizing mobile byzantine-tolerant atomic register","authors":"Silvia Bonomi, Antonella del Pozzo, M. Potop-Butucaru","doi":"10.1145/2833312.2833320","DOIUrl":"https://doi.org/10.1145/2833312.2833320","url":null,"abstract":"This paper proposes the first implementation of a self-stabilizing atomic register that is tolerant to both Mobile Byzantine Agents and transient failures. The register is maintained by n servers and our algorithm tolerates (i) any number of transient failures and (ii) up to f Mobile Byzantine Failures. In the Mobile Byzantine Failure model, faulty agents move from one server to another and when they are affecting a server, it behaves arbitrarily. Our implementation is designed for the round-based synchronous model where agents are moved from round to round. The paper considers four Mobile Byzantine Failure models differing for the diagnosis capabilities at server side i.e., when servers can diagnose their failure state (that is, be aware that the mobile Byzantine agent has left the server), and when servers cannot self-diagnose. We first prove lower bounds on the number of servers n necessary to construct a register tolerant to the presence of f Mobile Byzantine Failures for each of the Mobile Byzantine Failure models considered and then we propose a parametric algorithm working in all the models and matching the lower bounds.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117140611","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}

引用次数: 10

When can multi-agent rendezvous be executed in time linear in the diameter of a plane configuration? 何时可以在平面配置的直径线性时间内执行多智能体交会?

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833457

P. Hegarty, A. Martinsson, Dmitry Zhelezov

引用次数: 1

A secure credit card protocol over NFC 一个安全的信用卡协议在NFC

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833319

Oliver Jensen, M. Gouda, L. Qiu

引用次数: 6

STIC-D: algorithmic techniques for efficient parallel pagerank computation on real-world graphs STIC-D:在真实世界图上进行高效并行网页排名计算的算法技术

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833322

Paritosh Garg, Kishore Kothapalli

{"title":"STIC-D: algorithmic techniques for efficient parallel pagerank computation on real-world graphs","authors":"Paritosh Garg, Kishore Kothapalli","doi":"10.1145/2833312.2833322","DOIUrl":"https://doi.org/10.1145/2833312.2833322","url":null,"abstract":"Computing metrics on nodes of a graph is an essential step in understanding the properties of the graph. Pagerank is one such metric that is popular and is being used to measure the importance of nodes in not only web graphs but also in social networks, biological networks, road networks, and the like. The core of the computation of pagerank can be seen as an iterative approach that updates the pageranks of nodes until the values converge. However, as real-world graphs such as road networks and the web have a large size, one needs to design efficient techniques to address the challenges of scale. In addition to parallelism that can be exploited, it is important to also look for specific properties of graphs and their impact on the algorithm. In this paper, we present four algorithmic techniques that optimize the pagerank computation on real-world graphs. The techniques are presented with the aim of exploiting the nature of the real-world graphs and eliminating redundancies in the pagerank computation. Our techniques also have the advantage that with little extra effort one can quickly identify which of the techniques will be suitable for a given input graph. We implement our algorithm on an Intel i7 980x CPU running 12 threads using OpenMP Version 3.0. We study our techniques on four classes of real-world graphs: web graphs, social networks, citation and collaboration networks, and road networks. Our implementation achieves an average speedup of 32% compared to a baseline implementation.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133061983","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}

引用次数: 11

On perfectly secret message transmission in digraphs tolerating dual failures 容忍双重故障的有向图中的完全保密信息传输

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833327

R. Kishore, Chiranjeevi Vanarasa, Tushant Jha, K. Srinathan

引用次数: 3

Modular randomized byzantine k-set agreement in asynchronous message-passing systems 异步消息传递系统中的模块化随机拜占庭k集协议

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833313

A. Mostéfaoui, Moumen Hamouma, M. Raynal

{"title":"Modular randomized byzantine k-set agreement in asynchronous message-passing systems","authors":"A. Mostéfaoui, Moumen Hamouma, M. Raynal","doi":"10.1145/2833312.2833313","DOIUrl":"https://doi.org/10.1145/2833312.2833313","url":null,"abstract":"k-Set agreement is a central problem of fault-tolerant distributed computing. Considering a set of n processes, where up to t may commit failures, let us assume that each process proposes a value. The problem consists in defining an algorithm such that each non-faulty process decides a value, at most k different values are decided, and the decided values satisfy some context-depending validity condition. Synchronous message-passing algorithms solving k-set agreement have been proposed for different failure models (mainly process crashes, and process Byzantine failures). Differently, k-set agreement cannot be solved in failure-prone asynchronous message-passing systems when t ≥ k. To circumvent this impossibility an asynchronous system must be enriched with additional computational power. Assuming t ≥ k, this paper presents a distributed algorithm that solves k-set agreement in an asynchronous message-passing system where up to t processes may commit Byzantine failures. To that end, each process is enriched with randomization power. While randomized k-set agreement algorithms exist for the asynchronous process crash failure model where t ≥ k, to our knowledge the proposed algorithm is the first that solves k-set agreement in the presence of up to t ≥ k Byzantine processes. Interestingly, this algorithm is signature-free, and ensures that no value proposed only by Byzantine processes can be decided by a non-faulty process. Its design is based on a modular construction which rests on a \"no-duplicity\" one-to-all broadcast abstraction, and two all-to-all communication abstractions.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"76 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116767462","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

Automatic detection of cyberbullying on social networks based on bullying features 基于欺凌特征的社交网络网络欺凌自动检测

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2849567

Rui Zhao, Anna Zhou, K. Mao

{"title":"Automatic detection of cyberbullying on social networks based on bullying features","authors":"Rui Zhao, Anna Zhou, K. Mao","doi":"10.1145/2833312.2849567","DOIUrl":"https://doi.org/10.1145/2833312.2849567","url":null,"abstract":"With the increasing use of social media, cyberbullying behaviour has received more and more attention. Cyberbullying may cause many serious and negative impacts on a person's life and even lead to teen suicide. To reduce and stop cyberbullying, one effective solution is to automatically detect bullying content based on appropriate machine learning and natural language processing techniques. However, many existing approaches in the literature are just normal text classification models without considering bullying characteristics. In this paper, we propose a representation learning framework specific to cyberbullying detection. Based on word embeddings, we expand a list of pre-defined insulting words and assign different weights to obtain bullying features, which are then concatenated with Bag-of-Words and latent semantic features to form the final representation before feeding them into a linear SVM classifier. Experimental study on a twitter dataset is conducted, and our method is compared with several baseline text representation learning models and cyberbullying detection methods. The superior performance achieved by our method has been observed in this study.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126324505","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}

引用次数: 177

Distributed communication in bare-bones wireless networks 裸机无线网络中的分布式通信

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2015-10-26 DOI: 10.1145/2833312.2833454

Bogdan S. Chlebus, Shailesh Vaya

{"title":"Distributed communication in bare-bones wireless networks","authors":"Bogdan S. Chlebus, Shailesh Vaya","doi":"10.1145/2833312.2833454","DOIUrl":"https://doi.org/10.1145/2833312.2833454","url":null,"abstract":"We consider wireless networks in which the effects of interference are determined by the SINR model. We address the question of structuring distributed communication when stations have very limited individual capabilities. In particular, nodes do not know their geographic coordinates, neighborhoods or even the size n of the network, nor can they sense collisions. Each node is equipped only with its unique name from a range {1, ..., N}. We study the following three settings and distributed algorithms for communication problems in each of them. In the uncoordinated-start case, when one node starts an execution and other nodes are awoken by receiving messages from already awoken nodes, we present a randomized broadcast algorithm which wakes up all the nodes in O(n log2 N) rounds with high probability. In the synchronized-start case, when all the nodes simultaneously start an execution, we give a randomized algorithm that computes a backbone of the network in O(Δ log7 N) rounds with high probability. Finally, in the partly-coordinated-start case, when a number of nodes start an execution together and other nodes are awoken by receiving messages from the already awoken nodes, we develop an algorithm that creates a backbone network in time O(n log2 N + Δ log7 N) with high probability.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121365477","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}

引用次数: 12

Opacity proof for CaPR+ algorithm CaPR+算法的不透明度证明

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2015-10-23 DOI: 10.1145/2833312.2833445

Anshu S. Anand, R. Shyamasundar, Sathya Peri

引用次数: 7

Compact routing messages in self-healing trees 在自修复树中压缩路由消息

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2015-08-18 DOI: 10.1145/2833312.2833328

Armando Castañeda, D. Dolev, Amitabh Trehan

{"title":"Compact routing messages in self-healing trees","authors":"Armando Castañeda, D. Dolev, Amitabh Trehan","doi":"10.1145/2833312.2833328","DOIUrl":"https://doi.org/10.1145/2833312.2833328","url":null,"abstract":"Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and Chechik [PODC 2013], often have no means to tolerate failures, once the system has been setup and started. This paper presents, to our knowledge, the first self-healing compact routing scheme. Besides, our schemes are developed for low memory nodes, i.e., nodes need only O(log2 n) memory, and are thus, compact schemes. We introduce two algorithms of independent interest: The first is CompactFT, a novel compact version (using only O(log n) local memory) of the self-healing algorithm Forgiving Tree of Hayes et al. [PODC 2008]. The second algorithm (CompactFTZ) combines CompactFT with Thorup-Zwick's tree-based compact routing scheme [SPAA 2001] to produce a fully compact self-healing routing scheme. In the self-healing model, the adversary deletes nodes one at a time with the affected nodes self-healing locally by adding few edges. CompactFT recovers from each attack in only O(1) time and Δ messages, with only +3 degree increase and O(logΔ) graph diameter increase, over any sequence of deletions (Δ is the initial maximum degree). Additionally, CompactFTZ guarantees delivery of a packet sent from sender s as long as the receiver t has not been deleted, with only an additional O(y logΔ) latency, where y is the number of nodes that have been deleted on the path between s and t. If t has been deleted, s gets informed and the packet removed from the network.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116433532","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}

引用次数: 11