{"title":"Average degree estimation under ego-centric sampling design","authors":"E. Çem, K. Saraç","doi":"10.1109/INFCOMW.2016.7562063","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562063","url":null,"abstract":"Estimating the structural characteristics of large graphs from a sample is a classical problem. In this study, we propose asymptotically unbiased estimators for the average degree characteristic of a network under ego-centric sampling. In this sampling design, we first sample a number of vertices called ego vertices from the underlying graph and then obtain their ego-centric graph. Ego-centric graph of a sampled vertex is defined as the subgraph induced by the vertices within 1-hop neighborhood of the sampled ego vertex. We compare the proposed estimators with the estimator that do not utilize the neighborhood information using both real-world and synthetic large-scale graphs. The results show that utilization of the neighborhood information does not always increase the estimation accuracy depending on the sampling budget usage and the structure of the underlying graph.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"39 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":"133423340","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}
Ziqi Wang, Rui Yang, Xiao Fu, Xiaojiang Du, B. Luo
{"title":"A shared memory based cross-VM side channel attacks in IaaS cloud","authors":"Ziqi Wang, Rui Yang, Xiao Fu, Xiaojiang Du, B. Luo","doi":"10.1109/INFCOMW.2016.7562068","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562068","url":null,"abstract":"Cloud providers usually use virtualization to maximize the utilization of their computing resources, e.g. many virtual machines (VMs) run on a shared physical infrastructure. However co-residency with other VMs will cause high security risks, such as side channel attacks. This kind of attack is difficult to detect and prevent, so it's necessary to study it deeply. Recent research has shown attackers can build up cross-VM side channels to obtain sensitive information. However, due to the features of shared resources (e.g. CPU cache), the sensitive information obtained is usually limited and coarse-grained. In this paper, we present a novel side channel, which is based on shared physical memory and exploits the vulnerabilities of balloon driver. Balloon driver is a very popular mechanism used by current virtual machine managers (VMMs) to balance physical memory among several VMs. Because it is widely used in IaaS cloud, our side channel attack can achieve a high success rate. And compared with current cross-VM side channels, it can transmit more fine-grained data. Using Xen as a case study, we explore how to transmit data by this side channel.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"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":"114333148","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}
Qin Wang, Wei Wang, Shi Jin, Hongbo Zhu, Naitong Zhang
{"title":"Smart Media Pricing (SMP): Non-uniform packet pricing game for wireless multimedia communications","authors":"Qin Wang, Wei Wang, Shi Jin, Hongbo Zhu, Naitong Zhang","doi":"10.1109/INFCOMW.2016.7562040","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562040","url":null,"abstract":"Service Providers (SPs) typically set data price according to flat rate, the time or the usage. However, the importance of multimedia content is different among various packets, and such diversity has largely been ignored in the past. In this paper, we propose a fundamentally new framework named Smart Media Pricing (SMP), to allocate price according to multimedia packet importance in terms of distortion reduction. Specifically, we investigate the profit maximization problem of a network SP (selling video transmission service) and a client device (requesting video sequences). The transmission power and the packet price are allocated non-uniformly among video frames. By deriving game equilibrium, the SP and the client device both can achieve maximum utilities. Simulation results show that the video quality, the energy efficiency, and the social profit are improved significantly compared to traditional uniform data pricing.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"148 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":"124729258","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}
{"title":"A communication-efficient model of sparse neural network for distributed intelligence","authors":"Yiqiang Sheng, Jinlin Wang, Zhenyu Zhao","doi":"10.1109/INFCOMW.2016.7562131","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562131","url":null,"abstract":"In this paper, we propose a communication-efficient model of sparse bidirectional neural network to intelligently process distributed data. The basic idea of the proposal is a modified bidirectional communication between the core and the edge of Internet by model parameters. The formulation and the procedures of the proposal are investigated. In theory, we prove that the proposed neural network is sparse, while a typical neural network is dense. In practice, a tree topology of computer cluster with a core machine and M edge machines is designed to implement the proposal, where M is the number of distributed datasets. The MNIST image database is split into M parts on the edge machines to simulate the distributed datasets from Internet of Things. Simulation shows the communication cost is greatly improved with the same level of accuracy in comparison to the state-of-the-art model. More importantly, it is naturally secure and private to communicate between the core machine and the edge machines through the model parameters, instead of the original data.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"44 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":"122897635","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}
{"title":"Joint mode selection and resource allocation for D2D communications under queueing constraints","authors":"Yi Li, M. C. Gursoy, Senem Velipasalar","doi":"10.1109/INFCOMW.2016.7562126","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562126","url":null,"abstract":"Device-to-device (D2D) communication underlaid with cellular networks is a new paradigm, proposed to enhance the performance of cellular networks. By allowing a pair of D2D users to communicate directly and share the same spectral resources with the cellular users, D2D communication can achieve higher spectral efficiency, improve the energy efficiency, and lower the traffic delay. In this paper, we propose a novel channel matching algorithm for joint mode selection and channel allocation with the goal of maximizing the system throughput under statistical queueing constraints. Seven possible modes are considered, namely the D2D cellular mode, D2D dedicated mode, uplink dedicated mode, downlink dedicated mode, uplink reuse mode, downlink reuse mode, and D2D reuse mode. Using tools from stochastic network calculus, the throughput is characterized by determining the effective capacity. We formulate the channel allocation problem as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. Via simulation results, we verify the performance improvements achieved by our proposed matching algorithm.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"51 11 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":"129818614","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}
{"title":"Serving time in the cloud: Why time-as-a-service?","authors":"Tal Mizrahi, Y. Moses","doi":"10.1109/INFCOMW.2016.7562052","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562052","url":null,"abstract":"Various applications require the use of accurate time. However, public cloud providers do not currently offer accurate time as a cloud service. We study the level of precision that can be achieved in current public cloud environments, and make the case for time-as-a-service, which can considerably improve the precision of timekeeping in the cloud.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","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":"129344509","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}
{"title":"Video upload from public transport vehicles using multihomed systems","authors":"Ali Safari Khatouni, M. Marsan, M. Mellia","doi":"10.1109/INFCOMW.2016.7562091","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562091","url":null,"abstract":"We consider a surveillance system for public transport vehicles, which is based on the collection of on-board videos, and the upload via mobile network to a central security system of video segments corresponding to those cameras and time intervals involved in an accident. We assume that vehicles are connected to several wireless interfaces, provided by different Mobile Network Operators (MNOs), each charging a different cost. Both the cost and the upload rate for each network interface change over time, according to the network load and the position of the vehicle. When a video must be uploaded to the central security, the system has to complete the upload within a deadline, deciding i) which interface(s) to use, ii) when to upload from that interface(s) and iii) at which rate to upload. The goal is to minimize the total cost of the upload, which we assume to be proportional to the data volume being transmitted and to the cost of using a given interface. We formalize the optimization problem and discuss greedy heuristics to solve it. Then, we discuss scientific and technical challenges to solve the system.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"2 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":"129603569","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}
Han Zou, Ming Jin, Hao Jiang, Lihua Xie, C. Spanos
{"title":"WinIPS: WiFi-based non-intrusive IPS for online radio map construction","authors":"Han Zou, Ming Jin, Hao Jiang, Lihua Xie, C. Spanos","doi":"10.1109/INFCOMW.2016.7562263","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562263","url":null,"abstract":"Existing WiFi fingerprinting-based Indoor Positioning System (IPS) suffers from two major bottlenecks. One is that the offline site survey process is extremely time-consuming and labor-intensive. The other is that the offline calibrated received signal strength (RSS) fingerprint database is vulnerable to environmental dynamics. To address these issues comprehensively, in this paper, we propose WinIPS, a WiFi-based non-intrusive IPS that enables automatic online radio map construction and adaptation for calibration-free indoor localization. WinIPS is able to capture data packets transmitted in the existing WiFi traffic and extract the RSS values and MAC addresses of both access points (AP) and mobile devices (MD) in a non-intrusive manner. By leveraging APs as online reference points for radio map construction, we can completely remove the needs of laborious offline site survey process. The constructed radio map is more robust to environmental dynamics since it is updated automatically in real-time. Extensive experimental results verify the superiority of WinIPS in terms of RSS estimation accuracy and localization accuracy, and these merits make it more suitable for practical large-scale implementation.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","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":"129841304","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}
{"title":"Scheduling conflicts in wireless in-band backhaul for 5G millimeter wave communications","authors":"B. Panzner","doi":"10.1109/INFCOMW.2016.7562055","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562055","url":null,"abstract":"Millimeter wave communications play a key role in the next generation of cellular networks. The excess of bandwidth available at E-band frequencies plus the ultra-dense deployment of 5G millimeter wave basestations provide tremendous capacity to the 5G mobile network. In order to speed up the real deployment of millimeter wave basestations especially in dense urban scenarios, an inexpensive wireless connection between the access points and to the core network is inevitable. In this 5G demo we will address the impact of in-band wireless backhaul for 5G millimeter wave communications in a typical urban scenario in Chicago. Since the millimeter-wave radio modules are half duplex the in-band wirless backhaul can create scheduling conflicts in case the backhaul links and access links to the mobile users are competing against each other for radio resources. In this demo we will analyze the scheduling conflicts caused by the half duplex millimeter wave basestations with integrated backhaul that can lead to starvation situations for mobile users. Specific solutions that resolve these types of scheduling conflicts are demonstrated and prove that in-band wireless backhaul is a very cost-efficient method to realize millimeter wave communications for 5G cellular.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"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":"133553047","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}
{"title":"To achieve Massive MIMO with much less antennas by nested placement","authors":"Shitong Yuan, Q. Liang","doi":"10.1109/INFCOMW.2016.7562160","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562160","url":null,"abstract":"Nested array-A new type of two dimensional arrays with sensors(antennas) on lattice was proposed these years. This paper designs a novel antenna placement scheme at base station based on 2-D nested array. We utilize the difference co-array, which is an important characteristic of nested array, to model and generate all antennas(virtual antennas) in the covariance matrix of channel(virtual channel) coefficients. Based on this fact and inferences, we also model a Massive MIMO antenna system with nested configuration and list all mathematics procedures to calculate its performance with achievable rate. A zero forcing detector is applied to this Massive MIMO system and the spectral efficiency is given at the end. The numeric result proves our mathematics derivation and also the feasibility in real world. What's more, given the same number of antennas, the proposed method could achieve higher sum-rate capacity and better spectral efficiency.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"198 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":"130827801","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}