发布求助
文献互助 智能选刊 最新文献

Comput. Commun. Rev.最新文献

筛选
英文 中文
Making content caching policies 'smart' using the deepcache framework 使用deepcache框架使内容缓存策略“智能”
Comput. Commun. Rev. Pub Date : 2019-01-28 DOI: 10.1145/3310165.3310174
A. Narayanan, Saurabh Verma, Eman Ramadan, Pariya Babaie, Zhi-Li Zhang
{"title":"Making content caching policies 'smart' using the deepcache framework","authors":"A. Narayanan, Saurabh Verma, Eman Ramadan, Pariya Babaie, Zhi-Li Zhang","doi":"10.1145/3310165.3310174","DOIUrl":"https://doi.org/10.1145/3310165.3310174","url":null,"abstract":"In this paper, we present Deepcache a novel Framework for content caching, which can significantly boost cache performance. Our Framework is based on powerful deep recurrent neural network models. It comprises of two main components: i) Object Characteristics Predictor, which builds upon deep LSTM Encoder-Decoder model to predict the future characteristics of an object (such as object popularity) - to the best of our knowledge, we are the first to propose LSTM Encoder-Decoder model for content caching; ii) a caching policy component, which accounts for predicted information of objects to make smart caching decisions. In our thorough experiments, we show that applying Deepcache Framework to existing cache policies, such as LRU and k-LRU, significantly boosts the number of cache hits.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"86 21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126289794","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}
引用次数: 19
Bootstrapping privacy services in today's internet 在今天的互联网上引导隐私服务
Comput. Commun. Rev. Pub Date : 2019-01-28 DOI: 10.1145/3310165.3310169
Taeho Lee, C. Pappas, A. Perrig
{"title":"Bootstrapping privacy services in today's internet","authors":"Taeho Lee, C. Pappas, A. Perrig","doi":"10.1145/3310165.3310169","DOIUrl":"https://doi.org/10.1145/3310165.3310169","url":null,"abstract":"Internet users today have few solutions to cover a large space of diverse privacy requirements. We introduce the concept of privacy domains, which provide flexibility in expressing users' privacy requirements. Then, we propose three privacy services that construct meaningful privacy domains and can be offered by ISPs. Furthermore, we illustrate that these services introduce little overhead for communication sessions and that they come with a low deployment barrier for ISPs.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130460516","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}
引用次数: 2
Learning IP network representations 学习IP网络表示
Comput. Commun. Rev. Pub Date : 2019-01-28 DOI: 10.1145/3310165.3310172
Mingda Li, Bo Zong, C. Lumezanu, Haifeng Chen
{"title":"Learning IP network representations","authors":"Mingda Li, Bo Zong, C. Lumezanu, Haifeng Chen","doi":"10.1145/3310165.3310172","DOIUrl":"https://doi.org/10.1145/3310165.3310172","url":null,"abstract":"We present DIP, a deep learning based framework to learn structural properties of the Internet, such as node clustering or distance between nodes. Existing embedding-based approaches use linear algorithms on a single source of data, such as latency or hop count information, to approximate the position of a node in the Internet. In contrast, DIP computes low-dimensional representations of nodes that preserve structural properties and non-linear relationships across multiple, heterogeneous sources of structural information, such as IP, routing, and distance information. Using a large real-world data set, we show that DIP learns representations that preserve the real-world clustering of the associated nodes and predicts distance between them more than 30% better than a meanbased approach. Furthermore, DIP accurately imputes hop count distance to unknown hosts (i.e., not used in training) given only their IP addresses and routable prefixes. Our framework is extensible to new data sources and applicable to a wide range of problems in network monitoring and security.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131820217","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
A formally verified NAT stack 经过正式验证的NAT栈
Comput. Commun. Rev. Pub Date : 2019-01-28 DOI: 10.1145/3310165.3310176
Solal Pirelli, Arseniy Zaostrovnykh, George Candea
{"title":"A formally verified NAT stack","authors":"Solal Pirelli, Arseniy Zaostrovnykh, George Candea","doi":"10.1145/3310165.3310176","DOIUrl":"https://doi.org/10.1145/3310165.3310176","url":null,"abstract":"Prior work proved a stateful NAT network function to be, crash-free, memory safe and semantically correct [29]. Their toolchain verifies the network function code while assuming the underlying kernel-bypass framework, drivers, operating system, and hardware to be correct. We extend the toolchain to verify the kernel-bypass framework and a NIC driver in the context of the NAT. We uncover bugs in both the framework and the driver. Our code is publicly available [28].","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131669366","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
Refining network intents for self-driving networks 改进自驾车网络的网络意图
Comput. Commun. Rev. Pub Date : 2019-01-28 DOI: 10.1145/3310165.3310173
A. Jacobs, R. Pfitscher, R. Ferreira, L. Granville
{"title":"Refining network intents for self-driving networks","authors":"A. Jacobs, R. Pfitscher, R. Ferreira, L. Granville","doi":"10.1145/3310165.3310173","DOIUrl":"https://doi.org/10.1145/3310165.3310173","url":null,"abstract":"Recent advances in artificial intelligence (AI) offer an opportunity for the adoption of self-driving networks. However, network operators or home-network users still do not have the right tools to exploit these new advancements in AI, since they have to rely on low-level languages to specify network policies. Intent-based networking (IBN) allows operators to specify high-level policies that dictate how the network should behave without worrying how they are translated into configuration commands in the network devices. However, the existing research proposals for IBN fail to exploit the knowledge and feedback from the network operator to validate or improve the translation of intents. In this paper, we introduce a novel intent-refinement process that uses machine learning and feedback from the operator to translate the operator's utterances into network configurations. Our refinement process uses a sequence-to-sequence learning model to extract intents from natural language and the feedback from the operator to improve learning. The key insight of our process is an intermediate representation that resembles natural language that is suitable to collect feedback from the operator but is structured enough to facilitate precise translations. Our prototype interacts with a network operator using natural language and translates the operator input to the intermediate representation before translating to SDN rules. Our experimental results show that our process achieves a correlation coefficient squared (i.e., R-squared) of 0.99 for a dataset with 5000 entries and the operator feedback significantly improves the accuracy of our model.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121739891","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}
引用次数: 72
The october 2018 issue 2018年10月号
Comput. Commun. Rev. Pub Date : 2019-01-28 DOI: 10.1145/3310165.3310166
O. Bonaventure
{"title":"The october 2018 issue","authors":"O. Bonaventure","doi":"10.1145/3310165.3310166","DOIUrl":"https://doi.org/10.1145/3310165.3310166","url":null,"abstract":"SIGCOMM'18 was held in Hungary and the participants were pleased with both the technical program and the social interactions with all the members of the community. During her keynote on Networks Capable of Change, Jennifer Rexford mentioned two papers published in CCR that have had an important impact on our community : OpenFlow: enabling innovation in campus networks and P4: programming protocol-independent packet processors. These two editorial notes paved the way for Software-Defined Networks and then programmable switches. They are a good illustration of the benefits of having a venue like CCR that is open to other types of papers than the scientific papers that usually appear in our conferences and workshops.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132649379","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}
引用次数: 0
The Dagstuhl beginners guide to reproducibility for experimental networking research Dagstuhl初学者指南再现性的实验网络研究
Comput. Commun. Rev. Pub Date : 2019-01-12 DOI: 10.1145/3314212.3314217
Vaibhav Bajpai, A. Brunström, A. Feldmann, W. Kellerer, A. Pras, H. Schulzrinne, Georgios Smaragdakis, Matthias Wählisch, Klaus Wehrle
{"title":"The Dagstuhl beginners guide to reproducibility for experimental networking research","authors":"Vaibhav Bajpai, A. Brunström, A. Feldmann, W. Kellerer, A. Pras, H. Schulzrinne, Georgios Smaragdakis, Matthias Wählisch, Klaus Wehrle","doi":"10.1145/3314212.3314217","DOIUrl":"https://doi.org/10.1145/3314212.3314217","url":null,"abstract":"Reproducibility is one of the key characteristics of good science, but hard to achieve for experimental disciplines like Internet measurements and networked systems. This guide provides advice to researchers, particularly those new to the field, on designing experiments so that their work is more likely to be reproducible and to serve as a foundation for follow-on work by others.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"8 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594059","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}
引用次数: 44
Accelerating network measurement in software 加速软件网络测量
Comput. Commun. Rev. Pub Date : 2018-09-07 DOI: 10.1145/3276799.3276800
Yang Zhou, Omid Alipourfard, Minlan Yu, Tong Yang
{"title":"Accelerating network measurement in software","authors":"Yang Zhou, Omid Alipourfard, Minlan Yu, Tong Yang","doi":"10.1145/3276799.3276800","DOIUrl":"https://doi.org/10.1145/3276799.3276800","url":null,"abstract":"Network measurement plays an important role for many network functions such as detecting network anomalies and identifying big flows. However, most existing measurement solutions fail to achieve high performance in software as they often incorporate heavy computations and a large number of random memory accesses. We present Agg-Evict, a generic framework for accelerating network measurement in software. Agg-Evict aggregates the incoming packets on the same flows and sends them as a batch, reducing the number of computations and random memory accesses in the subsequent measurement solutions. We perform extensive experiments on top of DPDK with 10G NIC and observe that almost all the tested measurement solutions under Agg-Evict can achieve 14.88 Mpps throughput and see up to 5.7X lower average processing latency per packet.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131762216","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}
引用次数: 13
Looking for hypergiants in peeringDB 在peeringDB中寻找超级巨人
Comput. Commun. Rev. Pub Date : 2018-09-07 DOI: 10.1145/3276799.3276801
T. Böttger, F. Cuadrado, S. Uhlig
{"title":"Looking for hypergiants in peeringDB","authors":"T. Böttger, F. Cuadrado, S. Uhlig","doi":"10.1145/3276799.3276801","DOIUrl":"https://doi.org/10.1145/3276799.3276801","url":null,"abstract":"Hypergiants, such as Google or Netflix, are important organisations in the Internet ecosystem, due to their sheer impact in terms of traffic volume exchanged. However, beyond naming specific instances, the research community still lacks a sufficiently crisp understanding of them. In this paper we analyse PeeringDB data and identify features that differentiate hypergiants from the other organisations. To this end, we first characterise the organisations present in PeeringDB, allowing us to identify discriminating properties of these organisations. We then use these properties to separate the data in two clusters, differentiating hypergiants from other organisations. We conclude this paper by investigating how hypergiants and other organisations exploit the IXP ecosystem to reach the global IPv4 space.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116391798","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
NDN host model NDN主机模型
Comput. Commun. Rev. Pub Date : 2018-09-07 DOI: 10.1145/3276799.3276804
Haitao Zhang, Yanbiao Li, Zhiyi Zhang, A. Afanasyev, Lixia Zhang
{"title":"NDN host model","authors":"Haitao Zhang, Yanbiao Li, Zhiyi Zhang, A. Afanasyev, Lixia Zhang","doi":"10.1145/3276799.3276804","DOIUrl":"https://doi.org/10.1145/3276799.3276804","url":null,"abstract":"As a proposed Internet architecture, Named Data Networking (NDN) changes the network communication model from delivering packets to destinations identified by IP addresses to fetching data packets by names. This architectural change leads to changes of host functions and initial configurations. In this paper we present an overview of the basic functions of a host in an NDN network, together with necessary operations to configure an NDN host. We also compare and contrast the functionality and configuration between an NDN host and an IP host, to show the differences resulted from the different architecture designs.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124651290","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}
引用次数: 14
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信