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

zUpdate: updating data center networks with zero loss zUpdate:零损耗更新数据中心网络

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

H. Liu, Xin Wu, Ming Zhang, Lihua Yuan, Roger Wattenhofer, D. Maltz

引用次数: 255

M2cloud: software defined multi-site data center network control framework for multi-tenant M2cloud:软件定义的多租户多站点数据中心网络控制框架

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

Zhongjin Liu, Yong Li, L. Su, Depeng Jin, Lieguang Zeng

引用次数: 17

SplitX: high-performance private analytics SplitX:高性能私人分析

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

Ruichuan Chen, I. E. Akkus, P. Francis

引用次数: 58

ElasticSwitch: practical work-conserving bandwidth guarantees for cloud computing ElasticSwitch:为云计算提供实用的节省工作量的带宽保证

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

L. Popa, P. Yalagandula, S. Banerjee, J. Mogul, Yoshio Turner, J. R. Santos

{"title":"ElasticSwitch: practical work-conserving bandwidth guarantees for cloud computing","authors":"L. Popa, P. Yalagandula, S. Banerjee, J. Mogul, Yoshio Turner, J. R. Santos","doi":"10.1145/2486001.2486027","DOIUrl":"https://doi.org/10.1145/2486001.2486027","url":null,"abstract":"While cloud computing providers offer guaranteed allocations for resources such as CPU and memory, they do not offer any guarantees for network resources. The lack of network guarantees prevents tenants from predicting lower bounds on the performance of their applications. The research community has recognized this limitation but, unfortunately, prior solutions have significant limitations: either they are inefficient, because they are not work-conserving, or they are impractical, because they require expensive switch support or congestion-free network cores. In this paper, we propose ElasticSwitch, an efficient and practical approach for providing bandwidth guarantees. ElasticSwitch is efficient because it utilizes the spare bandwidth from unreserved capacity or underutilized reservations. ElasticSwitch is practical because it can be fully implemented in hypervisors, without requiring a specific topology or any support from switches. Because hypervisors operate mostly independently, there is no need for complex coordination between them or with a central controller. Our experiments, with a prototype implementation on a 100-server testbed, demonstrate that ElasticSwitch provides bandwidth guarantees and is work-conserving, even in challenging situations.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"166 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":"131212551","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}

引用次数: 205

The effectiveness of time dependent pricing in controlling usage incentives in wireless data network 时间依赖定价在无线数据网络中控制使用激励的有效性

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

L. Zhang, Weijie Wu, Dan Wang

{"title":"The effectiveness of time dependent pricing in controlling usage incentives in wireless data network","authors":"L. Zhang, Weijie Wu, Dan Wang","doi":"10.1145/2486001.2491731","DOIUrl":"https://doi.org/10.1145/2486001.2491731","url":null,"abstract":"With advances of bandwidth-intensive mobile devices (e.g., smart phones, tablet computers), the data traffic for wireless data network has grown tremendously, and is predicted to further increase by more than 10 times in the next five years. The tremendous increase in transmission demand may cause serious congestions. This challenges network operators to find new ways to improve, or at least maintain their service quality. There are many solutions to address this problem from a technical viewpoint [1, 2]. In this paper instead, we try to solve this problem using a pricing approach. The rationales are: 1) traffic demand is highly volatile over time, so it is neither physically easy nor economically profitable to purely rely on technology to meet the extreme demand at peak time; and 2) a large amount of traffic do not have realtime requirement, or are unnecessary at all, and pricing has been proven as an effective way to shape users’ behaviors [3]. Current pricing models are not well suited for wireless applications: flat rate pricing is dominant in broadband network where bandwidth is usually sufficient, but usually causes congestions in wireless environment. For example, WeChat, a very popular mobile social application in China, uses data network to send text, voice and photos. Under the flat rate pricing model today, people often relentlessly upload photos and “short talk” of trivial errands. As a result, ISPs incur","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"35 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":"124027090","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}

引用次数: 7

Dude, where's my card?: RFID positioning that works with multipath and non-line of sight 伙计，我的名片呢?: RFID定位与多路径和非视线工作

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

Jue Wang, D. Katabi

