2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第9页

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116423

Ran Zhang, Jiang Liu, Tao Huang, Renchao Xie

{"title":"Popularity based probabilistic caching strategy design for named data networking","authors":"Ran Zhang, Jiang Liu, Tao Huang, Renchao Xie","doi":"10.1109/INFCOMW.2017.8116423","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116423","url":null,"abstract":"Named Data Networking (NDN) is a promising future network architecture. In NDN, caching is widely deployed to improve content delivery. A lot of caching strategies have been proposed to improve caching performance, such as complicated cooperative caching and non-cooperative caching. No-cooperative Probability caching is proposed to increase the content variety across caching nodes, although it enjoys the feasibility due to its simplicity, it basically caches content randomly without special intention and usually caches content which would never be used again. To solve this problem, Popularity based Probabilistic Caching (PPC) is proposed in this paper. PPC decides whether content would be reused based on their popularity and hence cache them with different possibility. Content popularity consists of two aspects, the immediate local popularity and the potential deduced popularity. PPC considers both factors to make caching decisions. Simulation is carried out to compare PPC and other existing caching strategies to prove the improvement, and the results show that the general traffic is reduced, while the hit ratio of caching is enhanced.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130288063","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

Energy-efficient cooperative coded caching for heterogeneous small cell networks 异构小蜂窝网络的高效协同编码缓存

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116421

Qingmin Jia, Renchao Xie, Tao Huang, Jiang Liu, Yun-jie Liu

{"title":"Energy-efficient cooperative coded caching for heterogeneous small cell networks","authors":"Qingmin Jia, Renchao Xie, Tao Huang, Jiang Liu, Yun-jie Liu","doi":"10.1109/INFCOMW.2017.8116421","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116421","url":null,"abstract":"Coded caching and cooperative caching have been considered as two promising technologies in heterogeneous small cell networks. Although some works have been done for coded caching and cooperative caching in heterogeneous small cell networks, to the best of our knowledge, these two important issues have traditionally been addressed separately. However, it is necessary to jointly consider these two significant issues to reduce the backhaul rate and improve content delivery as well as the Quality of Experience (QoE) of end-users. Moreover, the energy efficiency issue for content caching and content delivery is also extremely significant but excessively negligent. In this paper, we jointly consider the coded caching and cooperative caching issues, and propose a cooperative coded caching scheme to improve the content delivery efficiency and enhance the QoE for end-users. And then, based on the proposed scheme, we establish an energy consumption model from the perspective of content caching and content delivery to optimize the energy efficiency. In addition, we propose a greedy-based algorithm to solve this energy efficiency issue by optimizing the caching placement. Finally, simulation results show the performance of the proposed scheme.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127420713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

A real-subject evaluation trial for location-aware smart buildings 位置感知智能建筑的实主体评价试验

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116393

Mahdi Inaya, Michael Meli, Dimitrios Sikeridis, M. Devetsikiotis

引用次数: 12

Context-resilient capacity-achieving rateless code for OFDM channels with frequency diversity 具有频率分集的OFDM信道环境弹性容量实现无速率码

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116430

Anfu Zhou, Liang Liu, Huadong Ma, G. Wang

引用次数: 0

Simulated annealing for edge partitioning 边划分的模拟退火

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116352

H. Mykhailenko, G. Neglia, F. Huet

引用次数: 0

Application interference analysis: Towards energy-efficient workload management on heterogeneous micro-server architectures 应用程序干扰分析:在异构微服务器架构上实现高效的工作负载管理

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116415

Markus Hähnel, Frehiwot Melak Arega, W. Dargie, R. Khasanov, J. Castrillón

{"title":"Application interference analysis: Towards energy-efficient workload management on heterogeneous micro-server architectures","authors":"Markus Hähnel, Frehiwot Melak Arega, W. Dargie, R. Khasanov, J. Castrillón","doi":"10.1109/INFCOMW.2017.8116415","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116415","url":null,"abstract":"The ever increasing demand for Internet traffic, storage and processing requires an ever increasing amount of hardware resources. In addition to this, infrastructure providers over-provision system architectures to serve users at peak times without performance delays. Over-provisioning leads to underutilization and thus to unnecessary power consumption. Therefore, there is a need for workload management strategies to map and schedule different services simultaneously in an energy-efficient manner without compromising performance, specially for heterogeneous micro-server architectures. This requires statistical models of how services interfere with each other, thereby affecting both performance and energy consumption. Indeed, the performance-energy behavior when mixing workloads is not well understood. This paper presents an interference analysis for heterogeneous workloads (i.e., CPU- and memory-intensive) on a big.LITTLE MPSoC architecture. We employ state-of-the-art tools to generate multiple single-application mappings and characterize the interference among two different services. We observed a performance degradation factor between 1.1 and 2.5. For some configurations, executing on different clusters resulted in reduced energy consumption with no performance penalty. This kind of detailed analysis give us first insights towards more general models for future workload management systems.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132541834","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}

引用次数: 1

Extracting mobile user behavioral similarity via cell-level location trace 通过小区级定位跟踪提取移动用户行为相似性

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116406

Jin Cao, Sining Chen, W. Kennedy, Nicolas Kim, Lisa Zhang

{"title":"Extracting mobile user behavioral similarity via cell-level location trace","authors":"Jin Cao, Sining Chen, W. Kennedy, Nicolas Kim, Lisa Zhang","doi":"10.1109/INFCOMW.2017.8116406","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116406","url":null,"abstract":"We study mobile user behavior from cell-level location trace (CLLT). Since CLLT contains no GPS coordinates of mobile users, we infer approximate user locations from the cell locations they visit. We build upon the vast literature on user behavior analysis and demonstrate the ability to extract user behavior in the absence of the more precise GPS information. We focus on the “leisure time” behavior, i.e. activities outside home and office. In particular, we compare pairs of users and study their similarity or the lack of it. Such similarity comparison can be done directly using the users' actual cell-level locations and the times of their visits. We observe that a user's behavior on different days tends to be more similar to oneself than to others. We then compare users in terms of their activities irrespective of physical locations. We develop the notion of semantic cell type which classifies the cells according to the consistency of points of interest within the cells. In this way, we can compare two users based on the type of cells they visit and extract similarity from there. As a result, we gain understanding of the general profiles of the cells and the users. We are able to differentiate user behavior and cluster them in a meaningful way.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132097703","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}

引用次数: 4

Robust authentication and data storage with perfect secrecy 强大的身份验证和数据存储，具有完美的保密性

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116437

Sebastian Baur, H. Boche

引用次数: 3

Characterizing and classifying IoT traffic in smart cities and campuses 对智慧城市和校园中的物联网流量进行表征和分类

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116438

Arunan Sivanathan, Daniel Sherratt, H. Gharakheili, Adam Radford, C. Wijenayake, A. Vishwanath, V. Sivaraman

{"title":"Characterizing and classifying IoT traffic in smart cities and campuses","authors":"Arunan Sivanathan, Daniel Sherratt, H. Gharakheili, Adam Radford, C. Wijenayake, A. Vishwanath, V. Sivaraman","doi":"10.1109/INFCOMW.2017.8116438","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116438","url":null,"abstract":"Campuses and cities of the near future will be equipped with vast numbers of IoT devices. Operators of such environments may not even be fully aware of their IoT assets, let alone whether each IoT device is functioning properly safe from cyber-attacks. This paper proposes the use of network traffic analytics to characterize IoT devices, including their typical behaviour mode. We first collect and synthesize traffic traces from a smart-campus environment instrumented with a diversity of IoT devices including cameras, lights, appliances, and health-monitors; our traces, collected over a period of 3 weeks, are released as open data to the public. We then analyze the traffic traces to characterize statistical attributes such as data rates and burstiness, activity cycles, and signalling patterns, for over 20 IoT devices deployed in our environment. Finally, using these attributes, we develop a classification method that can not only distinguish IoT from non-IoT traffic, but also identify specific IoT devices with over 95% accuracy. Our study empowers operators of smart cities and campuses to discover and monitor their IoT assets based on their network behaviour.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114388446","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}

引用次数: 297

Timely information dissemination with distributed storage in delay tolerant mobile sensor networks 容延迟移动传感器网络中分布式存储的信息及时传播

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116360

Aashish Dhungana, E. Bulut

引用次数: 2