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

Proactive patrol dispatch surveillance system by inferring mobile trajectories of multiple intruders using binary proximity sensors 利用二元接近传感器推断多入侵者移动轨迹的主动巡逻调度监控系统

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

Dahee Jeong, Minkyoung Cho, O. Gnawali, Hyungjune Lee

{"title":"Proactive patrol dispatch surveillance system by inferring mobile trajectories of multiple intruders using binary proximity sensors","authors":"Dahee Jeong, Minkyoung Cho, O. Gnawali, Hyungjune Lee","doi":"10.1109/INFOCOM.2016.7524369","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524369","url":null,"abstract":"In this paper, we consider the problem of distributing patrol officers inside a building to maximize the probability of catching multiple intruders while minimizing the distance the patrol officers travel to reach the locations of the intruders. In our problem setting, the patrol officers are assisted by the information collected by a network of binary proximity sensors installed in the building. We claim that learning even common movement sub-patterns that originate due to the constrained physical environment helps to find likely locations of intruders where each major location is instrumented using a sensor node. We use a series of binary detection events to infer likely future trajectories in a real-world building. For a given set of detectable nodes on the inferred future trajectories, we aim to find the optimal patrol dispatch node location with high exposure to intruders' future appearance using patrol officers in limited numbers, ideally fewer than the intruders. In order to prevent possible crime and perform responsive defense against potential intruders, our algorithm also tries to reduce the travel distance from patrols current positions to their dispatched positions at the same time. We validate our proposed scheme in terms of detection accuracy by varying the number of intruders, robustness against missing events, and responsiveness compared to a practical baseline counterpart through real-world system experiments.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"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":"125618128","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}

引用次数: 3

Scheduling jobs with non-uniform demands on multiple servers without interruption 在不中断的情况下调度多个服务器上具有不统一需求的作业

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

Sungjin Im, Mina Naghshnejad, M. Singhal

{"title":"Scheduling jobs with non-uniform demands on multiple servers without interruption","authors":"Sungjin Im, Mina Naghshnejad, M. Singhal","doi":"10.1109/INFOCOM.2016.7524417","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524417","url":null,"abstract":"We consider the problem of scheduling jobs with varying demands on multiple servers. Each server has a certain computing capacity and can schedule multiple jobs simultaneously as long as the jobs' total demand does not exceed the server's capacity. This scenario arises commonly in virtualization, cloud computing, and MapReduce (or Hadoop). We study this problem with the requirement that jobs must be scheduled non-preemptively, meaning that every job must be completed without interruption once it gets started. Often, preemption is out of choice since preempting a job can be prohibitively costly or is not allowed due to system constraints. We focus on the popular objective of minimizing total completion time of jobs. This problem is NP hard hence we study heuristics with provable approximation guarantees. Succinctly, the interaction between two orthogonal quantities, jobs demands and sizes makes the scheduling decision significantly more challenging. In this paper we propose novel algorithms for scheduling jobs with non-uniform demands on multiple homogeneous servers without preemption. We first observe that the Smallest Volume First (SVF) algorithm that favors jobs with smaller volumes could perform very poorly in general. However, we show that SVF yields a nearly optimal schedule when the system is overloaded and jobs have demands considerably smaller than servers' capacities. This result supports the intuition that SVF should work well unless some jobs with high demands occupy the servers for long, blocking other jobs. Building on this intuition and using reduction to geometric packing problems, we develop algorithms that are constant approximation for all instances for the first time. Prior to our work, there was no theoretical study on this problem even for the single server case.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"2015 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":"134436851","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}

引用次数: 12

Randomized algorithms for scheduling VMs in the cloud 云中的虚拟机调度采用随机算法

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

Javad Ghaderi

{"title":"Randomized algorithms for scheduling VMs in the cloud","authors":"Javad Ghaderi","doi":"10.1109/INFOCOM.2016.7524536","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524536","url":null,"abstract":"We consider the problem of scheduling VMs (Virtual Machines) in a multi-server system motivated by cloud computing applications. VMs arrive dynamically over time and require various amounts of resources (e.g., CPU, Memory, Storage, etc.) for the duration of their service. When a VM arrives, it is queued and later served by one of the servers that has sufficient remaining capacity to serve it. The scheduling of VMs is subject to: (i) packing constraints, i.e., multiple VMs can be be served simultaneously by a single server if their cumulative resource requirement does not violate the capacity of the server, and (ii) non-preemption, i.e., once a VM is scheduled in a server, it cannot be interrupted or migrated to another server. To achieve maximum throughput, prior results hinge on solving a hard combinatorial problem (Knapsack) at the instances that all the servers become empty (the so-called global refresh times which require synchronization among the servers). The main contribution of this paper is that it resolves these issues. Specifically, we present a class of randomized algorithms for placing VMs in the servers that can achieve maximum throughput without preemptions. The algorithms are naturally distributed, have low complexity, and each queue needs to perform limited operations. Further, our algorithms display good delay performance in simulations, comparable to delay of heuristics that may not be throughput-optimal, and much better than the delay of the prior known throughput-optimal algorithms.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"70 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":"134570693","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}

