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

筛选
英文 中文
A Geometric Windowing Algorithm in Network Data-Plane Verification 网络数据平面验证中的几何加窗算法
Richard Chen, Toru Mano, Takeru Inoue, Kimihiro Mizutani, Hisashi Nagata, Osamu Akashi
{"title":"A Geometric Windowing Algorithm in Network Data-Plane Verification","authors":"Richard Chen, Toru Mano, Takeru Inoue, Kimihiro Mizutani, Hisashi Nagata, Osamu Akashi","doi":"10.1109/ICDCS.2016.52","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.52","url":null,"abstract":"Network verification is attracting attention as a key technology to detect configuration errors before deploying the network. In verification, a set of packets to be inspected is usually specified by a window -- a multi-dimensional rectangle defined by packet header fields (e.g., address prefixes and port ranges). Network operators have to know the forwarding behaviors of packets inside the window, this can be regarded as the windowing query problem in computation geometry. This paper proposes a novel windowing algorithm for network verification. Unlike existing windowing algorithms, our algorithm runs on a compressed data structure, because the search space has to be represented in a compressed form due to the space complexity.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"34 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131575552","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
Gremlin: Systematic Resilience Testing of Microservices Gremlin:微服务的系统弹性测试
Victor Heorhiadi, Shriram Rajagopalan, H. Jamjoom, M. Reiter, V. Sekar
{"title":"Gremlin: Systematic Resilience Testing of Microservices","authors":"Victor Heorhiadi, Shriram Rajagopalan, H. Jamjoom, M. Reiter, V. Sekar","doi":"10.1109/ICDCS.2016.11","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.11","url":null,"abstract":"Modern Internet applications are being disaggregated into a microservice-based architecture, with services being updated and deployed hundreds of times a day. The accelerated software life cycle and heterogeneity of language runtimes in a single application necessitates a new approach for testing the resiliency of these applications in production infrastructures. We present Gremlin, a framework for systematically testing the failure-handling capabilities of microservices. Gremlin is based on the observation that microservices are loosely coupled and thus rely on standard message-exchange patterns over the network. Gremlin allows the operator to easily design tests and executes them by manipulating inter-service messages at the network layer. We show how to use Gremlin to express common failure scenarios and how developers of an enterprise application were able to discover previously unknown bugs in their failure-handling code without modifying the application.","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":"129309985","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}
引用次数: 97
Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Data Center 数据中心中高并发HTTP连接的攻击性TCP行为调优
Jiawei Huang, Jianxin Wang, Zhang Tao, Jianer Chen, Yi Pan
{"title":"Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Data Center","authors":"Jiawei Huang, Jianxin Wang, Zhang Tao, Jianer Chen, Yi Pan","doi":"10.1109/ICDCS.2016.72","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.72","url":null,"abstract":"Modern data centers host diverse HTTP-based services, which employ persistent TCP connections to send HTTP requests and responses. However, the ON/OFF pattern of HTTP traffic disturbs the increase of TCP congestion window, potentially triggering packet loss at the beginning of ON period. Furthermore, the transmission performance becomes worse due to severe congestion in the concurrent transfer of HTTP response. In this work, we first reveal that the TCP's aggressive behavior in increasing congestion window causes TCP timeouts and throughput collapse. We further present the design and implementation of TCP-TRIM, which employs probe packets to smooth the aggressive increase of congestion window in persistent TCP connection, and leverages congestion detection and control at end-host to limit the growth of switch queue length under highly concurrent TCP connections. The experimental results of at-scale simulations and real implementations show that TCPTRIM reduces the completion time of HTTP response by up to 80%, while introducing little deployment overhead only at the end hosts.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"20 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":"127221742","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
WiLocator: WiFi-Sensing Based Real-Time Bus Tracking and Arrival Time Prediction in Urban Environments WiLocator:城市环境中基于wifi传感的实时公交车跟踪和到达时间预测
Wenping Liu, Jiangchuan Liu, Hongbo Jiang, Bicheng Xu, Hongzhi Lin, Guoyin Jiang, Jing Xing
{"title":"WiLocator: WiFi-Sensing Based Real-Time Bus Tracking and Arrival Time Prediction in Urban Environments","authors":"Wenping Liu, Jiangchuan Liu, Hongbo Jiang, Bicheng Xu, Hongzhi Lin, Guoyin Jiang, Jing Xing","doi":"10.1109/ICDCS.2016.31","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.31","url":null,"abstract":"Offering the services of real-time tracking and arrival time prediction is a common welfare for bus riders and transit agencies, especially in urban environments. On the down side, the traditional GPS-based solutions work poorly in urban areas due to urban canyons, while the location systems based on cellular signal also suffer from inherent limitations. In this paper, we present a powerful tool named Signal Voronoi Diagram (SVD) to partition the radio-frequency (RF) signal space of WiFi Access Points (APs), distributed where a bus travels, into Signal Cells, and then into fine-grained Signal Tiles, tackling the problem of noisy received signal strength (RSS) readings and possible AP dynamics. On top of SVD, we present a novel framework so-called WiLocator, to track and predict the arrival time of an urban bus based on the surrounding WiFi information collected by the commodity off-the-shelf (COTS) smartphones of bus riders, the mobility constraint of a bus and the temporal consistency of travel time of buses on the overlapped road segments. We also show the WiLocator's power of generating an accurate and real-time traffic map with the predicted travel time on each road segment. We implement the prototype of WiLocator and conduct the in-situ experiment to demonstrate its accuracy.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"48 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":"115492971","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}
引用次数: 20
Mayflower: Improving Distributed Filesystem Performance Through SDN/Filesystem Co-Design 五月花:通过SDN/文件系统协同设计提高分布式文件系统性能
S. Rizvi, Xi Li, B. Wong, Fiodar Kazhamiaka, Benjamin Cassell
{"title":"Mayflower: Improving Distributed Filesystem Performance Through SDN/Filesystem Co-Design","authors":"S. Rizvi, Xi Li, B. Wong, Fiodar Kazhamiaka, Benjamin Cassell","doi":"10.1109/ICDCS.2016.39","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.39","url":null,"abstract":"In this paper, we introduce Mayflower, a new distributed filesystem that is co-designed from the ground up to work together with a network control plane. In addition to the standard distributed filesystem components, Mayflower has a flow monitor and manager running alongside a software-defined networking controller. This tight coupling with the network controller enables Mayflower to make intelligent replica selection and flow scheduling decisions based on both filesystem and network information. It further enables Mayflower to perform global optimizations that are unavailable to conventional distributed filesystems and network control planes. Our evaluation results from both simulations and a prototype implementation show that Mayflower reduces average read completion time by more than 25% compared to current state-of-the-art distributed filesystems with an independent network flow scheduler, and more than 75% compared to HDFS with ECMP.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"52 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":"122217329","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
Secure Surfing: Privacy-Preserving Speeded-Up Robust Feature Extractor 安全冲浪:隐私保护加速鲁棒特征提取器
Qian Wang, Shengshan Hu, Jingjun Wang, K. Ren
{"title":"Secure Surfing: Privacy-Preserving Speeded-Up Robust Feature Extractor","authors":"Qian Wang, Shengshan Hu, Jingjun Wang, K. Ren","doi":"10.1109/ICDCS.2016.84","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.84","url":null,"abstract":"Large-scale multimedia data are being exponentially generated, stored and processed continuously nowadays. Along with the data explosion, the data owner is highly motivated to outsource his/her huge amount of data storage and computation-expensive processing jobs to the cloud by leveraging its abundant resources for cost reduction and flexibility. Despite the fascinating advantages, security and privacy concerns are the primary obstacles that prevent the wide adoption of this promising information technology paradigm. In this work, we aim at outsourcing Speeded-up Robust Features (SURF), a widely-used feature extraction algorithm, to the intrinsically untrusted cloud, while protecting data owner's private information on the outsourced image data. We, for the first time, propose a practical privacy-preserving outsoucing scheme for SURF that can preserve its key characteristics in terms of distinctiveness and robustness. By randomly splitting the original image data and distributing the encrypted data shares to two independent cloud servers, we first design two novel efficient protocols for secure multiplication and comparison by leveraging somewhat homomorphic encryption (SHE) and single-instruction multiple-data (SIMD). We then carefully tune every step of the original SURF to adapt it to the ciphertext domain. A thorough theoretical analysis of effectiveness and security shows that our scheme is practically secure and approximates well the performance of the original SURF executed in the plaintext domain. Extensive experiments are also conducted over real-world image datasets to show that our scheme outperforms the existing solution and indeed performs comparably to the original SURF in preserving its various characteristics including image scale invariance, rotation invariance and robust matching across 3D viewpoint change etc.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"3 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":"131468467","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}
引用次数: 22
Nearly Optimal Distributed Algorithm for Computing Betweenness Centrality 计算中间度中心性的近最优分布算法
Qiang-Sheng Hua, Haoqiang Fan, Ming Ai, Lixiang Qian, Yangyang Li, Xuanhua Shi, Hai Jin
{"title":"Nearly Optimal Distributed Algorithm for Computing Betweenness Centrality","authors":"Qiang-Sheng Hua, Haoqiang Fan, Ming Ai, Lixiang Qian, Yangyang Li, Xuanhua Shi, Hai Jin","doi":"10.1109/ICDCS.2016.89","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.89","url":null,"abstract":"In this paper, we propose an O(N) time distributed algorithm for computing betweenness centralities of all nodes in the network where N is the number of nodes. Our distributed algorithm is designed under the widely employed CONGEST model in the distributed computing community which limits each message only contains O(log N) bits. To our best knowledge, this is the first linear time deterministic distributed algorithm for computing the betweenness centralities in the published literature. We also give a lower bound for distributively computing the betweenness centrality under the CONGEST model as Ω(D+N/ log N) where D is the diameter of the network. This implies that our distributed algorithm is nearly optimal.","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":"123195980","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
Deadline-Sensitive User Recruitment for Probabilistically Collaborative Mobile Crowdsensing 基于概率协同移动众测的截止日期敏感用户招募
Mingjun Xiao, Jie Wu, He Huang, Liusheng Huang, Chang Hu
{"title":"Deadline-Sensitive User Recruitment for Probabilistically Collaborative Mobile Crowdsensing","authors":"Mingjun Xiao, Jie Wu, He Huang, Liusheng Huang, Chang Hu","doi":"10.1109/ICDCS.2016.15","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.15","url":null,"abstract":"Mobile crowdsensing is a new paradigm in which a group of mobile users exploit their carried smart devices to cooperatively perform a large-scale sensing job over urban environments. In this paper, we focus on the Deadline-sensitive User Recruitment (DUR) problem for probabilistically collaborative mobile crowdsensing, in which mobile users perform sensing tasks with certain probabilities, and multiple users might be recruited to cooperatively perform a common task, ensuring that the expected completion time be no larger than a deadline. In order to solve this problem, we propose a greedy approximation algorithm, which can achieve the logarithmic approximation ratio.","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":"129492170","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
An Analysis of Onion-Based Anonymous Routing for Delay Tolerant Networks 时延容忍网络中基于洋葱的匿名路由分析
Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku, Jie Wu, Faisal S. Alanazi
{"title":"An Analysis of Onion-Based Anonymous Routing for Delay Tolerant Networks","authors":"Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku, Jie Wu, Faisal S. Alanazi","doi":"10.1109/ICDCS.2016.9","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.9","url":null,"abstract":"Delay tolerant network (DTN) routing provides a communication primitive in intermittently disconnected networks, such as battlefield communications and human-contact networks. In these applications, the anonymity preserving mechanism, which hides the identities of communicating parties, plays an important role as a defense against cyber and physical attacks. While anonymous routing protocols for DTNs have been proposed in the past, to the best of our knowledge, there is no work that emphasizes the theoretical aspects. In this paper, we first design an abstract of anonymous routing protocols for DTNs and augment the existing solution with multi-copy message forwarding. Then, we construct simplified mathematical models, which can be used to understand the fundamental performance and security guarantees of onion-based anonymous routing in DTNs. The numerical and simulation results using randomly generated contact graphs and the real traces demonstrate that our models provide very close approximations to the performance of the anonymous DTN routing protocol.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"97 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":"116322369","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}
引用次数: 20
Minimum-Cost Cloud Storage Service Across Multiple Cloud Providers 跨多个云提供商的最低成本云存储服务
Guoxin Liu, Haiying Shen
{"title":"Minimum-Cost Cloud Storage Service Across Multiple Cloud Providers","authors":"Guoxin Liu, Haiying Shen","doi":"10.1109/ICDCS.2016.36","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.36","url":null,"abstract":"Many Cloud Service Providers (CSPs) provide data storage services with datacenters distributed worldwide. These datacenters provide different Get/Put latencies and unit prices for resource utilization and reservation. Thus, when selecting different CSPs' datacenters, cloud customers of globally distributed applications (e.g., online social networks) face two challenges: (i) how to allocate data to worldwide datacenters to satisfy application SLO (service level objective) requirements including both data retrieval latency and availability, and (ii) how to allocate data and reserve resources in datacenters belonging to different CSPs to minimize the payment cost. To handle these challenges, we first model the cost minimization problem under SLO constraints using integer programming. Due to its NP-hardness, we then introduce our heuristic solution, including a dominant-cost based data allocation algorithm and an optimal resource reservation algorithm. We finally introduce an infrastructure to enable the conduction of the algorithms. Our trace-driven experiments on a supercomputing cluster and on real clouds (i.e., Amazon S3, Windows Azure Storage and Google Cloud Storage) show the effectiveness of our algorithms for SLO guaranteed services and customer cost minimization.","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":"114878856","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}
引用次数: 4
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学术官方微信
小红书