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

Information source detection in networks: Possibility and impossibility results 网络中的信息源检测:可能性和不可能性结果

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

Kai Zhu, Lei Ying

{"title":"Information source detection in networks: Possibility and impossibility results","authors":"Kai Zhu, Lei Ying","doi":"10.1109/INFOCOM.2016.7524363","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524363","url":null,"abstract":"This paper studies information source detection in networks under the independent cascade (IC) model. Assume the spread of information starts from a single source in a network and a complete snapshot of the network is obtained at some time. The goal is to identify the source based on the observation. We derive the maximum a posterior (MAP) estimator of the source for tree networks and propose a Short-Fat Tree (SFT) algorithm for general networks based on the MAP estimator. The algorithm selects the Jordan infection center [1] and breaks ties according the degree of boundary infected nodes. Loosely speaking, the algorithm selects the node such that the breadth-first search (BFS) tree from it has the minimum depth but the maximum number of leaf nodes. On the Erdos-Renyi (ER) random graph, we establish the following possibility and impossibility results: (i) when the infection duration <; log n/(1 + α)log μ for some α > 0.5, SFT identifies the source with probability 1 (w.p.1) asymptotically (as network size increases to infinity), where n is the network size and μ is the average node degree; (ii) when the infection duration > ⌈log n/ log μ ⌉ + 2, the probability of identifying the source approaches zero asymptotically under any algorithm; and (iii) when infection duration <; <; log n/(1 + α)log μ for some α > 0, asymptotically, at least 1-δ fraction of the nodes on the BFS tree starting from the source are leaf-nodes, where δ = 3√log n/μ, i.e., the BFS tree starting from the actual source is a fat tree. 1Numerical experiments on tree networks, the ER random graphs and real world networks with different evaluation metrics show that the SFT algorithm outperforms existing algorithms.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"97 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":"134200559","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

Characterizing IPv6 control and data plane stability 描述IPv6控制和数据平面稳定性

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

Ioana Livadariu, A. Elmokashfi, A. Dhamdhere

引用次数: 17

Synergistic policy and virtual machine consolidation in cloud data centers 云数据中心中的协同策略和虚拟机整合

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

Lin Cui, Richard Cziva, Fung Po Tso, D. Pezaros

{"title":"Synergistic policy and virtual machine consolidation in cloud data centers","authors":"Lin Cui, Richard Cziva, Fung Po Tso, D. Pezaros","doi":"10.1109/INFOCOM.2016.7524354","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524354","url":null,"abstract":"In modern Cloud Data Centers (DC)s, correct implementation of network policies is crucial to provide secure, efficient and high performance services for tenants. It is reported that the inefficient management of network policies accounts for 78% of DC downtime, challenged by the dynamically changing network characteristics and by the effects of dynamic Virtual Machine (VM) consolidation. While there has been significant research in policy and VM management, they have so far been treated as disjoint research problems. In this paper, we explore the simultaneous, dynamic VM and policy consolidation, and formulate the Policy-VM Consolidation (PVC) problem, which is shown to be NP-Hard. We then propose Sync, an efficient and synergistic scheme to jointly consolidate network policies and virtual machines. Extensive evaluation results and a testbed implementation of our controller show that policy and VM migration under Sync significantly reduces flow end-to-end delay by nearly 40%, and network-wide communication cost by 50% within few seconds, while adhering strictly to the requirements of network policies.","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":"124368625","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

Just-in-time WLANs: On-demand interference-managed WLAN infrastructures 即时WLAN:按需干扰管理的WLAN基础设施

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

Kimin Lee, Yeonkeun Kim, Seok-Hun Kim, Jinwoo Shin, Seungwon Shin, S. Chong

{"title":"Just-in-time WLANs: On-demand interference-managed WLAN infrastructures","authors":"Kimin Lee, Yeonkeun Kim, Seok-Hun Kim, Jinwoo Shin, Seungwon Shin, S. Chong","doi":"10.1109/INFOCOM.2016.7524451","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524451","url":null,"abstract":"In the past years, the centralized management of dense wireless local area networks has been emerged as a powerful paradigm for improving energy efficiency as well as avoiding severe interference. In this paper, we study the joint optimization on power-operation modes in access points (APs), channel selections and user-AP associations for improving energy efficiency and avoiding interference without sacrificing users' demands. To this end, we first formulate it as a mixed-integer programming using the popular Lyapunov approach, but it turns out to be computationally intractable, i.e., NP-hard. To address the issue, we propose a polynomial-time approximation algorithm and prove that it achieves a constant-factor approximation guarantee under mild assumptions. The main novelty underlying our algorithm design is based on a linear programming relaxation combining with two different greedy rounding schemes, where each achieves a constant-factor approximation in different regimes of parameters. We verify the performance of the proposed algorithm via extensive simulations and also demonstrate its practicability by implementing it at commercial APs using a Software-defined Networking framework, which shows that it reduces the wasted energy significantly while maintaining even higher throughput.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"12 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":"134561983","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

Privacy-preserving crowdsourced spectrum sensing 保护隐私的众包频谱传感

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

Xiaocong Jin, Yanchao Zhang

引用次数: 1

Exploiting channel diversity for rate adaptation in backscatter communication networks 利用信道分集进行反向散射通信网络的速率适应

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

Wei Gong, Haoxiang Liu, Kebin Liu, Q. Ma, Yunhao Liu

{"title":"Exploiting channel diversity for rate adaptation in backscatter communication networks","authors":"Wei Gong, Haoxiang Liu, Kebin Liu, Q. Ma, Yunhao Liu","doi":"10.1109/INFOCOM.2016.7524404","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524404","url":null,"abstract":"Backscatter communication networks receive much attention recently due to the small size and low power of backscatter nodes. As backscatter communication is often influenced by the dynamic wireless channel quality, rate adaptation becomes necessary. Most existing approaches share a common drawback: they do not distinguish channel qualities from different nodes or sub-channels. Consequently, the transmission rate may be improperly selected, resulting in low network throughput. Through extensive experimental studies, we observe that channel diversity plays a significant role in rate selection. Therefore, there are opportunities of exploiting channel diversity for better rate adaptation, improving network throughput. In this paper, we propose a Channel-Aware Rate Adaptation framework (CARA) for backscatter communication networks. By employing a lightweight channel probing scheme, we are able to obtain fine-grained channel information that enables accurate channel estimation. We further design a novel channel selection algorithm, benefiting as many backscatter nodes as possible. On each selected channel, CARA chooses data rate with respect to the node that has the best channel condition. We implement CARA on commercial readers and the experiment results show that CARA achieves up to 4× goodput gain compared with state-of-the-art rate adaptation scheme.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"67 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":"133294560","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}

引用次数: 26

Stochastic geometric analysis of handoffs in user-centric cooperative wireless networks 以用户为中心的协作无线网络切换的随机几何分析

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

Wei Bao, B. Liang

{"title":"Stochastic geometric analysis of handoffs in user-centric cooperative wireless networks","authors":"Wei Bao, B. Liang","doi":"10.1109/INFOCOM.2016.7524592","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524592","url":null,"abstract":"User-centric base station (BS) cooperation has been regarded as an effective solution to improve network coverage and throughput in next-generation wireless systems. However, it also introduces more complicated handoff patterns, which may potentially degrade user performance. In this paper, we aim to quantify the number of handoffs in user-centric cooperative wireless networks. The challenges are two-fold: (1) BSs are spatially randomly deployed, and (2) user-centric BS cooperation further creates complicated network topologies so that it is difficult to track handoffs in the system. We propose a stochastic geometric analysis framework on user mobility, to derive a theoretical expression for the handoff rate experienced by an active user with arbitrary movement trajectory. Furthermore, we characterize the average downlink user data rate under a common non-coherent joint-transmission scheme, which is used to illustrate the tradeoff between handoff rate and data rate in optimizing the cooperative cluster size for each user. Finally, computer simulation is conducted to validate the correctness and usefulness of our analysis.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"23 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":"133464032","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

MobTrack: Locating indoor interfering radios with a single device MobTrack:用单个设备定位室内干扰无线电

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

Changlai Du, Ruide Zhang, W. Lou, Y. T. Hou

引用次数: 8

Localization of LTE measurement records with missing information 缺失信息的LTE测量记录的定位

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

Avik Ray, S. Deb, Pantelis Monogioudis

{"title":"Localization of LTE measurement records with missing information","authors":"Avik Ray, S. Deb, Pantelis Monogioudis","doi":"10.1109/INFOCOM.2016.7524370","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524370","url":null,"abstract":"As cellular networks like 4G LTE networks get more and more sophisticated, mobiles also measure and send enormous amount of mobile measurement data (in TBs/week/metropolitan) during every call and session. The mobile measurement records are saved in data center for further analysis and mining, however, these measurement records are not geo-tagged because the measurement procedures are implemented in mobile LTE stack. Geo-tagging (or localizing) the stored measurement record is a fundamental building block towards network analytics and troubleshooting since the measurement records contain rich information on call quality, latency, throughput, signal quality, error codes etc. In this work, our goal is to localize these mobile measurement records. Precisely, we answer the following question: what was the location of the mobile when it sent a given measurement record? We design and implement novel machine learning based algorithms to infer whether a mobile was outdoor and if so, it infers the latitude-longitude associated with the measurement record. The key technical challenge comes from the fact that measurement records do not contain sufficient information required for triangulation or RF fingerprinting based techniques to work by themselves. Experiments performed with real data sets from an operational 4G network in a major metropolitan show that, the median accuracy of our proposed solution is around 20 m for outdoor mobiles and outdoor classification accuracy is more than 98%.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"126 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":"117346179","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}

引用次数: 46

Rot at the roots? Examining public timing infrastructure 从根部腐烂?检查公共计时基础设施

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

K. Vijayalayan, D. Veitch

引用次数: 14