2018 27th International Conference on Computer Communication and Networks (ICCCN)最新文献_第2页

STRAP: Secure TRansfer of Association Protocol 带子:安全传输的关联协议

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487333

Philip Lundrigan, S. Kasera, Neal Patwari

引用次数: 1

Novel Method of Game-Based Energy Efficient Subcarrier Allocation for IoT 基于博弈的物联网节能子载波分配新方法

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487453

De-gan Zhang, Ya-meng Tang, Xiao-huan Liu, Yu-ya Cui

引用次数: 0

Slytherin: Dynamic, Network-Assisted Prioritization of Tail Packets in Datacenter Networks 斯莱特林:数据中心网络中动态的、网络辅助的尾包优先排序

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487331

Hamed Rezaei, Mojtaba MalekpourShahraki, Balajee Vamanan

{"title":"Slytherin: Dynamic, Network-Assisted Prioritization of Tail Packets in Datacenter Networks","authors":"Hamed Rezaei, Mojtaba MalekpourShahraki, Balajee Vamanan","doi":"10.1109/ICCCN.2018.8487331","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487331","url":null,"abstract":"Datacenter applications demand both low latency and high throughput; while interactive applications (e.g., WebSearch) demand low tail latency for their short messages due to their partition-aggregate software architecture, many data-intensive applications (e.g., Map-Reduce) require high throughput for long flows as they move vast amounts of data across the network. Recent proposals improve latency of short flows and throughput of long flows by addressing the shortcomings of existing packet scheduling and congestion control algorithms, respectively. We make the key observation that long tails in theFlow Completion Times (FCT) of short flows result from packetsthat suffer congestion at more than one switch along their paths in the network. Our proposal,Slytherin, specifically targets packets that suffered from congestion at multiple points and prioritizes them in the network. Slytherin leverages ECN mechanism which iswidely used in existing datacenters to identify such tail packets and dynamically prioritizes them using existing priority queues. As compared to existing state-of-the-art packet scheduling proposals, Slytherin achieves 18.6% lower 99th percentile flow completion times for short flows without any loss of throughput. Further, Slytherin drastically reduces 99th percentile queue length in switches by a factor of about 2x on average.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133996642","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

2018 ICCCN Message from the Workshop Chairs 2018 ICCCN研讨会主席致辞

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/icccn.2018.8487313

引用次数: 0

Probability of Coexistence of LTE-LAA and WLAN Systems Based on Delay Constraints 基于时延约束的LTE-LAA与WLAN共存概率研究

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487360

Yao Ma, W. Young, E. Anderson, J. Coder

{"title":"Probability of Coexistence of LTE-LAA and WLAN Systems Based on Delay Constraints","authors":"Yao Ma, W. Young, E. Anderson, J. Coder","doi":"10.1109/ICCCN.2018.8487360","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487360","url":null,"abstract":"To support efficient spectrum sharing and related standardization efforts in unlicensed spectrum, it is important to develop analytical tools to accurately quantify coexistence performance between long-term evolution license assisted access (LTE-LAA) and incumbent systems, such as wireless local area network (WLAN). Though joint throughput of spectrum sharing LTE-LAA and WLAN systems has been extensively studied, there lacks a systematic study on a high level metric - the probability of coexistence (PoC), which indicates whether coexistence is successful or not probabilistically. Another problem is that the majority of available results either ignored delay constraints, or studied only the mean (or variance) of delay, but have not considered the delay distribution and its impact on throughput. To address these problems, we define and analyze the original PoC metrics between LTE-LAA and WLAN systems based on two practical delay constraints. The first PoC is derived from the joint distribution probability of delays for successful transmissions; and the second PoC is defined upon the joint probability of delay-constrained throughput (DCT) of LAA and WLAN systems. To address the technical difficulties involved, we design a novel analytical framework to evaluate the moment generating function and cumulative distribution function (CDF) of the delay, and a new method to evaluate the DCT and its CDF. Consequently, the PoCs can be evaluated accurately with low complexity. The analytical results are verified by our Monte Carlo simulations, which demonstrate impacts of delay and throughput requirements on the PoCs, and illustrate design tradeoffs and insightful findings. These results provide theoretical and practical value for designing improved LTE-LAA and WLAN systems, and may be extended to other emerging spectrum sharing communication systems.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133273505","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

User Localization Using Random Access Channel Signals in LTE Networks with Massive MIMO 大规模MIMO LTE网络中随机接入信道信号的用户定位

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487359

A. Fedorov, Haibo Zhang, Yawen Chen

{"title":"User Localization Using Random Access Channel Signals in LTE Networks with Massive MIMO","authors":"A. Fedorov, Haibo Zhang, Yawen Chen","doi":"10.1109/ICCCN.2018.8487359","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487359","url":null,"abstract":"Recent studies show that real-time precise user localization enables to deliver accurate beamforming in MIMO systems without the need for channel estimation. This paper presents new solutions for accurate user localization in massive MIMO LTE systems. A key novelty of the developed schemes is the ability to locate users during LTE's random access channel synchronization procedure before they are connected to the network, by which the obtained location information can be immediately used to optimize the allocation of radio resource and perform accurate beamforming. To achieve this, the developed solutions leverage the advantages of spherical wave propagation since it allows simultaneously estimating the angle of arrival and the propagation distance from the user equipment to each antenna element in the base station. We design solutions for both single-path line-of-sight communication and multi-path propagation environments. The developed schemes were evaluated through both simulations and proof-of-concept experiments. Simulation results show that both algorithms can achieve decimeter-level localization accuracy using 64 and more antenna elements for the distances up to 300 meters. The proof-of-concept experiment justifies the feasibility of user localization based on the estimation of the shape of the incoming wavefront.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133801158","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

Achieve Efficient and Privacy-Preserving Medical Primary Diagnosis Based on kNN 基于kNN实现高效且隐私保护的医疗初级诊断

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487422

Dan Zhu, Hui Zhu, Ximeng Liu, Hui Li, Fengwei Wang, Hao Li

{"title":"Achieve Efficient and Privacy-Preserving Medical Primary Diagnosis Based on kNN","authors":"Dan Zhu, Hui Zhu, Ximeng Liu, Hui Li, Fengwei Wang, Hao Li","doi":"10.1109/ICCCN.2018.8487422","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487422","url":null,"abstract":"Online medical primary diagnosis system, which can provide the pre-diagnosis service anywhere anytime, has attracted considerable interest. However, the flourish of online medical primary diagnosis system still faces many serious challenges since the sensitivity of personal health information and service provider''s diagnosis model. In this paper, we propose an efficient and privacy-preserving medical primary diagnosis scheme based on k-nearest-neighbors classification (kNN), called EPDK. With EPDK, medical users can ensure that their sensitive health information are not compromised during the online medical diagnosis process, and service provider can provide high-accuracy service without revealing its diagnosis model. Specifically, based on lightweight multiparty random masking and polynomial aggregation techniques, a medical user preprocesses her/his query vector before sending out and the preprocessed vector is directly operated in the service provider without obtaining original data, meanwhile, the primary diagnosis result cannot be achieved by anyone except the medical user. Through extensive analysis, we show that EPDK can resist multifarious known security threats, and has significantly lower computation complexity than existing schemes. Moreover, performance evaluations via implementing EPDK in the real environment demonstrate that EPDK is highly efficient in terms of computation overhead.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115868670","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

Request Dispatching for Minimizing Service Response Time in Edge Cloud Systems 边缘云系统中最小化服务响应时间的请求调度

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487354

Hongyue Wu, Shuiguang Deng, Wei Li, S. Khan, Jianwei Yin, Albert Y. Zomaya

引用次数: 13

An Assured Deletion Technique for Cloud-Based IoT 基于云的物联网的保证删除技术

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487372

Bryan Hall, G. Manimaran

{"title":"An Assured Deletion Technique for Cloud-Based IoT","authors":"Bryan Hall, G. Manimaran","doi":"10.1109/ICCCN.2018.8487372","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487372","url":null,"abstract":"The Internet of Things (IoT) and the cloud are expanding technologies with many security vulnerabilities. With at least one major data leak every year since 2004, the public's concern for data privacy has given rise to legislation known as the General Data Protection Regulation (GDPR) in the European Union. Assured deletion, the process by which deleted data on the cloud is made permanently unrecoverable, is a strong defense against data leaks. The existing assured deletion techniques fall into two categories: cryptographic protection and secure overwriting. Cryptographic protection blocks malicious preservation of data but leaves the data subject to cryptanalysis. Secure overwriting prevents cryptanalysis attacks but leaves the data subject to malicious preservation of data. Furthermore, both cryptographic protection and secure overwriting are too expensive for direct application to IoT technology. To address these problems, we proposed a hybrid assured deletion technique which combines cryptographic protection with secure overwriting on a semi- trusted cloud host. By moving the computation operations of assured deletion from the IoT device to a semi-trusted cloud host, we reduce the latency of the operations while relieving the IoT device of the processing overhead. By combining cryptographic protection with secure overwriting, the outsourced data is safeguarded from both vulnerabilities. We evaluated the proposed technique for latency performance and attack exposure. The results show that the latency performance of the hybrid technique was comparable to that of the cryptographic protection, and its overall attack surface is better than both the cryptographic protection and secure overwrite solutions.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116991902","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

The Classified and Active Caching Strategy for Iterative Application in Spark 面向Spark迭代应用的分类主动缓存策略

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487381

Dejiao Niu, Bo Chen, Tao Cai, Zhipeng Chen

引用次数: 1