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

Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks最新文献

筛选
英文 中文
Towards minimal-delay deadline-driven data center TCP 面向最小延迟、截止日期驱动的数据中心TCP
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks Pub Date : 2013-11-21 DOI: 10.1145/2535771.2535788
Lei Chen, Shuihai Hu, Kai Chen, Haitao Wu, D. Tsang
{"title":"Towards minimal-delay deadline-driven data center TCP","authors":"Lei Chen, Shuihai Hu, Kai Chen, Haitao Wu, D. Tsang","doi":"10.1145/2535771.2535788","DOIUrl":"https://doi.org/10.1145/2535771.2535788","url":null,"abstract":"This paper presents MCP, a novel distributed and reactive transport protocol for data center networks (DCNs) to achieve minimal per-packet delay while providing guaranteed transmission rates to meet flow deadlines. To design MCP, we first formulate a stochastic packet delay minimization problem with constraints on deadline completion and network stability. By solving this problem, we derive an optimal congestion window update function which establishes the theoretical foundation for MCP. To be incrementally deployable with existing switch hardware, MCP leverages functionality available on commodity switch, i.e., ECN, to approximate the optimal window update function. Our preliminary results show that MCP holds great promise in terms of deadline miss rate and goodput.","PeriodicalId":203847,"journal":{"name":"Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130268841","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}
引用次数: 38
On the validity of geosocial mobility traces 论地缘社会流动痕迹的有效性
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks Pub Date : 2013-11-21 DOI: 10.1145/2535771.2535786
Zengbin Zhang, Lin Zhou, Xiaohan Zhao, G. Wang, Yu Su, Miriam J. Metzger, Haitao Zheng, Ben Y. Zhao
{"title":"On the validity of geosocial mobility traces","authors":"Zengbin Zhang, Lin Zhou, Xiaohan Zhao, G. Wang, Yu Su, Miriam J. Metzger, Haitao Zheng, Ben Y. Zhao","doi":"10.1145/2535771.2535786","DOIUrl":"https://doi.org/10.1145/2535771.2535786","url":null,"abstract":"Mobile networking researchers have long searched for large-scale, fine-grained traces of human movement, which have remained elusive for both privacy and logistical reasons. Recently, researchers have begun to focus on geosocial mobility traces, e.g. Foursquare checkin traces, because of their availability and scale. But are we conceding correctness in our zeal for data? In this paper, we take initial steps towards quantifying the value of geosocial datasets using a large ground truth dataset gathered from a user study. By comparing GPS traces against Foursquare checkins, we find that a large portion of visited locations is missing from checkins, and most checkin events are either forged or superfluous events. We characterize extraneous checkins, describe possible techniques for their detection, and show that both extraneous and missing checkins introduce significant errors into applications driven by these traces.","PeriodicalId":203847,"journal":{"name":"Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130272676","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}
引用次数: 57
Plinko: building provably resilient forwarding tables Plinko:建立可证明有弹性的转发表
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks Pub Date : 2013-11-21 DOI: 10.1145/2535771.2535774
Brent E. Stephens, A. Cox, S. Rixner
{"title":"Plinko: building provably resilient forwarding tables","authors":"Brent E. Stephens, A. Cox, S. Rixner","doi":"10.1145/2535771.2535774","DOIUrl":"https://doi.org/10.1145/2535771.2535774","url":null,"abstract":"This paper introduces Plinko, a network architecture that uses a novel forwarding model and routing algorithm to build networks with forwarding paths that, assuming arbitrarily large forwarding tables, are provably resilient against t link failures, ∀t ∈ N. However, in practice, there are clearly limits on the size of forwarding tables. Nonetheless, when constrained to hardware comparable to modern top-of-rack (TOR) switches, Plinko scales with high resilience to networks with up to ten thousand hosts. Thus, as long as t or fewer links have failed, the only reason packets of any flow in a Plinko network will be dropped are congestion, packet corruption, and a partitioning of the network topology, and, even after t + 1 failures, most, if not all, flows may be unaffected. In addition, Plinko is topology independent, supports arbitrary paths for routing, provably bounds stretch, and does not require any additional computation during forwarding. To the best of our knowledge, Plinko is the first network to have all of these properties.","PeriodicalId":203847,"journal":{"name":"Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128328763","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}
引用次数: 58
Inaccurate spectrum databases?: public transit to its rescue! 频谱数据库不准确?公共交通可以拯救它!
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks Pub Date : 2013-11-21 DOI: 10.1145/2535771.2535793
Tan Zhang, Suman Banerjee
{"title":"Inaccurate spectrum databases?: public transit to its rescue!","authors":"Tan Zhang, Suman Banerjee","doi":"10.1145/2535771.2535793","DOIUrl":"https://doi.org/10.1145/2535771.2535793","url":null,"abstract":"Unlicensed, secondary users of TV whitespaces today rely on spectrum occupancy databases to determine what spectrum they can use for their communication needs. In this paper, we first show that such spectrum databases (that depend solely on propagation models as per guidelines of the FCC in the USA) can be quite inaccurate leading to under-utilization of spectrum. Next, we propose that these spectrum databases can be significantly augmented using opportunistic measurements when possible. Instead of incorporating primary detection functions in each secondary device, we propose to use vehicle-mounted spectrum sensors that collect and report measurements from the road, which can serve as useful \"anchor points\" to enhance existing propagation models. We have currently deployed a version of our system on a single public transit bus traveling across Madison, WI, in the USA. Based on measurements collected at over 1 million locations across a 100 square-km area, we find commercial databases tend to over-predict the coverage of certain TV broadcasts, unnecessarily blocking the usage of whitespace spectrum over large area (up to 42% measured locations). We further propose a model-fitting approach that refines existing propagation models with measurements, reclaiming a substantial amount of wasted area (up to 33% measured locations).","PeriodicalId":203847,"journal":{"name":"Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125037444","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}
引用次数: 15
Give in to procrastination and stop prefetching 向拖延屈服，停止提前准备
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks Pub Date : 2013-11-21 DOI: 10.1145/2535771.2535784
Lenin Ravindranath, S. Agarwal, J. Padhye, Christopher J. Riederer
{"title":"Give in to procrastination and stop prefetching","authors":"Lenin Ravindranath, S. Agarwal, J. Padhye, Christopher J. Riederer","doi":"10.1145/2535771.2535784","DOIUrl":"https://doi.org/10.1145/2535771.2535784","url":null,"abstract":"Generations of computer programmers are taught to prefetch network objects in computer science classes. In practice, prefetching can be harmful to the user's wallet when she is on a limited or pay-per-byte cellular data plan. Many popular, professionally-written smartphone apps today prefetch large amounts of network data that the typical user may never use. We present Procrastinator, which automatically decides when to fetch each network object that an app requests. This decision is made based on whether the user is on Wi-Fi or cellular, how many bytes are remaining on the user's data plan, and whether the object is needed at the present time. Procrastinator does not require developer effort, nor app source code, nor OS changes -- it modifies the app binary to trap specific system calls and inject custom code. Our system can achieve as little as no savings to 4X savings in bytes transferred, depending on the user and the app. In theory, we can achieve 17X savings, but we need to overcome additional technical challenges.","PeriodicalId":203847,"journal":{"name":"Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121584899","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}
引用次数: 16
How to improve your network performance by asking your provider for worse service 如何通过要求提供商提供更差的服务来提高网络性能
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks Pub Date : 2013-11-21 DOI: 10.1145/2535771.2535775
R. Mittal, Justine Sherry, S. Ratnasamy, S. Shenker
{"title":"How to improve your network performance by asking your provider for worse service","authors":"R. Mittal, Justine Sherry, S. Ratnasamy, S. Shenker","doi":"10.1145/2535771.2535775","DOIUrl":"https://doi.org/10.1145/2535771.2535775","url":null,"abstract":"TCP's congestion control is deliberately \"cautious\", avoiding overloads by starting with a small initial window and then iteratively ramping up. As a result, it often takes flows several round-trip times to fully utilize the available bandwidth. In this paper we propose using several levels of lower priority service and a modified TCP behavior to achieve significantly improved flow completion times while preserving fairness.","PeriodicalId":203847,"journal":{"name":"Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129190956","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
Network stack specialization for performance 网络堆栈专门化的性能
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks Pub Date : 2013-11-21 DOI: 10.1145/2535771.2535779
Ilias Marinos, R. Watson, M. Handley
{"title":"Network stack specialization for performance","authors":"Ilias Marinos, R. Watson, M. Handley","doi":"10.1145/2535771.2535779","DOIUrl":"https://doi.org/10.1145/2535771.2535779","url":null,"abstract":"Contemporary network stacks are masterpieces of generality, supporting a range of edge-node and middle-node functions. This generality comes at significant performance cost: current APIs, memory models, and implementations drastically limit the effectiveness of increasingly powerful hardware. Generality has historically been required to allow individual systems to perform many functions. However, as providers have scaled up services to support hundreds of millions of users, they have transitioned toward many thousands (or even millions) of dedicated servers performing narrow ranges of functions. We argue that the overhead of generality is now a key obstacle to effective scaling, making specialization not only viable, but necessary. This paper presents Sandstorm, a clean-slate userspace network stack that exploits knowledge of web server semantics, improving throughput over current off-the-shelf designs while retaining use of conventional operating-system and programming frameworks. Based on Netmap, our novel approach merges application and network-stack memory models, aggressively amortizes stack-internal TCP costs based on application-layer knowledge, tightly couples with the NIC event model, and exploits low-latency hardware access. We compare our approach to the FreeBSD and Linux network stacks with nginx as the web server, demonstrating ~3.5x throughput improvement, while experiencing low CPU utilization, linear scaling on multicore systems, and saturating current NIC hardware.","PeriodicalId":203847,"journal":{"name":"Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131847145","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}
引用次数: 140
Full duplex backscatter 全双工反向散射
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks Pub Date : 2013-11-21 DOI: 10.1145/2535771.2535785
Dinesh Bharadia, K. Joshi, S. Katti
{"title":"Full duplex backscatter","authors":"Dinesh Bharadia, K. Joshi, S. Katti","doi":"10.1145/2535771.2535785","DOIUrl":"https://doi.org/10.1145/2535771.2535785","url":null,"abstract":"This paper asks the following question: could we transform the radios found in our personal gadgets into powerful multipurpose scanning devices that can detect and locate tumors, guns, buried human bodies, a la the Star Trek Tricoder? Our key insight is that if radios could measure the backscatter of their own transmissions (i.e. reflections from the environment of their transmissions), then Tricorder-style powerful object detection and localization algorithms could be realized. In this paper we focus specifically on backscatter measurement, we describe novel circuits and algorithms that can be added to existing radios to enable them to accurately and concurrently receive and disentangle their own transmissions' reflections and infer its properties.","PeriodicalId":203847,"journal":{"name":"Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129414595","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}
引用次数: 28
On the risk of misbehaving RPKI authorities 关于RPKI当局行为不当的风险
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks Pub Date : 2013-11-21 DOI: 10.1145/2535771.2535787
Danny Cooper, E. Heilman, Kyle Brogle, L. Reyzin, S. Goldberg
{"title":"On the risk of misbehaving RPKI authorities","authors":"Danny Cooper, E. Heilman, Kyle Brogle, L. Reyzin, S. Goldberg","doi":"10.1145/2535771.2535787","DOIUrl":"https://doi.org/10.1145/2535771.2535787","url":null,"abstract":"The RPKI is a new security infrastructure that relies on trusted authorities to prevent some of the most devastating attacks on interdomain routing. The threat model for the RPKI supposes that authorities are trusted and routing is under attack. Here we discuss the risks that arise when this threat model is flipped: when RPKI authorities are faulty, misconfigured, compromised, or compelled to misbehave. We show how design decisions that elegantly address the vulnerabilities in the original threat model have unexpected side effects in this flipped threat model. In particular, we show new targeted attacks that allow RPKI authorities, under certain conditions, to limit access to IP prefixes, and discuss the risk that transient RPKI faults can take IP prefixes offline. Our results suggest promising directions for future research, and have implications on the design of security architectures that are appropriate for the untrusted and error-prone Internet.","PeriodicalId":203847,"journal":{"name":"Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121726853","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}
引用次数: 70
Managing the network with Merlin 使用Merlin管理网络
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks Pub Date : 2013-11-21 DOI: 10.1145/2535771.2535792
R. Soulé, Shrutarshi Basu, Robert D. Kleinberg, E. G. Sirer, Nate Foster
{"title":"Managing the network with Merlin","authors":"R. Soulé, Shrutarshi Basu, Robert D. Kleinberg, E. G. Sirer, Nate Foster","doi":"10.1145/2535771.2535792","DOIUrl":"https://doi.org/10.1145/2535771.2535792","url":null,"abstract":"This paper presents the Merlin network management framework. With Merlin, administrators express network policy using programs in a declarative language based on logical predicates and regular expressions. The Merlin compiler automatically partitions these programs into components that can be placed on a variety of devices including switches, middleboxes, and end hosts. It uses a constraint solver and parameterizable heuristics to allocate resources such as paths and bandwidth. To ease the administration of federated networks, Merlin provides mechanisms for delegating management of sub-policies to tenants, along with tools for verifying that delegated sub-policies do not violate global constraints. Overall, Merlin simplifies the task of network administration by providing high-level abstractions for directly specifying network policy.","PeriodicalId":203847,"journal":{"name":"Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132526892","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}
引用次数: 75
首页 上一页 下一页 尾页
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学术官方微信