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

Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos最新文献

筛选
英文 中文
A practical method for measuring Web above-the-fold time 一种实用的方法，用于测量Web上折叠时间
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pub Date : 2018-08-07 DOI: 10.1145/3234200.3234221
D. D. Hora, Dario Rossi, V. Christophides, R. Teixeira
{"title":"A practical method for measuring Web above-the-fold time","authors":"D. D. Hora, Dario Rossi, V. Christophides, R. Teixeira","doi":"10.1145/3234200.3234221","DOIUrl":"https://doi.org/10.1145/3234200.3234221","url":null,"abstract":"Page load time (PLT) is still the most common application Quality of Service (QoS) metric to estimate the Quality of Experience (QoE) of Web users. Yet, recent literature abounds with interesting proposals for alternative metrics (e.g., Above The Fold, SpeedIndex and variants) that aim at closely capturing how users perceive the Webpage rendering process. However, these novel metrics are typically computationally expensive, as they require to monitor and post-process videos of the rendering process, and have failed to be widely deployed. In this demo, we show our implementation of an opensource Chrome extension that implements a practical and lightweight method to measure the approximated Above-the-Fold (AATF) time, as well as others Web performance metrics. The idea is, instead of accurately monitoring the rendering output, to track the download time of the last visible object on screen (i.e., \"above the fold\"). Our plugin also has options to save detailed reports for later analysis, a functionality ideally suited for researchers wanting to gather data from Web experiments.","PeriodicalId":124017,"journal":{"name":"Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121046790","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}
引用次数: 5
Testing IDS using GENESIDS: Realistic Mixed Traffic Generation for IDS Evaluation 使用GENESIDS测试IDS:用于IDS评估的真实混合流量生成
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pub Date : 2018-08-07 DOI: 10.1145/3234200.3234204
Felix Erlacher, F. Dressler
{"title":"Testing IDS using GENESIDS: Realistic Mixed Traffic Generation for IDS Evaluation","authors":"Felix Erlacher, F. Dressler","doi":"10.1145/3234200.3234204","DOIUrl":"https://doi.org/10.1145/3234200.3234204","url":null,"abstract":"Evaluating signature-based Network Intrusion Detection Systems (NIDS) is a necessary but in general difficult task. Often, live or recorded real-world traffic is used. However, real-world network traffic is often hard to come by at larger scale and the few available traces usually do not contain application layer payload. Furthermore, these traces only contain a small amount of malicious traffic, which does not suffice to thoroughly test a NIDS. We solve this problem by proposing a complete stateful traffic generation system that mixes realistic traffic with user definable malicious HTTP traffic with the purpose of evaluating a NIDS. By relying on the Snort syntax for traffic definition, we guarantee a large dataset of realistic up-to-date attack patterns.","PeriodicalId":124017,"journal":{"name":"Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129784149","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}
引用次数: 6
Filtering Spoofed IP Traffic Using Switching ASICs 使用交换asic过滤欺骗IP流量
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pub Date : 2018-08-07 DOI: 10.1145/3234200.3234205
Jia-Ju Bai, J. Bi, Menghao Zhang, Guanyu Li
{"title":"Filtering Spoofed IP Traffic Using Switching ASICs","authors":"Jia-Ju Bai, J. Bi, Menghao Zhang, Guanyu Li","doi":"10.1145/3234200.3234205","DOIUrl":"https://doi.org/10.1145/3234200.3234205","url":null,"abstract":"","PeriodicalId":124017,"journal":{"name":"Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123929270","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}
引用次数: 11
High-Fidelity Interdomain Routing Experiments 高保真域间路由实验
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pub Date : 2018-08-07 DOI: 10.1145/3234200.3241324
Brivaldo Junior, R. Ferreira, Ítalo F. S. Cunha, Brandon Schlinker, Ethan Katz-Bassett
{"title":"High-Fidelity Interdomain Routing Experiments","authors":"Brivaldo Junior, R. Ferreira, Ítalo F. S. Cunha, Brandon Schlinker, Ethan Katz-Bassett","doi":"10.1145/3234200.3241324","DOIUrl":"https://doi.org/10.1145/3234200.3241324","url":null,"abstract":"The PEERING research platform lets researchers exchange actual BGP routes and traffic with hundreds of networks. To date, several researchers have used PEERING to perform interdomain routing experiments. However, PEERING's original design sends experiment data-plane traffic through a VPN, introducing latency and jitter, hindering the applicability of the platform to performance-sensitive experiments. In this work, we propose extensions to PEERING to allow researchers to run applications inside containers on PEERING routers, mitigating performance degradation on data-plane traffic and empowering new classes of experiments. Our goals include strong isolation between experiments and flexible routing to steer traffic in and out of containers.","PeriodicalId":124017,"journal":{"name":"Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123604773","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
Dynam-IX: a Dynamic Interconnection eXchange Dynamic - ix:动态互连交换
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pub Date : 2018-08-07 DOI: 10.1145/3234200.3234218
P. Marcos, Marco Chiesa, L. F. Müller, P. Kathiravelu, C. Dietzel, M. Canini, M. Barcellos
{"title":"Dynam-IX: a Dynamic Interconnection eXchange","authors":"P. Marcos, Marco Chiesa, L. F. Müller, P. Kathiravelu, C. Dietzel, M. Canini, M. Barcellos","doi":"10.1145/3234200.3234218","DOIUrl":"https://doi.org/10.1145/3234200.3234218","url":null,"abstract":"Autonomous Systems (ASes) can reach hundreds of networks via Internet eXchange Points (IXPs), allowing improvements in traffic delivery performance and competitiveness. Despite the benefits, any pair of ASes needs first to agree on exchanging traffic. By surveying 100+ network operators, we discovered that most interconnection agreements are established through ad-hoc and lengthy processes heavily influenced by personal relationships and brand image. As such, ASes prefer long-term agreements at the expense of a potential mismatch between actual delivery performance and current traffic dynamics. ASes also miss interconnection opportunities due to trust reasons. To improve wide-area traffic delivery performance, we propose Dynam-IX, a framework that allows operators to build trust cooperatively and implement traffic engineering policies to exploit the rich interconnection opportunities at IXPs quickly. Dynam-IX offers a protocol to automate the interconnection process, an intent abstraction to express interconnection policies, a legal framework to digitally handle contracts, and a distributed tamper-proof ledger to create trust among ASes. We build and evaluate a Dynam-IX prototype and show that an AS can establish tens of agreements per minute with negligible overhead for ASes and IXPs.","PeriodicalId":124017,"journal":{"name":"Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122278884","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}
引用次数: 11
Blockchain-based Decentralized Applications meet Multi-Administrative Domain Networking 基于区块链的去中心化应用满足多管理域网络
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pub Date : 2018-08-07 DOI: 10.1145/3234200.3234217
R. V. Rosa, Christian Esteve Rothenberg
{"title":"Blockchain-based Decentralized Applications meet Multi-Administrative Domain Networking","authors":"R. V. Rosa, Christian Esteve Rothenberg","doi":"10.1145/3234200.3234217","DOIUrl":"https://doi.org/10.1145/3234200.3234217","url":null,"abstract":"Envisioned 5G use cases arise challenges around the realization of inter-domain relationships beyond traditional Border Gateway Protocol (BGP) peering, e.g. end-to-end service deployments tailored to specific business needs (a.k.a. slices). Blockchain technologies bring consensus among decentralized non-trusting counterparts as a shared ledger, offering potential approaches for multi-administrative domain networking seeking agile, transparent end-to-end sliceable Service Level Agreements (SLAs). This demo showcases an experimental prototype based on best of breed open source components (e.g., Ethereum, OVS, Neo4j, Ryu/OpenFlowv1.3, ARIA/TOSCA) illustrating blockchain Decentralized Application (DApp) functionalities for life cycle management of multi-administrative domain network services.","PeriodicalId":124017,"journal":{"name":"Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124148271","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
Modeling IP-to-IP Communication using the Weighted Stochastic Block Model 基于加权随机块模型的ip - ip通信建模
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pub Date : 2018-08-07 DOI: 10.1145/3234200.3234245
Patrick Kalmbach, Lion Gleiter, Johannes Zerwas, Andreas Blenk, W. Kellerer, S. Schmid
{"title":"Modeling IP-to-IP Communication using the Weighted Stochastic Block Model","authors":"Patrick Kalmbach, Lion Gleiter, Johannes Zerwas, Andreas Blenk, W. Kellerer, S. Schmid","doi":"10.1145/3234200.3234245","DOIUrl":"https://doi.org/10.1145/3234200.3234245","url":null,"abstract":"The vision of self-driving networks integrates network measurements with network control. Processing data for each of the network control tasks separately might be prohibitive due to the large volume and waste of computational resources. In this work we make the case of using the Weighted Stochastic Block Model (WSBM), a probabilistic model, to learn a task independent representation. In particular, we consider a case study of real-world IP-to-IP communication. The learned representation provides higher level-features for traffic engineering, anomaly detection, or other tasks, and reduces their computational effort. We find that the WSBM is able to accurately model traffic and structure of communication in the considered trace.","PeriodicalId":124017,"journal":{"name":"Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos","volume":"53 27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123574839","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
The Case for a Rackless Data Center Network Architecture 无机架数据中心网络架构案例
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pub Date : 2018-08-07 DOI: 10.1145/3234200.3234233
Ding-Xue Wu, Ang Chen, T. Ng
{"title":"The Case for a Rackless Data Center Network Architecture","authors":"Ding-Xue Wu, Ang Chen, T. Ng","doi":"10.1145/3234200.3234233","DOIUrl":"https://doi.org/10.1145/3234200.3234233","url":null,"abstract":"","PeriodicalId":124017,"journal":{"name":"Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123729567","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
Muses 缪斯
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pub Date : 2018-08-07 DOI: 10.1145/3234200.3234202
Wei Wang, Yiyang Shao, Kai Zheng
{"title":"Muses","authors":"Wei Wang, Yiyang Shao, Kai Zheng","doi":"10.1145/3234200.3234202","DOIUrl":"https://doi.org/10.1145/3234200.3234202","url":null,"abstract":"Nowadays learning based congestion control (CC) algorithms ramp up quickly (e.g., Remy, Indigo, PCC) and are very promising to increase the average bar of CC performance. These methods leverage the ideas of machine learning technique and train the control model based on big network data. They enable more accurate and finegrained network state perception, and have more general and powerful representation ability which could deal with complex network states. Based on the performance ranking results on Pantheon platform [1] shown in Fig. 1(a), the learning based CC algorithms have shown their obvious performance improvement in some scenarios. However, except the common interest (e.g., valuable data and labels, suitable learning algorithms) that all machine learning based methods focus on, there are still three practical challenges in learning based CC","PeriodicalId":124017,"journal":{"name":"Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122133575","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
Revealing Hidden Hierarchical Heavy Hitters in network traffic 揭示网络流量中隐藏的分层重击者
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pub Date : 2018-08-07 DOI: 10.1145/3234200.3234226
Salvator Galea, A. Moore, G. Antichi, G. Bianchi, R. Bifulco
{"title":"Revealing Hidden Hierarchical Heavy Hitters in network traffic","authors":"Salvator Galea, A. Moore, G. Antichi, G. Bianchi, R. Bifulco","doi":"10.1145/3234200.3234226","DOIUrl":"https://doi.org/10.1145/3234200.3234226","url":null,"abstract":"The idea to enable advanced in-network monitoring functionality has been lately fostered by the advent of massive data-plane programmability. A specific example includes the detection of traffic aggregates with programmable switches, i.e., heavy hitters. So far, proposed solutions implement the mining process by partitioning the network stream in disjoint windows. This practice allows efficient implementations but comes at a well-known cost: the results are tightly coupled with the traffic and window's characteristics. This poster quantifies the limitations of disjoint time windows approaches by showing that they hardly cope with traffic dynamics. We report the results of our analysis and unveil that up to 34% of the total number of the hierarchical heavy hitters might not be detected with those approaches. This is a call for a new set of windowless-based algorithms to be implemented with the match-action paradigm.","PeriodicalId":124017,"journal":{"name":"Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128217150","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
下一页 尾页
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学术官方微信