{"title":"Dude, where's my card?: RFID positioning that works with multipath and non-line of sight","authors":"Jue Wang, D. Katabi","doi":"10.1145/2486001.2486029","DOIUrl":"https://doi.org/10.1145/2486001.2486029","url":null,"abstract":"RFIDs are emerging as a vital component of the Internet of Things. In 2012, billions of RFIDs have been deployed to locate equipment, track drugs, tag retail goods, etc. Current RFID systems, however, can only identify whether a tagged object is within radio range (which could be up to tens of meters), but cannot pinpoint its exact location. Past proposals for addressing this limitation rely on a line-of-sight model and hence perform poorly when faced with multipath effects or non-line-of-sight, which are typical in real-world deployments. This paper introduces the first fine-grained RFID positioning system that is robust to multipath and non-line-of-sight scenarios. Unlike past work, which considers multipath as detrimental, our design exploits multipath to accurately locate RFIDs. The intuition underlying our design is that nearby RFIDs experience a similar multipath environment (e.g., reflectors in the environment) and thus exhibit similar multipath profiles. We capture and extract these multipath profiles by using a synthetic aperture radar (SAR) created via antenna motion. We then adapt dynamic time warping (DTW) techniques to pinpoint a tag's location. We built a prototype of our design using USRP software radios. Results from a deployment of 200 commercial RFIDs in our university library demonstrate that the new design can locate misplaced books with a median accuracy of 11~cm.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"134 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":"121356985","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}

引用次数: 535

To 4,000 compute nodes and beyond: network-aware vertex placement in large-scale graph processing systems 到4000计算节点及以上:大规模图形处理系统中的网络感知顶点放置

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

Karim Awara, H. Jamjoom, Panos Kalnis

{"title":"To 4,000 compute nodes and beyond: network-aware vertex placement in large-scale graph processing systems","authors":"Karim Awara, H. Jamjoom, Panos Kalnis","doi":"10.1145/2486001.2491726","DOIUrl":"https://doi.org/10.1145/2486001.2491726","url":null,"abstract":"The explosive growth of \"big data\" is giving rise to a new breed of large scale graph systems, such as Pregel. This poster describes our ongoing work in characterizing and minimizing the communication cost of Bulk Synchronous Parallel (BSP) graph mining systems, like Pregel, when scaling to 4,096 compute nodes. Existing implementations generally assume a fixed communication cost. This is sufficient in small deployments as the BSP programming model (i.e., overlapping computation and communication) masks small variations in the underlying network. In large scale deployments, such variations can dominate the overall runtime characteristics. In this poster, we first quantify the impact of network communication on the total compute time of a Pregel system. We then propose an efficient vertex placement strategy that subsamples highly connected vertices and applies the Reverse Cuthill-McKee (RCM) algorithm to efficiently partition the input graph and place partitions closer to each other based on their expected communication patterns. We finally describe a vertex replication strategy to further reduce communication overhead.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"40 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":"129543158","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

Incremental SDN deployment in enterprise networks 企业网SDN增量部署

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

Dan Levin, Marco Canini, Stefan Schmid, Anja Feldmann

引用次数: 8

Automatic configuration of routing control platforms in OpenFlow networks OpenFlow网络中路由控制平台的自动配置

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

Sachin Sharma, D. Staessens, D. Colle, M. Pickavet, P. Demeester

引用次数: 11

Compressing IP forwarding tables: towards entropy bounds and beyond 压缩IP转发表:朝着熵的界限和超越

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

G'abor R'etv'ari, János Tapolcai, Attila KHorosi, Andr'as Majd'an, Zalán Heszberger

{"title":"Compressing IP forwarding tables: towards entropy bounds and beyond","authors":"G'abor R'etv'ari, János Tapolcai, Attila KHorosi, Andr'as Majd'an, Zalán Heszberger","doi":"10.1145/2486001.2486009","DOIUrl":"https://doi.org/10.1145/2486001.2486009","url":null,"abstract":"Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the efficiency of standard operations, like random access, search, or update. The main goal of this paper is to demonstrate how data compression can benefit the networking community, by showing how to squeeze the IP Forwarding Information Base (FIB), the giant table consulted by IP routers to make forwarding decisions, into information-theoretical entropy bounds, with essentially zero cost on longest prefix match and FIB update. First, we adopt the state-of-the-art in compressed data structures, yielding a static entropy-compressed FIB representation with asymptotically optimal lookup. Then, we re-design the venerable prefix tree, used commonly for IP lookup for at least 20 years in IP routers, to also admit entropy bounds and support lookup in optimal time and update in nearly optimal time. Evaluations on a Linux kernel prototype indicate that our compressors encode a FIB comprising more than 440K prefixes to just about 100--400 KBytes of memory, with a threefold increase in lookup throughput and no penalty on FIB updates.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"46 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":"127726205","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}

引用次数: 36