Paul Lepe, Aashray Aggarwal, J. Mirkovic, Jens Mache, Richard S. Weiss, David Weinmann
{"title":"Measuring Student Learning On Network Testbeds","authors":"Paul Lepe, Aashray Aggarwal, J. Mirkovic, Jens Mache, Richard S. Weiss, David Weinmann","doi":"10.1109/ICNP.2019.8888101","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888101","url":null,"abstract":"Engaging students in practical, hands-on exercises on testbeds improves student learning and knowledge retention. However, testbeds may also present an obstacle to learning for students who are not familiar with the environment, or who lack the necessary background to complete their assignments. Our research investigates how students learn with testbeds. We instrument a default operating system on the DeterLab testbed and monitor the students’ command line input and output, as they perform homework assignments.We use this data to evaluate students’ progress, to detect when a student is struggling and to identify common problems.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127590444","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":"SAFE-ME: Scalable and Flexible Middlebox Policy Enforcement with Software Defined Networking","authors":"Gongming Zhao, Hongli Xu, Jianchun Liu, Chen Qian, Juncheng Ge, Liusheng Huang","doi":"10.1109/ICNP.2019.8888123","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888123","url":null,"abstract":"The past decades have seen a proliferation of middlebox deployment in various networks, including backbone networks and datacenters. Since network flows have to traverse specific service function chains (SFCs) for security and performance enhancement, it becomes much complex for SFC routing due to routing loops, traffic dynamics and scalability requirement. The existing SFC routing solutions may consume many resources (e.g., TCAM) on the data plane and lead to massive overhead on the control plane, which decrease the scalability of middlebox networks. Due to SFC requirement and potential routing loops, solutions like traditional default paths (e.g., using ECMP) that are widely used in non-middlebox networks will no longer be feasible. In this paper, we present and implement a scalable and flexible middlebox policy enforcement (SAFE-ME) system to minimize the TCAM usage and control overhead. To this end, we design the smart tag operations for construction of default SFC paths with less TCAM rules in the data plane, and present lightweight SFC routing update with less control overhead for dealing with traffic dynamics in the control plane. We implement our solution and evaluate its performance with experiments on both physical platform (Pica8) and Open vSwitch (OVS), as well as large-scale simulations. Both experimental and simulation results show that SAFE-ME can greatly improve scalability (e.g., TCAM cost, update delay, and control overhead) in middlebox networks. For example, our system can reduce the control traffic overhead by about 83% while achieving almost the similar middlebox load, compared with state-of-the-art solutions.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"49 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114131957","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}
Mohammad Jahanian, Jiachen Chen, Kadangode K. Ramakrishnan
{"title":"Graph-based Namespaces and Load Sharing for Efficient Information Dissemination in Disasters","authors":"Mohammad Jahanian, Jiachen Chen, Kadangode K. Ramakrishnan","doi":"10.1109/ICNP.2019.8888047","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888047","url":null,"abstract":"Timely, flexible and accurate information dissemination can make a life-and-death difference in managing disasters. Complex command structures and information organization make such dissemination challenging. Thus, it is vital to have an architecture with appropriate naming frameworks, adaptable to the changing roles of participants, focused on content rather than network addresses. To address this, we propose POISE, a name-based and recipient-based publish/subscribe architecture for efficient content dissemination in disaster management. POISE proposes an information layer, improving on state-of-the-art Information-Centric Networking (ICN) solutions such as Named Data Networking (NDN) in two major ways: 1) support for complex graph-based namespaces, and 2) automatic name-based load-splitting. To capture the complexity and dynamicity of disaster response command chains and information flows, POISE proposes a graph-based naming framework, leveraged in a dissemination protocol which exploits information layer rendezvous points (RPs) that perform name expansions. For improved robustness and scalability, POISE allows load-sharing via multiple RPs each managing a subset of the namespace graph. However, excessive workload on one RP may turn it into a “hot spot”, thus impeding performance and reliability. To eliminate such traffic concentration, we propose an automatic load-splitting mechanism, consisting of a namespace graph partitioning complemented by a seamless, loss-less core migration procedure. Due to the nature of our graph partitioning and its complex objectives, off-the-shelf graph partitioning, e.g., METIS, is inadequate. We propose a hybrid partitioning solution, consisting of an initial and a refinement phase. Our simulation results show that POISE outperforms state-of-the-art solutions, demonstrating its effectiveness in timely delivery and load-sharing.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402183","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}
T. Friedman, R. McGeer, Berat Can Senel, Matt Hemmings, Glenn Ricart
{"title":"The EdgeNet System","authors":"T. Friedman, R. McGeer, Berat Can Senel, Matt Hemmings, Glenn Ricart","doi":"10.1109/ICNP.2019.8888122","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888122","url":null,"abstract":"EdgeNet is the prototype of a scalable, sustainable general-purpose testbed for very wide area distributed systems and extremely low-latency distributed services. In this, it is aimed at the same experimenters and systems that formed the core usage of previous, highly-successful wide-area testbeds such as PlanetLab [1], G-Lab [2], V-Node [5], GENI [4], and SAVI [3], and it incorporates many of the features that characterized those previous testbeds. EdgeNet’s goal is to achieve the usability and research value of the previous generations of wide area testbed, whilst offering radical improvements in the scalability and sustainability of those systems. It achieves this scalability and sustainability through a strategy of using industry-standard open-source software as the basis of its software stack, and by a strategy of hardwarefree, bottom-up, site-driven deployment. EdgeNet follows the Seattle [6] and PlanetIgnite [9] strategy of permitting sites to join the testbed with purely local action.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129633174","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":"Local Fast Rerouting with Low Congestion: A Randomized Approach","authors":"Gregor Bankhamer, Robert Elsässer, S. Schmid","doi":"10.1109/ICNP.2019.8888087","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888087","url":null,"abstract":"Most modern communication networks include fast rerouting mechanisms, implemented entirely in the data plane, to quickly recover connectivity after link failures. By relying on local failure information only, these data plane mechanisms provide very fast reaction times, but at the same time introduce an algorithmic challenge in case of multiple link failures: failover routes need to be robust to additional but locally unknown failures downstream.This paper presents local fast rerouting algorithms which not only provide a high degree of resilience against multiple link failures, but also ensure a low congestion on the resulting failover paths. We consider a randomized approach and focus on networks which are highly connected before the failures occur. Our main contribution are three simple algorithms which come with provable guarantees and provide interesting resilience-load tradeoffs, significantly outperforming any deterministic fast rerouting algorithm with high probability.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124577385","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":"DeepRoute on Chameleon: Experimenting with Large-scale Reinforcement Learning and SDN on Chameleon Testbed","authors":"Bashir Mohammed, M. Kiran, Nandini Krishnaswamy","doi":"10.1109/ICNP.2019.8888090","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888090","url":null,"abstract":"As the numbers of internet users and connected devices continue to multiply, due to big data and Cloud applications, network traffic is growing at an exponential rate. WAN networks, in particular, are witnessing very large traffic spikes cause by large file transfers that last from a few minutes to hours on network links and there is a need to develop innovative ways in which flows can be managed in real-time.In this work, we develop a reinforcement learning approach, in particular Upper-Confidence Algorithm, to learn optimal paths and reroute traffic to improve network utilization. We present throughput and flow diversions using Mininet and demo the technique using Chameleon’s Testbed (Bring-Your-Own-Controller [BYOC] functionality). This work is initial implementation towards DeepRoute, which combines Deep reinforcement learning algorithms with SDN controllers to create and route traffic using deployed OpenFlow switches.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127669576","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}
M. Dahlmanns, Chris Dax, Roman Matzutt, J. Pennekamp, Jens Hiller, Klaus Wehrle
{"title":"Privacy-Preserving Remote Knowledge System","authors":"M. Dahlmanns, Chris Dax, Roman Matzutt, J. Pennekamp, Jens Hiller, Klaus Wehrle","doi":"10.1109/ICNP.2019.8888121","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888121","url":null,"abstract":"More and more traditional services, such as malware detectors or collaboration services in industrial scenarios, move to the cloud. However, this behavior poses a risk for the privacy of clients since these services are able to generate profiles containing very sensitive information, e.g., vulnerability information or collaboration partners. Hence, a rising need for protocols that enable clients to obtain knowledge without revealing their requests exists. To address this issue, we propose a protocol that enables clients (i) to query large cloud-based knowledge systems in a privacy-preserving manner using Private Set Intersection and (ii) to subsequently obtain individual knowledge items without leaking the client’s requests via few Oblivious Transfers. With our preliminary design, we allow clients to save a significant amount of time in comparison to performing Oblivious Transfers only.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116679497","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":"mLoRa: A Multi-Packet Reception Protocol in LoRa networks","authors":"Xiong Wang, L. Kong, Liang He, Guihai Chen","doi":"10.1109/ICNP.2019.8888038","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888038","url":null,"abstract":"We present mLoRa in this paper, a novel protocol that can decode multiple collided packets simultaneously from different transmitters in LoRa networks. As a recently proposed wireless technology designed for low-power wide-area networks, LoRa has been proverbially employed in many fields, such as smart cities, intelligent agriculture, and environmental monitoring. In LoRa networks, a star-of-stars topology is conventionally implemented, in which thousands of nodes connect to a single gateway. Accordingly, the convergecast scenario becomes common. For example, in intelligent agriculture, multiple sensor nodes send information with respect to the soil temperature and humidity to a LoRa gateway. Regularly, simultaneous transmissions result in the severe collision problem. Meanwhile, the ALOHA protocol is widely applied in LoRa networks, which further aggravates the collision problem. To conquer this challenge, we propose a protocol named mLoRa for multi-packet reception in LoRa networks, leveraging unique features inherent in LoRa’s physical layer including chirp spread spectrum (CSS), M-FSK modulation, and demodulation. In addition, design enhancements are developed to mitigate the noise and frequency offset influence. We implement mLoRa on a six-node testbed with USRPs. Experiment results demonstrate that mLoRa enables up to three concurrent transmissions. Correspondingly, mLoRa based throughput is around 3 times more than the conventional LoRa.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117164320","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":"ICNP 2019 Welcome Message from the ICNP 2019 General Chairs","authors":"H. Seferoglu, Zhi Li Zhang","doi":"10.1109/icnp.2019.8888139","DOIUrl":"https://doi.org/10.1109/icnp.2019.8888139","url":null,"abstract":"","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116255422","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":"GreenEdge: Greening Edge Datacenters with Energy-Harvesting IoT Devices","authors":"Zhi Zhou","doi":"10.1109/ICNP.2019.8888103","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888103","url":null,"abstract":"Mobile edge computing, with its promise to fulfill the urgent need for richer applications and better experience of resource-hungry IoT devices, is emerging as a new computing paradigm and has quickly ascended to the spotlight. It is readily acknowledged, however that edge infrastructures are less capable of improving power usage efficiency and integrating renewable energy. To address this challenge, we propose a new framework — GreenEdge, which leverages device-to-device (D2D) communication and energy-harvesting (EH) to realize sustainable and collaborative task execution. Specifically, we first introduce the motivations of combining D2D and EH to green edge infrastructure. We next validate the feasibility and economic-efficiency of combining D2D and EH, with the help of two emerging commercial-applicable IoT applications: smart street lighting and smart bike-sharing. We further present the basic architecture, model and optimization of GreenEdge. For research inspirations, practical challenges and directions towards GreenEdge are identified. Finally, we acknowledge that GreenEdge is not the only road towards sustainability, future alternatives that can work in conjunction with GreenEdge to comprehensively green edge computing are discussed.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126418283","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}