Pub Date : 2022-12-14DOI: 10.1109/NCA57778.2022.10013642
Anshuman Misra, A. Kshemkalyani
Causal ordering of broadcasts is a widely used requirement in collaborative distributed software systems. We consider Byzantine-tolerant causal ordering of broadcasts in a replicated data store implemented over an incomplete graph network topology, wherein messages of the broadcast are sent via flooding. We propose two protocols to achieve this. The incomplete graph topology also occurs naturally in wireless networks and in overlay peer-to-peer networks. We identify four properties – safety, liveness, no impersonation, and no avatars – that a Byzantine-tolerant causal broadcast algorithm for a replicated data store over an incomplete graph must satisfy. We also reformulate the traditional properties – validity, integrity, self-delivery, and reliability (or termination) – specified for a complete graph in the literature for a replicated data store system over an incomplete graph topology. We then analyze whether Byzantine processes can mount attacks on these properties in our two protocols. We show results for the classical communication model and the local broadcast model.
{"title":"Byzantine Fault-Tolerant Causal Broadcast on Incomplete Graphs","authors":"Anshuman Misra, A. Kshemkalyani","doi":"10.1109/NCA57778.2022.10013642","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013642","url":null,"abstract":"Causal ordering of broadcasts is a widely used requirement in collaborative distributed software systems. We consider Byzantine-tolerant causal ordering of broadcasts in a replicated data store implemented over an incomplete graph network topology, wherein messages of the broadcast are sent via flooding. We propose two protocols to achieve this. The incomplete graph topology also occurs naturally in wireless networks and in overlay peer-to-peer networks. We identify four properties – safety, liveness, no impersonation, and no avatars – that a Byzantine-tolerant causal broadcast algorithm for a replicated data store over an incomplete graph must satisfy. We also reformulate the traditional properties – validity, integrity, self-delivery, and reliability (or termination) – specified for a complete graph in the literature for a replicated data store system over an incomplete graph topology. We then analyze whether Byzantine processes can mount attacks on these properties in our two protocols. We show results for the classical communication model and the local broadcast model.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"118 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":"127992763","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.10013515
Hajer Nabli, Ines Regaig, Raoudha Ben Djemaa, Layth Sliman
Technology is always improving, which raises standards of living and makes life easier for people. A significant portion of these advancements are aimed at healthcare systems, with a particular emphasis in recent years on assisting elderly people in maintaining their independence in their homes. Data is collected continuously from various sensors and is used for contextual anomaly detection. As a result, the amount of sensor contextual data grows exponentially. These sensor data’s ability to be shared, reused, and interpreted was, however, constrained by the lack of syntactic or semantic integrity. On the other hand, understanding the Quality of Context (QoC) is acknowledged as a crucial component for the health monitoring system’s performance. The QoC has a significant impact on how contextual data behaves in health monitoring systems. As a result, health monitoring systems need to manage the QoC they rely on carefully and effectively. To address these problems, the main goal of this study is to develop a Context and Quality of Context (CQoC) ontology, which offers a framework for handling and utilizing contextual data, any QoC criteria, as well as context interpretation in a health monitoring system. Another purpose of this paper is the development of a Semantic QoC-aware Health Monitoring System (SQoCHMS) for the elderly that assures their safety and issues early alerts to help them deal with minor everyday problems related to such disorders.
{"title":"Never Alone: a Quality of Context-aware Monitoring System for Aging in Place Smart Home","authors":"Hajer Nabli, Ines Regaig, Raoudha Ben Djemaa, Layth Sliman","doi":"10.1109/NCA57778.2022.10013515","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013515","url":null,"abstract":"Technology is always improving, which raises standards of living and makes life easier for people. A significant portion of these advancements are aimed at healthcare systems, with a particular emphasis in recent years on assisting elderly people in maintaining their independence in their homes. Data is collected continuously from various sensors and is used for contextual anomaly detection. As a result, the amount of sensor contextual data grows exponentially. These sensor data’s ability to be shared, reused, and interpreted was, however, constrained by the lack of syntactic or semantic integrity. On the other hand, understanding the Quality of Context (QoC) is acknowledged as a crucial component for the health monitoring system’s performance. The QoC has a significant impact on how contextual data behaves in health monitoring systems. As a result, health monitoring systems need to manage the QoC they rely on carefully and effectively. To address these problems, the main goal of this study is to develop a Context and Quality of Context (CQoC) ontology, which offers a framework for handling and utilizing contextual data, any QoC criteria, as well as context interpretation in a health monitoring system. Another purpose of this paper is the development of a Semantic QoC-aware Health Monitoring System (SQoCHMS) for the elderly that assures their safety and issues early alerts to help them deal with minor everyday problems related to such disorders.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"23 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":"132932771","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.10013626
Imene Ben Hafaiedh
Currently, the IoT performs important functions in several diverse applications. As a consequence of such diversity, there are also several issues to deal with, and the communication of devices is one of these prominent challenges. Due to its heterogeneity, the communication of IoT devices is an eminent system function, and, thus, distinct communication protocols have been proposed for these systems. Even under the same operating conditions, the performance of these protocols can differ significantly. In this paper, we present a performance evaluation of IoT communication protocols for the application layer. We address the problem of the efficiency of IoT protocols by means of a formal model-based approach, which encompasses features of various protocols and aims at analyzing and comparing the performance of these protocols. The proposed models have been proven useful by considering the verification and comparison of three well-known IoT communication protocols, namely MQTT, AMQP and CoAP protocols.
{"title":"Formal models for the verification, performance evaluation, and comparison of IoT communication protocols","authors":"Imene Ben Hafaiedh","doi":"10.1109/NCA57778.2022.10013626","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013626","url":null,"abstract":"Currently, the IoT performs important functions in several diverse applications. As a consequence of such diversity, there are also several issues to deal with, and the communication of devices is one of these prominent challenges. Due to its heterogeneity, the communication of IoT devices is an eminent system function, and, thus, distinct communication protocols have been proposed for these systems. Even under the same operating conditions, the performance of these protocols can differ significantly. In this paper, we present a performance evaluation of IoT communication protocols for the application layer. We address the problem of the efficiency of IoT protocols by means of a formal model-based approach, which encompasses features of various protocols and aims at analyzing and comparing the performance of these protocols. The proposed models have been proven useful by considering the verification and comparison of three well-known IoT communication protocols, namely MQTT, AMQP and CoAP protocols.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"87 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":"115565815","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}
Video streaming is the dominating traffic in today’s data-sharing world. Media service providers stream video content for their viewers, while worldwide users create and distribute videos using mobile or video system applications that significantly increase the traffic share. We propose a multilayer and pipeline encoding on the computing continuum (MPEC2) method that addresses the key technical challenge of high-price and computational complexity of video encoding. MPEC2 splits the video encoding into several tasks scheduled on appropriately selected Cloud and Fog computing instance types that satisfy the media service provider and user priorities in terms of time and cost. In the first phase, MPEC2 uses a multilayer resource partitioning method to explore the instance types for encoding a video segment. In the second phase, it distributes the independent segment encoding tasks in a pipeline model on the underlying instances. We evaluate MPEC2 on a federated computing continuum encompassing Amazon Web Services (AWS) EC2 Cloud and Exoscale Fog instances distributed in seven geographical locations. Experimental results show that MPEC2 achieves 24% faster completion time and 60% lower cost for video encoding compared to resource allocation related methods. When compared with baseline methods, MPEC2 yields 40%– 50% lower completion time and 5%–60% reduced total cost.
{"title":"MPEC2: Multilayer and Pipeline Video Encoding on the Computing Continuum","authors":"Samira Afzal, Zahra Najafabadi Samani, Narges Mehran, C. Timmerer, R.-C. Prodan","doi":"10.1109/NCA57778.2022.10013519","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013519","url":null,"abstract":"Video streaming is the dominating traffic in today’s data-sharing world. Media service providers stream video content for their viewers, while worldwide users create and distribute videos using mobile or video system applications that significantly increase the traffic share. We propose a multilayer and pipeline encoding on the computing continuum (MPEC2) method that addresses the key technical challenge of high-price and computational complexity of video encoding. MPEC2 splits the video encoding into several tasks scheduled on appropriately selected Cloud and Fog computing instance types that satisfy the media service provider and user priorities in terms of time and cost. In the first phase, MPEC2 uses a multilayer resource partitioning method to explore the instance types for encoding a video segment. In the second phase, it distributes the independent segment encoding tasks in a pipeline model on the underlying instances. We evaluate MPEC2 on a federated computing continuum encompassing Amazon Web Services (AWS) EC2 Cloud and Exoscale Fog instances distributed in seven geographical locations. Experimental results show that MPEC2 achieves 24% faster completion time and 60% lower cost for video encoding compared to resource allocation related methods. When compared with baseline methods, MPEC2 yields 40%– 50% lower completion time and 5%–60% reduced total cost.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"49 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131652210","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.10013538
Yotam Ashkenazi, S. Dolev
This paper demonstrates and proves that the coordination of actions in a distributed swarm can be enhanced by using quantum entanglement. In particular, we focus on• Global and local simultaneous random walks, using entangled qubits that collapse into the same (or opposite) direction, either random direction or totally controlled simultaneous movements.• Identifying eavesdropping from malicious eavesdroppers aimed at disturbing the simultaneous random walks by using entangled qubits that were sent at random or with predefined bases.
{"title":"Distributed Coordination Based on Quantum Entanglement (Work in Progress)","authors":"Yotam Ashkenazi, S. Dolev","doi":"10.1109/NCA57778.2022.10013538","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013538","url":null,"abstract":"This paper demonstrates and proves that the coordination of actions in a distributed swarm can be enhanced by using quantum entanglement. In particular, we focus on• Global and local simultaneous random walks, using entangled qubits that collapse into the same (or opposite) direction, either random direction or totally controlled simultaneous movements.• Identifying eavesdropping from malicious eavesdroppers aimed at disturbing the simultaneous random walks by using entangled qubits that were sent at random or with predefined bases.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"65 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":"129106694","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.10013616
Souvik Deb, S. K. Ghosh, Sasthi C. Ghosh
In this work, a network selection mechanism for re-configurable intelligent surface (RIS) assisted network has been proposed. The goal of the proposed mechanism is to select appropriate base station (BS) or BS-RIS pair to maximize user throughput while satisfying the delay and reliability constraints of uRLLC users. First, the network selection mechanism for RIS assisted network has been formulated as multi arm bandit (MAB) problem; Then, based on the formulation, a network selection strategy has been proposed. Finally, through extensive system level simulations, it has been shown that the proposed scheme outperforms the existing A3 handover scheme in terms of reliability and user throughput.
{"title":"MAB based Network Selection mechanism for URLLC users in RIS assisted network","authors":"Souvik Deb, S. K. Ghosh, Sasthi C. Ghosh","doi":"10.1109/NCA57778.2022.10013616","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013616","url":null,"abstract":"In this work, a network selection mechanism for re-configurable intelligent surface (RIS) assisted network has been proposed. The goal of the proposed mechanism is to select appropriate base station (BS) or BS-RIS pair to maximize user throughput while satisfying the delay and reliability constraints of uRLLC users. First, the network selection mechanism for RIS assisted network has been formulated as multi arm bandit (MAB) problem; Then, based on the formulation, a network selection strategy has been proposed. Finally, through extensive system level simulations, it has been shown that the proposed scheme outperforms the existing A3 handover scheme in terms of reliability and user throughput.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"1 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":"130199744","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-07-14DOI: 10.1109/NCA57778.2022.10013530
Ziran Min, Shashank Shekhar, C. Mahmoudi, Valerio Formicola, S. Gokhale, A. Gokhale
This paper addresses the challenges of delivering fine-grained Quality of Service (QoS) and communication determinism over 5G wireless networks for real-time and autonomous needs of Industrial Internet of Things (IIoT) applications while effectively sharing network resources. Specifically, this work presents DANSM, a software-defined, dynamic and autonomous network slice management middleware for 5G-based IIoT use cases, such as adaptive robotic repair. The novelty of our approach lies in (1) the use of multiple M/M/1 queues to formulate a 5G network resource scheduling optimization problem comprising service-level and system-level objectives; (2) the design of a heuristics-based solution to overcome the NP-hard properties of this optimization problem, and (3) the implementation of a software-defined solution that incorporates the heuristics to dynamically and autonomously provision and manage 5G network slices that deliver predictable communications to IIoT use cases. Empirical studies evaluating DANSM on our testbed comprising a Free5GC-based core and UERANSIM-based simulations reveal that the software-defined DANSM solution can efficiently balance the traffic load in the data plane thereby reducing the end-to-end response time and improve the service performance by completing 34% more subtasks than a Modified Greedy Algorithm (MGA), 64% more subtasks than First Fit Descending (FFD) and 22% more subtasks than Best Fit Descending (BFD) approaches all while minimizing operational costs.
{"title":"Software-defined Dynamic 5G Network Slice Management for Industrial Internet of Things","authors":"Ziran Min, Shashank Shekhar, C. Mahmoudi, Valerio Formicola, S. Gokhale, A. Gokhale","doi":"10.1109/NCA57778.2022.10013530","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013530","url":null,"abstract":"This paper addresses the challenges of delivering fine-grained Quality of Service (QoS) and communication determinism over 5G wireless networks for real-time and autonomous needs of Industrial Internet of Things (IIoT) applications while effectively sharing network resources. Specifically, this work presents DANSM, a software-defined, dynamic and autonomous network slice management middleware for 5G-based IIoT use cases, such as adaptive robotic repair. The novelty of our approach lies in (1) the use of multiple M/M/1 queues to formulate a 5G network resource scheduling optimization problem comprising service-level and system-level objectives; (2) the design of a heuristics-based solution to overcome the NP-hard properties of this optimization problem, and (3) the implementation of a software-defined solution that incorporates the heuristics to dynamically and autonomously provision and manage 5G network slices that deliver predictable communications to IIoT use cases. Empirical studies evaluating DANSM on our testbed comprising a Free5GC-based core and UERANSIM-based simulations reveal that the software-defined DANSM solution can efficiently balance the traffic load in the data plane thereby reducing the end-to-end response time and improve the service performance by completing 34% more subtasks than a Modified Greedy Algorithm (MGA), 64% more subtasks than First Fit Descending (FFD) and 22% more subtasks than Best Fit Descending (BFD) approaches all while minimizing operational costs.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115120454","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-02-07DOI: 10.1109/NCA57778.2022.10013556
K. Korkmaz, Joachim Bruneau-Queyreix, Sonia Ben Mokhtar, Laurent R'eveillere
Most of today’s online services (e.g., social networks, search engines, marketplace places) are centralized, which most users recognize as unsatisfactory for various reasons (e.g., centralized governance, censorship, loss of control over personal data). Blockchain technologies promise a new Web revolution (Web 3.0) through the decentralization of online services. However, one of the fundamental limitations for this revolution to happen at a planetary scale is the poor performance of today’s permissionless blockchains. In this paper, we propose ALDER, a generic construction that multiplexes off-the-shelf permissionless blockchain protocols to address the performance bottleneck due to store-validate-forward block dissemination techniques in blockchain protocols. We apply ALDER to two representative blockchains, namely Algorand (Proof-of-Stake) and Bitcoin (Proof-of-Work), to illustrate the benefits it brings to blockchain performance. Our evaluations show that ALDER can drastically improve the throughput of blockchains when bottlenecks exist.
{"title":"ALDER: Unlocking blockchain performance by multiplexing consensus protocols","authors":"K. Korkmaz, Joachim Bruneau-Queyreix, Sonia Ben Mokhtar, Laurent R'eveillere","doi":"10.1109/NCA57778.2022.10013556","DOIUrl":"https://doi.org/10.1109/NCA57778.2022.10013556","url":null,"abstract":"Most of today’s online services (e.g., social networks, search engines, marketplace places) are centralized, which most users recognize as unsatisfactory for various reasons (e.g., centralized governance, censorship, loss of control over personal data). Blockchain technologies promise a new Web revolution (Web 3.0) through the decentralization of online services. However, one of the fundamental limitations for this revolution to happen at a planetary scale is the poor performance of today’s permissionless blockchains. In this paper, we propose ALDER, a generic construction that multiplexes off-the-shelf permissionless blockchain protocols to address the performance bottleneck due to store-validate-forward block dissemination techniques in blockchain protocols. We apply ALDER to two representative blockchains, namely Algorand (Proof-of-Stake) and Bitcoin (Proof-of-Work), to illustrate the benefits it brings to blockchain performance. Our evaluations show that ALDER can drastically improve the throughput of blockchains when bottlenecks exist.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124174662","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
扫码关注我们
求助内容：
应助结果提醒方式：