Hit enter to search or ESC to close

Paper Digest: INFOCOM 2019 Highlights

admin

IEEE INFOCOM is a top ranked conference on networking in the research community. In this year, there were 288 papers accepted.In 2019, it is to be held in Paris, France.

To help the community quickly catch up on the work presented in this conference, Paper Digest Team processed all accepted papers, and generated one highlight sentence (typically the main topic) for each paper. Readers are encouraged to read these machine generated highlights / summaries to quickly get the main idea of each paper.

We thank all authors for writing these interesting papers, and readers for reading our digests. If you do not want to miss any interesting academic paper, you are welcome to sign up our free paper digest service to get new paper updates customized to your own interests on a daily basis.

Paper Digest Team
team@paperdigest.org

TABLE 1: INFOCOM 2019 Papers

Title Authors Highlight
1 Access Strategies for Network Caching I. Cohen, G. Einziger, R. Friedman and G. Scalosub Since these summaries are not entirely accurate, forming an efficient access strategy to multiple data stores becomes a complex risk management problem.This paper formally models this problem, and introduces practical algorithms with guaranteed approximation ratios, and in particular we show that our algorithms are optimal in a variety of settings.
2 A Utility-Driven Multi-Queue Admission Control Solution for Network Slicing B. Han, V. Sciancalepore, D. Feng, X. Costa-Perez and H. D. Schotten In this paper, we aim i) to study the slicing admission control problem by means of a multi-queuing system for heterogeneous tenant requests, ii) to derive its statistical behavior model, and iii) to provide a utility-based admission control optimization.
3 A Unified Sampling and Scheduling Approach for Status Update in Multiaccess Wireless Networks Z. Jiang, S. Zhou, Z. Niu and C. Yu In this paper, a unified sampling and scheduling (S2) approach is proposed, focusing on decentralized updates in multiaccess wireless networks.
4 INT-path: Towards Optimal Path Planning for In-band Network-Wide Telemetry T. Pan et al. In this work, we propose INT-path, a network-wide telemetry framework, by decoupling the system into a routing mechanism and a routing path generation policy.
5 A Holistic Model for Performance Prediction and Optimization on NUMA-based Virtualized Systems J. Li, J. Qian and H. Guan In this paper, we first give an analytic evaluation for performance influence from the various resource affinity. Motivated by the observations, we then build an accurate performance prediction model, named Resource Affinity performance Influence Estimation (RAIE).
6 A Practical Underlay Spectrum Sharing Scheme for Cognitive Radio Networks P. K. Sangdeh, H. Pirayesh, H. Zeng and H. Li In this paper, we propose a practical underlay spectrum sharing scheme for cognitive radio networks (CRNs) where the primary users are oblivious to the secondary users.
7 EE-IoT: An Energy-Efficient IoT Communication Scheme for WLANs H. Pirayesh, P. K. Sangdeh and H. Zeng In this paper, we propose an Energy-Efficient IoT (EE-IoT) communication scheme by taking advantage of the existing WiFi infrastructure that is widely available in home, office, campus, and city environments.
8 Towards Low Latency Multi-viewpoint 360� Interactive Video: A Multimodal Deep Reinforcement Learning Approach H. Pang, C. Zhang, F. Wang, J. Liu and L. Sun To fully understand the viewing-related features and provide a one-step solution, we advocate multimodal learning and deep reinforcement learning in the design.
9 Robust Scheduling for Wireless Charger Networks X. Wang, H. Dai, H. Huang, Y. Liu, G. Chen and W. Dou In this paper, we deal with the problem of Robust schedUling for wireLess charger nEtworks (RULE), i.e., given a number of rechargeable devices, each of which may drift within a certain range, and a number of directional chargers with fixed positions and adjustable orientations distributed on a 2D plane, determining the orientations of the wireless chargers to maximize the overall expected charging utility while taking the charging power jittering into consideration.
10 DeepTMA: Predicting Effective Contention Models for Network Calculus using Graph Neural Networks F. Geyer and S. Bondorf For effective predictions, our main contribution in this paper is a novel framework combining graph-based deep learning and Network Calculus (NC) models.
11 FID: Function Modeling-based Data-Independent and Channel-Robust Physical-Layer Identification T. Zheng, Z. Sun and K. Ren To address the above problems, we propose to exploit the mathematical expression of the physical-layer process, regarded as a function T(�), for device identification.
12 Performance Analysis of Online Social Platforms A. Giovanidis, B. Baynat and A. Vendeville We introduce an original mathematical model to analyze the diffusion of posts within a generic online social platform.
13 Nomad: An Efficient Consensus Approach for Latency-Sensitive Edge-Cloud Applications Z. Hao, S. Yi and Q. Li To this end, we propose a protocol, called Nomad, for achieving fast event ordering in edge computing environments.
14 NAuth: Secure Face-to-Face Device Authentication via Nonlinearity X. Zhou, X. Ji, C. Yan, J. Deng and W. Xu In this paper, we present Nhuth, a nonlinearity-enhanced, location-sensitive authentication mechanism for such communication.
15 CoDoC: A Novel Attack for Wireless Rechargeable Sensor Networks through Denial of Charge C. Lin, Z. Shang, W. Du, J. Ren, L. Wang and G. Wu In this paper, we develop a novel attack for WRSN through Denial of Charge (DoC) aiming at maximizing destructiveness.
16 Minimizing Charging Delay for Directional Charging in Wireless Rechargeable Sensor Networks C. Lin, Y. Zhou, F. Ma, J. Deng, L. Wang and G. Wu Besides, a merging method is introduced for a more practical application scenario.
17 Differentially-Private Incentive Mechanism for Crowdsourced Radio Environment Map Construction Y. Hu and R. Zhang To tackle this challenge, this paper introduces a novel differentially-private reverse auction mechanism for crowdsourcing-based spectrum sensing.
18 Brush like a Dentist: Accurate Monitoring of Toothbrushing via Wrist-Worn Gesture Sensing C. Luo et al. In this work, we propose Hygiea, an energy-efficient and highly-accurate toothbrushing monitoring system which exploits IMU-based wrist-worn gesture sensing using unmodified toothbrushes.
19 Octans: Optimal Placement of Service Function Chains in Many-Core Systems Z. Zheng et al. In this paper, we propose Octans, an NFV orchestrator to achieve maximum aggregate throughput of all SFCs in many-core systems.
20 Data-Intensive Routing in Delay-Tolerant Networks K. Sakai, M. Sun and W. Ku In this paper, we first introduce a new routing problem in DTNs – data-intensive routing – where data transmitted from one node to another is very large with respect to the size of data which can be transmitted in a single contact and available buffer size at relay nodes.
21 Memory/Disk Operation Aware Lightweight VM Live Migration Across Data-centers with Low Performance Impact B. Shi and H. Shen In this paper, we propose a system named Memory/disk operation aware Lightweight VM Live Migration across data-centers with low performance impact (MLLM).
22 Evolving Knowledge Graphs J. Liu, Q. Zhang, L. Fu, X. Wang and S. Lu To this end, we propose EvolveKG, a framework that reveals cross-time knowledge interaction with desirable performance of storage and computation.
23 Lightweight Flow Distribution for Collaborative Traffic Measurement in Software Defined Networks H. Xu, S. Chen, Q. Ma and L. Huang In this paper, we propose a new lightweight solution to the flow distribution problem.
24 Network Interdiction Using Adversarial Traffic Flows X. Fu and E. Modiano In this paper, we propose a new paradigm for network interdiction that models scenarios, such as stealth DoS attack, where the interdiction is performed through injecting adversarial traffic flows.
25 Distributed Machine Learning with a Serverless Architecture H. Wang, D. Niu and B. Li In this paper, we propose SIREN, an asynchronous distributed machine learning framework based on the emerging serverless architecture, with which stateless functions can be executed in the cloud without the complexity of building and maintaining virtual machine infrastructures.
26 Load Balancing for Interdependent IoT Microservices R. Yu, V. T. Kilari, G. Xue and D. Yang In this paper, we study the important problem of load balancing across IoT microservice instances.
27 Crowd-Flow Graph Construction and Identification with Spatio-Temporal Signal Feature Fusion S. He and K. G. Shin To realize an efficient and flexible urban crowd-flow identification, we propose a new scheme called CFid by fusing fine-grained spatio-temporal smartphone signal features.
28 HyCloud: Tweaking Hybrid Cloud Storage Services for Cost-Efficient Filesystem Hosting J. E, Y. Cui, M. Ruan, Z. Li and E. Zhai In this paper, we attempt to address the bottleneck with little overhead by carefully tweaking the usages of S3 and EFS.
29 NeuralWalk: Trust Assessment in Online Social Networks with Neural Networks G. Liu, C. Li and Q. Yang To address this challenge, we propose the NeuralWalk algorithm to cope with trust factor estimation and trust relation prediction problems simultaneously.
30 Measurements As First-class Artifacts P. Laffranchini, L. Rodrigues, M. Canini and B. Krishnamurthy In this paper, we propose the use of a set of reusable primitive building blocks that can be composed to express measurement tasks in a concise and simple way.
31 Minimum Age TDMA Scheduling T. Kuo Our contribution is threefold. First, we introduce a new job scheduling problem called the Min-WCS problem, and we prove that, for any constant r = 1, every r-approximation algorithm for the Min-WCS problem can be transformed into an r-approximation algorithm for the Min-Age problem.
32 Routing in Black Box: Modularized Load Balancing for Multipath Data Center Networks F. Fan, B. Hu and K. L. Yeung In this paper, we propose a new load balancing algorithm for large-scale, multi-tier fat-tree based data center networks.
33 Big Data Goes Small: Real-Time Spectrum-Driven Embedded Wireless Networking Through Deep Learning in the RF Loop F. Restuccia and T. Melodia In this paper, we present RFLearn, the first system enabling spectrum knowledge extraction from unprocessed I/Q samples by deep learning directly in the RF loop.
34 The Slice Is Served: Enforcing Radio Access Network Slicing in Virtualized 5G Systems S. D�Oro, F. Restuccia, A. Talamonti and T. Melodia In this article, we mathematically formalize the RAN slicing enforcement problem (RSEP) and demonstrate its NP-hardness.
35 Hiding Data in Plain Sight: Undetectable Wireless Communications Through Pseudo-Noise Asymmetric Shift Keying S. D�Oro, F. Restuccia and T. Melodia We evaluate the throughput performance and undetectability of PN-ASK through extensive simulations and on an experimental testbed based on USRP N210 software-defined radios.
36 Statistical learning of geometric characteristics of wireless networks A. Brochard, B. Blaszczyszyn, S. Mallat and S. Zhang Motivated by the prediction of cell loads in cellular networks, we formulate the following new, fundamental problem of statistical learning of geometric marks of point processes: An unknown marking function, depending on the geometry of point patterns, produces characteristics (marks) of the points.
37 Addressing Skewness in Iterative ML Jobs with Parameter Partition S. Wang, W. Chen, X. Zhou, S. Chang and M. Ji In this paper, we present FlexPara, a parameter partition approach that leverages the non-linear relationship and provisions adaptive tasks to match the distinct machine capacity so as to address the skewness in iterative ML jobs on data-parallel clusters.
38 CRF: Coexistent Routing and Flooding using WiFi Packets in Heterogeneous IoT Networks W. Wang, X. Liu, Y. Yao, Y. Pan, Z. Chi and T. Zhu In this paper, we present coexistent routing and flooding (CRF), which leverages the unique feature of physical layer cross-technology communication technique for concurrently conducting routing within the WiFi network and flooding among ZigBee nodes using a single stream of WiFi packets.
39 Link Rate Selection using Constrained Thompson Sampling H. Gupta, A. Eryilmaz and R. Srikant We present an algorithm called CoTS – Constrained Thompson sampling algorithm which improves upon the current state-of-the-art, is fast and is also general in the sense that it can handle several different constraints in the problem with the same algorithm.
40 Batch Reading Densely Arranged QR Codes B. Jiang, Y. Ji, X. Tian and X. Wang This paper presents BatchQR, a mobile APP that can batch read the densely arranged QR codes attached to caps of the tubes and vials in clinical and biological labs.
41 Mechanism Design for Network Utility Maximization with Private Constraint Information M. Zhang and J. Huang To tackle this issue, we propose the DeNUM Mechanism, the first mechanism for solving a general class of decomposable NUM Problems considering both private utility and constraint information.
42 How to Earn Money in Live Streaming Platforms? � A Study of Donation-Based Markets M. Tang and J. Huang To gain insights into the operation and optimization of such platforms, we formulate a two-stage game to study the platform’s and firms’ behaviors. Finally, we collect data from Twitch and demonstrate the results of the two-stage model with a case study.
43 Online Internet Anomaly Detection With High Accuracy: A Fast Tensor Factorization Solution X. Li et al. To reduce the high cost for computation and storage involved in tensor factorization, we propose two lightweight techniques to effectively derive factor matrices of tensor in the current window and iteration, taking advantage of tensor decomposition results of the previous window and iteration.
44 Efficiently Inferring Top-k Elephant Flows based on Discrete Tensor Completion K. Xie, J. Tian, X. Wang, G. Xie, J. Wen and D. Zhang To reduce the computational overhead, we propose a novel discrete tensor completion model which uses binary codes to represent the factor matrices.
45 Quick and Accurate False Data Detection in Mobile Crowd Sensing K. Xie et al. In this work, we observe the quick false data location feature from our empirical study of DRMF, based on which we propose an intelligent Light weight Low Rank and False Matrix Separation algorithm (LightLRFMS) that can reuse the previous result of the matrix decomposition to deduce the one for the current iteration step.
46 Collaborative Client-Side DNS Cache Poisoning Attack F. Alharbi, J. Chang, Y. Zhou, F. Qian, Z. Qian and N. Abu-Ghazaleh In this paper, we present a new class of DNS poisoning attacks targeting the client-side DNS cache.
47 Optimal Network Control in Partially-Controllable Networks Q. Liang and E. Modiano In this paper, we design optimal network control algorithms that can stabilize a partially-controllable network.
48 Efficient Indexing Mechanism for Unstructured Data Sharing Systems in Edge Computing J. Xie, C. Qian, D. Guo, M. Wang, S. Shi and H. Chen This paper presents a COordinate-based INdexing (COIN) mechanism for the data sharing in edge computing.
49 Differentially-Private Two-Party Egocentric Betweenness Centrality L. Roohi, B. I. P. Rubinstein and V. Teague We describe a novel protocol for computing the egocentric betweenness centrality of a node when relevant edge information is spread between two mutually distrusting parties such as two telecommunications providers.
50 EVSO: Environment-aware Video Streaming optimization of Power Consumption K. Park and M. Kim This paper presents the design and prototype of EVSO, which achieves power saving by applying adaptive frame rates to parts of videos with a little degradation of the user experience.
51 Bound-based Network Tomography with Additive Metrics C. Feng, L. Wang, K. Wu and J. Wang In this paper, we extend Boolean-based network tomography to bound-based network tomography where the lower and upper bounds are derived for unidentifiable links.
52 Deep Learning-based Job Placement in Distributed Machine Learning Clusters Y. Bao, Y. Peng and C. Wu This paper presents Harmony, a deep learning-driven ML cluster scheduler that places training jobs in a manner that minimizes interference and maximizes performance (i.e., training completion time).
53 Collaborated Tasks-driven Mobile Charging and Scheduling: A Near Optimal Result T. Wu, P. Yang, H. Dai, W. Xu and M. Xu In this paper we first advocate the collaborated tasks-driven mobile charging and scheduling to respect the energy requirement diversity.
54 Approximate Classifiers with Controlled Accuracy V. Demianiuk, K. Kogan and S. I. Nikolenko In this work, we consider a generalization of the classical packet classification problem.
55 Charging Oriented Sensor Placement and Flexible Scheduling in Rechargeable WSNs T. Wu, P. Yang, H. Dai, W. Xu and M. Xu In this paper, we focus on how to efficiently improve the charging utility when introducing charging oriented sensor placement and flexible scheduling policy.
56 Dedas: Online Task Dispatching and Scheduling with Bandwidth Constraint in Edge Computing J. Meng, H. Tan, C. Xu, W. Cao, L. Liu and B. Li In this paper, we study online deadline-aware task dispatching and scheduling in edge computing.
57 Real-time Identification of Rogue WiFi Connections Using Environment-Independent Physical Features P. Liu, P. Yang, W. Song, Y. Yan and X. Li In this paper, we present a novel security mechanism to detect and identify rogue WiFi devices or AP using environment-independent characteristics extracted from channel state information (CSI), and refuse their connections.
58 Detecting Anomaly in Large-scale Network using Mobile Crowdsourcing Y. Li, J. Sun, W. Huang and X. Tian In this paper, we propose a tree modeling-based data mining method to detect anomalies from crowdsourced network data.
59 Parameter Self-Configuration and Self-Adaptation in Industrial Wireless Sensor-Actuator Networks J. Shi and M. Sha In this work, we develop the Parameter Selection and Adaptation FramEwork (P-SAFE) that optimally configures the network parameters based on the application Quality of Service (QoS) demand and adapts the configuration at runtime to consistently satisfy the dynamic requirements.
60 VoicePop: A Pop Noise based Anti-spoofing System for Voice Authentication on Smartphones Q. Wang et al. In this paper, we design and implement VoicePop, a robust software-only anti-spoofing system on smartphones.
61 An Integrated Top-down and Bottom-up Task Allocation Approach in Social Sensing based Edge Computing Systems D. Y. Zhang and D. Wang In this paper, we focus on the task allocation problem in SSEC where rational edge devices are motivated by incentives to collectively accomplish the computation tasks in the system.
62 CG4SR: Near Optimal Traffic Engineering for Segment Routing with Column Generation M. Jadin, F. Aubry, P. Schaus and O. Bonaventure This paper leverages column generation, a widely used technique for solving large scale linear programs, combined with a novel dynamic program for solving the pricing problem.
63 Collaborative Validation of Public-Key Certificates for IoT by Distributed Caching M. Wang, C. Qian, X. Li and S. Shi This work proposes to utilize the power of distributed caching and explores the feasibility of using the cache spaces on all IoT devices as a large pool to store validated certificates.
64 Simultaneous Bi-directional Communications and Data Forwarding using a Single ZigBee Data Stream Z. Chi, Y. Li, Z. Huang, H. Sun and T. Zhu In this paper, we present Amphista, a novel cross-layer design for IoT communication and data forwarding that can more efficiently utilize the ever increasingly crowded 2.4 GHz spectrum near the gateway.
65 Efficient systematic testing of network protocols with temporal uncertain events M. Vu, L. Xu, S. Elbaum, W. Sun and K. Qia In this paper, we argue that the efficiency of SEIB could be further exponentially improved by eliminating unnecessary comparisons of the event timestamps.
66 RTOP: Optimal User Grouping and SFN Clustering for Multiple eMBMS Video Sessions A. Khalid, A. H. Zahran and C. J. Sreenan We propose an algorithm, RTOP, that finds the optimal or a near-optimal solution in real-time regardless of the number of eMBMS users.
67 Spin-Antenna: 3D Motion Tracking for Tag Array Labeled Objects via Spinning Antenna C. Wang, L. Xie, K. Zhang, W. Wang, Y. Bu and S. Lu In this paper, we propose to use a spinning linearly polarized antenna to track the 3D motion of a specified object attached with the passive RFID tag array.
68 Label-Less: A Semi-Automatic Labelling Tool for KPI Anomalies N. Zhao, J. Zhu, R. Liu, D. Liu, M. Zhang and D. Pei In this paper, we argue that labeling overhead is the main hurdle to obtain such datasets.
69 Pricing for Revenue Maximization in IoT Data Markets: An Information Design Perspective W. Mao, Z. Zheng and F. Wu For a more practical setting where buyers have bounded rationality, we design MPractical mechanism with a tight logarithmic approximation ratio.
70 Joint Antenna Allocation and Link Scheduling in FlexRadio Networks Z. Qian, Y. Yang, K. Srinivasan and N. B. Shroff In this paper, we introduce a new virtual link model to characterize the feasibility constraint from the perspective of contending RF chain usage.
71 Detecting Vulnerable Android Inter-App Communication in Dynamically Loaded Code M. Alhanahnah et al. In this paper, we present DINA, a novel hybrid analysis approach for identifying malicious IAC behaviors concealed within dynamically loaded code through reflective/DCL calls.
72 ALS-P: Light Weight Visible Light Positioning via Ambient Light Sensor Z. Wang, Z. Yang, Q. Huang, L. Yang and Q. Zhang This paper introduces ALS-P, a lightweight VLP approach which only requires the commercially widely available ambient light sensor (ALS).
73 On Optimal Hybrid Premium Peering and Caching Purchasing Strategy of Internet Content Providers L. Shi, X. Wang and M. Richard T. B. In this paper, we study how a CP determines an optimal strategy that maximizes its utility, if both premium peering and caching are available from an ISP.
74 Discrete-Time Modeling of NFV Accelerators that Exploit Batched Processing S. Lange, L. Linguaglossa, S. Geissler, D. Rossi and T. Zinner In this paper, we fill this gap by proposing a simple generic model for such batching-based mechanisms, which allows a very detailed prediction of highly relevant performance indicators.
75 Tweeting with Sunlight: Encoding Data on Mobile Objects R. Bloom, M. Zuniga, Q. Wang and D. Giustiniano We analyze and optimize the performance of a new type of channel that exploits sunlight for wireless communication.
76 Dynamic Task Pricing in Multi-Requester Mobile Crowd Sensing with Markov Correlated Equilibrium H. Jin, H. Guo, L. Su, K. Nahrstedt and X. Wang Technically, we propose a computationally efficient algorithm to compute an approximately optimal MCE.
77 Towards Verifiable Performance Measurement over In-the-Cloud Middleboxes X. Zhang, H. Duan, C. Wang, Q. Li and J. Wu In this paper, we propose a practical scheme towards verifiable performance measurement over in-the-cloud middleboxes.
78 Interference Recycling: Exploiting Interfering Signals to Enhance Data Transmission Z. Li, J. Chen, K. G. Shin and J. Liu Based on this observation, we propose Interference ReCycling (IRC).
79 Joint Placement and Allocation of Virtual Network Functions with Budget and Capacity Constraints G. Sallam and B. Ji To address these challenges, we introduce a novel relaxation method such that the objective function of the relaxed placement subproblem becomes submodular.
80 SADeepSense: Self-Attention Deep Learning Framework for Heterogeneous On-Device Sensors in Internet of Things Applications S. Yao et al. In this work, we propose SADeepSense, a deep learning framework that can automatically balance the contributions of multiple sensor inputs over time by exploiting their sensing qualities.
81 The Consistent Cuckoo Filter L. Luo, D. Guo, O. Rottenstreich, R. T. B. Ma, X. Luo and B. Ren In this paper, we first propose the Index-Independent Cuckoo filter (I2CF), a probabilistic data structure that decouples the dependency between the length of the filter and the indices of buckets which store the information of elements.
82 PANDA: Placement of Unmanned Aerial Vehicles Achieving 3D Directional Coverage W. Wang et al. This paper considers the fundamental problem of Placement of unmanned Aerial vehicles achieviNg 3D Directional cover Age (PANDA), that is, given a set of objects with determined positions and orientations in a 3D space, deploy a fixed number of UAVs by adjusting their positions and orientations such that the overall directional coverage utility for all objects is maximized.
83 RF-Mehndi: A Fingertip Profiled RF Identifier C. Zhao et al. This paper presents RF-Mehndi, a passive commercial RFID tag array formed identifier.
84 MV-Sketch: A Fast and Compact Invertible Sketch for Heavy Flow Detection in Network Data Streams L. Tang, Q. Huang and P. P. C. Lee We present MV-Sketch, a fast and compact invertible sketch that supports heavy flow detection with small and static memory allocation.
85 Figment: Fine-grained Permission Management for Mobile Apps I. Gasparis, Z. Qian, C. Song, S. V. Krishnamurthy, R. Gupta and P. Yu In this paper, we develop a framework Figment, which consists of set of libraries that developers can easily use to build in fine-grained dynamic permission management capabilities.
86 Embracing Tag Collisions: Acquiring Bloom Filters across RFIDs in Physical Layer Z. An, Q. Lin, L. Yang and W. Lou This work presents TagMap, a practical solution that acquires BFs across commercial off-the-shelf (COTS) RFID tags in the physical layer, enabling upper applications to boost their performance by orders of magnitude.
87 If You Do Not Care About It, Sell It: Trading Location Privacy in Mobile Crowd Sensing W. Jin, M. Xiao, M. Li and L. Guo As formally proved in this manuscript, our proposed mechanism guarantees a series of nice properties, including -privacy, (a, 3)accuracy, and budget feasibility.
88 Towards Privacy-preserving Incentive for Mobile Crowdsensing Under An Untrusted Platform Z. Wang, J. Li, J. Hu, J. Ren, Z. Li and Y. Li In this paper, we focus on the bid protection problem in mobile crowdsensing with an untrusted platform, and propose a novel privacy-preserving incentive mechanism to protect users’ true bids against the honest-but-curious platform while minimizing the social cost of winner selection.
89 Fast Distributed Backbone Construction Despite Strong Adversarial Jamming Y. Zou et al. Under the strong adversarial jamming model, we propose a randomized distributed algorithm that can construct a backbone in J(O(log n + logR)) rounds with high probability, where J(O(log n + log R)) is the number of rounds in the interval from the beginning of the algorithm execution that contains O(log n + log R) unjammed rounds for every node.
90 Hysteresis-based Active Queue Management for TCP Traffic in Data Centers A. M. Abdelmoniem and B. Bensaou We show the stability of HSCC via analytical modelling, and demonstrate its effectiveness via simulation and implementation in a small testbed.
91 Autonomous Environment Mapping Using Commodity Millimeter-wave Network Device A. Zhou, S. Yang, Y. Yang, Y. Fan and H. Ma In this work, we design and implement mmRanger, a system can automatically sense environment without any infrastructure support.
92 Dynamic Spectrum Management in 5G Wireless Networks: A Real-Life Modeling Approach P. Vamvakas, E. E. Tsiropoulou and S. Papavassiliou In this paper a novel dynamic spectrum management scheme for 5G Non Orthogonal Multiple Access (NOMA) wireless networks is proposed, where users are offered the option to transmit via licensed and unlicensed bands.
93 Towards Physical-Layer Vibration Sensing with RFIDs P. Li, Z. An, L. Yang and P. Yang To address this issue, this work presents TagSound, an RFID-based vibration sensing system that explores a tag’s harmonic backscattering to recover high-frequency and tiny mechanical vibrations accurately.
94 TagSheet: Sleeping Posture Recognition with an Unobtrusive Passive Tag Matrix J. Liu, X. Chen, S. Chen, X. Liu, Y. Wang and L. Chen This paper presents TagSheet, the first sleep monitoring system based on passive RFID tags, which provides a convenient, non-intrusive, and comfortable way of monitoring the sleeping postures.
95 On Improving Write Throughput in Commodity RFID Systems J. Liu, X. Chen, X. Liu, X. Zhang, X. Wang and L. Chen In this paper, we make a fresh attempt to study the under-investigated problem of group write and discuss how to improve the write throughput in the commodity RFID system.
96 Hetero-Edge: Orchestration of Real-time Vision Applications on Heterogeneous Edge Clouds W. Zhang, S. Li, L. Liu, Z. Jia, Y. Zhang and D. Raychaudhuri This paper presents the design and evaluation of a latency-aware edge computing platform, aiming to minimize the end-to-end latency for edge applications.
97 A Flexible Distributed Optimization Framework for Service of Concurrent Tasks in Processing Networks Z. Shi and A. Eryilmaz Distributed optimization has important applications in the practical implementation of machine learning and signal processing setup by providing means to allow interconnected network of processors to work towards the optimization of a global objective with intermittent communication.
98 Adaptive Path Tracing with Programmable Bloom Filters in Software-Defined Networks S. Xiong, Q. Cao and W. Si In this paper, we develop and evaluate a �debugging mode� for packet forwarding, where we demonstrate a possible design space by introducing a programmable header field into data packets used for diagnosis purposes.
99 A Business Model Analysis of Mobile Data Rewards H. Yu, E. Wei and R. A. Berry In this work, we study two such rewarding schemes: a Subscription-Aware Rewarding (SAR) scheme and a Subscription-Unaware Rewarding (SUR) scheme.
100 Strongly Secure and Efficient Range Queries in Cloud Databases under Multiple Keys K. Cheng et al. In this paper, we overcome this restriction for secure range queries by enabling query executions on the multi-key encryption data. We propose a secure cloud database supporting range queries under multiple keys, in which all users could preserve the confidentiality of their own different keys, and do not have to share them with each other.
101 On the Power of Preprocessing in Decentralized Network Optimization K. Foerster, J. Hirvonen, S. Schmid and J. Suomela We take this as an opportunity to study the fundamental question of how and to what extent local algorithms can benefit from preprocessing.
102 CASA: Congestion and Stretch Aware Static Fast Rerouting K. Foerster, Y. Pignolet, S. Schmid and G. Tredan We complement our formal analysis with a simulation study, in which we compare our algorithms with the state-of-the-art in different scenarios and show benefits in terms of stretch, load, and resilience.
103 Dynamic Multicast Traffic Engineering with Efficient Rerouting for Software-Defined Networks J. Kuo, S. Chiang, S. Shen, D. Yang and W. Chen In this paper, we explore Multi-tree Low-overhead Multicast Rerouting (MLMR) to jointly solve both problems for SDN multicast.
104 Pair-Navi: Peer-to-Peer Indoor Navigation with Mobile Visual SLAM E. Dong, J. Xu, C. Wu, Y. Liu and Z. Yang In this paper, we present Pair-Navi, an infrastructure-free indoor navigation system that circumvents all these requirements by reusing a previous traveler’s (i.e. leader) trace experience to navigate future users (i.e. followers) in a Peer-to-Peer (P2P) mode.
105 Adjusting Matching Algorithm to Adapt to Workload Fluctuations in Content-based Publish/Subscribe Systems S. Qian, W. Mao, J. Cao, F. L. Mou�l and M. Li In this paper, we explore the idea of endowing matching algorithms with adaptability.
106 Beyond Inferring Class Representatives: User-Level Privacy Leakage From Federated Learning Z. Wang, M. Song, Z. Zhang, Y. Song, Q. Wang and H. Qi We propose a framework incorporating GAN with a multi-task discriminator, which simultaneously discriminates category, reality, and client identity of input samples.
107 On User Selective Eavesdropping Attacks in MU-MIMO: CSI Forgery and Countermeasure S. Wang, Z. Chen, Y. Xu, Q. Yan, C. Xu and X. Wang In this paper, we explore the eavesdropping attack in a novel and practical context in which CSI forgery entangles MU-MIMO user selection in a many-users regime.
108 Distributed Energy-Adaptive Aggregation Scheduling with Coverage Guarantee For Battery-Free Wireless Sensor Networks K. Chen, H. Gao, Z. Cai, Q. Chen and J. Li We formulate this problem and propose a distributed algorithm which can select nodes adaptively according to their energy condition and schedule these nodes to achieve the minimum latency, simultaneously. Thus, we propose to aggregate a subset of nodes which can meet the given coverage quality requirement.
109 Novel and Practical SDN-based Traceback Technique for Malicious Traffic over Anonymous Networks Z. Ling, J. Luo, D. Xu, M. Yang and X. Fu To mitigate this issue, we propose a novel and practical traceback technique to confirm the communication relationship between the suspicious server and the user.
110 ReLeS: A Neural Adaptive Multipath Scheduler based on Deep Reinforcement Learning H. Zhang, W. Li, S. Gao, X. Wang and B. Ye To support real-time scheduling, we propose an asynchronous training algorithm that enables parallel execution of packet scheduling, data collecting, and neural network training.
111 Economic Viability of Data Trading with Rollover Z. Wang, L. Gao, J. Huang and B. Shou In this paper, we investigate the economic viability of offering the data trading market together with the rollover mechanism, to gain a deeper understanding of the interrelationship between the user-flexibility and the time-flexibility.
112 A Network-centric Framework for Auditing Recommendation Systems A. Dash, A. Mukherjee and S. Ghosh In this work, we propose a novel network-centric framework which is not only able to quantify various static properties of RSs, but also is able to quantify dynamic properties such as how likely RSs are to lead to polarization or segregation of information among their users.
113 FS-Net: A Flow Sequence Network For Encrypted Traffic Classification C. Liu, L. He, G. Xiong, Z. Cao and Z. Li In this paper, we apply the recurrent neural network to the encrypted traffic classification problem and propose the Flow Sequence Network (FS-Net).
114 Bootstrapping Accountability and Privacy to IPv6 Internet without Starting from Scratch L. He, G. Ren and Y. Liugg In this paper, we propose a private and accountable proposal based on IPv6 called PAVI that seeks to bootstrap accountability and privacy to the IPv6 Internet without introducing new communication identifiers and large-scale modifications to the deployed base.
115 Age Optimal Information Gathering and Dissemination on Graphs V. Tripathi, R. Talak and E. Modiano We consider the problem of timely exchange of updates between a central station and a set of ground terminals V , via a mobile agent that traverses across the ground terminals along a mobility graph G = (V, E).
116 Trustworthiness Inference Framework in the Social Internet of Things: A Context-Aware Approach H. Xia, F. Xiao, S. Zhang, C. Hu and X. Cheng We subsequently present concrete methods for the calculation of different trust elements.
117 Combinatorial Sleeping Bandits with Fairness Constraints F. Li, J. Liu and B. Ji To that end, we propose a new Combinatorial Sleeping MAB model with Fairness constraints, called CSMAB-F, aiming to address the aforementioned crucial modeling issues.
118 Optimal Trunk-Reservation by Policy Learning A. Massaro, F. De Pellegrini and L. Maggi In this paper we study online learning of optimal trunk-reservation policies when the system parameters, i.e., class arrival rates and service time, are unknown.
119 A stack-vector routing protocol for automatic tunneling M. L. Lamali, S. Lassourreuille, S. Kunne and J. Cohen Here, we propose the first fully distributed algorithm for path computation with automatic tunneling, i.e., taking into account encapsulation, decapsulation and conversion of protocols.
120 A Generic Technique for Sketches to Adapt to Different Counting Ranges T. Yang et al. To address this issue, we propose a generic technique: self-adaptive counters (SA Counter).
121 An Online Market Mechanism for Edge Emergency Demand Response via Cloudlet Control S. Chen, L. Jiao, L. Wang and F. Liu We propose a novel online market mechanism, EdgeEDR, to incentivize cloudlets to participate in EDR, featuring multiple cloudlet-specific designs.
122 Multi-hop Backscatter Tag-to-Tag Networks A. Y. Majid, M. Jansen, G. O. Delgado, K. S. Yildirim and P. Pawellzak We characterize the performance of a backscatter tag-to-tag (T2T) multi-hop network.
123 Intelligent Edge-Assisted Crowdcast with Deep Reinforcement Learning for Personalized QoE F. Wang et al. In this paper, we propose DeepCast, an edge-assisted crowdcast framework, which makes intelligent decisions at edges based on the massive amount of real-time information from the network and viewers to accommodate personalized QoE with minimized system cost. We collect multiple real-world datasets and evaluate the performance of DeepCast using trace-driven experiments.
124 FAVE: A fast and efficient network Flow AVailability Estimation method with bounded relative error T. Liu and J. C. S. Lui We name such probability as � flow availability� and present the -flow availability estimation (FAVE) problem, which is a generalisation of network connectivity or maximum flow reliability estimations.
125 Kelly Cache Networks M. Mahdian, A. Moharrer, S. Ioannidis and E. Yeh We show that so-called continuous greedy algorithm [1] attains a ratio arbitrarily close to 1-1/ e � 0.63 using a deterministic estimation via a power series; this drastically reduces execution time over prior art, which resorts to sampling.
126 Entrapment for Wireless Eavesdroppers S. Fang, T. Wang, Y. Liu, S. Zhao and Z. Lu Towards this goal, we propose techniques that can conceal exchanged messages by utilizing wireless channel characteristics between the transmitter and the receiver, as well as techniques that can attract an eavesdropper to gradually approach a trap region, where the eavesdropper can get fake messages.
127 Hardening Database Padding for Searchable Encryption L. Xu, X. Yuan, C. Wang, Q. Wang and C. Xu In this paper, we propose an information theory based framework to analyse the security strength under certain padding overhead.
128 Adaptive Multipath Routing based on Hybrid Data and Control Plane Operation M. Pizzutti and A. E. Schaeffer-Filho In this paper, we present a multipath routing strategy that takes full advantage of a hybrid SDN/OpenFlow and P4 architecture.
129 Dynamic Adaptive DNN Surgery for Inference Acceleration on the Edge C. Hu, W. Bao, D. Wang and F. Liu Motivated by the fact that the data size of some intermediate DNN layers is significantly smaller than that of raw input data, we design the DNN surgery, which allows partitioned DNN processed at both the edge and cloud while limiting the data transmission.
130 Fair Rate Allocation over A Generalized Symmetric Polymatroid with Box Constraints P. Wan, Z. Wang, H. Yuan, J. Zhang and X. Mao In this paper, we present a divide-and-conquer algorithm for this problem with quadratic running time.
131 Impact of Network Topology on the Performance of DML: Theoretical Analysis and Practical Factors S. Wang, D. Li, J. Geng, Y. Gu and Y. Cheng In this paper, we study the impact of network topology on the DML performance both in theory and in practice.
132 Corking by Forking: Vulnerability Analysis of Blockchain S. Wang, C. Wang and Q. Hu To take precautions, we employ the large deviation theory to study the vulnerability of blockchain networks incurred by intentional forks from a micro point of view, boosting forward-looking and strategic planning mechanisms for resisting the forking attack.
133 ImgSensingNet: UAV Vision Guided Aerial-Ground Air Quality Sensing System Y. Yang, Z. Hu, K. Bian and L. Song This paper presents ImgSensingNet, a vision guided aerial-ground sensing system, for air quality monitoring and forecasting by the fusion of haze images taken by the unmanned-aerial-vehicle (UAV) and the AQI data collected by an on-ground wireless sensor network.
134 Balancing Cost and Dissatisfaction in Online EV Charging under Real-time Pricing H. Yi, Q. Lin and M. Chen Our key contribution is two simple online algorithms with the best possible competitive ratio among all deterministic algorithms.
135 Perceiving Internet Anomalies via CDN Replica Shifts Y. Jia and A. Kuzmanovic In this paper, we demonstrate that the production Content Distribution Networks (CDNs), and their pervasive network infrastructure, could be effectively utilized to detect Internet anomalies.
136 DRL360: 360-degree Video Streaming with Deep Reinforcement Learning Y. Zhang, P. Zhao, K. Bian, Y. Liu, L. Song and X. Li This paper presents a Deep Reinforcement Learning (DRL) based framework for 360-degree video streaming, named DRL360.
137 PassiveRETRO: Enabling Completely Passive Visible Light Localization for IoT Applications S. Shao, A. Khreishah and J. Paez This paper investigates the feasibility of tracking the real-time location of a completely passive retroreflector using visible light for IoT applications.
138 D3-Guard: Acoustic-based Drowsy Driving Detection Using Smartphones Y. Xie, F. Li, Y. Wu, S. Yang and Y. Wang In order to improve the performance of our system, we adopt an effective feature extraction method based on undersampling technique and FFT, and carefully design a high-accuracy detector based on LSTM networks for the early detection of drowsy driving.
139 Faster Placement of Virtual Machines through Adaptive Caching G. Einziger, M. Goldstein and Y. Sa�ar Our work introduces a new cache refresh method that achieves an up to a 5.3x reduction in placement time with only a slight degradation of quality compared to having the complete and up to date system’s state.
140 PeDSS: Privacy Enhanced and Database-Driven Dynamic spectrum Sharing H. Li, Y. Yang, Y. Dou, J. J. Park and K. Ren To address the shortcomings of existing solutions, we propose a privacy enhanced and database-driven dynamic spectrum sharing (PeDSS) framework in this paper, which preserves the privacy for both IUs and SUs in database-driven DSA systems without the need for online trusted third party.
141 GCN-GAN: A Non-linear Temporal Link Prediction Model for Weighted Dynamic Networks K. Lei, M. Qin, B. Bai, G. Zhang and M. Yang In this paper, we generally formulate the dynamics prediction problem of various network systems (e.g., the prediction of mobility, traffic and topology) as the temporal link prediction task.
142 Individual Data Plan in Virtual Network Operation: A Proactive Matching Approach Z. Wang, Y. Zhuang, Z. Wang and X. Wu To this end, we propose CAPITAL, a proactive resource allocation framework based on behavior-driven individual cellular data usage prediction.
143 Adaptive Interference-Aware VNF Placement for Service-Customized 5G Network Slices Q. Zhang, F. Liu and C. Zeng With an aim to maximize the total throughput of accepted requests, we propose an Adaptive Interference-Aware (AIA) heuristic approach to automatically place VNFs in 5G service-customized network slices.
144 Fog-based Data Offloading in Urban IoT Scenarios P. Korto�i, L. Zheng, C. Joe-wong, M. D. Francesco and M. Chiang This work leverages the fog networking paradigm to devise a multi-tier data offloading protocol suitable for diverse data-centric applications in urban IoT scenarios.
145 Winning at the Starting Line: Joint Network Selection and Service Placement for Mobile Edge Computing B. Gao, Z. Zhou, F. Liu and F. Xu In this paper, we study the problem of jointly optimizing the access network selection and service placement for MEC, towards the goal of improving the QoS by balancing the access, switching and communication delay.
146 HideMe: Privacy-Preserving Photo Sharing on Social Networks F. Li, Z. Sun, A. Li, B. Niu, H. Li and G. Cao In this paper, we propose the design, implementation and evaluation of HideMe, a framework to preserve the associated users’ privacy for online photo sharing.
147 Doppler Radar with In-Band Full Duplex Radios S. A. Hassani, K. Parashar, A. Bourdoux, B. van Liempd and S. Pollin In this paper, we show that the non-zero Doppler frequencies can be extracted from the residual SI, giving information about the speed of objects in the environment.
148 Regularized inversion of flow size distribution N. Antunes, V. Pipiras and G. Jacinto In this paper, we revisit the estimation of the size distribution of packet flows in Internet traffic through an inversion approach for several packet sampling schemes which are based on probabilistic sampling (PS).
149 Measuring Update Performance and Consistency Anomalies in Managed DNS Services Z. Gao and A. Venkataramani We conduct an empirical measurement-driven study of 8 top-tier managed DNS providers and find that inter-nameserver update propagation delays commonly take tens of seconds with little improvement over the last several years.
150 Camul: Online Caching on Multiple Caches with Relaying and Bypassing H. Tan, J. Shaofeng H.-C., Z. Han, L. Liu, K. Han and Q. Zhao We propose an O(log K)-competitive randomized algorithm Camul and an O(K)-competitive deterministic algorithm Camul-Det, where K is the total number of slots in all caches.
151 Maximum Lifetime Analytics in IoT Networks V. Valls, G. Iosifidis and T. Salonidis This paper studies the problem of allocating band-width and computation resources to data analytics tasks in Internet of Things (IoT) networks.
152 Unsupervised Anomaly Detection for Intricate KPIs via Adversarial Training of VAE W. Chen et al. In this paper, we propose an adversarial training method in the Bayesian network based on partition analysis with solid theoretical proof.
153 RABA: Resource-Aware Backup Allocation For A Chain of Virtual Network Functions J. Zhang, Z. Wang, C. Peng, L. Zhang, T. Huang and Y. Liu In this paper, we formalize the resource-aware backup allocation problem, which aims to minimize the backup resource consumption while meeting the overall availability demand.
154 Efficient Online Resource Allocation in Heterogeneous Clusters with Machine Variability H. Xu, Y. Liu, W. C. Lau, J. Guo and A. Liu In this paper, we tackle this online resource allocation problem for approximation jobs in parallel computing clusters.
155 Online Job Scheduling with Resource Packing on a Cluster of Heterogeneous Servers Y. Liu, H. Xu and W. C. Lau In this paper, we consider the problem of online job scheduling for a computing cluster comprised of multiple servers with heterogeneous computation resources, while taking the diversity of resource demands for different jobs into account.
156 TwinLeak: RFID-based Liquid Leakage Detection in Industrial Environments J. Guo, T. Wang, Y. He, M. Jin, C. Jiang and Y. Liu In this work, we present a RFID-based solution, TwinLeak, to detect liquid leakage using COTS RFID devices.
157 WristSpy: Snooping Passcodes in Mobile Payment Using Wrist-worn Wearables C. Wang, J. Liu, X. Guo, Y. Wang and Y. Chen This paper demonstrates a serious security breach and aims to raise the awareness of the public that the passcodes for authorizing transactions in mobile payments can be leaked by exploiting the embedded sensors in wearable devices (e.g., smartwatches).
158 On the Distribution of Traffic Volumes in the Internet and its Implications M. Alasmar, G. Parisis, R. Clegg and N. Zakhleniu We examine anomalous traces which are a poor fit for all distributions tried and show that this is often due to traffic outages or links that hit maximum capacity.We demonstrate the utility of the log-normal distribution in two contexts: predicting the proportion of time traffic will exceed a given level (for service level agreement or link capacity estimation) and predicting 95th percentile pricing.
159 Disentangled Network Alignment with Matching Explainability F. Zhou, Z. Wen, G. Trajcevski, K. Zhang, T. Zhong and F. Liu We propose d NAME (disentangled Network Alignment with Matching Explainability) – a novel solution for NA in heterogeneous networks settings, based on a matching technique that embeds nodes in a disentangled and faithful manner.
160 Slicing Cell Resources: The Case of HTC and MTC Coexistence V. Mancuso, P. Castagno, M. Sereno and M. A. Marsan In this paper we investigate the allocation of resources to slices on the radio interface of one cell.
161 Cross-Network Prioritized Sharing: An Added Value MVNO�s Perspective Y. Zhu, H. Yu, R. A. Berry and C. Liu We analyze the prioritized sharing between an added value Mobile Virtual Network Operator (MVNO) and multiple Mobile Network Operators (MNOs).
162 To Cancel or Not to Cancel: Exploiting Interference Signal Strength in the Eigenspace for Efficient MIMO DoF Utilization Y. Chen, S. Li, C. Li, Y. T. Hou and B. Jalaian In this paper, we exploited the difference in interference signal strength in the eigenspace and differentiate strong and weak interference signals via their singular values.
163 Pairwise Markov Chain: A Task Scheduling Strategy for Privacy-Preserving SIFT on Edge H. Zhang and K. Zeng In this paper, we propose a task scheduling strategy, which can achieve image feature extraction on edge while ensuring privacy.
164 A General Model for Minimizing Age of Information at Network Edge C. Li, S. Li and Y. T. Hou In this paper, we consider a more general model for AoI research that is closer to what happens in the real world.
165 When Network Matters: Data Center Scheduling with Network Tasks F. Giroire, N. Huin, A. Tomassilli and S. P�rennes We thus propose new provably efficient algorithms with the goal of minimizing the makespan in this framework.
166 Task Replication for Vehicular Cloud: Contextual Combinatorial Bandit with Delayed Feedback L. Chen and J. Xu A learning-based algorithm, called DATEV (Deadline-Aware Task rEplication for Vehicular Cloud), is proposed to address the special issues in VCC systems including uncertainty of vehicle movements, volatile vehicle members, and large vehicle population.
167 A Probabilistic Framework to Node-level Anomaly Detection in Communication Networks B. L. Bars and A. Kalogeratos In this paper we consider the task of detecting abnormal communication volume occurring at node-level in communication networks.
168 iLPS: Local Positioning System with Simultaneous Localization and Wireless Communication M. Yang, L. Chuo, K. Suri, L. Liu, H. Zheng and H. Kim This paper presents a novel RF local positioning system, iLPS, specifically designed for challenging indoor non-lineof-sight (NLOS) scenarios and/or urban canyons where global positioning systems (GPS) fail to reliably operate.
169 How Powerful Switches Should be Deployed: A Precise Estimation Based on Queuing Theory G. Shen, Q. Li, S. Ai, Y. Jiang, M. Xu and X. Jia In this paper, we fill the gap of solving the flow table space estimation problem based on queuing theory.
170 Optimal Resource Allocation for Secure Multi-User Wireless Powered Backscatter Communication with Artificial Noise P. Wang, N. Wang, M. Dabaghchian, K. Zeng and Z. Yan In this paper, we consider a wireless powered backscatter communication (WPBC) network in which a full-duplex access point (AP) simultaneously transmits information and energy signals by injecting artificial noise (AN) to secure the backscatter transmission from multiple backscatter devices (BDs).
171 TDFI: Two-stage Deep Learning Framework for Friendship Inference via Multi-source Information Y. Zhao et al. To address this issue, we propose a Two-stage Deep learning framework for Friendship Inference (TDFI).
172 Switching Constrained Max-Weight Scheduling for Wireless Networks S. Basu and S. Shakkottai Using novel drift based techniques, in this paper we derive stability, and provide explicit bounds on the expected cost and queue lengths for both algorithms.
173 Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention G. A. Tong and D. Du In this paper, we study the misinformation prevention problem under the prominent independent cascade model.
174 MG-WFBP: Efficient Data Communication for Distributed Synchronous SGD Algorithms S. Shi, X. Chu and B. Li In this paper, we observe that many deep neural networks have a large number of layers with only a small amount of data to be communicated.
175 Virtual Speed Test: an AP Tool for Passive Analysis of Wireless LANs P. Nayak, S. Pandey and E. W. Knightly In this paper, we present virtual speed test, a measurement based framework that enables an AP to estimate speed test results for any of its associated clients without any special-purpose probing, with zero end-user co-operation and purely based on passively observable parameters at the AP.
176 Experiences Implementing Live VM Migration over the WAN with Multi-Path TCP F. Le and E. M. Nahum This necessarily restricts the ability to migrate VMs, limiting their potential and utility.In this paper, we show how a new Internet standard, Multi-Path TCP, can be used to seamlessly migrate live VMs across WAN boundaries.
177 TTL-based Cloud Caches D. Carra, G. Neglia and P. Michiardi Our aim is to adapt dynamically the number of caches based on the traffic pattern, to minimize the overall costs.We present a dynamic algorithm for TTL caches whose goal is to obtain close-to-minimal costs.
178 The Role of Network Topology for Distributed Machine Learning G. Neglia, G. Calbi, D. Towsley and G. Vardoyan In this paper, we study how the variability of task execution times at cluster nodes affects the system throughput.
179 Looking Glass of NFV: Inferring the Structure and State of NFV Network from External Observations Y. Lin, T. He, S. Wang, K. Chan and S. Pasteris In this work, we take a first step towards this problem by developing an inference framework designed to �look into� the NFV network.
180 Auction-based Cache Trading for Scalable Videos in Multi-Provider Heterogeneous Networks B. Jedari and M. D. Francesco In this article, we design a commercial trading system in which multiple CPs, each owning SVC videos, compete over renting the cache in multiple SBSs provided by an MNO.
181 Online Channel-state Clustering And Multiuser Capacity Learning For Wireless Scheduling I. Tariq, R. Sen, G. d. Veciana and S. Shakkottai In this paper we propose an online algorithm for clustering channel-states and learning the associated achievable multiuser rates.
182 Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels G. Quan, J. Tan and A. Eryilmaz We consider a single-hop multi-cache distributed system with data items being dispatched by random hashing.
183 ACCEL: Accelerating the Bitcoin Blockchain for High-throughput, Low-latency Applications A. Hari, M. Kodialam and T. V. Lakshman In this paper, we present a high-throughput, low-latency, deterministic confirmation mechanism called ACCEL for accelerating Bitcoin’s block confirmation mechanism.
184 Incentivizing Relay Participation for Securing IoT Communication X. Zhang, P. Huang, L. Guo and M. Sha In this paper, we apply the amplify-and-forward (AF) cooperative communication to increase the secrecy capacity of IoT systems by incentivizing relay IoT devices.
185 Nascent: Tackling Caller-ID Spoofing in 4G Networks via Efficient Network-Assisted Validation A. Sheoran, S. Fahmy, C. Peng and N. Modi In this paper, we seek an effective and efficient solution for 4G (and conceptually 5G) carrier networks to detect (and block) caller-ID spoofing.
186 Update Algebra: Toward Continuous, Non-Blocking Composition of Network Updates in SDN G. Li, Y. R. Yang, F. Le, Y. Lim and J. Wang In this paper, we develop update algebra, a novel, systematic, theoretical framework based on abstract algebra, to enable continuous, non-blocking, fast composition of multiple updates.
187 Price Competition with LTE-U and WiFi X. Wang and R. A. Berry There have been a number of technical studies on the co-existence of LTE-U and WiFi in unlicensed spectrum In this paper, we instead investigate the impact of such a technology from an economic perspective.
188 Hide and Seek: A Defense Against Off-sensing Attack in Cognitive Radio Networks M. Hossain and J. Xie In this paper, we propose a new random approach, the random-OS attack, which adapts to realistic scenarios and is difficult to detect using conventional techniques.
189 Routing and Spectrum Assignment Integrating Machine-Learning-Based QoT Estimation in Elastic Optical Networks M. Salani, C. Rottondi and M. Tornatore We develop a framework that leverages the probabilistic outputs of a ML-based QoT estimator to define the reach constraints in an Integer Linear Programming (ILP) formulation for RSA in an elastic optical network.
190 Age of Information-Aware Scheduling for Timely and Scalable Internet of Things Applications L. Corneo, C. Rohner and P. Gunningberg We aim to minimize direct access to the possibly battery powered physical devices, yet improving Age of Information as a data freshness metric.
191 CapJack: Capture In-Browser Crypto-jacking by Deep Capsule Network through Behavioral Analysis R. Ning, C. Wang, C. Xin, J. Li, L. Zhu and H. Wu This work proposes an innovative approach, named CapJack, to detect in-browser malicious cryptocurrency mining activities by using the latest CapsNet technology.
192 Robust and Efficient Modulation Recognition Based on Local Sequential IQ Features W. Xiong, P. Bogdanov and M. Zheleva We propose to use local features, besides global statistics, extracted from raw IQ data, which collectively enable a robust framework for modulation recognition that outperforms baselines from the state-of-the-art.
193 Scheduling Jobs with Random Resource Requirements in Computing Clusters K. Psychas and J. Ghaderi We consider a natural scheduling problem which arises in many distributed computing frameworks.
194 Joint Content Distribution and Traffic Engineering of Adaptive Videos in Telco-CDNs K. Diab and M. Hefeeda To address this problem, we present a new algorithm called CAD (Cooperative Active Distribution), which strives to serve as much as possible of the requested multimedia objects within the ISP while carefully engineering the traffic paths through the network.
195 Federated Learning over Wireless Networks: Optimization Model Design and Analysis N. H. Tran, W. Bao, A. Zomaya, N. Minh N.H. and C. S. Hong We fill this gap by formulating a Federated Learning over wireless network as an optimization problem FEDL that captures both trade-offs.
196 Statistical Enrichment Models for Activity Inference from Imprecise Location Data R. He, J. Cao, L. Zhang and D. Lee The focus of this paper is on the development of a location insight system for activity labeling and user segment inference, based only on Telecom mobility data enriched with point-of-interest (POI) data.
197 PAMT: Phase-based Acoustic Motion Tracking in Multipath Fading Environments Y. Liu, W. Zhang, Y. Yang, W. Fang, F. Qin and X. Dai In this paper, a new parameter named Multipath Effect Ratio (MER) is defined to indicate the multipath fading effect on received signals at different frequencies.
198 X-CHANT: A Diverse DSA based Architecture for Next-generation Challenged Networks V. K. Shah, S. Silvestri, B. Luciano and S. K. Das This paper presents a novel network architecture, termed neXt-generation CHAllenged NeTwork (X-CHANT), for improving connectivity in rural environments.
199 CFHider: Control Flow Obfuscation with Intel SGX Y. Wang et al. In this paper, we propose CFHider, a hardware-assisted method to protect the control flow confidentiality.
200 Real-Time Scheduling for Event-Triggered and Time-Triggered Flows in Industrial Wireless Sensor-Actuator Networks X. Jin, A. Saifullah, C. Lu and P. Zeng In this paper, we propose three fundamental centralized algorithms that reserve as few resources as possible for event-triggered flows such that the real-time performance of time-triggered flows is not affected.
201 On the Stochastic Link Modeling of Static Wireless Sensor Networks in Ocean Environments A. Shahanaghi, Y. Yang and R. M. Buehrer In this paper, we are going to investigate ocean surface waves’ effects on the Line-of-Sight (LoS) link between sensors in a homogeneous WSN.
202 Automating CSI Measurement with UAVs: from Problem Formulation to Energy-Optimal Solution S. Piao, Z. Ba, L. Su, D. Koutsonikolas, S. Li and K. Ren To address this challenge, we formulate an energy optimization problem based on a novel graph model that includes the cost of possible actions for UAVs.
203 Making Big Money from Small Sensors: Trading Time-Series Data under Pufferfish Privacy C. Niu, Z. Zheng, S. Tang, X. Gao and F. Wu In this paper, we study time-series data trading from the perspective of a data broker in data markets.
204 KeyListener: Inferring Keystrokes on QWERTY Keyboard of Touch Screen through Acoustic Signals L. Lu et al. In this work, we show the practicability of an indirect eavesdropping attack, KeyListener, which infers keystrokes on QWERTY keyboards of touch screen leveraging audio devices on a smartphone.
205 Dynamic Pricing and Capacity Allocation of UAV-provided Mobile Services X. Wang and L. Duan We prove that the UAV should ask for a higher price if the leftover hovering time is longer or its service capacity is smaller, and its expected profit approaches to that under complete user information if the hovering time is sufficiently large.
206 Compressed Distributed Gradient Descent: Communication-Efficient Consensus over Networks X. Zhang, J. Liu, Z. Zhu and E. S. Bentley Our contributions in this paper are three-fold: i) We develop a communication-efficient algorithm called amplified-differential compression DGD (ADC-DGD) and show that it converges under any unbiased compression operator; ii) We rigorously prove the convergence performances of ADC-DGD and show that they match with those of DGD without compression; iii) We reveal an interesting phase transition phenomenon in the convergence speed of ADC-DGD.
207 Recommending Paths: Follow or Not Follow? Y. Li, C. Courcoubetis and L. Duan In this paper we analyse the simple but fundamental model of a platform choosing between two paths: one with known deterministic travel cost and the other that alternates over time between a low and a high random cost states, where the low and the high cost states are only partially observable and perform respectively better and worse on average than the fixed cost path.
208 APRIL: An Application-Aware, Predictive and Intelligent Load Balancing Solution for Data-Intensive Science D. Nadig, B. Ramamurthy, B. Bockelman and D. Swanson In this paper, we propose an application-aware intelligent load balancing system for high-throughput, distributed computing, and data-intensive science workflows.
209 Towards Measuring Quality of Service in Untrusted Multi-Vendor Service Function Chains: Balancing Security and Resource Consumption P. K. Vairam, G. Mitra, V. Manoharan, C. Rebeiro, B. Ramamurthy and Kamakoti In this paper, we propose the Measuring Tape scheme, comprised of (1) a novel data structure called evidence Bloom filter (e-BF) that can be deployed at the vendor devices (and services), and (2) unique querying techniques, which can be used by the administrator to query the e-BF to measure QoS.
210 OFM: An Online Fisher Market for Cloud Computing A. S. Prasad, M. Arumaithurai, D. Koll, Y. Jiang and X. Fu In this work, we propose OFM, an online learning based marketplace that dynamically determines the price for arbitrary resource types based on supply and demand existing at that period.
211 Keeping Context In Mind: Automating Mobile App Access Control with User Interface Inspection H. Fu, Z. Zheng, S. Zhu and P. Mohapatra In this work, we present the design, implementation, and evaluation of COSMOS, a context-aware mediation system that bridges the semantic gap between foreground interaction and background access, in order to protect system integrity and user privacy.
212 SynLight: Synthetic Light Emission for Fast Transmission in COTS Device-enabled VLC Y. Yang, J. Luo, C. Chen, W. Zhong and L. Chen In this paper, we engineer SynLight aiming to significantly improve the data rate of a practical VLC system.
213 Demand-Aware Network Design with Minimal Congestion and Route Lengths C. Avin, K. Mondal and S. Schmid This paper presents the first bounded-degree, demand-aware network, ct-DAN, which minimizes both congestion and route lengths.
214 Service Scheduling for Bernoulli Requests and Quadratic Cost R. Burra, C. Singh and J. Kuri We study service scheduling problems in a slotted system in which jobs arrive according to a Bernoulli process and have to leave within two slots after arrival, service costs are quadratic in service rates, and there is also a linear waiting cost.
215 Distributed Self-Adjusting Tree Networks B. Peres, O. A. d. O. Souza, O. Goussevskaia, C. Avin and S. Schmid We present a rigorous formal analysis of the correctness and performance of DiSptayNet, which can be seen as an interesting generalization of analyses known from sequential self-adjusting datastructures.
216 Aloe: An Elastic Auto-Scaled and Self-stabilized Orchestration Framework for IoT Applications S. Chattopadhyay, S. Chatterjee, S. Nandi and S. Chakraborty Therefore, in this paper, we propose Aloe, an elastically auto-scalable SDN orchestration framework.
217 TransLink: User Identity Linkage across Heterogeneous Social Networks via Translating Embeddings J. Zhou and J. Fan In this paper, we investigate the UIL problem by presenting a translation-modeling approach-TransLink.
218 Computing Blocking Probabilities in Elastic Optical Networks with Spectrum Defragmentation S. K. Singh and A. Jukan Since the complexity of the exact Markov model increases exponentially with the network capacity and size, we propose a reduced state model where a link occupancy state is defined by the total occupied slices on a fiber link.
219 Hierarchical Multi-resource Fair Queueing for Network Function Virtualization C. You In this paper, we present two new multi-resource fair queueing algorithms that support hierarchies, collapsed Hierarchical Dominant Resource Fair Queueing (collapsed H-DRFQ) and dove-tailing H-DRFQ, both of which provide hierarchical share guarantees.
220 Learning Network Traffic Dynamics Using Temporal Point Process A. Saha, N. Ganguly, S. Chakraborty and A. De In this paper, we propose Network Transmission Point Process (NTPP), a probabilistic deep machinery that models the traffic characteristics of hosts on a network and effectively forecasts the network traffic patterns, such as load spikes.
221 Learning to Cache With No Regrets G. S. Paschos, A. Destounis, L. Vigneri and G. Iosifidis This paper introduces a novel caching analysis that, contrary to prior work, makes no modeling assumptions for the file request sequence.
222 Weighted Sum-Rate Maximization in Multi-Carrier NOMA with Cellular Power Constraint L. Sala�n, M. Coupechoux and C. S. Chen We propose a novel approach to solve the WSR maximization problem in multi-carrier NOMA with cellular power constraint.
223 Optimal User Choice Engineering in Mobile Crowdsensing with Bounded Rational Users M. Karaliopoulos, I. Koutsopoulos and L. Spiliopoulos In this paper, we revisit the well-investigated question of how to optimize the contributions of crowds of mobile end users to MCS tasks.
224 Detecting Network Disruptions At Colocation Facilities A. Milolidakis, R. Fontugne and X. Dimitropoulos In this paper we devise a methodology to identify collocation facilities in traceroute data and to monitor delay and routing patterns between facilities.
225 UnseenCode: Invisible On-screen Barcode with Image-based Extraction H. Cui, H. Bian, W. Zhang and N. Yu We propose an image-based extraction method based on cross-component correlation of color images.
226 Burstable Instances for Clouds: Performance Modeling, Equilibrium Analysis, and Revenue Maximization Y. Jiang, M. Shahrad, D. Wentzlaff, D. H. K. Tsang and C. Joe-Wong This paper presents the first unified framework to model, analyze, and optimize the operation of burstable instances.
227 DeepCog: Cognitive Network Management in Sliced 5G Networks with Deep Learning D. Bega, M. Gramaglia, M. Fiore, A. Banchs and X. Costa-Perez To this end, we present DeepCog, a novel data analytics tool for the cognitive management of resources in 5G systems.
228 Multisource Rumor Spreading with Network Coding Y. Bromberg, Q. Dufour and D. Frey We are revisiting the state of the art by applying Random Linear Network Coding to further increase performance.
229 Adaptive User-managed Service Placement for Mobile Edge Computing: An Online Learning Approach T. Ouyang, R. Li, X. Chen, Z. Zhou and X. Tang Thus, in this paper we propose a novel adaptive user-managed service placement mechanism, which jointly optimizes a user’s perceived-latency and service migration cost, weighted by user preferences.
230 Market Manipulation of Bitcoin: Evidence from Mining the Mt. Gox Transaction Network W. Chen, J. Wu, Z. Zheng, C. Chen and Y. Zhou This paper proposes an approach to mine the transaction networks of exchanges for answering this question.
231 A Distributed Orchestration Algorithm for Edge Computing Resources with Guarantees G. Castellano, F. Esposito and F. Risso To solve this problem, we present DRAGON, a Distributed Resource AssiGnment and OrchestratioN algorithm that seeks optimal partitioning of shared resources between different applications running over a common edge infrastructure.
232 LEGO-Fi: Transmitter-Transparent CTC with Cross-Demapping X. Guo, Y. He, X. Zheng, Z. Yu and Y. Liu This paper presents transmitter-transparent cross-technology communication, which leaves the processing complexity solely at the receiver side and therefore makes a critical advance toward bidirectional high-throughput CTC.
233 Distributed Learning and Optimal Assignment in Multiplayer Heterogeneous Networks H. Tibrewal, S. Patchala, M. K. Hanawal and S. J. Darak For such a completely decentralized network we develop algorithms that aim to achieve optimal network throughput.
234 No Regret in Cloud Resources Reservation with Violation Guarantees N. Liakopoulos, G. Paschos and T. Spyropoulos We propose a novel model-free approach that has its root in online learning.
235 Round-Robin Synchronization: Mitigating Communication Bottlenecks in Parameter Servers C. Chen, W. Wang and B. Li To address this problem, in this paper we propose the Round-Robin Synchronous Parallel (R2SP) scheme, which coordinates workers to make updates in an evenly-gapped, round-robin manner.
236 Satisfying Network Slicing Constraints via 5G MAC Scheduling S. Mandelli, M. Andrews, S. Borst and S. Klein In the present paper we propose a MAC scheduler which meets these objectives and preserves the basic structure of utility-based schedulers such as the Proportional Fair algorithm in terms of per-user scheduling metrics.
237 Memory flipping: a threat to NUMA virtual machines in the Cloud. D. Mvondo, B. Teabe, A. Tchana, D. Hagimont and N. De Palma In this paper, we show that violating this requirement can degrade performance by up to 18%.
238 LEAP: Location Estimation and Predictive Handover with Consumer-Grade mmWave Devices J. Palacios, P. Casari, H. Assasa and J. Widmer We show that compared to standard state-of-the-art 802.11ad systems, LEAP’s location driven management greatly improves network performance and link stability.
239 A Truthful FPTAS Mechanism for Emergency Demand Response in Colocation Data Centers J. Chen, D. Ye, S. Ji, Q. He, Y. Xiang and Z. Liu Aiming at solving the efficiency of DR, in this paper, we present MEDR, a mechanism on emergency DR in colocation data center.
240 Joint Service Placement and Request Routing in Multi-cell Mobile Edge Computing Networks K. Poularakis, J. Llorca, A. M. Tulino, I. Taylor and L. Tassiulas We show that this problem generalizes several problems in literature and propose an algorithm that achieves close-to-optimal performance using randomized rounding.
241 Search in My Way: Practical Outsourced Image Retrieval Framework Supporting Unshared Key X. Wang, J. Ma, X. Liu and Y. Miao Strict security analysis shows that the user privacy and outsourced data security can be guaranteed during the image retrieval process, and the performance analysis using real-world dataset shows that the proposed image retrieval framework is efficient and feasible for practical applications.
242 Synthesizing Wider WiFi Bandwidth for Respiration Rate Monitoring in Dynamic Environments S. Shi, Y. Xie, M. Li, A. X. Liu and J. Zhao To address the limitations of both radar based and COTS device based systems, in this paper, we propose RespiRadio, a system that can detect a person’s respiration rate in dynamic ambient environments via a single TX-RX pair of WiFi cards.
243 Orthogonality-Sabotaging Attacks against OFDMA-based Wireless Networks S. Zhao, Z. Lu, Z. Luo and Y. Liu In this paper, we propose a novel attack strategy, called orthogonality-sabotaging attack, against orthogonal frequency division multiple access (OFDMA) that has been widely adopted in today’s wireless network standards (e.g., 4G/5G and 802.11ax).
244 Self-sustainable Sensor Networks with Multi-source Energy Harvesting and Wireless Charging P. Zhou, C. Wang and Y. Yang We propose a three-step solution to optimize this new framework.
245 Differentially-Private Deep Learning from an optimization Perspective L. Xiang, J. Yang and B. Li In this paper, we address this problem from an optimization perspective, and formulate the problem as one that minimizes the accuracy loss given a set of privacy constraints.
246 Interference-aware User Grouping Strategy in NOMA Systems with QoS Constraints F. Guo, H. Lu, D. Zhu and H. Wu In this paper, we focus on the interference-aware user grouping strategy in NOMA systems, aiming at minimizing power consumption with QoS constraints.
247 Service Placement with Provable Guarantees in Heterogeneous Edge Computing Systems S. Pasteris, S. Wang, M. Herbster and T. He In this paper, we consider such a heterogeneous MEC system, and focus on the problem of placing multiple services in the system to maximize the total reward.
248 Smart Information Spreading for Opinion Maximization in Social Networks A. Nayak, S. Hosseinalipour and H. Dai In this paper, we propose a novel approach to solve the problem, where opinion maximization is achieved through efficient information spreading.
249 Learning the Optimal Synchronization Rates in Distributed SDN Control Architectures K. Poularakis, Q. Qin, L. Ma, S. Kompella, K. K. Leung and L. Tassiulas In this paper, we fill this gap by introducing the SDN synchronization problem: how often to synchronize the network views for each controller pair.
250 Wireless Multicasting for Content Distribution: Stability and Delay Gain Analysis B. Abolhassani, J. Tadrous and A. Eryilmaz In this work, we provide a comprehensive analysis of stability properties and delay gains that wireless multicasting capabilities, as opposed to more traditional unicast transmissions, can provide for content distribution in mobile networks.
251 A Near Optimal Reliable Composition Approach for Geo-Distributed Latency-Sensitive Service Chains D. Chemodanov, P. Calyam and F. Esposito In this paper, we present a novel practical and near optimal SFC composition approach for geo-distributed cloud infrastructures that also admits end-to-end network QoS constraints such as latency, packet loss, etc.
252 Optimal Representations of a Traffic Distribution in Switch Memories Y. Sadeh, O. Rottenstreich, A. Barkan, Y. Kanizo and H. Kaplan For splitting a universe of 2W addresses into k pieces of particular sizes, we give a simple algorithm that computes an optimal representation in �(Wk) time.
253 CBA: Contextual Quality Adaptation for Adaptive Bitrate Video Streaming B. Alt, T. Ballard, R. Steinmetz, H. Koeppl and A. Rizk In this paper, we provide a fresh view on ABR quality adaptation for QoE maximization, which we formalize as a decision problem under uncertainty, and for which we contribute a sparse Bayesian contextual bandit algorithm denoted CBA.
254 Large-Scale Network Utility Maximization: Countering Exponential Growth with Exponentiated Gradients L. Vigneri, G. Paschos and P. Mertikopoulos To do so, we leverage a suite of modified gradient methods known as �mirror descent� and we derive a scalable and efficient algorithm for the NUM problem based on gradient exponentiation.
255 A Collaborative Learning Based Approach for Parameter Configuration of Cellular Networks J. Chuai et al. To address those challenges, we propose a collaborative learning approach to leverage data from different cells to boost the learning efficiency and to improve network performance.
256 Smartlink: Exploiting Channel Clustering Effects for Reliable Millimeter Wave Communications I. Aykin, B. Akgun and M. Krunz In this paper, we propose SmartLink, a protocol that exploits the multi-cluster scattering phenomenon at mmW frequencies to establish a multi-directional link between a base station and a user.
257 Space-Optimal Packet Routing on Trees B. Patt-Shamir and W. Rosenbaum In this paper, for any d = 2, we describe a d-local algorithm whose buffer space requirement is O (?
258 Incrementally-deployable Indoor Navigation with Automatic Trace Generation Y. Shu, Z. Li, B. Karlsson, Y. Lin, T. Moscibroda and K. Shin In this paper, we present FollowUs, an easily-deployable (bootstrap-free) and scalable indoor navigation system.
259 Dynamic Mobility-Aware Interference Avoidance for Aerial Base Stations in Cognitive Radio Networks A. Rahmati, X. He, I. Guvenc and H. Dai With this consideration, an adaptive dynamic interference avoidance scheme is proposed in this work for ABSs coexisting with a primary network.
260 TrustSAS: A Trustworthy Spectrum Access System for the 3.5 GHz CBRS Band M. Grissa, A. A. Yavuz and B. Hamdaoui In this paper, we propose TrustSAS, a trustworthy framework for SAS that synergizes state-of-the-art cryptographic techniques with blockchain technology in an innovative way to address these privacy issues while complying with FCC’s regulatory design requirements.
261 Hurts to Be Too Early: Benefits and Drawbacks of Communication in Multi-Agent Learning P. Naghizadeh, M. Gorlatova, A. S. Lan and M. Chiang We consider a learning algorithm in which agents make decisions based on their own observations of the environment, as well as the observations of other agents, which are collected through communication between agents.
262 Only Those Requested Count: Proactive Scheduling Policies for Minimizing Effective Age-of-Information B. Yin et al. In this paper, we introduce the concept of effective AoI (EAoI) to quantify the freshness of the information users utilize for decision-making.
263 Live Migration Ate My VM: Recovering a Virtual Machine after Failure of Post-Copy Live Migration D. Fernando, J. Terner, K. Gopalan and P. Yang In this paper, we present PostCopyFT, a new approach to recover a VM after a destination or network failure during post-copy live migration using an efficient reverse incremental checkpointing mechanism.
264 PHDP: Preserving Persistent Homology in Differentially Private Graph Publications T. Gao and F. Li This paper proposes a novel anonymization scheme, called PHDP, which preserves persistent homology and satisfies differential privacy.
265 Enabling Cross-Technology Coexistence for Extremely Weak Wireless Devices R. Chen and W. Gao In this paper, we design and implement EmBee, a new wireless PHY technique that enables cross-technology coexistence at zero cost or performance loss to these extremely weak wireless devices.
266 Wireless and Computing Resource Allocation for Selfish Computation Offloading in Edge Computing S. Jo�ilo and G. D�n We model the interaction between devices and the operator as a Stackelberg game, prove the existence of Stackelberg equilibria, and propose an efficient decentralized algorithm for computing equilibria.
267 LiBeam: Throughput-Optimal Cooperative Beamforming for Indoor Visible Light Networks N. Cen, N. Dave, E. Demirors, Z. Guan and T. Melodia To reduce the effect of interference among users created by the partial overlap of each LED’s field of view, we propose LiBeam, a cooperative beamforming scheme, based on forming multiple LED clusters.
268 Throughput and Pricing of Ridesharing Systems C. Courcoubetis and A. Dimakis We introduce a queueing model for passengers waiting to get transport by drivers participating in a ridesharing system.
269 A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling M. Liu, A. W. Richa, M. Rost and S. Schmid We complement our theoretical contribution with extensive simulation in two different scenarios, and find that our algorithm performs significantly better than predicted in theory, achieving an edge capacity violation ratio of at most 3.
270 Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds V. Farhadi et al. We address this problem by proposing a two-time-scale framework that jointly optimizes service (data & code) placement and request scheduling, under storage, communication, computation, and budget constraints.
271 ORACLE: Optimized Radio clAssification through Convolutional neuraL nEtworks K. Sankhe, M. Belgiovine, F. Zhou, S. Riyaz, S. Ioannidis and K. Chowdhury This paper describes the architecture and performance of ORACLE, an approach for detecting a unique radio from a large pool of bit-similar devices (same hardware, protocol, physical address, MAC ID) using only IQ samples at the physical layer.
272 Joint Offloading Decision and Resource Allocation with Uncertain Task Computing Requirement N. Eshraghi and B. Liang We propose an efficient algorithm, termed Task Offloading and Resource Allocation with Uncertain Computing (TORAUC), and show that it always converges to a Karush-Kuhn-Tucker (KKT) point of an alternate form of the original problem, which has its binary constraints removed but guarantees an offloading decision solution that is arbitrarily close to binary.
273 Powers Maximizing Proportional Fairness Among Poisson Bipoles N. S. Ramesan and F. Baccelli This paper uses Poisson geometry to define a power control mechanism for large mobile ad hoc networks.
274 Client Pre-Screening for MU-MIMO in Commodity 802.11ac Networks via Online Learning S. Su, W. Tan, X. Zhu and R. Liston Our algorithm is based on a sequence of channel state information (CSI), SNR, and client device type, and can automatically adapt to the motion of individual clients.
275 Achieving a Fully-Flexible Virtual Network Embedding in Elastic Optical Networks N. Shahriar et al. In this paper, we present an optimization model that solves the VNE problem over EON when lightpath configurations can be chosen among a large (and practical) set of combinations of paths, modulation formats, FEC overheads and baud rates.
276 Cache Network Management Using BIG Cache Abstraction P. Babaie, E. Ramadan and Z. Zhang In this paper, we develop an optimization decomposition framework for cache management under �BIG� cache abstraction which fully utilizes the cache resources in a cache network.
277 Calibrate: Frequency Estimation and Heavy Hitter Identification with Local Differential Privacy via Incorporating Prior Knowledge J. Jia and N. Z. Gong In this work, we aim to design LDP algorithms that can leverage such prior knowledge.
278 Enhancing Cellular Performance via Vehicular-based Opportunistic Relaying and Load Balancing S. Kassir, G. d. Veciana, N. Wang, X. Wang and P. Palacharla This paper studies the potential gains of leveraging clusters of V2V interconnected vehicles to enable: (1) improved opportunistic access to the cellular infrastructure; and (2), balancing traffic loads across cells through cluster multihoming.
279 Channel Independent Wi-Fi Backscatter Networks T. Kim and W. Lee Based on the analysis, we propose a method that translates the error vectors into a backscatter frame.
280 SAS: Modeling and Analysis of Spectrum Activity Surveillance in Wireless Overlay Networks J. Wang, W. Wang and C. Wang We find that randomized strategies with m monitors can achieve a sweep-coverage over a space of n assignment points in T(n/m ln n) time, and detect an oblivious or adversarial spectrum culprit in T(n/m) time for SAS systems.
281 Secure On-skin Biometric Signal Transmission using Galvanic Coupling W. J. Tomlinson, S. Banou, C. Yu, M. Nogueira and K. R. Chowdhury We propose a secure, body-guided transmission channel through the use of galvanic coupling (GC).
282 Receiver-driven Video Multicast over NOMA Systems in Heterogeneous Environments X. Jiang, H. Lu, C. W. Chen and F. Wu We propose a novel receiver-driven superposed video multicast (Supcast) scheme by integrating Softcast, an analog-like transmission scheme, into the NOMA-based system to achieve high bandwidth efficiency as well as gradual decoding quality proportional to channel conditions at receivers.
283 CellTradeMap: Delineating Trade Areas for Urban Commercial Districts with Cellular Networks Y. Zhao, Z. Zhou, X. Wang, T. Liu, Y. Liu and Z. Yang In this paper, we propose CellTradeMap, a novel district-level trade area analysis framework using mobile flow records (MFRs), a type of fine-grained cellular network data.
284 Consortiums of ISP-Content Providers Formed by Nash Bargaining for Internet Content Delivery D. Mitra and A. Sridhar Consortiums of ISP-Content Providers Formed by Nash Bargaining for Internet Content Delivery
285 D2D Offloading for Statistical QoS Provisionings Over 5G Multimedia Mobile Wireless Networks X. Zhang and Q. Zhu To tackle these challenges, we propose the overall two-hop wireless link QoS provisioning schemes based on its two individual single-hop statistical QoS requirements.
286 A Blockchain based Witness Model for Trustworthy Cloud Service Level Agreement Enforcement H. Zhou, X. Ouyang, Z. Ren, J. Su, C. de Laat and Z. Zhao To tackle this challenge, we propose a witness model using game theory and the smart contract techniques.
287 The Browsers Strike Back: Countering Cryptojacking and Parasitic Miners on the Web R. Tahir, S. Durrani, F. Ahmed, H. Saeed, F. Zaffar and S. Ilyas Hence, we propose a machine learning solution based on hardware-assisted profiling of browser code in real-time.
288 On the Distribution of AoI for the GI/GI/1/1 and GI/GI/1/2* Systems: Exact Expressions and Bounds J. P. Champati, H. Al-Zubaidy and J. Gross For any single-source-single-server queueing system, we derive, using sample path analysis, a fundamental result that characterizes the AoI violation probability, and use it to obtain closed-form expressions for D/GI/1/1, M/GI/1/1 as well as systems that use zero-wait policy.