IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications最新文献_第2页

Kraken: Online and elastic resource reservations for multi-tenant datacenters Kraken:多租户数据中心的在线和弹性资源预留

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications Pub Date : 2016-04-10 DOI: 10.1109/INFOCOM.2016.7524466

Carlo Fuerst, S. Schmid, L. Suresh, Paolo Costa

{"title":"Kraken: Online and elastic resource reservations for multi-tenant datacenters","authors":"Carlo Fuerst, S. Schmid, L. Suresh, Paolo Costa","doi":"10.1109/INFOCOM.2016.7524466","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524466","url":null,"abstract":"In multi-tenant cloud environments, the absence of strict network performance guarantees leads to unpredictable job execution times. To address this issue, recently there have been several proposals on how to provide guaranteed network performance. These proposals, however, rely on computing resource reservation schedules a priori. Unfortunately, this is not practical in today's cloud environments, where application demands are inherently unpredictable, e.g., due to differences in the input datasets or phenomena such as failures and stragglers. To overcome these limitations, we designed KRAKEN, a system that allows tenants to dynamically request and update minimum guarantees for both network bandwidth and compute resources at runtime. Unlike previous work, Kraken does not require prior knowledge about the resource needs of the tenants' applications but allows tenants to modify their reservation at runtime. Kraken achieves this through an online resource reservation scheme which comes with provable optimality guarantees. In this paper, we motivate the need for dynamic resource reservation schemes, present how this is provided by Kraken, and evaluate Kraken via extensive simulations.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"377 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115987745","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}

引用次数: 37

No-cost distance estimation using standard WSN radios 使用标准无线传感器网络无线电进行无成本距离估计

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications Pub Date : 2016-04-10 DOI: 10.1109/INFOCOM.2016.7524540

Georg von Zengen, Yannic Schröder, S. Rottmann, Felix Büsching, L. Wolf

引用次数: 26

Random access signaling for network MIMO uplink 网络MIMO上行链路随机接入信令

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications Pub Date : 2016-04-10 DOI: 10.1109/INFOCOM.2016.7524483

Teng Wei, Xinyu Zhang

