Firewalls for IoT devices can be enforced at the gateway or at the cloud. Utilizing a fog based architecture, firewalls can also be enforced at fog layer. Depending on where the firewall is running, varying delays and overhead will be experienced by IoT devices. Some IoT devices are sensitive to the incurred delays. So choosing the most suitable platform to enforce firewall for each individual device under the different load conditions is important. In this work, we present a delay-aware IoT firewall enforcing mechanism using fog-cloud based architecture.
{"title":"Enforcing delay-aware fog-cloud based IoT firewall (Work In Progress)","authors":"Towhidul Islam, Asif Ahmed, Raihan Tanvir, Rezwana Reaz","doi":"10.1109/NCA57778.2022.10013561","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013561","url":null,"abstract":"Firewalls for IoT devices can be enforced at the gateway or at the cloud. Utilizing a fog based architecture, firewalls can also be enforced at fog layer. Depending on where the firewall is running, varying delays and overhead will be experienced by IoT devices. Some IoT devices are sensitive to the incurred delays. So choosing the most suitable platform to enforce firewall for each individual device under the different load conditions is important. In this work, we present a delay-aware IoT firewall enforcing mechanism using fog-cloud based architecture.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117347093","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}
Pub Date : 2022-12-14DOI: 10.1109/NCA57778.2022.10013531
Giovanni Merlino, R. Asorey-Cacheda, L. D'Agati, F. Longo, A. García-Sánchez, J. García-Haro, A. Puliafito
The development of Low-Power Wide-Area Networks (LPWAN) has significantly boosted the uptake of Internet of Things technologies, fostering their adoption in such domains as Smart Cities and Industry 4.0. In the context of LPWANs, LoRa is one of the most promising developments, experiencing massive growth in recent years. This situation has led to the steadily growing trend of redundant deployments across locations, or scenarios, where it would be more natural to be able to leverage (e.g., rent) LoRa infrastructure belonging to a third party. Key to reversing this unsustainable trend is roaming approaches. Although the LoRa specifications define mechanisms for roaming, gaps and challenges make roaming difficult to deploy and operate in real-world scenarios. This paper analyzes these concerns and proposes a novel architecture compliant with the LoRa specification to design and accommodate roaming services in a consistent, efficient, and scalable way.
{"title":"Infrastructure-centric, NetworkServer-agnostic LoRaWAN Roaming","authors":"Giovanni Merlino, R. Asorey-Cacheda, L. D'Agati, F. Longo, A. García-Sánchez, J. García-Haro, A. Puliafito","doi":"10.1109/NCA57778.2022.10013531","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013531","url":null,"abstract":"The development of Low-Power Wide-Area Networks (LPWAN) has significantly boosted the uptake of Internet of Things technologies, fostering their adoption in such domains as Smart Cities and Industry 4.0. In the context of LPWANs, LoRa is one of the most promising developments, experiencing massive growth in recent years. This situation has led to the steadily growing trend of redundant deployments across locations, or scenarios, where it would be more natural to be able to leverage (e.g., rent) LoRa infrastructure belonging to a third party. Key to reversing this unsustainable trend is roaming approaches. Although the LoRa specifications define mechanisms for roaming, gaps and challenges make roaming difficult to deploy and operate in real-world scenarios. This paper analyzes these concerns and proposes a novel architecture compliant with the LoRa specification to design and accommodate roaming services in a consistent, efficient, and scalable way.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127656955","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}
Pub Date : 2022-12-14DOI: 10.1109/NCA57778.2022.10013513
S. Dolev, Yaniv Kleinman
A new CRT-based positive (non-zero) secret-sharing scheme with perfect information-theoretic (PIT) security and multiplicative homomorphism is presented. The scheme is designed to support the evaluation of multiplications of non-zero secrets of multiplicative groups.Our CRT-based scheme is partially homomorphic, supporting homomorphic multiplications. Nevertheless, it has the potential to be regarded as fully homomorphic for practical scenarios, such as bounded-sized multi-cloud databases.
{"title":"Multiplicative Partially Homomorphic CRT Secret Sharing : (Preliminary Version)","authors":"S. Dolev, Yaniv Kleinman","doi":"10.1109/NCA57778.2022.10013513","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013513","url":null,"abstract":"A new CRT-based positive (non-zero) secret-sharing scheme with perfect information-theoretic (PIT) security and multiplicative homomorphism is presented. The scheme is designed to support the evaluation of multiplications of non-zero secrets of multiplicative groups.Our CRT-based scheme is partially homomorphic, supporting homomorphic multiplications. Nevertheless, it has the potential to be regarded as fully homomorphic for practical scenarios, such as bounded-sized multi-cloud databases.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134069220","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}
Pub Date : 2022-12-14DOI: 10.1109/NCA57778.2022.10013545
Fadoua Debbabi, Raouia Taktak, Rihab Jmal, L. Chaari, R. Aguiar
The Beyond 5G (B5G) networks vision afford wireless access to a vertical market with varying Quality of Service (QoS) requirements. Network Slicing (NS) is one of the key features that offers the opportunity to have a logical network that affects the market model of these verticals. Accordingly, Network Slicing opens the door to new market players including the Infrastructure Provider (InP) and the Virtual Network Operator (VNO). The InP is the owner of the infrastructure that supports several types of slices. The VNO will buy network resources (i.e., bandwidth) from the InP in order to provide a particular service to its users. Consequently, deciding on the optimal resources allocation among VNO users while maximizing the revenue of the InP has become a fundamental issue that needs to be solved. Previous works have presented optimal solutions for resources allocation and focused mainly on a single scenario based on pricing mechanisms. In this paper, we propose an inter-slice resources allocation based on multiple sets, namely customer residential profile, industry coverage, and business area. We propose an Integer Linear Programming (ILP) formulation to the problem, describe an admission control scheme and devise a greedy-based heuristic to solve the problem.
{"title":"Inter-slice B5G Bandwidth Resource Allocation","authors":"Fadoua Debbabi, Raouia Taktak, Rihab Jmal, L. Chaari, R. Aguiar","doi":"10.1109/NCA57778.2022.10013545","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013545","url":null,"abstract":"The Beyond 5G (B5G) networks vision afford wireless access to a vertical market with varying Quality of Service (QoS) requirements. Network Slicing (NS) is one of the key features that offers the opportunity to have a logical network that affects the market model of these verticals. Accordingly, Network Slicing opens the door to new market players including the Infrastructure Provider (InP) and the Virtual Network Operator (VNO). The InP is the owner of the infrastructure that supports several types of slices. The VNO will buy network resources (i.e., bandwidth) from the InP in order to provide a particular service to its users. Consequently, deciding on the optimal resources allocation among VNO users while maximizing the revenue of the InP has become a fundamental issue that needs to be solved. Previous works have presented optimal solutions for resources allocation and focused mainly on a single scenario based on pricing mechanisms. In this paper, we propose an inter-slice resources allocation based on multiple sets, namely customer residential profile, industry coverage, and business area. We propose an Integer Linear Programming (ILP) formulation to the problem, describe an admission control scheme and devise a greedy-based heuristic to solve the problem.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122168808","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}
Pub Date : 2022-12-14DOI: 10.1109/NCA57778.2022.10013643
A. Venturi, Claudio Zanasi, Mirco Marchetti, M. Colajanni
The rise of sequential Machine Learning (ML) methods has paved the way for a new generation of Network Intrusion Detection Systems (NIDS) which base their classification on the temporal patterns exhibited by malicious traffic. Previous work presents successful algorithms in this field, but just a few attempts try to assess their robustness in real-world contexts. In this paper, we aim to fill this gap by presenting a novel evaluation methodology. In particular, we propose a new time-based adversarial attack in which we simulate a delay in the malicious communications that changes the arrangement of the samples in the test set. Moreover, we design an innovative evaluation technique simulating a worst-case training scenario in which the last portion of the training set does not include any malicious flow. Through them, we can evaluate how much sequential ML-based NIDS are sensible to modifications that an adaptive attacker might apply at temporal level, and we can verify their robustness to the unpredictable traffic produced by modern networks. Our experimental campaign validates our proposal against a recent NIDS trained on a public dataset for botnet detection. The results demonstrate its high resistance to temporal adversarial attacks, but also a drastic performance drop when even just 1% of benign flows are injected at the end of the training set. Our findings raise questions about the reliable deployment of sequential ML-NIDS in practice, and at the same time can guide researchers to develop more robust defensive tools in the future.
{"title":"Robustness Evaluation of Network Intrusion Detection Systems based on Sequential Machine Learning","authors":"A. Venturi, Claudio Zanasi, Mirco Marchetti, M. Colajanni","doi":"10.1109/NCA57778.2022.10013643","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013643","url":null,"abstract":"The rise of sequential Machine Learning (ML) methods has paved the way for a new generation of Network Intrusion Detection Systems (NIDS) which base their classification on the temporal patterns exhibited by malicious traffic. Previous work presents successful algorithms in this field, but just a few attempts try to assess their robustness in real-world contexts. In this paper, we aim to fill this gap by presenting a novel evaluation methodology. In particular, we propose a new time-based adversarial attack in which we simulate a delay in the malicious communications that changes the arrangement of the samples in the test set. Moreover, we design an innovative evaluation technique simulating a worst-case training scenario in which the last portion of the training set does not include any malicious flow. Through them, we can evaluate how much sequential ML-based NIDS are sensible to modifications that an adaptive attacker might apply at temporal level, and we can verify their robustness to the unpredictable traffic produced by modern networks. Our experimental campaign validates our proposal against a recent NIDS trained on a public dataset for botnet detection. The results demonstrate its high resistance to temporal adversarial attacks, but also a drastic performance drop when even just 1% of benign flows are injected at the end of the training set. Our findings raise questions about the reliable deployment of sequential ML-NIDS in practice, and at the same time can guide researchers to develop more robust defensive tools in the future.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121078071","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}
Pub Date : 2022-12-14DOI: 10.1109/NCA57778.2022.10013541
Slim Abbes, S. Rekhis
The Internet of Vehicles (IoV) has been recognized as a powerful application of the Internet of Things (IoT) in the Intelligent Transportation System (ITS), providing intelligence for interconnection between devices, interaction with the environment, and thus, greater efficiency in sensor data exploitation. Therefore, leveraging the huge capability of sensors embedded in vehicles to offer a Sensing As A Service (Se-aaS) represents a great solution to exploit under-used sensor resources and continue providing sensors despite their positions and mobility patterns. Nevertheless, the high network mobility and the fast topology changes in IoV impact the vehicle availability and complicate the service provision. To this aim, we propose a vehicle sensor virtualization in a Cloud IoV architecture that encompasses functional blocks of mobile sensor suppliers, Sensor Cloud Service Provider (SCSP), and service consumers. Moreover, we propose a reinforcement learning-based solution for vehicle sensor selection to predict and dynamically select the physical sensors composing the vehicle virtual sensor. The conducted simulations show the effectiveness of the proposed solution.
{"title":"Reinforcement Learning-based Virtual Sensors Provision in Internet of Vehicles (IoV)","authors":"Slim Abbes, S. Rekhis","doi":"10.1109/NCA57778.2022.10013541","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013541","url":null,"abstract":"The Internet of Vehicles (IoV) has been recognized as a powerful application of the Internet of Things (IoT) in the Intelligent Transportation System (ITS), providing intelligence for interconnection between devices, interaction with the environment, and thus, greater efficiency in sensor data exploitation. Therefore, leveraging the huge capability of sensors embedded in vehicles to offer a Sensing As A Service (Se-aaS) represents a great solution to exploit under-used sensor resources and continue providing sensors despite their positions and mobility patterns. Nevertheless, the high network mobility and the fast topology changes in IoV impact the vehicle availability and complicate the service provision. To this aim, we propose a vehicle sensor virtualization in a Cloud IoV architecture that encompasses functional blocks of mobile sensor suppliers, Sensor Cloud Service Provider (SCSP), and service consumers. Moreover, we propose a reinforcement learning-based solution for vehicle sensor selection to predict and dynamically select the physical sensors composing the vehicle virtual sensor. The conducted simulations show the effectiveness of the proposed solution.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125533080","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}
Pub Date : 2022-12-14DOI: 10.1109/NCA57778.2022.10013517
Michel Neves, Andre Riker, J. Nobre, A. Abelém, B. Dalmazo
Network traffic engineering aims at the network quality, optimizing routes and detecting network attacks. In this context, traffic prediction is an essential tool to capture the underlying behavior of a network. Therefore, this work proposes a modularization architecture for volumetric prediction models, allowing switching between models and setups at runtime in controllers of Software Defined Networks (SDN), dealing with short time series and delivering the data already processed for the prediction. The proposed architecture compares the results from four traditional predictors based on short-range time dependency.
{"title":"Modularized and Contract-Based Prediction Models in Programmable Networks","authors":"Michel Neves, Andre Riker, J. Nobre, A. Abelém, B. Dalmazo","doi":"10.1109/NCA57778.2022.10013517","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013517","url":null,"abstract":"Network traffic engineering aims at the network quality, optimizing routes and detecting network attacks. In this context, traffic prediction is an essential tool to capture the underlying behavior of a network. Therefore, this work proposes a modularization architecture for volumetric prediction models, allowing switching between models and setups at runtime in controllers of Software Defined Networks (SDN), dealing with short time series and delivering the data already processed for the prediction. The proposed architecture compares the results from four traditional predictors based on short-range time dependency.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126691981","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}
Pub Date : 2022-12-14DOI: 10.1109/NCA57778.2022.10013607
Ricardo Grade, Samih Eisa, M. Pardal
Nowadays, tourists turn to digital platforms to discover new places to explore. CROSS City is a smart tourism mobile application that enhances the user experience of tourists visiting points of interest in a route by rewarding them in the end, if they actually visited all locations. From a technical standpoint, the user location is certified resorting to strategies that take advantage of both the diversity of the existing Wi-Fi network infrastructure throughout the city, as well as the presence of other users at the same site using Bluetooth. This work developed a new, peer-to-peer location certification strategy and added gamification elements to encourage users to keep the wireless radios turned on and use the app more. This work was evaluated both in laboratory experiments and with users in a real-world scenario which demonstrated that the new Bluetooth peer-based strategy is both feasible and resistant to collusion attacks.
{"title":"Bluetooth Peer-to-Peer Location Certification with a Gamified Mobile Application","authors":"Ricardo Grade, Samih Eisa, M. Pardal","doi":"10.1109/NCA57778.2022.10013607","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013607","url":null,"abstract":"Nowadays, tourists turn to digital platforms to discover new places to explore. CROSS City is a smart tourism mobile application that enhances the user experience of tourists visiting points of interest in a route by rewarding them in the end, if they actually visited all locations. From a technical standpoint, the user location is certified resorting to strategies that take advantage of both the diversity of the existing Wi-Fi network infrastructure throughout the city, as well as the presence of other users at the same site using Bluetooth. This work developed a new, peer-to-peer location certification strategy and added gamification elements to encourage users to keep the wireless radios turned on and use the app more. This work was evaluated both in laboratory experiments and with users in a real-world scenario which demonstrated that the new Bluetooth peer-based strategy is both feasible and resistant to collusion attacks.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127238275","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}
Pub Date : 2022-12-14DOI: 10.1109/NCA57778.2022.10013527
A. Venturi, Dario Stabili, Francesco Pollicino, Emanuele Bianchi, Mirco Marchetti
This paper presents a comparative analysis of different Machine Learning-based detection algorithms designed for Controller Area Network (CAN) communication on three different datasets. This work focuses on addressing the current limitations of related scientific literature, related to the quality of the publicly available datasets and to the lack of public implementations of the detection solutions presented in literature. Since these issues are preventing the reproducibility of published results and their comparison with novel detection solutions, we remark that it is necessary that all security researchers working in this field start to address them properly to advance the current state-of-the-art in CAN intrusion detection systems. This paper strives to solve these issues by presenting a comparison of existing works on publicly available datasets.
{"title":"Comparison of Machine Learning-based anomaly detectors for Controller Area Network","authors":"A. Venturi, Dario Stabili, Francesco Pollicino, Emanuele Bianchi, Mirco Marchetti","doi":"10.1109/NCA57778.2022.10013527","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013527","url":null,"abstract":"This paper presents a comparative analysis of different Machine Learning-based detection algorithms designed for Controller Area Network (CAN) communication on three different datasets. This work focuses on addressing the current limitations of related scientific literature, related to the quality of the publicly available datasets and to the lack of public implementations of the detection solutions presented in literature. Since these issues are preventing the reproducibility of published results and their comparison with novel detection solutions, we remark that it is necessary that all security researchers working in this field start to address them properly to advance the current state-of-the-art in CAN intrusion detection systems. This paper strives to solve these issues by presenting a comparison of existing works on publicly available datasets.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129014452","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}
Pub Date : 2022-12-14DOI: 10.1109/NCA57778.2022.10013537
L. Rossi, Luca Ferretti
Modern browser technologies allow running highly portable and usable complex applications. However, the inability to access all the operating system features may limit their features or performance when compared to native software in certain scenarios. We investigate the design of peer-to-peer (P2P) networks of interconnected browsers to improve applications interconnecting users, such as videotelephony, messaging and gaming. Although peer-to-peer protocols are well-established in the literature, known designs and implementations cannot be executed on browsers due to constraints of browser environments. We propose WebDHT, a webassembly library for creating P2P networks among browsers which offers topic-based peer-discovery features and integrates usable identity authentication mechanisms. WebDHT implements a variant of the Kademlia protocol based on distributed hash tables (DHT) adapted to support WebRTC protocol. WebDHT requires a native server to be available only for network bootstrap, but leverages existing browsers connected to the DHT to decentralize WebRTC signaling backends. We propose an open-source implementation and two demonstrative applications for users messaging and multimedia streaming, and analyze limitations and future work for designing better browser-compatible P2P networks.
{"title":"WebDHT: browser-compatible distributed hash table for decentralized Web applications","authors":"L. Rossi, Luca Ferretti","doi":"10.1109/NCA57778.2022.10013537","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013537","url":null,"abstract":"Modern browser technologies allow running highly portable and usable complex applications. However, the inability to access all the operating system features may limit their features or performance when compared to native software in certain scenarios. We investigate the design of peer-to-peer (P2P) networks of interconnected browsers to improve applications interconnecting users, such as videotelephony, messaging and gaming. Although peer-to-peer protocols are well-established in the literature, known designs and implementations cannot be executed on browsers due to constraints of browser environments. We propose WebDHT, a webassembly library for creating P2P networks among browsers which offers topic-based peer-discovery features and integrates usable identity authentication mechanisms. WebDHT implements a variant of the Kademlia protocol based on distributed hash tables (DHT) adapted to support WebRTC protocol. WebDHT requires a native server to be available only for network bootstrap, but leverages existing browsers connected to the DHT to decentralize WebRTC signaling backends. We propose an open-source implementation and two demonstrative applications for users messaging and multimedia streaming, and analyze limitations and future work for designing better browser-compatible P2P networks.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125633426","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
扫码关注我们
求助内容：
应助结果提醒方式：