2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)最新文献

筛选
英文 中文
UDS: A Unified Approach to Deterministic Multithreading UDS:确定性多线程的统一方法
F. Hauck, Jörg Domaschka
{"title":"UDS: A Unified Approach to Deterministic Multithreading","authors":"F. Hauck, Jörg Domaschka","doi":"10.1109/ICDCS.2016.73","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.73","url":null,"abstract":"There are several applications for the deterministic execution of software, e.g. replicated systems, test and febugging scenarios. In all cases the execution should lead zo the same effects in order to be consistent. Multi-threading is one of the major sources of nondeterminism. Several deterministic scheduling algorithms exist that allow concurrent but deterministic executions despite of arbitrary switching decisions of the underlying system schedulers. We present the novel and flexible Unified Deterministic Scheduling algorithm (UDS) for weakly and fully deterministic systems. Compared to existing algorithms, UDS has a broad parameter set that can be (re-)configured even at runtime. Further, we show that many existing algorithms are merely a particular configuration of UDS.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124736200","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
A De-compositional Approach to Regular Expression Matching for Network Security Applications 网络安全应用中正则表达式匹配的分解方法
Eric Norige, A. Liu
{"title":"A De-compositional Approach to Regular Expression Matching for Network Security Applications","authors":"Eric Norige, A. Liu","doi":"10.1109/ICDCS.2016.63","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.63","url":null,"abstract":"Regular expressions are a very common tool for network security applications because they can match precisely and maintain high matching speed even for many simultaneous patterns. Their core feature is efficient representation as an automaton, where much of the interaction between patterns can be pre-computed and aggregated. Many algorithms have been devised to try and improve this pre-computation to not take exponential space while keeping high performance, but none has met all the requirements of fast, automated construction, small memory image, and high matching speed. We present Match Filtering, a technique for de-composing regular expressions into segments that can be matched independently, while a stateful post-processing engine filters these matches to eliminate those that do not correspond to matches of the original regular expression. Using standard CPU instructions, the post-processing engine can more efficiently represent constructs that would require a multiplicative increase in automaton states. Because the pre-processing is simple, automaton construction can be automated and fast, and because most on-line processing is done by a DFA, its matching speed is close to that of a DFA alone. We demonstrate experimentally 30× smaller, fast (seconds, not minutes) automaton construction and 43% faster matching speeds than state-of-the-art software algorithms.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124431070","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
Optimal Marching of Autonomous Networked Robots 自主网络机器人的最优行进
Buri Ban, Miao Jin, Hongyi Wu
{"title":"Optimal Marching of Autonomous Networked Robots","authors":"Buri Ban, Miao Jin, Hongyi Wu","doi":"10.1109/ICDCS.2016.51","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.51","url":null,"abstract":"The recent advances in sensors, actuators, robots, and mobile wireless communication technologies have acceleratedinterest in autonomous networked robots (ANRs), where theindividual robots coordinate among themselves to complete atask, e.g., to explore or monitor a Field of Interest (FoI). Byteamwork, which is especially important in complex tasks, ANRsystem expresses much more capacity than traditional staticsensor networks. Existing work focuses on improving the coverageperformance of a group of ANRs within a single FoI. In thisresearch, we consider a group of ANRs that are instructed toexplore a number of FoIs. After they complete a task at currentFoI, they move to the next one, which may be far away fromcurrent one and the shape can also vary dramatically. Ourresearch focuses on how to efficiently enable such transition. TheANRs must be able to redeploy themselves to desired positionsin the new FoI based on distributed algorithms. Besides, to avoidunexpected event breaks network's integrity, the ANRs shouldpreserve their local connectivities as much as they can andorganize themselves as a whole network without any isolatednodes during the transition. Furthermore, considering energyconsumption, such relocation algorithm should work at the costof reasonable total moving distance. We study this problemand call it optimal marching of autonomous networked robots. The proposed algorithms guarantee global connectivity, andpreserve local connectivities as much as possible at negligiblecost of moving distance. Additionally, ANRs can automaticallyadjust their deployment density in the new FoI based on therequirements of various tasks or regions.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121976756","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
Enabling Privacy-Preserving Incentives for Mobile Crowd Sensing Systems 为移动人群传感系统启用隐私保护激励
Haiming Jin, Lu Su, Bolin Ding, K. Nahrstedt, N. Borisov
{"title":"Enabling Privacy-Preserving Incentives for Mobile Crowd Sensing Systems","authors":"Haiming Jin, Lu Su, Bolin Ding, K. Nahrstedt, N. Borisov","doi":"10.1109/ICDCS.2016.50","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.50","url":null,"abstract":"Recent years have witnessed the proliferation of mobile crowd sensing (MCS) systems that leverage the public crowd equipped with various mobile devices (e.g., smartphones, smartglasses, smartwatches) for large scale sensing tasks. Because of the importance of incentivizing worker participation in such MCS systems, several auction-based incentive mechanisms have been proposed in past literature. However, these mechanisms fail to consider the preservation of workers' bid privacy. Therefore, different from prior work, we propose a differentially private incentive mechanism that preserves the privacy of each worker's bid against the other honest-but-curious workers. The motivation of this design comes from the concern that a worker's bid usually contains her private information that should not be disclosed. We design our incentive mechanism based on the single-minded reverse combinatorial auction. Specifically, we design a differentially private, approximately truthful, individual rational, and computationally efficient mechanism that approximately minimizes the platform's total payment with a guaranteed approximation ratio. The advantageous properties of the proposed mechanism are justified through not only rigorous theoretical analysis but also extensive simulations.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124891709","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}
引用次数: 102
An Endpoint Communication Profiling Tool for Distributed Computing Frameworks 分布式计算框架的端点通信分析工具
Andrea Rosà, L. Chen, Walter Binder
{"title":"An Endpoint Communication Profiling Tool for Distributed Computing Frameworks","authors":"Andrea Rosà, L. Chen, Walter Binder","doi":"10.1109/ICDCS.2016.67","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.67","url":null,"abstract":"Message exchange is a central activity in distributed computing frameworks. Nevertheless, past research has paid little attention on profiling techniques and tools for endpoint communication. In this paper, we fill this gap by introducing a new fine-grained profiler for endpoints and communication between them in distributed systems. Our tool aids efficient analysis, optimization, and tuning of endpoint communication in distributed frameworks. The paper presents an overview of our profiler, discusses employed profiling techniques and collected metrics, and shows preliminary results in profiling a well-known distributed computing framework.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126054278","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
Memory Efficient One-Sided Communucation Library "ACP" in Globary Memory on Raspberry Pi 2 树莓派2上全局内存中的内存高效单边通信库“ACP”
Yoshiyuki Morie, H. Honda, T. Nanri, Taizo Kobayashi, H. Shibamura, R. Susukita, Yuichiro Ajima
{"title":"Memory Efficient One-Sided Communucation Library \"ACP\" in Globary Memory on Raspberry Pi 2","authors":"Yoshiyuki Morie, H. Honda, T. Nanri, Taizo Kobayashi, H. Shibamura, R. Susukita, Yuichiro Ajima","doi":"10.1109/ICDCS.2016.54","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.54","url":null,"abstract":"Previously, communications in parallel programs for High Performance Computing (HPC) and Distributed Computing (DC) are mostly written with two-sided communication interfaces that are based on a pair of operations, Send and Receive. Since such interface requires explicit synchronization between both sides of the communication, techniques for communication optimization such as overlapping are not efficiently described in many cases. On the other hand, one-sided communication interface is becoming important as a method to describe asynchronous communications to enable highly overlapped communication with computation. As one of such interface, in this demonstration, Advanced Communication Primitives (ACP) is introduced. ACP is a portable interface that supports UDP, IBverbs of InfiniBand and Tofu library of K Computer. In addition to that, it is designed to be memory efficient. For example, with 10 thousand processes, the memory consumption of ACP over UDP is estimated to be less than 1MB. Since the number of computational elements is increasing more rapidly than the amount of available memory, this memory efficiency is becoming one of the keys for parallel programs in HPC and DC. To show this characteristics, we run ACP library on Raspberry Pi 2, and examine its performance and memory consumption.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128099263","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}
引用次数: 0
PAG: Private and Accountable Gossip PAG:私人和可靠的八卦
Jérémie Decouchant, Sonia Ben Mokhtar, Albin Petit, Vivien Quéma
{"title":"PAG: Private and Accountable Gossip","authors":"Jérémie Decouchant, Sonia Ben Mokhtar, Albin Petit, Vivien Quéma","doi":"10.1109/ICDCS.2016.34","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.34","url":null,"abstract":"A large variety of content sharing applications rely, at least partially, on gossip-based dissemination protocols. However, these protocols are subject to various types of faults, among which selfish behaviours performed by nodes that benefit from the system without contributing their fair share to it. Accountability mechanisms (e.g., PeerReview, AVMs, FullReview), which require that nodes log their interactions with others and periodically inspect each others' logs are effective solutions to deter faults. However, these solutions require that nodes disclose the content of their logs, which may leak sensitive information about them. Building on a monitoring infrastructure and on homomorphic cryptographic procedures, we propose in this paper PAG, the first accountable and partially privacy-preserving gossip protocol. We assess PAG theoretically using the ProVerif cryptographic protocol verifier and evaluate it experimentally using both a real deployment on a cluster of 48 machines and simulations. The performance evaluation of PAG, performed using a video live streaming application, shows that it is compatible with the visualisation of live video content on commodity Internet connections. Furthermore, PAG's bandwidth consumption inherits the desirable scalability properties of gossip when the number of users in the system grows.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128385289","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}
引用次数: 7
Quality-Aware and Fine-Grained Incentive Mechanisms for Mobile Crowdsensing 移动人群感知的质量意识和细粒度激励机制
Jing Wang, Jian Tang, Dejun Yang, Erica Wang, G. Xue
{"title":"Quality-Aware and Fine-Grained Incentive Mechanisms for Mobile Crowdsensing","authors":"Jing Wang, Jian Tang, Dejun Yang, Erica Wang, G. Xue","doi":"10.1109/ICDCS.2016.30","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.30","url":null,"abstract":"Limited research efforts have been made for Mobile CrowdSensing (MCS) to address quality of the recruited crowd, i.e., quality of services/data each individual mobile user and the whole crowd are potentially capable of providing, which is the main focus of the paper. Moreover, to improve flexibility and effectiveness, we consider fine-grained MCS, in which each sensing task is divided into multiple subtasks and a mobile user may make contributions to multiple subtasks. In this paper, we first introduce mathematical models for characterizing the quality of a recruited crowd for different sensing applications. Based on these models, we present a novel auction formulation for quality-aware and fine-grained MCS, which minimizes the expected expenditure subject to the quality requirement of each subtask. Then we discuss how to achieve the optimal expected expenditure, and present a practical incentive mechanism to solve the auction problem, which is shown to have the desirable properties of truthfulness, individual rationality and computational efficiency. We conducted trace-driven simulation using the mobility dataset of San Francisco taxies. Extensive simulation results show the proposed incentive mechanism achieves noticeable expenditure savings compared to two well-designed baseline methods, and moreover, it produces close-to-optimal solutions.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120991694","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}
引用次数: 79
Social Graph Publishing with Privacy Guarantees 社交图谱发布与隐私保障
F. Ahmed, A. Liu, Rong Jin
{"title":"Social Graph Publishing with Privacy Guarantees","authors":"F. Ahmed, A. Liu, Rong Jin","doi":"10.1109/ICDCS.2016.74","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.74","url":null,"abstract":"Online social network graphs provide useful insights on various social phenomena such as information dissemination and epidemiology. Unfortunately, social network providers often refuse to publish their social network graphs due to privacy concerns. Recently, differential privacy has become the widely accepted criteria for privacy preserving data publishing because it provides strongest privacy guarantees for publishing sensitive datasets. Although some work has been done on publishing matrices with differential privacy, they are computationally unpractical as they are not designed to handle large matrices such as the adjacency matrices of OSN graphs. In this paper, we propose a random matrix approach to OSN graph publishing, which achieves storage and computational efficiency by reducing the dimensions of adjacency matrices and achieves differential privacy by adding a small amount of noise. Our key idea is to first project each row of an adjacency matrix into a low dimensional space using random projection, and then perturb the projected matrix with random noise, and finally publish the perturbed and projected matrix. In this paper, we first prove that random projection plus random perturbation preserve differential privacy, and also that the random noise required to achieve differential privacy is small. We then validate the proposed approach and evaluate the utility of the published data for two different applications, namely node clustering and node ranking, using publicly available OSN graphs of Facebook, Live Journal, and Pokec.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126984780","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
Practical Intrusion-Tolerant Networks 实用的抗入侵网络
Daniel Obenshain, Thomas Tantillo, Amy Babay, John L. Schultz, Andrew Newell, Md. Endadul Hoque, Y. Amir, C. Nita-Rotaru
{"title":"Practical Intrusion-Tolerant Networks","authors":"Daniel Obenshain, Thomas Tantillo, Amy Babay, John L. Schultz, Andrew Newell, Md. Endadul Hoque, Y. Amir, C. Nita-Rotaru","doi":"10.1109/ICDCS.2016.99","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.99","url":null,"abstract":"As the Internet becomes an important part of the infrastructure our society depends on, it is crucial to construct networks that are able to work even when part of the network is compromised. This paper presents the first practical intrusion-tolerant network service, targeting high-value applications such as monitoring and control of global clouds and management of critical infrastructure for the power grid. We use an overlay approach to leverage the existing IP infrastructure while providing the required resiliency and timeliness. Our solution overcomes malicious attacks and compromises in both the underlying network infrastructure and in the overlay itself. We deploy and evaluate the intrusion-tolerant overlay implementation on a global cloud spanning East Asia, North America, and Europe, and make it publicly available.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130090227","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}
引用次数: 18
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学术官方微信
小红书