引用次数: 30

Deadline-aware bandwidth sharing by allocating switch buffer in data center networks 在数据中心网络中，通过分配交换机缓冲区实现截止日期感知带宽共享

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

Jiao Zhang

{"title":"Deadline-aware bandwidth sharing by allocating switch buffer in data center networks","authors":"Jiao Zhang","doi":"10.1109/INFOCOM.2016.7524531","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524531","url":null,"abstract":"Most of today's data center applications are sensitive to latency. In this paper, a Deadline-aware bandwidth Sharing mechanism by Allocating switch Buffer (DSAB) is proposed to satisfy the deadline requirements of flows. As the existing work SAB does, DSAB also leverages the feature that the buffer size of a switch port is usually much larger than the product of bandwidth and round trip delay in data center networks. The basic idea of DSAB is to allocate switch buffer to deadline-sensitive flows in priority and the remaining buffer is fairly allocated to background flows. However, this method will possibly lead to bandwidth wastage in topologies with multiple bottlenecks. Therefore, enlightened by the pre-authorization method in credit card systems, we propose a Pre-Authorization (PA) algorithm to address this problem. The PA algorithm allows switches take back the extra allocated bandwidth by adding a bandwidth confirmation phase after the bandwidth request phase. End hosts and switch functions of DSAB is implemented in Linux kernel and NetFPGA platform, respectively. The results of experiments conducted in a real small testbed indicate that DSAB can indeed satisfy the deadline requirements of deadline-sensitive flows by allocating switch buffer to them in priority.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"13 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":"133880445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Characterizing caching workload of a large commercial Content Delivery Network 描述大型商业内容交付网络的缓存工作负载

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

M. Shafiq, Amir R. Khakpour, A. Liu

{"title":"Characterizing caching workload of a large commercial Content Delivery Network","authors":"M. Shafiq, Amir R. Khakpour, A. Liu","doi":"10.1109/INFOCOM.2016.7524379","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524379","url":null,"abstract":"Content Delivery Networks (CDNs) have emerged as a dominant mechanism to deliver content over the Internet. Despite their importance, to our best knowledge, large-scale analysis of CDN cache performance is lacking in prior literature. A CDN serves many content publishers simultaneously and thus has unique workload characteristics; it typically deals with extremely large content volume and high content diversity from multiple content publishers. CDNs also have unique performance metrics; other than hit ratio, CDNs also need to minimize network and disk load on cache servers. In this paper, we present measurement and analysis of caching workload at a large commercial CDN. Using detailed logs from four geographically distributed CDN cache servers, we analyze over 600 million content requests accounting for more than 1.3 petabytes worth of traffic. We analyze CDN workload from a wide range of perspectives, including request composition, size, popularity, and temporal dynamics. Using real-world logs, we also evaluate cache replacement algorithms, including two enhancements designed based on our CDN workload analysis: N-hit and content-aware caching. The results show that these enhancements achieve substantial performance gains in terms of cache hit ratio, disk load, and origin traffic volume.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130711773","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}

引用次数: 24

Practical antenna selection for WLAN AP 实用的无线局域网AP天线选择

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

Seungmin Yoo, Seongwon Kim, Youngwook Son, Jaehong Yi, Sunghyun Choi

引用次数: 2

Coordinated caching in planet-scale CDNs: Analysis of feasibility and benefits 行星级cdn中的协调缓存:可行性和效益分析

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

Kianoosh Mokhtarian, H. Jacobsen

引用次数: 7

Flowing with the water: On optimal monitoring of water distribution networks by mobile sensors 随水流动:移动传感器对配水网络的优化监测

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

Rong Du, C. Fischione, Ming Xiao

{"title":"Flowing with the water: On optimal monitoring of water distribution networks by mobile sensors","authors":"Rong Du, C. Fischione, Ming Xiao","doi":"10.1109/INFOCOM.2016.7524480","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524480","url":null,"abstract":"Contamination in drinkable water distribution networks can be potentially monitored by new and agile mobile sensor networks. These sensor networks are composed of static sensor nodes, which are pre-installed, of mobile sensor nodes, which are released into the water network for a more punctual monitoring, and of sink nodes, which are used to collect data from mobile sensor nodes. Thus, the activation of the sink nodes as well as the release locations of the mobile nodes must be carefully decided to ensure timely and accurate event detections. Unfortunately, no approach can be found in the literature to optimally determine the release locations of the mobile sensor nodes and the activation of the sink nodes. In this paper, a novel optimization approach to solve such a problem is posed. The problem is particularly challenging due to the potential large size of the networks, the undetermined movement of the mobile sensor nodes, the integer decision variables associated to the release locations of these mobile sensor nodes, and the binary decision variables associated to the activation of the sink nodes. To account for the mobile node mobility across the water distribution network, a stochastic mobility model is considered. It is shown that the objective function of the optimization problem exhibits submodular properties, which allow establishing a mobile nodes release algorithm. The benefits and efficiency of the proposed algorithm are illustrated by analysis and numerical evaluations. It is concluded that the proposed optimization based approach allows efficient monitoring of water distribution networks by mobile sensor nodes.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"35 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":"132746544","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}

引用次数: 18

Privacy-preserving verifiable data aggregation and analysis for cloud-assisted mobile crowdsourcing 云辅助移动众包的隐私保护可验证数据聚合和分析

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

Gaoqiang Zhuo, Qi Jia, Linke Guo, Ming Li, Pan Li

{"title":"Privacy-preserving verifiable data aggregation and analysis for cloud-assisted mobile crowdsourcing","authors":"Gaoqiang Zhuo, Qi Jia, Linke Guo, Ming Li, Pan Li","doi":"10.1109/INFOCOM.2016.7524547","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524547","url":null,"abstract":"Crowdsourcing is a crowd-based outsourcing, where a requester (task owner) can outsource tasks to workers (public crowd). Recently, mobile crowdsourcing, which can leverage workers' data from smartphones for data aggregation and analysis, has attracted much attention. However, when the data volume is getting large, it becomes a difficult problem for a requester to aggregate and analyze the incoming data, especially when the requester is an ordinary smartphone user or a start-up company with limited storage and computation resources. Besides, workers are concerned about their identity and data privacy. To tackle these issues, we introduce a three-party architecture for mobile crowdsourcing, where the cloud is implemented between workers and requesters to ease the storage and computation burden of the resource-limited requester. Identity privacy and data privacy are also achieved. With our scheme, a requester is able to verify the correctness of computation results from the cloud. We also provide several aggregated statistics in our work, together with efficient data update methods. Extensive simulation shows both the feasibility and efficiency of our proposed solution.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"37 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":"128844837","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}

引用次数: 69

Dynamic scaling of virtual clusters with bandwidth guarantee in cloud datacenters 云数据中心中具有带宽保障的虚拟集群动态扩展

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

Lei Yu, Zhipeng Cai

{"title":"Dynamic scaling of virtual clusters with bandwidth guarantee in cloud datacenters","authors":"Lei Yu, Zhipeng Cai","doi":"10.1109/INFOCOM.2016.7524355","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524355","url":null,"abstract":"Network virtualization with bandwidth guarantee is essential for the performance predictability of cloud applications because of the shared multi-tenant nature of the cloud. Several virtual network abstractions have been proposed for the tenants to specify and reserve their virtual clusters with bandwidth guarantee. However, they require pre-determined fixed cluster size and bandwidth, and do not support the scaling of the cluster in size and bandwidth requirements. On the other hand, the existing works on virtual cluster scaling focus on dynamically adjusting the cluster size without considering any bandwidth guarantee targeted by current network abstractions. To fill the gap, this paper considers the problem of scaling up a virtual network abstraction with bandwidth guarantee. Efficient algorithms are proposed to find the valid allocation for the scaled cluster abstraction with optimization on the VM locality of the cluster. We also point out the case that a virtual cluster cannot be scaled without changing its original VM placement, and propose an optimal allocation algorithm that exploits the VM migration to address this issue while minimizing the total migration cost for the virtual cluster scaling. Extensive simulations demonstrate the effectiveness and efficiency of our algorithms.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"19 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":"115582103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 46