Proceedings of the ACM SIGCOMM 2011 conference最新文献_第3页

Improving datacenter performance and robustness with multipath TCP 通过多路径TCP提高数据中心性能和健壮性

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018467

C. Raiciu, S. Barré, C. Pluntke, A. Greenhalgh, D. Wischik, M. Handley

{"title":"Improving datacenter performance and robustness with multipath TCP","authors":"C. Raiciu, S. Barré, C. Pluntke, A. Greenhalgh, D. Wischik, M. Handley","doi":"10.1145/2018436.2018467","DOIUrl":"https://doi.org/10.1145/2018436.2018467","url":null,"abstract":"The latest large-scale data centers offer higher aggregate bandwidth and robustness by creating multiple paths in the core of the net- work. To utilize this bandwidth requires different flows take different paths, which poses a challenge. In short, a single-path transport seems ill-suited to such networks. We propose using Multipath TCP as a replacement for TCP in such data centers, as it can effectively and seamlessly use available bandwidth, giving improved throughput and better fairness on many topologies. We investigate what causes these benefits, teasing apart the contribution of each of the mechanisms used by MPTCP. Using MPTCP lets us rethink data center networks, with a different mindset as to the relationship between transport protocols, rout- ing and topology. MPTCP enables topologies that single path TCP cannot utilize. As a proof-of-concept, we present a dual-homed variant of the FatTree topology. With MPTCP, this outperforms FatTree for a wide range of workloads, but costs the same. In existing data centers, MPTCP is readily deployable leveraging widely deployed technologies such as ECMP. We have run MPTCP on Amazon EC2 and found that it outperforms TCP by a factor of three when there is path diversity. But the biggest benefits will come when data centers are designed for multipath transports.","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":"114071757","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}

引用次数: 766

Pomelo: accurate and decentralized shortest-path distance estimation in social graphs 柚:社交图中准确和分散的最短路径距离估计

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018491

Zhuo Chen, Yang Chen, Cong Ding, Beixing Deng, Xing Li

引用次数: 4

The evolution of layered protocol stacks leads to an hourglass-shaped architecture 分层协议栈的演变导致了沙漏形的架构

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018460

Saamer Akhshabi, C. Dovrolis

引用次数: 92

Performance based traffic control with IDIPS 使用IDIPS进行基于性能的流量控制

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018508

D. Saucez, O. Bonaventure

引用次数: 2

Better never than late: meeting deadlines in datacenter networks 不做总比迟到好:在数据中心网络中按时完成任务

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018443

Christo Wilson, Hitesh Ballani, T. Karagiannis, A. Rowstron

{"title":"Better never than late: meeting deadlines in datacenter networks","authors":"Christo Wilson, Hitesh Ballani, T. Karagiannis, A. Rowstron","doi":"10.1145/2018436.2018443","DOIUrl":"https://doi.org/10.1145/2018436.2018443","url":null,"abstract":"The soft real-time nature of large scale web applications in today's datacenters, combined with their distributed workflow, leads to deadlines being associated with the datacenter application traffic. A network flow is useful, and contributes to application throughput and operator revenue if, and only if, it completes within its deadline. Today's transport pro- tocols (TCP included), given their Internet origins, are agnostic to such flow deadlines. Instead, they strive to share network resources fairly. We show that this can hurt application performance. Motivated by these observations, and other (previously known) deficiencies of TCP in the datacenter environment, this paper presents the design and implementation of D3, a deadline-aware control protocol that is customized for the datacenter environment. D3 uses explicit rate control to apportion bandwidth according to flow deadlines. Evaluation from a 19-node, two-tier datacenter testbed shows that D3, even without any deadline information, easily outper- forms TCP in terms of short flow latency and burst tolerance. Further, by utilizing deadline information, D3 effectively doubles the peak load that the datacenter network cansupport.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"14 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":"133973440","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}

引用次数: 650

What's the difference?: efficient set reconciliation without prior context 有什么区别?:有效的设置和解没有事先的背景

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018462

D. Eppstein, M. Goodrich, Frank C. Uyeda, G. Varghese

{"title":"What's the difference?: efficient set reconciliation without prior context","authors":"D. Eppstein, M. Goodrich, Frank C. Uyeda, G. Varghese","doi":"10.1145/2018436.2018462","DOIUrl":"https://doi.org/10.1145/2018436.2018462","url":null,"abstract":"We describe a synopsis structure, the Difference Digest, that allows two nodes to compute the elements belonging to the set difference in a single round with communication overhead proportional to the size of the difference times the logarithm of the keyspace. While set reconciliation can be done efficiently using logs, logs require overhead for every update and scale poorly when multiple users are to be reconciled. By contrast, our abstraction assumes no prior context and is useful in networking and distributed systems applications such as trading blocks in a peer-to-peer network, and synchronizing link-state databases after a partition. Our basic set-reconciliation method has a similarity with the peeling algorithm used in Tornado codes [6], which is not surprising, as there is an intimate connection between set difference and coding. Beyond set reconciliation, an essential component in our Difference Digest is a new estimator for the size of the set difference that outperforms min-wise sketches [3] for small set differences. Our experiments show that the Difference Digest is more efficient than prior approaches such as Approximate Reconciliation Trees [5] and Characteristic Polynomial Interpolation [17]. We use Difference Digests to implement a generic KeyDiff service in Linux that runs over TCP and returns the sets of keys that differ between machines.","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":"131826383","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}

引用次数: 149

A novel approach for making energy efficient PON 一种制造节能PON的新方法

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018503

S. Newaz, Ángel Cuevas, G. Lee, N. Crespi, J. Choi

引用次数: 1

Session details: Bulk data transfers 会话详细信息:批量数据传输

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/3256190

D. Clark

引用次数: 0

WiFire: a firewall for wireless networks WiFire:无线网络防火墙

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018518

M. Wilhelm, I. Martinovic, J. Schmitt, Vincent Lenders

引用次数: 34

Clearing the RF smog: making 802.11n robust to cross-technology interference 清除射频烟雾:使802.11n对跨技术干扰具有鲁棒性

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018456

Shyamnath Gollakota, Fadel M. Adib, D. Katabi, S. Seshan

{"title":"Clearing the RF smog: making 802.11n robust to cross-technology interference","authors":"Shyamnath Gollakota, Fadel M. Adib, D. Katabi, S. Seshan","doi":"10.1145/2018436.2018456","DOIUrl":"https://doi.org/10.1145/2018436.2018456","url":null,"abstract":"Recent studies show that high-power cross-technology interference is becoming a major problem in today's 802.11 networks. Devices like baby monitors and cordless phones can cause a wireless LAN to lose connectivity. The existing approach for dealing with such high-power interferers makes the 802.11 network switch to a different channel; yet the ISM band is becoming increasingly crowded with diverse technologies, and hence many 802.11 access points may not find an interference-free channel. This paper presents TIMO, a MIMO design that enables 802.11n to communicate in the presence of high-power cross-technology interference. Unlike existing MIMO designs, however, which require all concurrent transmissions to belong to the same technology, TIMO can exploit MIMO capabilities to decode in the presence of a signal from a different technology, hence enabling diverse technologies to share the same frequency band. We implement a prototype of TIMO in GNURadio-USRP2 and show that it enables 802.11n to communicate in the presence of interference from baby monitors, cordless phones, and microwave ovens, transforming scenarios with a complete loss of connectivity to operational networks.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"61 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":"126726799","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}

引用次数: 197