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

筛选
英文 中文
A Realistic and Optimized V2V Communication System for Taxicabs 出租车V2V通信系统的优化设计
Yang Wang, Erkun Yang, Wei Zheng, Liusheng Huang, Hengchang Liu, Binxin Liang
{"title":"A Realistic and Optimized V2V Communication System for Taxicabs","authors":"Yang Wang, Erkun Yang, Wei Zheng, Liusheng Huang, Hengchang Liu, Binxin Liang","doi":"10.1109/ICDCS.2016.28","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.28","url":null,"abstract":"Due to high mobility and intermittent connections in vehicular networks, reliable and efficient vehicular communication is a challenging task. Previous research on Vehicle-to-Vehicle (V2V) communication mostly focuses on achieving reliable transmissions from a given source to a given destination by mining moving patterns of taxicabs. However, to the best of our knowledge, none of them considered the habit-driven regularities of individual taxicabs as well as the urban-layout-driven time-varying regularities of crowds of taxicabs synthetically. With this insight, we model both individual and holistic driving patterns by Markov Chain models, then devise a new method to predict possible driving routes for every single taxicab. In addition, we design a new method to evaluate the probability that a single taxicab retrieves information of a specific road segment while it drives through another road segment during a given time period, and also to quantify the expected probability that a single taxicab obtains the information of a given road segment in the near future. With such information, our solution enables the selection of the optimal data packet transmission scheme. We evaluate our solution on a real-world taxicab dataset. Experimental results demonstrate that our approach outperforms alternative solutions in terms of diffusion speed and success ratio of data retrieval.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"23 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":"114753810","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
CryptoLock (and Drop It): Stopping Ransomware Attacks on User Data CryptoLock(并放弃它):阻止对用户数据的勒索软件攻击
Nolen Scaife, Henry Carter, Patrick Traynor, Kevin R. B. Butler
{"title":"CryptoLock (and Drop It): Stopping Ransomware Attacks on User Data","authors":"Nolen Scaife, Henry Carter, Patrick Traynor, Kevin R. B. Butler","doi":"10.1109/ICDCS.2016.46","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.46","url":null,"abstract":"Ransomware is a growing threat that encrypts auser's files and holds the decryption key until a ransom ispaid by the victim. This type of malware is responsible fortens of millions of dollars in extortion annually. Worse still, developing new variants is trivial, facilitating the evasion of manyantivirus and intrusion detection systems. In this work, we presentCryptoDrop, an early-warning detection system that alerts a userduring suspicious file activity. Using a set of behavior indicators, CryptoDrop can halt a process that appears to be tampering witha large amount of the user's data. Furthermore, by combininga set of indicators common to ransomware, the system can beparameterized for rapid detection with low false positives. Ourexperimental analysis of CryptoDrop stops ransomware fromexecuting with a median loss of only 10 files (out of nearly5,100 available files). Our results show that careful analysis ofransomware behavior can produce an effective detection systemthat significantly mitigates the amount of victim data loss.","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":"116032321","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}
引用次数: 371
Reflecting on the Past, Preparing for the Future: From Peer-to-Peer to Edge-Centric Computing 反思过去,准备未来:从点对点到边缘中心计算
A. Montresor
{"title":"Reflecting on the Past, Preparing for the Future: From Peer-to-Peer to Edge-Centric Computing","authors":"A. Montresor","doi":"10.1109/ICDCS.2016.111","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.111","url":null,"abstract":"In many aspects of human activity, there has been a continuous struggle between the forces of centralization and decentralization. Computing exhibits the same phenomenon; after having abandoned mainframes in favor of PCs, the last decade has witnessed an unparalleled centralization and consolidation of services in data centers and clouds. Yet, trust, privacy, security and autonomy concerns are requiring to shift control again, taking services from the central nodes (the \"core\") to the other logical extreme (the \"edge\") of the Internet. This development can help blurring the boundary between man and machine, and embrace social computing in which humans are part of the computation and decision-making loop, resulting in a human-centered system design. In this tutorial we will elaborate on the necessary steps to be taken and challenges to be solved to realize this vision. The tutorial will include an overview of related research topics, including peerto-peer networks, blockchains, hybrid and decentralized cloud architectures.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"140 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":"123072396","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
On MinMax-Memory Claims for Scientific Workflows in the In-memory Cloud Computing 论内存云计算中科学工作流的最小最大内存要求
Yang Wang, Chengzhong Xu, Shuibing He, Xian-He Sun
{"title":"On MinMax-Memory Claims for Scientific Workflows in the In-memory Cloud Computing","authors":"Yang Wang, Chengzhong Xu, Shuibing He, Xian-He Sun","doi":"10.1109/ICDCS.2016.13","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.13","url":null,"abstract":"We propose a new concept of minmax memory claim (MMC) to achieve cost-effective workflow computations in in-memory cloud computing environments. The minmax-memory claim is defined as the minimum amount of memory required to finish the workflow without compromising its maximum concurrency. With MMC, the workflow tenants can achieve the best performance via the maximum concurrency while minimizing the cost to use the memory resources. In this paper, we present the algorithms to find the MMC for workflow computation and evaluate its value by applying it to deadlock avoidance algorithms.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"19 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":"115642088","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
The Same Speed Timer in Population Protocols 人口协议中的相同速度计时器
Y. Sudo, T. Masuzawa, A. Datta, L. Larmore
{"title":"The Same Speed Timer in Population Protocols","authors":"Y. Sudo, T. Masuzawa, A. Datta, L. Larmore","doi":"10.1109/ICDCS.2016.82","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.82","url":null,"abstract":"A novel concept of the same speed timer is presented, and is applied in the population protocol (PP) model to improve the convergence time of existing loosely-stabilizing leader election protocols. Loosely-stabilizing leader election guarantees that, starting from any configuration, the system reaches a safe configuration within a short time (convergence), and after that, the system keeps the unique leader for a long time (closure). Two loosely-stabilizing leader election protocols for arbitrary graphs exist in the literature; one uses identifiers of nodes and the other uses random numbers to elect a unique leader. Both protocols guarantee that the expected convergence time is polynomial and the expected holding time (the time the leader is kept) is exponential. In this paper, convergence time of these protocols is dramatically improved by the same speed timer without impairing the exponential holding time. Specifically, a fast deterministic loosely-stabilizing leader election protocol that uses identifiers of nodes and a fast randomized looselystabilizing leader election protocol are given. The expected convergence time and expected holding time of the former protocol are O(mN log N) and Ω(Ne2N), respectively, where m is the number of edges in the graph and N is a given upper bound on the number of nodes n. The expected convergence time and expected holding time of the latter protocol are O(mN2 log n) and Ω(Ne2N), respectively. A self-stabilizing two-hop coloring protocol that uses only O(log n) memory space of each agent is given as a tool of the latter protocol. A lower bound is also given: any loosely-stabilizing leader election protocol with expected exponential holding time requires Ω(mN) expected convergence time.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"22 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":"127783170","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}
引用次数: 15
Measurement, Modeling, and Analysis of TCP in High-Speed Mobility Scenarios 高速移动场景下TCP的测量、建模和分析
Qingfang Liu, Ke Xu, Haiyang Wang, Meng Shen, Li Li, Qingyang Xiao
{"title":"Measurement, Modeling, and Analysis of TCP in High-Speed Mobility Scenarios","authors":"Qingfang Liu, Ke Xu, Haiyang Wang, Meng Shen, Li Li, Qingyang Xiao","doi":"10.1109/ICDCS.2016.43","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.43","url":null,"abstract":"The rapid growth of high-speed transit systems, such as High Speed Rail (HSR), is putting considerable pressure on TCP-based data transmission. It is well known that TCP is suffering from severe throughput degradation in high-speed mobility scenarios. The root cause at the transport layer however remains unclear and largely undetermined to date. In this paper, we aim to pinpoint the throughput bottlenecks and develop a throughput model to understand TCP in high-speed mobility environments. Based on the analysis of real-world HSR traces, we find that high-speed mobility will introduce significant challenges to the packet retransmission process after timeouts. And ACKs are more likely to trigger spurious retransmission timeouts in TCP flows in high-speed mobile environments. Such problems are not yet considered in the existing TCP models because classic timeouts can easily be recovered by retransmission in stationary scenarios. We therefore propose an enhanced TCP throughput model to integrate the above features. Our model analysis indicates that the optimization of TCP ACK latency is critical to obtain better throughput. Moreover, reliable retransmission mechanisms, e.g., multi-path TCP (MPTCP), can also bring notable benefits in high-speed mobility environments.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"25 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":"126332738","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}
引用次数: 8
INSPECTOR: Data Provenance Using Intel Processor Trace (PT) 检查员:使用英特尔处理器跟踪(PT)进行数据来源
Jörg Thalheim, Pramod Bhatotia, C. Fetzer
{"title":"INSPECTOR: Data Provenance Using Intel Processor Trace (PT)","authors":"Jörg Thalheim, Pramod Bhatotia, C. Fetzer","doi":"10.1109/ICDCS.2016.86","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.86","url":null,"abstract":"Data provenance strives for explaining how the computation was performed by recording a trace of the execution. The provenance trace is useful across a wide-range of workflows to improve the dependability, security, and efficiency of software systems. In this paper, we present Inspector, a POSIX-compliant data provenance library for shared-memory multithreaded programs. The Inspector library is completely transparent and easy to use: it can be used as a replacement for the pthreads library by a simple exchange of libraries linked, without even recompiling the application code. To achieve this result, we present a parallel provenance algorithm that records control, data, and schedule dependencies using a Concurrent Provenance Graph (CPG). We implemented our algorithm to operate at the compiled binary code level by leveraging a combination of OS-specific mechanisms, and recently released Intel PT ISA extensions as part of the Broadwell micro-architecture. Our evaluation on a multicore platform using applications from multithreaded benchmarks suites (PARSEC and Phoenix) shows reasonable provenance overheads for a majority of applications. Lastly, we briefly describe three case-studies where the generic interface exported by Inspector is being used to improve the dependability, security, and efficiency of systems. The Inspector library is publicly available for further use in a wide range of other provenance workflows.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"46 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":"131997267","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}
引用次数: 29
SpotLight: An Information Service for the Cloud 聚焦:面向云的信息服务
Xue Ouyang, David E. Irwin, P. Shenoy
{"title":"SpotLight: An Information Service for the Cloud","authors":"Xue Ouyang, David E. Irwin, P. Shenoy","doi":"10.1109/ICDCS.2016.88","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.88","url":null,"abstract":"Infrastructure-as-a-Service cloud platforms are incredibly complex: they rent hundreds of different types of servers across multiple geographical regions under a wide range of contract types that offer varying tradeoffs between risk and cost. Unfortunately, the internal dynamics of cloud platforms are opaque along several dimensions. For example, while the risk of servers not being available when requested is critical in optimizing the cloud's risk-cost tradeoffs, it is not typically made visible to users. Thus, inspired by prior work on Internet bandwidth probing, we propose actively probing cloud platforms to explicitly learn such information, where each \"probe\" is a request for a particular type of server. We model the relationships between different contracts types to develop a market-based probing policy, which leverages the insight that real-time prices in cloud spot markets loosely correlate with the supply (and availability) of fixed-price on-demand servers. That is, the higher the spot price for a server, the more likely the corresponding fixed-price on-demand server is not available. We incorporate market-based probing into SpotLight, an information service that enables cloud applications to query this and other data, and use it to monitor the availability of more than 4500 distinct server types across 9 geographical regions in Amazon's Elastic Compute Cloud over a 3 month period. We analyze this data to reveal interesting observations about the platform's internal dynamics. We then show how SpotLight enables two recently proposed derivative cloud services to select a better mix of servers to host applications, which improves their availability from ~70-90% to near 100% in practice.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"91 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":"133279328","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}
引用次数: 29
CRONets: Cloud-Routed Overlay Networks CRONets:云路由覆盖网络
Chris X. Cai, Franck Le, Xin Sun, G. Xie, H. Jamjoom, R. Campbell
{"title":"CRONets: Cloud-Routed Overlay Networks","authors":"Chris X. Cai, Franck Le, Xin Sun, G. Xie, H. Jamjoom, R. Campbell","doi":"10.1109/ICDCS.2016.49","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.49","url":null,"abstract":"Overlay networking and ISP-assisted tunneling are effective solutions to overcome problematic BGP routes and bypass troublesome autonomous systems. Despite their demonstrated effectiveness, overlay support is not broadly available. In this paper, we propose Cloud-Routed Overlay Networks (CRONets), whereby users can readily build their own overlays using nodes from global and well-provisioned cloud providers like IBM Softlayer or Amazon EC2. While previous studies have demonstrated the benefits of overlay networks with the high-speed experimental Internet2 backbone, we are the first to evaluate the improvements in a realistic -- cloud -- setting. We conduct a large-scale experiment where we observe 6,600 Internet paths. The results show that CRONets improve the throughput for 78% of the default Internet paths with a median and average improvement factors of 1.67 and 3.27 times respectively, at a tenth of the cost of leasing private lines of comparable performance. We also performed a longitudinal measurement, and demonstrate that the performance gains are consistent over time with only a small number of overlay nodes needed to be deployed. However, given the size and dynamic nature of the Internet routing system (e.g., due to congestion and failures), selecting the proper path is still a challenging problem. To address it, we propose a novel solution based on the newly-introduced MPTCP extensions. Our experiments show that MPTCP can achieve the maximum observed throughput across the different overlay paths.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"699 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":"116729096","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}
引用次数: 17
Amnesia: A Bilateral Generative Password Manager 失忆症:双边生成密码管理器
Luren Wang, Yue Li, Kun Sun
{"title":"Amnesia: A Bilateral Generative Password Manager","authors":"Luren Wang, Yue Li, Kun Sun","doi":"10.1109/ICDCS.2016.90","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.90","url":null,"abstract":"While numerous flaws have been recognized in using passwords as a method of authentication, passwords still remain the de-facto authentication standard in use today. Though password managers can ameliorate password fatigue, the vast majority of password managers require the user to choose and maintain a strong master password while offering little to no recourse in the event that the master password is compromised. The wide-application of cloud-based password managers congregate passwords in an encrypted database, which becomes an attractive target for attackers and also represents a single point of failure. In this paper, we propose Amnesia, a bilateral generative password manager that requires both the knowledge of the master password and the possession of the user's smartphone to generate website passwords for the user. Our generative password manager is not vulnerable to the password database leakage, since it generates the requested password on demand using both the master password and the secret information on the smartphone. An attacker wishing to steal the user's website passwords has to compromise both the user's smartphone and the master password. Amnesia also has strong recovery capability when either the master password is compromised or the smartphone is lost/stolen. By using an Amnesia server, a user can have the access to the password manager on multiple computers without installing any software on those computers. We implemented an Amnesia system prototype using Android and Cherrypy web framework and evaluated it in terms of security, usability, and overhead. A user study of 31 testers shows that Amnesia increases password security while maintaining reasonable user convenience.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"37 10 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":"128752213","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}
引用次数: 17
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学术官方微信
小红书