Wassim Jerbi, O. Cheikhrouhou, Abderrahmen Guermazi, Atef Boubaker, H. Trabelsi
{"title":"A Novel Blockchain Secure to Routing Protocol in WSN","authors":"Wassim Jerbi, O. Cheikhrouhou, Abderrahmen Guermazi, Atef Boubaker, H. Trabelsi","doi":"10.1109/HPSR52026.2021.9481805","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481805","url":null,"abstract":"A blockchain is a database that contains the history of all exchanges made between its users since its creation. A blockchain is a distributed and secure ledger of all transactions made since the start of the distributed system. It is a technology for storing and transmitting information, transparent, secure, and operating without a central control body. Our paper studies a new device authentication for mobile sensor node to prove its authenticity to unknown network manager. To solve the authentication of sensor among multiple networks, our proposal a blockchain scheme where the transaction specifies the authentication of given cluster head CH. As we claim, a blockchain guarantees an integrity and availability of message under assumption that every node has some public and private key pairs. However, it does not provide any authentication mechanism for symmetric key. Hence, the proposed scheme is secure as we claim. More concretely, in the protocol proposed Blockchain Security IoT (BSI) is to provide authentication between the mobile base station (BS), the cluster head and the member nodes for wireless sensor networks (WSN). Our protocol BSI protocol makes it possible to put the necessary keys of the networks at the level of each sensor for the different scenarios carried out, BS mobile node and migration node. We evaluate the performance of our protocol with simulations using MATLAB. The results confirm that the BSI protocol is robust and efficient, provides lower power consumption and fast computing time.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114178333","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":"Run-to-Completion versus Pipelined: The Case of 100 Gbps Packet Parsing","authors":"H. Zolfaghari, Haseeb Mustafa, J. Nurmi","doi":"10.1109/HPSR52026.2021.9481797","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481797","url":null,"abstract":"Packet parsing is the initial step in processing of network packets. It is encountered in any environment in which packets must be processed. Examples include switches, routers, firewalls, and kernel of operating system. In recent years, there has been focus on programmable and protocol-independent packet processing hardware. The two main hardware architectures for packet processing are run-to-completion and pipelined organization of functional units. This applies to packet parsing as well. Both run-to-completion and pipelined organization have pros and cons and the debate as to which provides greater overall benefit is endless. In this paper, we consider this problem from the perspective of programmable 100 Gbps packet parsing. We will see that the pipelined parser provides 40x throughput compared to the run-to-completion architecture despite running at the same operating frequency and using the same functional units in each pipeline stage.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124761404","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":"High-speed Connection Tracking in Modern Servers","authors":"Massimo Girondi, Marco Chiesa, Tom Barbette","doi":"10.1109/HPSR52026.2021.9481841","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481841","url":null,"abstract":"The rise of commodity servers equipped with high-speed network interface cards poses increasing demands on the efficient implementation of connection tracking, i.e., the task of associating the connection identifier of an incoming packet to the state stored for that connection. In this work, we thoroughly investigate and compare the performance obtainable by different implementations of connection tracking using high-speed real traffic traces. Based on a load balancer use case, our results show that connection tracking is an expensive operation, achieving at most 24 Gbps on a single core. Core-sharding and lock-free hash tables emerge as the only suitable multi-thread approaches for enabling 100 Gbps packet processing. In contrast to recent beliefs, we observe that newly proposed techniques to \"lazily\" delete connection states are not more effective than properly tuned traditional deletion techniques based on timer wheels.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125187447","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":"A bandwidth balance routing approach for saving network capacity in static elastic optical networks","authors":"J. Cedeño, Reinaldo Vallejos Campos, N. Jara","doi":"10.1109/HPSR52026.2021.9481804","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481804","url":null,"abstract":"Nowadays, most optical network planning strategies route the users by the shortest paths. However, balancing the network paths may achieve remarkable savings by using network resources as even as possible. In this work, we propose a balancing routing strategy for elastic optical networks (EON) architectures with static network operation, called Bandwidth-Balanced (BB). We compute the connection paths balancing the number of FSUs demanded in all network links, contrary to the users balancing strategies found in the literature. To evaluate our proposal, we perform the Routing, Modulation Level, and Spectrum Assignment problems (RMLSA), taking into account physical-layer impairments (PLI) found in optical communications. Experimental results show that the BB strategy outperforms commonly used strategies in capacity savings and spectral fragmentation.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"27 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123581012","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":"[HPSR 2021 Front cover]","authors":"","doi":"10.1109/hpsr52026.2021.9481860","DOIUrl":"https://doi.org/10.1109/hpsr52026.2021.9481860","url":null,"abstract":"","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132731688","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":"Prediction Augmented Segment Routing","authors":"M. Kodialam, T. Lakshman","doi":"10.1109/HPSR52026.2021.9481858","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481858","url":null,"abstract":"With the increasing success of machine learning based approaches for prediction problems, there has been recent effort in improving the performance of online algorithms by augmenting them with machine learning predictions. Since machine learning predictions typically do not offer any performance guarantees, the new approach has to take into consideration the possibility that the machine learning prediction can be inaccurate. The idea is to develop approaches that give good results when the prediction is accurate (consistency) while ensuring that the performance is still acceptable in the worst case, when the prediction is not accurate (robustness). Segment routing is now being widely deployed and used for traffic engineering in IP networks. The key idea in segment routing is to break up the routing path into segments to better control routing paths and improve network utilization. We consider the problem of designing the segments in a network to minimize congestion. This is typically done for a predicted traffic matrix. We use the ideas of consistency and robustness to design a parametrized algorithm that gives good performance when the actual traffic matrix is exactly the predicted traffic matrix (consistency) while giving good performance in the worst case if the actual traffic matrix deviates significantly from the predicted traffic matrix (robustness).","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132405541","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":"SDN-Based Link Recovery Scheme for Large-Scale Internet of Things","authors":"N. Ahmed, Arijit Roy, A. Mondal, S. Misra","doi":"10.1109/HPSR52026.2021.9481842","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481842","url":null,"abstract":"In this paper, we propose SD-Reco, a Software-Defined Network (SDN)-based centralized AP and relay node re-configuration scheme for link recovery in IEEE 802.11ah networks. The proposed scheme identifies the overlapping regions and congestion of a network and re-configures Relays, APs, and SDN core nodes for reliable data transmission. Taking advantage of redundant links, the SDN controller triggers a node to receive/transmit frames using the best relay/AP for reliable and low latency delivery. The stations use redundant available links to relay/AP for any failure, not meeting the Quality of Service (QoS) requirement and congestion. Our solution use a relay placement scheme to know topology of the network for centralized controlling. An AP node determines the congestion status of each relay and itself and updates the same to the SDN controller. Accordingly, the controller selects an AP/relay and places flow-rules from overlapping regions for forwarding the traffic dynamically. SD-Reco improves packet delivery ratio up to 18.7% and latency up to 33.3%, compared to the existing state-of-the-art.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133342987","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}
Paul Almasan, Jos'e Su'arez-Varela, Bo-Xi Wu, Shihan Xiao, P. Barlet-Ros, A. Cabellos-Aparicio
{"title":"Towards Real-Time Routing Optimization with Deep Reinforcement Learning: Open Challenges","authors":"Paul Almasan, Jos'e Su'arez-Varela, Bo-Xi Wu, Shihan Xiao, P. Barlet-Ros, A. Cabellos-Aparicio","doi":"10.1109/HPSR52026.2021.9481864","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481864","url":null,"abstract":"The digital transformation is pushing the existing network technologies towards new horizons, enabling new applications (e.g., vehicular networks). As a result, the networking community has seen a noticeable increase in the requirements of emerging network applications. One main open challenge is the need to accommodate control systems to highly dynamic network scenarios. Nowadays, existing network optimization technologies do not meet the needed requirements to effectively operate in real time. Some of them are based on hand-crafted heuristics with limited performance and adaptability, while some technologies use optimizers which are often too time-consuming. Recent advances in Deep Reinforcement Learning (DRL) have shown a dramatic improvement in decision-making and automated control problems. Consequently, DRL represents a promising technique to efficiently solve a variety of relevant network optimization problems, such as online routing. In this paper, we explore the use of state-of-the-art DRL technologies for real-time routing optimization and outline some relevant open challenges to achieve production-ready DRL-based solutions.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123853529","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":"A Low-Cost IP-to-NDN Translation Gateway","authors":"Feri Fahrianto, N. Kamiyama","doi":"10.1109/HPSR52026.2021.9481861","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481861","url":null,"abstract":"A low-cost migration from IP-to-NDN is one of the most critical challenges that should be answered before the NDN protocol replacing the IP protocol on the Internet. A translation approach is considered as the practical and economical approach for IP to NDN migration. This paper proposes a lightweight translation method between IP and NDN by utilizing the data payload for bridging the semantic protocol gap in some possible producer and consumer scenarios. We evaluate the packet throughput, latency, and processing load to clarify the gateway effectiveness using a computer emulator.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115669668","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}
Jose Soriano, Guillermo Jiménez, Ernesto Correa, Noel Ruiz
{"title":"Challenges in the Automotive Software Supply Chain, Connected CAR : Benefits from an Intent Policy framework","authors":"Jose Soriano, Guillermo Jiménez, Ernesto Correa, Noel Ruiz","doi":"10.1109/HPSR52026.2021.9481853","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481853","url":null,"abstract":"Car Manufacturer has to address today growing threats, cars have been incrementally becoming more complex with more code and on the other hand they have to maintain its components during extended life spans of several years compared with other industries. This, together with the increasing connectivity thanks to the connected car and 5G, is becoming a major concern for the industry.FISHY offers a prime opportunity to address some of these challenges since it will offer a homogenous way to tackle some of the threats.The focus of this document is to describe how the supply chain for its IOT components, that are part of the ECU, can be secured to maintain security over time, all using surveillance techniques such as continuous vulnerability management or firmware and software updates using out-of-band channels.Finally, we will discuss the importance of security maintain-ability as a key enabler for long-term crypto-based protection.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126914663","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}