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

Proceedings of the ACM SIGCOMM 2011 conference最新文献

筛选
英文 中文
Session details: Network modeling 会话细节:网络建模
Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/3256193
Ratul Mahajan
{"title":"Session details: Network modeling","authors":"Ratul Mahajan","doi":"10.1145/3256193","DOIUrl":"https://doi.org/10.1145/3256193","url":null,"abstract":"","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115595282","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
Let the market drive deployment: a strategy for transitioning to BGP security 市场驱动部署:向BGP安全过渡的策略
Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018439
Phillipa Gill, Michael Schapira, S. Goldberg
{"title":"Let the market drive deployment: a strategy for transitioning to BGP security","authors":"Phillipa Gill, Michael Schapira, S. Goldberg","doi":"10.1145/2018436.2018439","DOIUrl":"https://doi.org/10.1145/2018436.2018439","url":null,"abstract":"With a cryptographic root-of-trust for Internet routing(RPKI [17]) on the horizon, we can finally start planning the deployment of one of the secure interdomain routing protocols proposed over a decade ago (Secure BGP [22], secure origin BGP [37]). However, if experience with IPv6 is any indicator, this will be no easy task. Security concerns alone seem unlikely to provide sufficient local incentive to drive the deployment process forward. Worse yet, the security benefits provided by the S*BGP protocols do not even kick in until a large number of ASes have deployed them. Instead, we appeal to ISPs' interest in increasing revenue-generating traffic. We propose a strategy that governments and industry groups can use to harness ISPs' local business objectives and drive global S*BGP deployment. We evaluate our deployment strategy using theoretical analysis and large-scale simulations on empirical data. Our results give evidence that the market dynamics created by our proposal can transition the majority of the Internet to S*BGP.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129937675","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}
引用次数: 130
"Roto-Rooting" your router: solution against new potential DoS attacks on modern routers “roto - root”您的路由器:针对现代路由器的新潜在DoS攻击的解决方案
Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018486
D. Chasaki
{"title":"\"Roto-Rooting\" your router: solution against new potential DoS attacks on modern routers","authors":"D. Chasaki","doi":"10.1145/2018436.2018486","DOIUrl":"https://doi.org/10.1145/2018436.2018486","url":null,"abstract":"Our work presents the first practical example of an entirely new class of network attacks - attacks that target the network infrastructure. Modern routers use general purpose programmable processors, and the software used for packet processing on these systems is potentially vulnerable to remote exploits. We describe a specific attack that can launch a devastating denial-of-service attack by sending just a single packet. We also show that there are effective defense techniques, based on processor monitoring, that can help in detecting and avoiding such attacks.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"11966 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129005831","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
Wide-area routing dynamics of malicious networks 恶意网络的广域路由动态
Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018505
Maria Konte, N. Feamster
{"title":"Wide-area routing dynamics of malicious networks","authors":"Maria Konte, N. Feamster","doi":"10.1145/2018436.2018505","DOIUrl":"https://doi.org/10.1145/2018436.2018505","url":null,"abstract":"This paper studies the routing dynamics of malicious networks. We characterize the routing behavior of malicious networks on both short and long timescales. We find that malicious networks more consistently advertise prefixes with short durations and long inter- arrival times; over longer timescales, we find that malicious ASes connect with more upstream providers than legitimate ASes, and they also change upstream providers more frequently.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123320254","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
Optimizing a virtualized data center 优化虚拟化数据中心
Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018530
David Erickson, Brandon Heller, Shuang Yang, Jonathan Chu, J. Ellithorpe, Scott Whyte, Stephen Stuart, N. McKeown, G. Parulkar, M. Rosenblum
{"title":"Optimizing a virtualized data center","authors":"David Erickson, Brandon Heller, Shuang Yang, Jonathan Chu, J. Ellithorpe, Scott Whyte, Stephen Stuart, N. McKeown, G. Parulkar, M. Rosenblum","doi":"10.1145/2018436.2018530","DOIUrl":"https://doi.org/10.1145/2018436.2018530","url":null,"abstract":"Many data centers extensively use virtual machines (VMs), which provide the flexibility to move workload among physical servers. VMs can be placed to maximize application performance, power efficiency, or even fault tolerance. However, VMs are typically repositioned without considering network topology, congestion, or traffic routes. In this demo, we show a system, Virtue, which enables the comparison of different algorithms for VM placement and network routing at the scale of an entire data center. Our goal is to understand how placement and routing affect overall application performance by varying the types and mix of workloads, network topologies, and compute resources; these parameters will be available for demo attendees to explore.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114231898","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
Taming power peaks in mapreduce clusters 驯服能力在mapreduce集群中达到峰值
Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018497
Nan Zhu, Lei Rao, Xue Liu, Jie Liu, Haibing Guan
{"title":"Taming power peaks in mapreduce clusters","authors":"Nan Zhu, Lei Rao, Xue Liu, Jie Liu, Haibing Guan","doi":"10.1145/2018436.2018497","DOIUrl":"https://doi.org/10.1145/2018436.2018497","url":null,"abstract":"Along with the surging service demands on the cloud, the energy cost of Internet Data Centers (IDCs) is dramatically increasing. Energy management for IDCs is becoming ever more important. A large portion of applications running on data centers are data-intensive applications. MapReduce (and Hadoop) has been one of the mostly deployed frameworks for data-intensive applications. Both academia and industry have been greatly concerned with the problem of how to reduce the energy consumption of IDCs. However the critical power peak problem for MapReduce clusters has been overlooked, which is a new challenge brought by the usage of MapReduce. We elaborate the power peak problem and investigate the cause of the problem in details. Then we design an adaptive approach to regulate power peaks.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126263081","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}
引用次数: 17
Visualizing anomalies in sensor networks 传感器网络异常可视化
Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018521
Qi Liao, Lei Shi, Yuan He, Rui Li, Zhongji Su, A. Striegel, Yunhao Liu
{"title":"Visualizing anomalies in sensor networks","authors":"Qi Liao, Lei Shi, Yuan He, Rui Li, Zhongji Su, A. Striegel, Yunhao Liu","doi":"10.1145/2018436.2018521","DOIUrl":"https://doi.org/10.1145/2018436.2018521","url":null,"abstract":"Diagnosing a large-scale sensor network is a crucial but challenging task due to the spatiotemporally dynamic network behaviors of sensor nodes. In this demo, we present Sensor Anomaly Visualization Engine (SAVE), an integrated system that tackles the sensor network diagnosis problem using both visualization and anomaly detection analytics to guide the user quickly and accurately diagnose sensor network failures. Temporal expansion model, correlation graphs and dynamic projection views are proposed to effectively interpret the topological, correlational and dimensional sensor data dynamics and their anomalies. Through a real-world large-scale wireless sensor network deployment (GreenOrbs), we demonstrate that SAVE is able to help better locate the problem and further identify the root cause of major sensor network failures.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121761613","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
LifeNet: a flexible ad hoc networking solution for transient environments LifeNet:为瞬态环境提供灵活的自组织网络解决方案
Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018513
H. Mehendale, A. Paranjpe, S. Vempala
{"title":"LifeNet: a flexible ad hoc networking solution for transient environments","authors":"H. Mehendale, A. Paranjpe, S. Vempala","doi":"10.1145/2018436.2018513","DOIUrl":"https://doi.org/10.1145/2018436.2018513","url":null,"abstract":"We demonstrate a new ad hoc routing method that can handle transience such as node-mobility, obstructions and node failures. It has controlled management overhead, and is platform-independent (our demo includes phones, routers, and laptops running different operating systems). It achieves reliability and flexibility at the expense of throughput. It is ideal for scenarios where the reliability of connectivity is critical and bandwidth requirements are low. For e.g., disaster relief operations and sensor networks. Along with applications, we exhibit measurements to illustrate the advantages of our approach in dealing with transience.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132354433","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}
引用次数: 31
Revisiting next-hop selection in multipath networks 重新审视多路径网络中的下一跳选择
Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018499
S. Linden, G. Detal, O. Bonaventure
{"title":"Revisiting next-hop selection in multipath networks","authors":"S. Linden, G. Detal, O. Bonaventure","doi":"10.1145/2018436.2018499","DOIUrl":"https://doi.org/10.1145/2018436.2018499","url":null,"abstract":"Multipath routing strategies such as Equal-Cost MultiPath (ECMP) are widely used in IP and data-center networks. Most current methods to balance packets over the multiple next hops toward the destination base their decision on a hash computed over selected fields of the packet headers. Because of the non-invertible nature of hash functions, it is hard to determine the values of those fields so as to make the packet follow a specific path in the network. However, several applications might benefit from being able to choose such a path. Therefore, we propose a novel next-hop selection method based on an invertible function. By encoding the selection of successive routers into common fields of packet headers, the proposed method enables end hosts to force their packets to follow a specific path.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130293315","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}
引用次数: 8
On the efficacy of fine-grained traffic splitting protocolsin data center networks 细粒度的功效交通分裂protocolsin数据中心网络
Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018504
A. Dixit, P. Prakash, R. Kompella
{"title":"On the efficacy of fine-grained traffic splitting protocolsin data center networks","authors":"A. Dixit, P. Prakash, R. Kompella","doi":"10.1145/2018436.2018504","DOIUrl":"https://doi.org/10.1145/2018436.2018504","url":null,"abstract":"Multi-rooted tree topologies are commonly used to construct high-bandwidth data center network fabrics. In these networks, switches typically rely on equal-cost multipath (ECMP) routing techniques to split traffic across multiple paths, such that packets within a flow traverse the same end-to-end path. Unfortunately, since ECMP splits traffic based on flow-granularity, it can cause load imbalance across paths resulting in poor utilization of network resources. More fine-grained traffic splitting techniques are typically not preferred because they can cause packet reordering that can, according to conventional wisdom, lead to severe TCP throughput degradation. In this work, we revisit this fact in the context of regular data center topologies such as fat-tree architectures. We argue that packet-level traffic splitting, where packets of a flow are sprayed through all available paths, would lead to a better load-balanced network, which in turn leads to significantly more balanced queues and much higher throughput compared to ECMP.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134209335","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}
引用次数: 17
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信