{"title":"Random access signaling for network MIMO uplink","authors":"Teng Wei, Xinyu Zhang","doi":"10.1109/INFOCOM.2016.7524483","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524483","url":null,"abstract":"Increasing popularity of mobile devices and upload-intensive applications is rapidly driving the uplink traffic demand in wireless LANs. Network MIMO (netMIMO) can potentially meet the demand by enabling concurrent uplink transmissions to an AP cluster (APC) comprised of multiple access points. NetMIMO's PHY-layer communication algorithms have been well explored, but the MAC-level signaling procedure remains an open issue: prior to uplink transmission, a group of clients must gain channel access, and ensure synchronization and channel orthogonality with each other. But such signaling is fundamentally challenging, because netMIMO clients tend to be widely distributed and may not even sense each other. In this paper, we introduce the first signaling protocol, called NURA, to meet the challenge. NURA clients employ a novel medium-access-signaling mechanism to realize group-based random access and synchronization, without disturbing ongoing uplink transmissions. The APC leverages a lightweight user-admission mechanism to group users with orthogonal channels (and hence high uplink capacity), without requiring costly channel-state feedback from all users. We have implemented NURA on a software-radio based netMIMO platform. Our experiments show that NURA is feasible, efficient, and can readily serve as the a priori signaling mechanism for distributed asynchronous netMIMO clients.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122687715","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

CU-LTE: Spectrally-efficient and fair coexistence between LTE and Wi-Fi in unlicensed bands CU-LTE:频谱效率高，LTE和Wi-Fi在免授权频段内公平共存

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications Pub Date : 2016-04-10 DOI: 10.1109/INFOCOM.2016.7524589

Zhangyu Guan, T. Melodia

{"title":"CU-LTE: Spectrally-efficient and fair coexistence between LTE and Wi-Fi in unlicensed bands","authors":"Zhangyu Guan, T. Melodia","doi":"10.1109/INFOCOM.2016.7524589","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524589","url":null,"abstract":"To cope with the increasing scarcity of spectrum resources, researchers have been working to extend LTE/LTE-A cellular systems to unlicensed bands, leading to so-called unlicensed LTE (U-LTE). However, this extension is by no means straightforward, primarily because the radio resource management schemes used by LTE and by systems already deployed in unlicensed bands are incompatible. Specifically, it is well known that coexistence with scheduled systems like LTE degrades considerably the throughput of Wi-Fi networks that are based on carrier-sense medium access schemes. To address this challenge, we propose for the first time a cognitive coexistence scheme to enable spectrum sharing between U-LTE and Wi-Fi networks, referred to as CU-LTE. The proposed scheme is designed to jointly determine dynamic channel selection, carrier aggregation and fractional spectrum access for U-LTE networks, while guaranteeing fair spectrum access for Wi-Fi based on a newly designed cross-technology fairness criterion. We first derive a mathematical model of the spectrum sharing problem for the coexisting networks; we then design a solution algorithm to solve the resulting fairness constrained mixed integer nonlinear optimization problem. The algorithm, based on a combination of branch and bound and convex relaxation techniques, maximizes the network utility with guaranteed optimality precision that can be set arbitrarily to 1 at the expense of computational complexity. Performance evaluation indicates that near-optimal spectrum access can be achieved with guaranteed fairness between U-LTE and Wi-Fi. Issues regarding implementation of CU-LTE are also discussed.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122764234","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}

引用次数: 108

A PTAS to minimize mobile sensor movement for target coverage problem 针对目标覆盖问题，采用PTAS最小化移动传感器运动

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications Pub Date : 2016-04-10 DOI: 10.1109/INFOCOM.2016.7524334

Zhiyin Chen, Xiaofeng Gao, Fan Wu, Guihai Chen

{"title":"A PTAS to minimize mobile sensor movement for target coverage problem","authors":"Zhiyin Chen, Xiaofeng Gao, Fan Wu, Guihai Chen","doi":"10.1109/INFOCOM.2016.7524334","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524334","url":null,"abstract":"Energy consumption is a fundamental and critical issue in wireless sensor networks. Mobile sensors consume much more energy during the movement than that during the communication or sensing process. Thus how to schedule mobile sensors and minimize their moving distance has great significance to researchers. In this paper, we study the target coverage problem in mobile sensor networks. Our goal is to minimize the moving distance of sensors to cover all targets in the surveillance region. Here initially all the sensors are located at k base stations. Thus we define this problem as k-Sink Minimum Movement Target Coverage. To solve this problem, we propose a PTAS, named Energy Effective Movement Algorithm (EEMA). We can divide EEMA into two phases. In the first phase, we partition the surveillance region into some subareas. In the second phase, we select subareas and schedule sensors to the selected subareas. We also prove that the approximation ratio of EEMA is 1 + ε and the time complexity is ηO(1/ε2 Finally, we conduct experiments to validate the efficiency and effectiveness of EEMA.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128475041","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}

引用次数: 25

Is every flow on the right track?: Inspect SDN forwarding with RuleScope 每个流程都在正确的轨道上吗?:使用RuleScope检查SDN转发

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications Pub Date : 2016-04-10 DOI: 10.1109/INFOCOM.2016.7524333

Kai Bu, Xitao Wen, Bo Yang, Yan Chen, Erran L. Li, Xiaolin Chen

{"title":"Is every flow on the right track?: Inspect SDN forwarding with RuleScope","authors":"Kai Bu, Xitao Wen, Bo Yang, Yan Chen, Erran L. Li, Xiaolin Chen","doi":"10.1109/INFOCOM.2016.7524333","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524333","url":null,"abstract":"Software-Defined Networking (SDN) promises un-precedentedly flexible network management but it is susceptible to forwarding faults. Such faults originate from data-plane rules with missing faults and priority faults. Yet existing fault detection ignores priority faults because they are not discovered on commercial switches until recently. In this paper, we present RuleScope, a more comprehensive solution for inspecting SDN forwarding. RuleScope offers a series of accurate and efficient algorithms for detecting and troubleshooting rule faults. They inspect forwarding behavior using customized probe packets to exercise data-plane rules. The detection algorithm exposes not only missing faults but also priority faults. Beyond simply detecting rule faults, the troubleshooting algorithms uncover actual data-plane flow tables. They help track real-time forwarding status and benefit reliable network monitoring. We explore various techniques for enhancing algorithm efficiency without sacrificing inspection accuracy. Experiments with our prototype on the Ryu SDN controller and Pica8 P-3297 switch show that RuleScope achieves accurate and efficient forwarding inspection with limited bandwidth and packet-switching overhead.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124710924","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}

引用次数: 63

Secure fingertip mouse for mobile devices 安全的指尖鼠标移动设备

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications Pub Date : 2016-04-10 DOI: 10.1109/INFOCOM.2016.7524368

Z. Ling, Junzhou Luo, Qi Chen, Qinggang Yue, Ming Yang, Wei Yu, Xinwen Fu

{"title":"Secure fingertip mouse for mobile devices","authors":"Z. Ling, Junzhou Luo, Qi Chen, Qinggang Yue, Ming Yang, Wei Yu, Xinwen Fu","doi":"10.1109/INFOCOM.2016.7524368","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524368","url":null,"abstract":"Various attacks may disclose sensitive information such as passwords of mobile devices. Residue-based attacks exploit oily or heat residues on the touch screen, computer vision based attacks analyze the hand movement on a keyboard, and sensor based attacks measure a device's motion difference via motion sensors as different keys are tapped. A randomized soft keyboard may defeat these attacks. However, a randomized key layout is counter-intuitive and users may be reluctant to adopt it. In this paper, we introduce a novel and intuitive input system, secure finger mouse, which uses a mobile device's camera sensing the fingertip movement, moves an on-screen cursor and performs clicks by sensing click gestures. We design a randomized mouse acceleration algorithm so that the adversary cannot infer keys clicked on the soft keyboard by observing the finger movement. The secure finger mouse can defeat attacks including residue, computer vision and motion based attacks too. We perform both theoretical analysis and real-world experiments to demonstrate the security and usability of the secure fingertip mouse.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"11 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130521355","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

Taming collisions for delay reduction in low-duty-cycle wireless sensor networks 低占空比无线传感器网络中时延降低的驯服碰撞

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications Pub Date : 2016-04-10 DOI: 10.1109/INFOCOM.2016.7524538

Long Cheng, Y. Gu, J. Niu, Ting Zhu, Cong Liu, Q. Zhang, T. He

{"title":"Taming collisions for delay reduction in low-duty-cycle wireless sensor networks","authors":"Long Cheng, Y. Gu, J. Niu, Ting Zhu, Cong Liu, Q. Zhang, T. He","doi":"10.1109/INFOCOM.2016.7524538","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524538","url":null,"abstract":"Many-to-one data collection is a fundamental operation in wireless sensor networks (WSNs). To support long-term deployment of WSNs, sensor nodes normally operate at low-duty-cycles. However, the low-duty-cycle operation significantly reduces the communication chance between nodes. Consequently, the risk of data collisions significantly increases when multiple senders transmit packets to a receiver during its very short active period. Data collision not only results in wasted packet transmissions, but also incurs a large delivery latency. Under such conditions, collision-free medium access is more appealing than recovering after collision for low-duty-cycle WSNs. In this work, we propose an incast-collision-free data collection protocol, named iCore, to address the many-to-one collision problem in low-duty-cycle WSNs. iCore employs the dynamic forwarding technique and establishes a non-conflicting schedule for delay reduction. Specifically, we design efficient forwarder assignment and forwarding optimization algorithms that ensure low end-to-end latency under diverse data traffic types. Through comprehensive performance evaluations, we demonstrate that, compared with the state-of-the-art protocol, iCore effectively minimizes the end-to-end delay by 25% ~ 57% and maintains high delivery ratio and energy efficiency for different many-to-one convergecast scenarios.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"383 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116490648","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

Understanding and diagnosing real-world Femtocell performance problems 理解和诊断实际的Femtocell性能问题

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications Pub Date : 2016-04-10 DOI: 10.1109/INFOCOM.2016.7524590

Chunyi Peng, Yuanjie Li, Z. Li, Jie Zhao, Jiaqi Xu

{"title":"Understanding and diagnosing real-world Femtocell performance problems","authors":"Chunyi Peng, Yuanjie Li, Z. Li, Jie Zhao, Jiaqi Xu","doi":"10.1109/INFOCOM.2016.7524590","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524590","url":null,"abstract":"Femtocells (small cells) augment the current mobile network by providing users short-range radio access at home and small-business settings. They have rapidly emerged as a promising scheme to alleviate capacity and coverage shortage by offloading traffic from the conventional Macrocells (large cells). Despite its increasing popularity, the real-world Femtocell performance has remained largely unexplored. In this paper, we conduct an in-depth study to assess Femtocell performance and diagnose identified issues in operational carrier networks. We focus on user-deployed Femtocells in a top-tier US mobile network. While the Femtocell generally works well, unanticipated performance degradations and even failures still occur. Contrary to conventional wisdom in the research community, we find that, radio link quality and interference is not the main bottleneck of Femtocells in many real-life usage scenarios. For instance, while Femtocell deployment at blind-zones with no radio coverage is desirable, not all deployments have succeeded; Compared with their Macrocell counterparts, Femtocells exhibit lower speed and larger speed variations, and induce larger delay for data services. Moreover, mobility support for femtocells is incomplete and no seamless migration is available under certain usage scenarios. We pinpoint their root causes, quantify the potential impacts, and share the learned lessons.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116508383","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

Deadlock-free local fast failover for arbitrary data center networks 用于任意数据中心网络的无死锁本地快速故障转移

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications Pub Date : 2016-04-10 DOI: 10.1109/INFOCOM.2016.7524356

Brent E. Stephens, A. Cox

{"title":"Deadlock-free local fast failover for arbitrary data center networks","authors":"Brent E. Stephens, A. Cox","doi":"10.1109/INFOCOM.2016.7524356","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524356","url":null,"abstract":"Today, given data center networks' sizes and bursty workloads, it is likely that at any moment there is packet loss due to some type of failure in the network. This paper focuses on solving the two most common types of data center network failures: congestion and routing failures. Recently, there has been demand for lossless Ethernet (DCB) in data center networks as a solution to congestion failures. However, DCB complicates fault tolerance by introducing a new type of failure, deadlock. If DCB is enabled, then all routing must be deadlock free. To the best of our knowledge, this paper describes the first ever deadlock-free approaches to local fast failover that can be combined with DCB, DF-FI and DF-EDST resilience. Moreover, in the evaluation, this paper shows that DF-EDST resilience, which is the paper's main contribution, can improve fault tolerance without adversely impacting performance when compared to a state-of-the-art approach to deadlock-free routing. If, however, a small reduction in aggregate throughput is acceptable, then it is possible to build routes such that only 0.00001% of the total flows in the network are likely to fail given 16 edge failures on networks with 1K-4K hosts.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126409756","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