Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM最新文献

筛选
英文 中文
Full duplex radios 全双工无线电
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2486033
Dinesh Bharadia, Emily McMilin, S. Katti
{"title":"Full duplex radios","authors":"Dinesh Bharadia, Emily McMilin, S. Katti","doi":"10.1145/2486001.2486033","DOIUrl":"https://doi.org/10.1145/2486001.2486033","url":null,"abstract":"This paper presents the design and implementation of the first in-band full duplex WiFi radios that can simultaneously transmit and receive on the same channel using standard WiFi 802.11ac PHYs and achieves close to the theoretical doubling of throughput in all practical deployment scenarios. Our design uses a single antenna for simultaneous TX/RX (i.e., the same resources as a standard half duplex system). We also propose novel analog and digital cancellation techniques that cancel the self interference to the receiver noise floor, and therefore ensure that there is no degradation to the received signal. We prototype our design by building our own analog circuit boards and integrating them with a fully WiFi-PHY compatible software radio implementation. We show experimentally that our design works robustly in noisy indoor environments, and provides close to the expected theoretical doubling of throughput in practice.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"43 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":"116889493","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}
引用次数: 1989
Dispatch: secure, resilient mobile reporting 调度:安全,灵活的移动报告
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491697
Kanak Biscuitwala, W. Bult, Mathias Lécuyer, T. J. Purtell, Madeline K. B. Ross, A. Chaintreau, Chris Haseman, M. Lam, Susan E. McGregor
{"title":"Dispatch: secure, resilient mobile reporting","authors":"Kanak Biscuitwala, W. Bult, Mathias Lécuyer, T. J. Purtell, Madeline K. B. Ross, A. Chaintreau, Chris Haseman, M. Lam, Susan E. McGregor","doi":"10.1145/2486001.2491697","DOIUrl":"https://doi.org/10.1145/2486001.2491697","url":null,"abstract":"Kanak Biscuitwala kanak@cs.stanford.edu Willem Bult wbult@stanford.edu Mathias Lecuyer† ml3302@columbia.edu T.J. Purtell tpurtell@cs.stanford.edu Madeline K.B. Ross‡ mkr2132@columbia.edu Augustin Chaintreau† augustin@cs.columbia.edu Chris Haseman§ haseman@tumblr.com Monica S. Lam lam@cs.stanford.edu Susan E. McGregor‡ sem2196@columbia.edu Computer Science Department, Stanford University †Computer Science Department, Columbia University ‡Graduate School of Journalism, Columbia University §Tumblr, Inc.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"16 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":"125001976","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
Toward content-centric privacy in ICN: attribute-based encryption and routing ICN中以内容为中心的隐私:基于属性的加密和路由
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491717
Mihaela Ion, Jianqing Zhang, E. Schooler
{"title":"Toward content-centric privacy in ICN: attribute-based encryption and routing","authors":"Mihaela Ion, Jianqing Zhang, E. Schooler","doi":"10.1145/2486001.2491717","DOIUrl":"https://doi.org/10.1145/2486001.2491717","url":null,"abstract":"We design a content-centric privacy scheme for Information-Centric Networking (ICN). We enhance ICN's ability to support data confidentiality by introducing attribute-based encryption into ICN and making it specific to the data attributes. Our approach is unusual in that it preserves ICN's goal to decouple publishers and subscribers for greater data accessibility, scalable multiparty communication and efficient data distribution. Inspired by application-layer publish-subscribe, we enable fine-grained access control with more expressive policies. Moreover, we propose an attribute-based routing scheme that offers interest confidentiality. A prototype system is implemented based on CCNx, a popular open source version of ICN, to showcase privacy preservation in Smart Neighborhood and Smart City applications.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"55 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":"123165976","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}
引用次数: 104
Characterizing correlated latency anomalies in broadband access networks 宽带接入网中相关延迟异常的表征
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491734
Swati Roy, N. Feamster
{"title":"Characterizing correlated latency anomalies in broadband access networks","authors":"Swati Roy, N. Feamster","doi":"10.1145/2486001.2491734","DOIUrl":"https://doi.org/10.1145/2486001.2491734","url":null,"abstract":"The growing prevalence of broadband Internet access around the world has made understanding the performance and reliability of broadband access networks extremely important. To better understand the performance anomalies that arise in broadband access networks, we have deployed hundreds of routers in home broadband access networks around the world and are studying the performance of these networks. One of the performance pathologies that we have observed is correlated, sudden latency increases simultaneously and to multiple destinations. In this work, we provide an preliminary glimpse into these sudden latency increases and attempt to understand their causes. Although we do not isolate root cause in this study, observing the sets of destinations that experience correlated latency increases can provide important clues as to the locations in the network that may be inducing these pathologies. We present an algorithm to better identify the network locations that are likely responsible for these pathologies. We then analyze latency data from one month across our home router deployment to determine where in the network latency issues are arising, and how those pathologies differ across regions, ISPs, and countries. Our preliminary analysis suggests that most latency pathologies are to a single destination and a relatively small percentage of these pathologies are likely in the last mile, suggesting that peering within the network may be a more likely culprit for these pathologies than access link problems.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"4 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":"128283292","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
Locating using prior information: wireless indoor localization algorithm 利用先验信息定位:无线室内定位算法
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491688
Yuanfang Chen, N. Crespi, Lin Lv, Mingchu Li, A. M. Ortiz, Lei Shu
{"title":"Locating using prior information: wireless indoor localization algorithm","authors":"Yuanfang Chen, N. Crespi, Lin Lv, Mingchu Li, A. M. Ortiz, Lei Shu","doi":"10.1145/2486001.2491688","DOIUrl":"https://doi.org/10.1145/2486001.2491688","url":null,"abstract":"Most indoor localization algorithms are based on Received Signal Strength (RSS), in which RSS signatures of an interested area are annotated with their real recorded locations. However, according to our experiments, RSS signatures are not suitable as the unique annotations (like Fingerprints) of recorded locations. In this study, we investigate the characteristics of RSS (e.g., how the RSS values change as time goes on and between consecutive positions?). On this basis, we design LuPI (Locating using Prior Information) that exploits the characteristics of RSS: with user motion, LuPI uses novel sensors integrated in smartphones to construct the RSS variation space (like radio map) of a floor plan as prior information. The deployment of LuPI is easy and rapid since little human intervention is needed. In LuPI, the calibration of ``radio map'' is crowd-sourced, automatic and scheduled. Experimental results show that LuPI achieves comparable location accuracy to previous approaches, even without the statistical information of site survey.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"38 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":"122733392","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
A provider-side view of web search response time web搜索响应时间的提供者端视图
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2486035
Yingying Chen, Ratul Mahajan, B. Sridharan, Zhi-Li Zhang
{"title":"A provider-side view of web search response time","authors":"Yingying Chen, Ratul Mahajan, B. Sridharan, Zhi-Li Zhang","doi":"10.1145/2486001.2486035","DOIUrl":"https://doi.org/10.1145/2486001.2486035","url":null,"abstract":"Using a large Web search service as a case study, we highlight the challenges that modern Web services face in understanding and diagnosing the response time experienced by users. We show that search response time (SRT) varies widely over time and also exhibits counter-intuitive behavior. It is actually higher during off-peak hours, when the query load is lower, than during peak hours. To resolve this paradox and explain SRT variations in general, we develop an analysis framework that separates systemic variations due to periodic changes in service usage and anomalous variations due to unanticipated events such as failures and denial-of-service attacks. We find that systemic SRT variations are primarily caused by systemic changes in aggregate network characteristics, nature of user queries, and browser types. For instance, one reason for higher SRTs during off-peak hours is that during those hours a greater fraction of queries come from slower, mainly-residential networks. We also develop a technique that, by factoring out the impact of such variations, robustly detects and diagnoses performance anomalies in SRT. Deployment experience shows that our technique detects three times more true (operator-verified) anomalies than existing techniques.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"9 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":"134023970","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}
引用次数: 91
Reducing web latency: the virtue of gentle aggression 减少网络延迟:温和攻击的优点
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2486014
Tobias Flach, Nandita Dukkipati, A. Terzis, B. Raghavan, N. Cardwell, Yuchung Cheng, Ankur Jain, Shuai Hao, Ethan Katz-Bassett, R. Govindan
{"title":"Reducing web latency: the virtue of gentle aggression","authors":"Tobias Flach, Nandita Dukkipati, A. Terzis, B. Raghavan, N. Cardwell, Yuchung Cheng, Ankur Jain, Shuai Hao, Ethan Katz-Bassett, R. Govindan","doi":"10.1145/2486001.2486014","DOIUrl":"https://doi.org/10.1145/2486001.2486014","url":null,"abstract":"To serve users quickly, Web service providers build infrastructure closer to clients and use multi-stage transport connections. Although these changes reduce client-perceived round-trip times, TCP's current mechanisms fundamentally limit latency improvements. We performed a measurement study of a large Web service provider and found that, while connections with no loss complete close to the ideal latency of one round-trip time, TCP's timeout-driven recovery causes transfers with loss to take five times longer on average. In this paper, we present the design of novel loss recovery mechanisms for TCP that judiciously use redundant transmissions to minimize timeout-driven recovery. Proactive, Reactive, and Corrective are three qualitatively-different, easily-deployable mechanisms that (1) proactively recover from losses, (2) recover from them as quickly as possible, and (3) reconstruct packets to mask loss. Crucially, the mechanisms are compatible both with middleboxes and with TCP's existing congestion control and loss recovery. Our large-scale experiments on Google's production network that serves billions of flows demonstrate a 23% decrease in the mean and 47% in 99th percentile latency over today's TCP.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"64 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":"132596235","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}
引用次数: 227
In-network caching assisted wireless AP storage management: challenges and algorithms 网络内缓存辅助无线AP存储管理:挑战和算法
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491706
Zhongxing Ming, Mingwei Xu, Dan Wang
{"title":"In-network caching assisted wireless AP storage management: challenges and algorithms","authors":"Zhongxing Ming, Mingwei Xu, Dan Wang","doi":"10.1145/2486001.2491706","DOIUrl":"https://doi.org/10.1145/2486001.2491706","url":null,"abstract":"The goal of this paper is to improve wireless AP caching by leveraging in-network caching. We observe that by treating routers as an in-network storage extension, we can relieve the storage limitation of APs. The unique challenge is that APs and routers cannot have a full collaboration, which makes the problem different from traditional cooperative caching problems. We study how APs can optimize caching decisions by using in-network caching information without controlling routers.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"47 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":"133639531","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
Session details: Wireless communication 1 会话详细信息:无线通信
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/3246326
Kun Tan
{"title":"Session details: Wireless communication 1","authors":"Kun Tan","doi":"10.1145/3246326","DOIUrl":"https://doi.org/10.1145/3246326","url":null,"abstract":"","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"1 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":"131062888","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
AutoEmbed: automated multi-provider virtual network embedding AutoEmbed:自动多提供商虚拟网络嵌入
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491690
David Dietrich, Amr Rizk, Panagiotis Papadimitriou
{"title":"AutoEmbed: automated multi-provider virtual network embedding","authors":"David Dietrich, Amr Rizk, Panagiotis Papadimitriou","doi":"10.1145/2486001.2491690","DOIUrl":"https://doi.org/10.1145/2486001.2491690","url":null,"abstract":"We present AutoEmbed, a fully-automated framework for VN embedding across multiple substrate networks. To automate VN embedding, AutoEmbed deploys functions over three layers: (i) Service Providers, (ii) VN Providers, and (iii) Infrastructure Providers (InPs). AutoEmbed enables VN Providers to partition VN requests among multiple substrate networks based on resource and network topology information that is not treated as confidential by InPs. Subsequently, each VN segment is mapped by the corresponding InP onto its substrate network. AutoEmbed enables the evaluation of various aspects of multi-provider VN embedding, such as the efficiency and scalability of embedding algorithms, the impact of different levels of information disclosure on VN embedding efficiency, and the suitability of VN request specifications.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"21 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":"127051949","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
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学术官方微信