Talal Ahmad, Ranveer Chandra, Ashish Kapoor, Michael Daum, E. Horvitz
More than half of the world's population face barriers in accessing the Internet. A recent ITU study estimates that 2.6 billion people cannot afford connectivity and that 3.8 billion do not have access. Recent proposals for providing low-cost connectivity include fielding of drones and long-lasting balloons in the stratosphere. We propose a more economical alternative, which we refer to as Wi-Fly, that leverages existing commercial planes to provide Internet connectivity to remote regions. In Wi-Fly we enable communication between a lightweight Wi-Fi device on commercial planes and ground stations, resulting in connectivity in regions that do not otherwise have low-cost Internet connectivity. Wi-Fly leverages existing ADS-B signals from planes as a control channel to ensure that there is a strong link from the plane to the ground, and that the stations intelligently wake up and associate to the appropriate AP. For our experimentation, we have customized two airplanes to conduct measurements. Through empirical experiments with test flights and simulations, we show that Wi-Fly and its extensions have the potential to provide connectivity to the most remote regions of the world at a significantly lower cost than existing alternatives.
{"title":"Wi-Fly: Widespread Opportunistic Connectivity via Commercial Air Transport","authors":"Talal Ahmad, Ranveer Chandra, Ashish Kapoor, Michael Daum, E. Horvitz","doi":"10.1145/3152434.3152458","DOIUrl":"https://doi.org/10.1145/3152434.3152458","url":null,"abstract":"More than half of the world's population face barriers in accessing the Internet. A recent ITU study estimates that 2.6 billion people cannot afford connectivity and that 3.8 billion do not have access. Recent proposals for providing low-cost connectivity include fielding of drones and long-lasting balloons in the stratosphere. We propose a more economical alternative, which we refer to as Wi-Fly, that leverages existing commercial planes to provide Internet connectivity to remote regions. In Wi-Fly we enable communication between a lightweight Wi-Fi device on commercial planes and ground stations, resulting in connectivity in regions that do not otherwise have low-cost Internet connectivity. Wi-Fly leverages existing ADS-B signals from planes as a control channel to ensure that there is a strong link from the plane to the ground, and that the stations intelligently wake up and associate to the appropriate AP. For our experimentation, we have customized two airplanes to conduct measurements. Through empirical experiments with test flights and simulations, we show that Wi-Fly and its extensions have the potential to provide connectivity to the most remote regions of the world at a significantly lower cost than existing alternatives.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130929486","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}
Arjun Singhvi, S. Banerjee, Yotam Harchol, Aditya Akella, M. Peek, Pontus Rydin
Computing/infrastructure as a service continues to evolve with bare metal, virtual machines, containers and now serverless granular computing service offerings. Granular computing enables developers to decompose their applications into smaller logical units or functions, and run them on small, low cost and short lived computation containers without having to worry about setting up servers - hence the term serverless computing. While serverless environments can be used very cost effectively for large scale parallel processing data analytics applications, it is less clear if network intensive packet processing applications can also benefit from these new computing services as they do not share the same characteristics. This paper examines the architectural constraints as well as current serverless implementations to develop a position on this topic and influence the next generation of computing services. We support our position through measurement and experimentation on Amazon's AWS Lambda service with a few popular network functions.
{"title":"Granular Computing and Network Intensive Applications: Friends or Foes?","authors":"Arjun Singhvi, S. Banerjee, Yotam Harchol, Aditya Akella, M. Peek, Pontus Rydin","doi":"10.1145/3152434.3152450","DOIUrl":"https://doi.org/10.1145/3152434.3152450","url":null,"abstract":"Computing/infrastructure as a service continues to evolve with bare metal, virtual machines, containers and now serverless granular computing service offerings. Granular computing enables developers to decompose their applications into smaller logical units or functions, and run them on small, low cost and short lived computation containers without having to worry about setting up servers - hence the term serverless computing. While serverless environments can be used very cost effectively for large scale parallel processing data analytics applications, it is less clear if network intensive packet processing applications can also benefit from these new computing services as they do not share the same characteristics. This paper examines the architectural constraints as well as current serverless implementations to develop a position on this topic and influence the next generation of computing services. We support our position through measurement and experimentation on Amazon's AWS Lambda service with a few popular network functions.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129670040","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}
Congestion control is a perennial topic of networking research. In making decisions about who sends data when, congestion-control schemes prevent collapses and ultimately determine the allocation of scarce communications resources among contending users and applications. The field has seen considerable recent activity. Even after three decades of research, basic principles and techniques remain up for debate. In this throwdown-as-paper, the authors find themselves at loggerheads over the fundamental tenets of congestion control.
{"title":"Congestion-Control Throwdown","authors":"Michael Schapira, Keith Winstein","doi":"10.1145/3152434.3152446","DOIUrl":"https://doi.org/10.1145/3152434.3152446","url":null,"abstract":"Congestion control is a perennial topic of networking research. In making decisions about who sends data when, congestion-control schemes prevent collapses and ultimately determine the allocation of scarce communications resources among contending users and applications. The field has seen considerable recent activity. Even after three decades of research, basic principles and techniques remain up for debate. In this throwdown-as-paper, the authors find themselves at loggerheads over the fundamental tenets of congestion control.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121504539","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}
Nikola Gvozdiev, Stefano Vissicchio, B. Karp, M. Handley
Early in in the Internet's history, routing within a single provider's WAN centered on placing traffic on the shortest path. More recent traffic engineering efforts aim to reduce congestion and/or increase utilization within the status quo of greedy shortest-path first routing on a sparse topology. In this paper, we argue that this status quo of routing and topology is fundamentally at odds with placing traffic so as to minimize latency for users while avoiding congestion. We advocate instead provider backbone topologies that are more mesh-like, and hence better at providing multiple low-latency paths, and a routing system that directly considers latency minimization and congestion avoidance while dynamically placing traffic on multiple unequal-cost paths. We offer a research agenda for achieving this new low-latency approach to WAN topology design and routing.
{"title":"Low-Latency Routing on Mesh-Like Backbones","authors":"Nikola Gvozdiev, Stefano Vissicchio, B. Karp, M. Handley","doi":"10.1145/3152434.3152453","DOIUrl":"https://doi.org/10.1145/3152434.3152453","url":null,"abstract":"Early in in the Internet's history, routing within a single provider's WAN centered on placing traffic on the shortest path. More recent traffic engineering efforts aim to reduce congestion and/or increase utilization within the status quo of greedy shortest-path first routing on a sparse topology. In this paper, we argue that this status quo of routing and topology is fundamentally at odds with placing traffic so as to minimize latency for users while avoiding congestion. We advocate instead provider backbone topologies that are more mesh-like, and hence better at providing multiple low-latency paths, and a routing system that directly considers latency minimization and congestion avoidance while dynamically placing traffic on multiple unequal-cost paths. We offer a research agenda for achieving this new low-latency approach to WAN topology design and routing.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115064285","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}
Patricia Callejo, Conor Kelton, N. Vallina-Rodriguez, R. C. Rumín, Oliver Gasser, C. Kreibich, F. Wohlfart, Ángel Cuevas
For many years, the research community, practitioners, and regulators have used myriad methods and tools to understand the complex structure and behavior of ISPs from the edge of the network. Unfortunately, the nature of these techniques forces the researcher to find a balance between ISP-coverage, user scale, and accuracy. In this paper we present AdTag, a network measurement paradigm that leverages the opportunistic nature of online targeted advertising to measure the Internet from the edge of the network. We discuss and formalize AdTag's design space---including technical, ethical, deployability and economic factors---and its potential to analyze a wide spectrum of Internet connectivity aspects from the browser. We run several experiments to demonstrate that AdTag can be tailored towards geographic and device-based user groups, finding also several challenges to be faced in order to maximize the number of samples. In a 7-day campaign, AdTag could access more than 20K ISPs at a global scale (185 countries) using millions of edge nodes.
{"title":"Opportunities and Challenges of Ad-based Measurements from the Edge of the Network","authors":"Patricia Callejo, Conor Kelton, N. Vallina-Rodriguez, R. C. Rumín, Oliver Gasser, C. Kreibich, F. Wohlfart, Ángel Cuevas","doi":"10.1145/3152434.3152895","DOIUrl":"https://doi.org/10.1145/3152434.3152895","url":null,"abstract":"For many years, the research community, practitioners, and regulators have used myriad methods and tools to understand the complex structure and behavior of ISPs from the edge of the network. Unfortunately, the nature of these techniques forces the researcher to find a balance between ISP-coverage, user scale, and accuracy. In this paper we present AdTag, a network measurement paradigm that leverages the opportunistic nature of online targeted advertising to measure the Internet from the edge of the network. We discuss and formalize AdTag's design space---including technical, ethical, deployability and economic factors---and its potential to analyze a wide spectrum of Internet connectivity aspects from the browser. We run several experiments to demonstrate that AdTag can be tailored towards geographic and device-based user groups, finding also several challenges to be faced in order to maximize the number of samples. In a 7-day campaign, AdTag could access more than 20K ISPs at a global scale (185 countries) using millions of edge nodes.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115312353","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}
Allen Welkie, Longfei Shangguan, Jeremy Gummeson, Wenjun Hu, K. Jamieson
Smart spaces, such as smart homes and smart offices, are common Internet of Things (IoT) scenarios for building automation with networked sensors. In this paper, we suggest a different notion of smart spaces, where the radio environment is programmable to achieve desirable link quality within the space. We envision deploying low-cost devices embedded in the walls of a building to passively reflect or actively transmit radio signals. This is a significant departure from typical approaches to optimizing endpoint radios and individual links to improve performance. In contrast to previous work combating or leveraging per-link multipath fading, we actively reconfigure the multipath propagation. We sketch design and implementation directions for such a programmable radio environment, highlighting the computational and operational challenges our architecture faces. Preliminary experiments demonstrate the efficacy of using passive elements to change the wireless channel, shifting frequency "nulls" by nine Wi-Fi subcarriers, changing the 2 x 2 MIMO channel condition number by 1.5 dB, and attenuating or enhancing signal strength by up to 26 dB.
智能空间，如智能家居和智能办公室，是具有联网传感器的楼宇自动化的常见物联网(IoT)场景。在本文中，我们提出了一种不同的智能空间概念，其中无线电环境是可编程的，以在空间内实现理想的链路质量。我们设想将低成本的设备嵌入建筑物的墙壁中，被动反射或主动传输无线电信号。这与优化端点无线电和单个链接以提高性能的典型方法有很大的不同。与以前对抗或利用每链路多径衰落的工作相反，我们积极地重新配置多径传播。我们概述了这种可编程无线电环境的设计和实现方向，突出了我们的架构面临的计算和操作挑战。初步实验证明了使用无源元件改变无线信道的有效性，通过9个Wi-Fi子载波移动频率“零”，将2 x 2 MIMO信道条件数改变1.5 dB，并衰减或增强信号强度高达26 dB。
{"title":"Programmable Radio Environments for Smart Spaces","authors":"Allen Welkie, Longfei Shangguan, Jeremy Gummeson, Wenjun Hu, K. Jamieson","doi":"10.1145/3152434.3152456","DOIUrl":"https://doi.org/10.1145/3152434.3152456","url":null,"abstract":"Smart spaces, such as smart homes and smart offices, are common Internet of Things (IoT) scenarios for building automation with networked sensors. In this paper, we suggest a different notion of smart spaces, where the radio environment is programmable to achieve desirable link quality within the space. We envision deploying low-cost devices embedded in the walls of a building to passively reflect or actively transmit radio signals. This is a significant departure from typical approaches to optimizing endpoint radios and individual links to improve performance. In contrast to previous work combating or leveraging per-link multipath fading, we actively reconfigure the multipath propagation. We sketch design and implementation directions for such a programmable radio environment, highlighting the computational and operational challenges our architecture faces. Preliminary experiments demonstrate the efficacy of using passive elements to change the wireless channel, shifting frequency \"nulls\" by nine Wi-Fi subcarriers, changing the 2 x 2 MIMO channel condition number by 1.5 dB, and attenuating or enhancing signal strength by up to 26 dB.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114175856","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}
Vasudevan Nagendra, V. Yegneswaran, Phillip A. Porras
The Science DMZ (SDMZ) is a special purpose network infrastructure that is engineered to cater to the ultra-high bandwidth needs of the scientific and high performance computing (HPC) communities. These networks are isolated from stateful security devices such as firewalls and deep packet inspection (DPI) engines to allow HPC data transfer nodes (DTNs) to efficiently transfer petabytes of data without associated bandwidth and performance bottlenecks. This paper presents our ongoing effort toward the development of more fine-grained data flow access control policies to manage SDMZ networks that service large-scale experiments with varying data sensitivity levels and privacy constraints. We present a novel system, called CoordiNetZ (CNZ), that provides coordinated security monitoring and policy enforcement for sites participating in SDMZ projects by using an intent-based policy framework for effectively capturing the high-level policy intents of non-admin SDMZ project users (e.g., scientists, researchers, students). Central to our solution is the notion of coordinated situational awareness that is extracted from the synthesis of context derived from SDMZ host DTN applications and the network substrate. To realize this vision, we present a specialized process-monitoring system and flow-monitoring tool that facilitate context-aware data-flow intervention and policy enforcement in ultra-highspeed data transfer environments. We evaluate our prototype implementation using case studies that highlight the utility of our framework and demonstrate how security policy could be effectively specified and implemented within and across SDMZ networks.
{"title":"Securing Ultra-High-Bandwidth Science DMZ Networks with Coordinated Situational Awareness","authors":"Vasudevan Nagendra, V. Yegneswaran, Phillip A. Porras","doi":"10.1145/3152434.3152460","DOIUrl":"https://doi.org/10.1145/3152434.3152460","url":null,"abstract":"The Science DMZ (SDMZ) is a special purpose network infrastructure that is engineered to cater to the ultra-high bandwidth needs of the scientific and high performance computing (HPC) communities. These networks are isolated from stateful security devices such as firewalls and deep packet inspection (DPI) engines to allow HPC data transfer nodes (DTNs) to efficiently transfer petabytes of data without associated bandwidth and performance bottlenecks. This paper presents our ongoing effort toward the development of more fine-grained data flow access control policies to manage SDMZ networks that service large-scale experiments with varying data sensitivity levels and privacy constraints. We present a novel system, called CoordiNetZ (CNZ), that provides coordinated security monitoring and policy enforcement for sites participating in SDMZ projects by using an intent-based policy framework for effectively capturing the high-level policy intents of non-admin SDMZ project users (e.g., scientists, researchers, students). Central to our solution is the notion of coordinated situational awareness that is extracted from the synthesis of context derived from SDMZ host DTN applications and the network substrate. To realize this vision, we present a specialized process-monitoring system and flow-monitoring tool that facilitate context-aware data-flow intervention and policy enforcement in ultra-highspeed data transfer environments. We evaluate our prototype implementation using case studies that highlight the utility of our framework and demonstrate how security policy could be effectively specified and implemented within and across SDMZ networks.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121484355","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}
{"title":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","authors":"","doi":"10.1145/3152434","DOIUrl":"https://doi.org/10.1145/3152434","url":null,"abstract":"","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128787620","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：