João Romeiras Amado, S. Signorello, M. Correia, Fernando M. V. Ramos
{"title":"Poster: Speeding Up Network Intrusion Detection","authors":"João Romeiras Amado, S. Signorello, M. Correia, Fernando M. V. Ramos","doi":"10.1109/ICNP49622.2020.9259349","DOIUrl":"https://doi.org/10.1109/ICNP49622.2020.9259349","url":null,"abstract":"Modern network data planes have enabled new measurement approaches, including efficient sketch-based techniques with provable trade-offs between memory and accuracy, directly in the data plane, at line rate. We thus ask the question: can one leverage this richer measurement plane to improve network intrusion detection? Our answer is SPID, a push-based, feature-rich network monitoring approach to assist learning-based attack detection. SPID switches run a diverse set of measurement primitives and proactively push measurements to the monitoring system when relevant changes occur. Network measurements are then fed as input features to a classifier based on unsupervised learning to detect ongoing attacks, as they occur. In consequence, SPID aims to reduce attack detection time, when comparing to existing solutions present in large scale networks.","PeriodicalId":233856,"journal":{"name":"2020 IEEE 28th International Conference on Network Protocols (ICNP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124935847","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":"Oktopus: Service Chaining for Multicast Traffic","authors":"Khaled M. Diab, Carlos Lee, M. Hefeeda","doi":"10.1109/ICNP49622.2020.9259408","DOIUrl":"https://doi.org/10.1109/ICNP49622.2020.9259408","url":null,"abstract":"Multicast service chaining refers to the orchestration of network services for multicast traffic. Paths of a multicast session that span the source, destinations and required services form a complex structure that we refer to as the multicast distribution graph. In this paper, we propose a new path-based algorithm, called Oktopus, that runs at the control plane of the ISP network to calculate the multicast distribution graph for a given session. Oktopus aims at minimizing the routing cost for each multicast session while satisfying all service chaining requirements. Oktopus consists of two steps. The first one generates a set of segments from the given ISP network topology, and the second step uses these segments to efficiently calculate the multicast distribution graph. Oktopus has a fine-grained control over the selection of links in the distribution graphs that leads to significant improvements. Specifically, Oktopus increases the number of allocated sessions because it can reach ISP locations that have the required services, and thus includes them in the calculated graph. Moreover, Oktopus can reduce the routing cost per session as it carefully chooses links belonging to the graph. We compared Oktopus against the optimal and closest algorithms using real ISP topologies. Our results show that Oktopus has an optimality gap of 5% on average, and it computes the distribution graphs multiple orders of magnitude faster than the optimal algorithm. Moreover, Oktopus outperforms the closest algorithm in the literature in terms of the number of allocated multicast sessions by up to 37%.","PeriodicalId":233856,"journal":{"name":"2020 IEEE 28th International Conference on Network Protocols (ICNP)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127257867","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":"Demo: Visualization of Stability Monitoring for Node Selection","authors":"Thiago Garrett, L. C. E. Bona, E. P. Duarte","doi":"10.1109/ICNP49622.2020.9259389","DOIUrl":"https://doi.org/10.1109/ICNP49622.2020.9259389","url":null,"abstract":"The purpose of this demo is to visually show a testbed monitoring strategy used to select \"stable\" sets of nodes to run new protocols. The stability of a set of nodes is defined in terms of the ability of the nodes to communicate among themselves within given time bounds during reasonable intervals of time. We assume an unstable network, in which some nodes may not be able to communicate with some others, and this condition varies with time. In order to measure stability, the communication between pairs of nodes is continuously monitored by measuring the corresponding Round Trip Time (RTT). A stability graph is generated from the monitoring data in which vertices represent network nodes and an each edge means the corresponding nodes are considered to be stable during an observation period. Multiple different structures have been embedded on the stability graph to select a large enough number of nodes on which the new protocols are executed: based on degree, clique, and k-core. We compare the different strategies both in terms of the quality of the set of nodes returned and how they fare as time passes.","PeriodicalId":233856,"journal":{"name":"2020 IEEE 28th International Conference on Network Protocols (ICNP)","volume":"37 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114045042","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}
Sezana Fahmida, V. P. Modekurthy, Mahbubur Rahman, Abusayeed Saifullah, Marco Brocanelli
{"title":"Long-Lived LoRa: Prolonging the Lifetime of a LoRa Network","authors":"Sezana Fahmida, V. P. Modekurthy, Mahbubur Rahman, Abusayeed Saifullah, Marco Brocanelli","doi":"10.1109/ICNP49622.2020.9259375","DOIUrl":"https://doi.org/10.1109/ICNP49622.2020.9259375","url":null,"abstract":"Prolonging the network lifetime is a major consideration in many Internet of Things applications. In this paper, we study maximizing the network lifetime of an energy-harvesting LoRa network. Such a network is characterized by heterogeneous recharging capabilities across the nodes that is not taken into account in existing work. We propose a link-layer protocol to achieve a long-lived LoRa network which dynamically enables the nodes with depleting batteries to exploit the superfluous energy of the neighboring nodes with affluent batteries by letting a depleting node offload its packets to an affluent node. By exploiting the LoRa’s capability of adjusting multiple transmission parameters, we enable low-cost offloading by depleting nodes instead of high-cost direct forwarding. Such offloading requires synchronization of wake-up times as well as transmission parameters between the two nodes which also need to be selected dynamically. The proposed protocol addresses these challenges and prolongs the lifetime of a LoRa network through three novel techniques. (1) We propose a lightweight medium access control protocol for peer-to-peer communication to enable packet offloading which circumvents the synchronization overhead between the two nodes. (2) We propose an intuitive heuristic method for effective parameter selections for different modes (conventional vs. offloading). (3) We analyze the energy overhead of offloading and, based on it, the protocol dynamically selects affluent and depleting nodes while ensuring that an affluent node is not overwhelmed by the depleting ones. Simulations in NS-3 as well as real experiments show that our protocol can increase the network lifetime up to 4 times while maintaining the same throughput compared to traditional LoRa network.","PeriodicalId":233856,"journal":{"name":"2020 IEEE 28th International Conference on Network Protocols (ICNP)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121862166","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}
Michael Baddeley, C. Boano, Antonio Escobar-Molero, Yeshu Liu, Xiaoyuan Ma, Usman Raza, K. Römer, Markus Schuss, Aleksandar Stanoev
{"title":"The Impact of the Physical Layer on the Performance of Concurrent Transmissions","authors":"Michael Baddeley, C. Boano, Antonio Escobar-Molero, Yeshu Liu, Xiaoyuan Ma, Usman Raza, K. Römer, Markus Schuss, Aleksandar Stanoev","doi":"10.1109/ICNP49622.2020.9259407","DOIUrl":"https://doi.org/10.1109/ICNP49622.2020.9259407","url":null,"abstract":"The popularity of concurrent transmissions (CT) has soared after recent studies have shown their feasibility on the four physical layers specified by BLE 5, hence providing an alternative to the use of IEEE 802.15.4 for the design of reliable and efficient low-power wireless protocols. However, to date, the extent to which physical layer properties affect the performance of CT has not yet been investigated in detail. This paper fills this gap and provides the first extensive study on the impact of the physical layer on CT-based solutions using IEEE 802.15.4 and BLE 5. We first highlight through simulation how the impact of errors induced by de-synchronization and beating on the performance of CT highly depends on the choice of the underlying physical layer. We then confirm these observations experimentally on real hardware through an analysis of the bit error distribution across received packets, unveiling possible techniques to effectively handle these errors. We further study the performance of CT-based flooding protocols in the presence of radio interference on a large-scale, and derive important insights on how the used physical layer affects their dependability.","PeriodicalId":233856,"journal":{"name":"2020 IEEE 28th International Conference on Network Protocols (ICNP)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115870398","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}