2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)最新文献_第10页

Scale the Data Plane of Software-Defined Networks: a Lazy Rule Placement Approach 扩展软件定义网络的数据平面:一种惰性规则放置方法

2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2020-11-01 DOI: 10.1109/ICDCS47774.2020.00077

Qing Li, Nanyang Huang, Yong Jiang, R. Sinnott, Mingwei Xu

{"title":"Scale the Data Plane of Software-Defined Networks: a Lazy Rule Placement Approach","authors":"Qing Li, Nanyang Huang, Yong Jiang, R. Sinnott, Mingwei Xu","doi":"10.1109/ICDCS47774.2020.00077","DOIUrl":"https://doi.org/10.1109/ICDCS47774.2020.00077","url":null,"abstract":"Data plane programming languages enable administrators of Software-Defined Networks (SDNs) to perform fine-grained flow control by compiling high-level policies into low-level rules and deploying rules in the data plane. However, it is difficult to scale the data plane with the dynamics of network traffic and the limited storage space of switches. In this paper, we propose a lazy OpenFlow Rule Placement (ORP) framework to enforce control polices and scale the SDN data plane by placing and reusing wildcard rules. We provide an offline rule placement scheme to meet performance objectives under real-world constraints. To handle dynamic traffic and perform incremental rule updates, we design an online matching rule deployment algorithm to place rules in polynomial time and prove it to be conditionally-optimal. Furthermore, to address the rule dependency problem during online rule placement, we extend the algorithm to deploy dependent rules and present lightweight heuristics to guarantee the fast reaction to the new flows. Extensive experiments are conducted on diverse network topologies and datasets to show that the lazy ORP framework significantly reduces the storage cost, improves data plane scalability and is flexible enough to accomplish different optimization goals.","PeriodicalId":158630,"journal":{"name":"2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126561714","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

Towards a Lightweight Blockchain Platform for Critical Infrastructure Protection 迈向关键基础设施保护的轻量级区块链平台

2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2020-11-01 DOI: 10.1109/ICDCS47774.2020.00166

Jerin Sunny, S. Sankaran, V. Saraswat

{"title":"Towards a Lightweight Blockchain Platform for Critical Infrastructure Protection","authors":"Jerin Sunny, S. Sankaran, V. Saraswat","doi":"10.1109/ICDCS47774.2020.00166","DOIUrl":"https://doi.org/10.1109/ICDCS47774.2020.00166","url":null,"abstract":"Critical Infrastructures are one of the vital systems that support modern societies. The adoption of technologies like Industry 4.0, Industrial Internet of Things (IIoT) in critical infrastructures have made it a lucrative target for cyberattackers. Protecting critical infrastructure is of paramount importance due to the sensitive nature of the data coupled with the resource-constrained nature of the devices. The advent of blockchains can be a significant enabler for protecting critical infrastructure through the use of immutable ledger for storing the operations. However, blockchains are computationally expensive, have limited scalability and incur significant delays in processing transactions thus necessitating the development of a lightweight platform while retaining the functionality. This paper develops a lightweight blockchain based framework for protecting critical infrastructure by leveraging its hierarchical nature. Evaluation using embedded devices shows that our proposed framework minimizes the execution time of blockchain operations thus making it suitable for protecting critical infrastructure. Finally, our proposed framework is generic, in that it can be applied to any of the domains operating in the critical infrastructure.","PeriodicalId":158630,"journal":{"name":"2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123319331","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

DeX: Scaling Applications Beyond Machine Boundaries DeX:超越机器边界的扩展应用程序

2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2020-11-01 DOI: 10.1109/ICDCS47774.2020.00021

Sang-Hoon Kim, Ho-Ren Chuang, Robert Lyerly, Pierre Olivier, Changwoo Min, B. Ravindran

引用次数: 6

SpotTune: Leveraging Transient Resources for Cost-efficient Hyper-parameter Tuning in the Public Cloud SpotTune:在公共云中利用瞬时资源进行经济高效的超参数调优

2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2020-11-01 DOI: 10.1109/ICDCS47774.2020.00111

Yan Li, Bo An, Junming Ma, Donggang Cao, Yasha Wang, Hong Mei

引用次数: 4

HybrIDX: New Hybrid Index for Volume-hiding Range Queries in Data Outsourcing Services 数据外包服务中容量隐藏范围查询的新型混合索引

2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2020-11-01 DOI: 10.1109/ICDCS47774.2020.00014

K. Ren, Yu Guo, Jiaqi Li, X. Jia, Cong Wang, Yajin Zhou, Sheng Wang, N. Cao, Feifei Li

{"title":"HybrIDX: New Hybrid Index for Volume-hiding Range Queries in Data Outsourcing Services","authors":"K. Ren, Yu Guo, Jiaqi Li, X. Jia, Cong Wang, Yajin Zhou, Sheng Wang, N. Cao, Feifei Li","doi":"10.1109/ICDCS47774.2020.00014","DOIUrl":"https://doi.org/10.1109/ICDCS47774.2020.00014","url":null,"abstract":"An encrypted index is a data structure that assisting untrusted servers to provide various query functionalities in the ciphertext domain. Although traditional index designs can prevent servers from directly obtaining plaintexts, the confidentiality of outsourced data could still be compromised by observing the volume of different queries. Recent volume attacks have demonstrated the importance of sealing volume-pattern leakage. To this end, several works are made to design secure indexes with the volume-hiding property. However, prior designs only work for encrypted keyword search. Due to the unpredictable range query results, it is difficult to protect the volume-pattern leakage while achieving efficient range queries.In this paper, for the first time, we define and solve the challenging problem of volume-hiding range queries over encrypted data. Our proposed hybrid index framework, called HybrIDX, allows an untrusted server to efficiently search encrypted data based on order conditions without revealing the exact volume size. It resorts to the trusted hardware techniques to assist range query processing by moving the comparison algorithm to trusted SGX enclaves. To enable volume-hiding data retrieval, we propose to host encrypted results outside the enclave in an encrypted multimaps manner. Apart from this novel hybrid index design, we further customize a bulk refresh mechanism to enable accesspattern obfuscation. We formally analyze the security strengths and complete the prototype implementation. Evaluation results demonstrate the feasibility and practicability of our designs.","PeriodicalId":158630,"journal":{"name":"2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129261449","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}

引用次数: 19

BP-Com: A Service Mapping Tool for Rapid Development of Business Processes com:用于快速开发业务流程的服务映射工具

2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2020-11-01 DOI: 10.1109/ICDCS47774.2020.00121

Ayesha Afzal, Muhammad Adeel Zahid, A. Akhtar, Basit Shafiq, S. Shamail, Abeer Elahraf, Jaideep Vaidya, N. Adam

{"title":"BP-Com: A Service Mapping Tool for Rapid Development of Business Processes","authors":"Ayesha Afzal, Muhammad Adeel Zahid, A. Akhtar, Basit Shafiq, S. Shamail, Abeer Elahraf, Jaideep Vaidya, N. Adam","doi":"10.1109/ICDCS47774.2020.00121","DOIUrl":"https://doi.org/10.1109/ICDCS47774.2020.00121","url":null,"abstract":"Business Process (BP) composition is a challenging task for small and medium organizations that do not have sufficient resources for design, coding, and management of their BPs. Cloud infrastructure and service-oriented middleware can be leveraged for rapid development and deployment of BPs of such organizations. BP development in the cloud-based environment can be done by exploiting the knowledge of existing BPs of related organizations. In this demonstration, we present the BP- Com tool which is a Web-based interactive system that enables efficient development of BPs in the cloud. BP-Com implements our service mapping approach called ASSEMBLE that utilizes the attribute, structural and semantics information of service operations of existing BPs in a given domain to help a user organization to compose its BP. Given a collection of related BPs and available service operations of a user organization, BP-Com computes a mapping between the available service operations of the user organization and the BP operations of other organizations. The results of operation mapping are presented to the user for refinement and customization of the generated BP workflow. Executable BP code is then generated in standard BPEL language, which can be deployed on any process execution engine on the user organization’s site or on the cloud.","PeriodicalId":158630,"journal":{"name":"2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130604068","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

Safe Process Quitting for GPU Multi-Process Service (MPS) GPU多进程服务安全退出进程

2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2020-11-01 DOI: 10.1109/ICDCS47774.2020.00125

Hao Wu, Wei Liu, Yifan Gong, Jiangming Jin

引用次数: 0

Workshop Organizers 研讨会的组织者

2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2020-11-01 DOI: 10.1109/icdcs47774.2020.00008

Diwakar Krishnamurthy

引用次数: 0

WiWrite: An Accurate Device-Free Handwriting Recognition System with COTS WiFi WiWrite:一个精确的无设备手写识别系统与COTS WiFi

2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2020-11-01 DOI: 10.1109/ICDCS47774.2020.00079

Chi Lin, Tingting Xu, Jie Xiong, Fenglong Ma, Lei Wang, Guowei Wu

{"title":"WiWrite: An Accurate Device-Free Handwriting Recognition System with COTS WiFi","authors":"Chi Lin, Tingting Xu, Jie Xiong, Fenglong Ma, Lei Wang, Guowei Wu","doi":"10.1109/ICDCS47774.2020.00079","DOIUrl":"https://doi.org/10.1109/ICDCS47774.2020.00079","url":null,"abstract":"Handwriting recognition system provides people a convenient and alternative way for writing in the air with fingers rather than typing keyboards. For people with blurred vision and patients with generalized hand neurological disease, writing in the air is particularly attracting due to the small input screen of smartphones and smartwatches. Existing recognition systems still face drawbacks such as requiring to wear dedicated devices, relatively low accuracy and infeasible for cross domain identification, which greatly limit the usability of these systems. To address these issues, we propose WiWrite, an accurate device-free handwriting recognition system which allows writing in the air without a need of attaching any device to the user. Specifically, we use Commercial Off-The-Shelf (COTS) WiFi hardware to achieve fine-grained finger tracking. We develop a CSI division scheme to process the noisy raw WiFi channel state information (CSI), which stabilizes the CSI phase and reduces the noise of the CSI amplitude. To automatically retain low noise data for identification, we propose a self-paced dense convolutional network (SPDCN), which consists of the self-paced loss function based on a modified convolutional neural network, together with a dense convolutional network. Comprehensive experiments are conducted to show the merits of WiWrite, revealing that, the recognition accuracies for the same-size input and different-size input are 93.6% and 89.0%, respectively. Moreover, WiWrite can achieve a one-fit-for-all recognition regardless of environment diversities.","PeriodicalId":158630,"journal":{"name":"2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129767944","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

E-Sharing: Data-driven Online Optimization of Parking Location Placement for Dockless Electric Bike Sharing 电子共享:数据驱动的无桩共享电动自行车停车位置在线优化

2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2020-11-01 DOI: 10.1109/ICDCS47774.2020.00059

Pengzhan Zhou, Cong Wang, Yuanyuan Yang, Xin Wei

{"title":"E-Sharing: Data-driven Online Optimization of Parking Location Placement for Dockless Electric Bike Sharing","authors":"Pengzhan Zhou, Cong Wang, Yuanyuan Yang, Xin Wei","doi":"10.1109/ICDCS47774.2020.00059","DOIUrl":"https://doi.org/10.1109/ICDCS47774.2020.00059","url":null,"abstract":"The rise of dockless electric bike sharing becomes a new urban lifestyle recently. More than just the first-and-last mile, it offers a new modality of green transportation. However, in addition to the traditional re-balance and overcrowding problems, it also brings new challenges to urban management and maintenance. Due to the safety risks of batteries, customers are regulated to park at designated locations, which potentially causes dissatisfaction and customer loss. Meanwhile, service providers should charge those scattering low-energy batteries in time. To address these issues, we propose E-sharing, a two-tier optimization framework that leverages data-driven online algorithms to plan parking locations and maintenance. First, we balance the user dissatisfaction and the number of parking locations by minimizing their sum. To account for real-time dynamics while not losing track of the historical optimality, we propose an online algorithm based on its near-optimal offline solution. Second, we develop an incentive mechanism to motivate users to aggregate low-battery bikes together, saving the cost of bike charging. Our experiment based on the public dataset demonstrates that the online algorithm can minimize the cost from the conflicting objectives and incentive mechanism further reduces the maintenance cost by 47%.","PeriodicalId":158630,"journal":{"name":"2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133493548","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