Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM最新文献_第6页

Smart in-network deduplication for storage-aware SDN 面向存储感知SDN的智能网内重复数据删除

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491714

Yu Hua, Xue Liu, D. Feng

引用次数: 18

An empirical reexamination of global DNS behavior 全球DNS行为的经验重新检查

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2486018

Hongyu Gao, V. Yegneswaran, Yan Chen, Phillip A. Porras, Shalini Ghosh, Jian Jiang, Haixin Duan

{"title":"An empirical reexamination of global DNS behavior","authors":"Hongyu Gao, V. Yegneswaran, Yan Chen, Phillip A. Porras, Shalini Ghosh, Jian Jiang, Haixin Duan","doi":"10.1145/2486001.2486018","DOIUrl":"https://doi.org/10.1145/2486001.2486018","url":null,"abstract":"The performance and operational characteristics of the DNS protocol are of deep interest to the research and network operations community. In this paper, we present measurement results from a unique dataset containing more than 26 billion DNS query-response pairs collected from more than 600 globally distributed recursive DNS resolvers. We use this dataset to reaffirm findings in published work and notice some significant differences that could be attributed both to the evolving nature of DNS traffic and to our differing perspective. For example, we find that although characteristics of DNS traffic vary greatly across networks, the resolvers within an organization tend to exhibit similar behavior. We further find that more than 50% of DNS queries issued to root servers do not return successful answers, and that the primary cause of lookup failures at root servers is malformed queries with invalid TLDs. Furthermore, we propose a novel approach that detects malicious domain groups using temporal correlation in DNS queries. Our approach requires no comprehensive labeled training set, which can be difficult to build in practice. Instead, it uses a known malicious domain as anchor, and identifies the set of previously unknown malicious domains that are related to the anchor domain. Experimental results illustrate the viability of this approach, i.e. , we attain a true positive rate of more than 96%, and each malicious anchor domain results in a malware domain group with more than 53 previously unknown malicious domains on average.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116361856","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}

引用次数: 80

Towards fast regular expression matching in practice 实现正则表达式的快速匹配

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491705

Kai Wang, Jun Li

引用次数: 11

Maple: simplifying SDN programming using algorithmic policies Maple:使用算法策略简化SDN编程

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2486030

A. Voellmy, Junchang Wang, Y. Yang, B. Ford, P. Hudak

{"title":"Maple: simplifying SDN programming using algorithmic policies","authors":"A. Voellmy, Junchang Wang, Y. Yang, B. Ford, P. Hudak","doi":"10.1145/2486001.2486030","DOIUrl":"https://doi.org/10.1145/2486001.2486030","url":null,"abstract":"Software-Defined Networking offers the appeal of a simple, centralized programming model for managing complex networks. However, challenges in managing low-level details, such as setting up and maintaining correct and efficient forwarding tables on distributed switches, often compromise this conceptual simplicity. In this pa- per, we present Maple, a system that simplifies SDN programming by (1) allowing a programmer to use a standard programming language to design an arbitrary, centralized algorithm, which we call an algorithmic policy, to decide the behaviors of an entire network, and (2) providing an abstraction that the programmer-defined, centralized policy runs, conceptually, \"afresh\" on every packet entering a network, and hence is oblivious to the challenge of translating a high-level policy into sets of rules on distributed individual switches. To implement algorithmic policies efficiently, Maple includes not only a highly-efficient multicore scheduler that can scale efficiently to controllers with 40+ cores, but more importantly a novel tracing runtime optimizer that can automatically record reusable policy decisions, offload work to switches when possible, and keep switch flow tables up-to-date by dynamically tracing the dependency of policy decisions on packet contents as well as the environment (system state). Evaluations using real HP switches show that Maple optimizer reduces HTTP connection time by a factor of 100 at high load. During simulated benchmarking, Maple scheduler, when not running the optimizer, achieves a throughput of over 20 million new flow requests per second on a single machine, with 95-percentile latency under 10 ms.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116594267","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}

引用次数: 239

CSPAN: cost-effective geo-replicated storage spanning multiple cloud services CSPAN:跨多个云服务的经济高效的地理复制存储

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491707

Zhe Wu, Michael Butkiewicz, Dorian Perkins, Ethan Katz-Bassett, H. Madhyastha

引用次数: 13

D-tunes: self tuning datastores for geo-distributed interactive applications D-tunes:自调优地理分布交互式应用程序的数据存储

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491684

N. ShankaranarayananP., A. Sivakumar, Sanjay G. Rao, Mohit Tawarmalani

引用次数: 4

OMware: an open measurement ware for stable residential broadband measurement OMware:用于稳定住宅宽带测量的开放式测量软件

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491702

Lei Xue, Ricky K. P. Mok, R. Chang

引用次数: 1

R2D2: bufferless, switchless data center networks using commodity ethernet hardware R2D2:使用商用以太网硬件的无缓冲、无交换机数据中心网络

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491722

Matthew P. Grosvenor, Malte Schwarzkopf, A. Moore

引用次数: 2

Collaborative caching based on hash-routing for information-centric networking 基于以信息为中心的网络的哈希路由的协作缓存

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491727

Sen Wang, J. Bi, Jianping Wu

引用次数: 53

Qphone: a quantum security VoIP phone Qphone:量子安全VoIP电话

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491696

Bo Liu, Bao-kang Zhao, Ziling Wei, Chunqing Wu, Jinshu Su, Wanrong Yu, Fei Wang, S. Sun

引用次数: 13