Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843566
Abdeldjalil Ikhelef, M. Saidi, Shuopeng Li, Ken Chen
During the last decade, we are witnessing the emergence of NFV and SDN to reduce CAPEX and OPEX. Under the SDN paradigm and thanks to NFV, a service can be swiftly deployed by the chaining of several VNFs forming an SFC running on a virtualized infrastructure. Nowadays, there are still quite a number of issues related to SFCs, among them, the optimal placement of SFC components. In this paper, we focused on the variant of the resource allocation cost optimization problem of VNF placement and chaining for limited resources on the servers. After proving that the problem of VNF placement is NP-Hard and equivalent to the multiple knapsack problem, we proposed a genetic algorithm-based meta-heuristic to solve large instance of our VNF placement and chaining problem variant. Simulation results show that our genetic algorithms are efficient since they reduce the SFC mean cost and improve the accepted requests ratio.
{"title":"A Knapsack-based Optimization Algorithm for VNF Placement and Chaining Problem","authors":"Abdeldjalil Ikhelef, M. Saidi, Shuopeng Li, Ken Chen","doi":"10.1109/LCN53696.2022.9843566","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843566","url":null,"abstract":"During the last decade, we are witnessing the emergence of NFV and SDN to reduce CAPEX and OPEX. Under the SDN paradigm and thanks to NFV, a service can be swiftly deployed by the chaining of several VNFs forming an SFC running on a virtualized infrastructure. Nowadays, there are still quite a number of issues related to SFCs, among them, the optimal placement of SFC components. In this paper, we focused on the variant of the resource allocation cost optimization problem of VNF placement and chaining for limited resources on the servers. After proving that the problem of VNF placement is NP-Hard and equivalent to the multiple knapsack problem, we proposed a genetic algorithm-based meta-heuristic to solve large instance of our VNF placement and chaining problem variant. Simulation results show that our genetic algorithms are efficient since they reduce the SFC mean cost and improve the accepted requests ratio.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129792571","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-08-22DOI: 10.1109/LCN53696.2022.9843573
Shakil Ahmed, Mohamed Y. Selim, A. Kamal
Recent research on reconfigurable intelligent surfaces (RIS) suggests that the RIS panel, containing passive elements, enhances channel performance for the internet of things (IoT) systems by reflecting transmitted signals to the receiving nodes. This paper investigates RIS panel assisted-wireless network to instigate minimal base station (BS) transmit power in the form of energy harvesting for batteryless IoT sensors to maximize bits transmission in the significant multi-path environment, such as urban areas. Batteryless IoT sensors harvest energy through the RIS panel from external sources, such as from nearby BS radio frequency (RF) signal in the first optimal time frame, for a given time frame. The bits transmission among IoT sensors, followed by a device-to-device (D2D) communications protocol, is maximized using harvested energy in the final optimal time frame. The bits transmission is at least equal to the number of bits sampled by the IoT sensor. We formulate a non-convex mixed-integer non-linear problem to maximize the number of communicating bits subject to energy harvesting from BS RF signals, RIS panel energy consumption, and required time. We propose a robust solution by presenting an iterative algorithm. We perform extensive simulation results based on the 3GPP Urban Micro channel model to validate our model.
{"title":"Enhanced IoT Batteryless D2D Communications Using Reconfigurable Intelligent Surfaces","authors":"Shakil Ahmed, Mohamed Y. Selim, A. Kamal","doi":"10.1109/LCN53696.2022.9843573","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843573","url":null,"abstract":"Recent research on reconfigurable intelligent surfaces (RIS) suggests that the RIS panel, containing passive elements, enhances channel performance for the internet of things (IoT) systems by reflecting transmitted signals to the receiving nodes. This paper investigates RIS panel assisted-wireless network to instigate minimal base station (BS) transmit power in the form of energy harvesting for batteryless IoT sensors to maximize bits transmission in the significant multi-path environment, such as urban areas. Batteryless IoT sensors harvest energy through the RIS panel from external sources, such as from nearby BS radio frequency (RF) signal in the first optimal time frame, for a given time frame. The bits transmission among IoT sensors, followed by a device-to-device (D2D) communications protocol, is maximized using harvested energy in the final optimal time frame. The bits transmission is at least equal to the number of bits sampled by the IoT sensor. We formulate a non-convex mixed-integer non-linear problem to maximize the number of communicating bits subject to energy harvesting from BS RF signals, RIS panel energy consumption, and required time. We propose a robust solution by presenting an iterative algorithm. We perform extensive simulation results based on the 3GPP Urban Micro channel model to validate our model.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130143180","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-08-10DOI: 10.1109/LCN53696.2022.9843323
Rowdy Chotkan, Jérémie Decouchant, Johan Pouwels
Self-Sovereign Identity (SSI) aspires to create a standardised identity layer for the Internet by placing citizens at the centre of their data, thereby weakening the grip of big tech on current digital identities. However, as millions of both physical and digital identities are lost annually, it is also necessary for SSIs to possibly be revoked to prevent misuse. Previous attempts at designing a revocation mechanism typically violate the principles of SSI by relying on central trusted components. This lack of a distributed revocation mechanism hampers the development of SSI. In this paper, we address this limitation and present the first fully distributed SSI revocation mechanism that does not rely on specialised trusted nodes. Our novel gossip-based propagation algorithm disseminates revocations throughout the network and provides nodes with a proof of revocation that enables offline verification of revocations. We demonstrate through simulations that our protocol adequately scales to national levels.
{"title":"Distributed Attestation Revocation in Self-Sovereign Identity","authors":"Rowdy Chotkan, Jérémie Decouchant, Johan Pouwels","doi":"10.1109/LCN53696.2022.9843323","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843323","url":null,"abstract":"Self-Sovereign Identity (SSI) aspires to create a standardised identity layer for the Internet by placing citizens at the centre of their data, thereby weakening the grip of big tech on current digital identities. However, as millions of both physical and digital identities are lost annually, it is also necessary for SSIs to possibly be revoked to prevent misuse. Previous attempts at designing a revocation mechanism typically violate the principles of SSI by relying on central trusted components. This lack of a distributed revocation mechanism hampers the development of SSI. In this paper, we address this limitation and present the first fully distributed SSI revocation mechanism that does not rely on specialised trusted nodes. Our novel gossip-based propagation algorithm disseminates revocations throughout the network and provides nodes with a proof of revocation that enables offline verification of revocations. We demonstrate through simulations that our protocol adequately scales to national levels.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126186919","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-13DOI: 10.1109/LCN53696.2022.9843830
João Tiago, D. Dias, L. Veiga
The InterPlanetary File System (IPFS) is an hypermedia distribution protocol, addressed by content and identities. It aims to make the web faster, safer, and more open. The JavaScript implementation of IPFS runs on the browser, benefiting from the mass adoption potential that it yields. Startrail takes advantage of the IPFS ecosystem and strives to further evolve it, making it more scalable and performant through the implementation of an adaptive network caching mechanism. Our solution aims to add resilience to IPFS and improve its overall scalability, by avoiding overloading the nodes providing highly popular content, particularly during flash-crowd-like conditions where popularity and demand grow suddenly. We add a novel crucial key component to enable an IPFS-based decentralized Content Distribution Network (CDN). Following a peer-to-peer architecture, it runs on a scalable, highly available network of untrusted nodes that distribute immutable authenticated objects which are cached progressively towards the sources of requests.
{"title":"Adaptive Edge Content Delivery Networks for Web-Scale File Systems","authors":"João Tiago, D. Dias, L. Veiga","doi":"10.1109/LCN53696.2022.9843830","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843830","url":null,"abstract":"The InterPlanetary File System (IPFS) is an hypermedia distribution protocol, addressed by content and identities. It aims to make the web faster, safer, and more open. The JavaScript implementation of IPFS runs on the browser, benefiting from the mass adoption potential that it yields. Startrail takes advantage of the IPFS ecosystem and strives to further evolve it, making it more scalable and performant through the implementation of an adaptive network caching mechanism. Our solution aims to add resilience to IPFS and improve its overall scalability, by avoiding overloading the nodes providing highly popular content, particularly during flash-crowd-like conditions where popularity and demand grow suddenly. We add a novel crucial key component to enable an IPFS-based decentralized Content Distribution Network (CDN). Following a peer-to-peer architecture, it runs on a scalable, highly available network of untrusted nodes that distribute immutable authenticated objects which are cached progressively towards the sources of requests.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127733896","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-13DOI: 10.1109/LCN53696.2022.9843795
P. Agostinho, David Dias, L. Veiga
The InterPlanetary File System (IPFS) is a hypermedia distribution protocol enabling the creation of completely distributed applications. One of the most efficient and effective ways to distribute information is through notifications, with a producer of content (publisher) sharing content with other interested parts (subscribers). IPFS already implements topic-based publish-subscribe systems under an experimental flag. The goal of this work is to advance on that, by developing a content-based pub-sub system (with subscriptions as predicates about event content) to disseminate information on top of IPFS in an efficient and decentralized way, leveraging its infrastructure. We design two protocols: ScoutSubs that is completely decentralized; FastDelivery that is centered in the publisher. With these two approaches, we show the different advantages of having each of these protocols simultaneously by comparing ScoutSubs’ full decentralization, and FastDelivery’s centralization at data sources.
{"title":"SmartPubSub: Content-based Pub-Sub on IPFS","authors":"P. Agostinho, David Dias, L. Veiga","doi":"10.1109/LCN53696.2022.9843795","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843795","url":null,"abstract":"The InterPlanetary File System (IPFS) is a hypermedia distribution protocol enabling the creation of completely distributed applications. One of the most efficient and effective ways to distribute information is through notifications, with a producer of content (publisher) sharing content with other interested parts (subscribers). IPFS already implements topic-based publish-subscribe systems under an experimental flag. The goal of this work is to advance on that, by developing a content-based pub-sub system (with subscriptions as predicates about event content) to disseminate information on top of IPFS in an efficient and decentralized way, leveraging its infrastructure. We design two protocols: ScoutSubs that is completely decentralized; FastDelivery that is centered in the publisher. With these two approaches, we show the different advantages of having each of these protocols simultaneously by comparing ScoutSubs’ full decentralization, and FastDelivery’s centralization at data sources.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128461660","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-06-19DOI: 10.1109/LCN53696.2022.9843207
Robert Thompson, Muhammad Ismail, Susmit Shannigrahi
Cities around the world are increasingly promoting electric vehicles (EV) to reduce and ultimately eliminate greenhouse gas emissions. A huge number of EVs will put unprecedented stress on the power grid. To efficiently serve the increased charging load, these EVs need to be charged in a coordinated fashion. One promising coordination strategy is vehicle-to-vehicle (V2V) charging coordination, enabling EVs to sell their surplus energy in an ad-hoc, peer to peer manner. This paper introduces an Information Centric Networking (ICN)-based protocol to support ad-hoc V2V charging coordination (V2V-CC). Our evaluations demonstrate that V2V-CC can provide added flexibility, fault tolerance, and reduced communication latency than a conventional centralized cloud based approach. We show that V2V-CC can achieve a 93% reduction in protocol completion time compared to a conventional approach. We also show that V2V-CC also works well under extreme packet loss, making it ideal for V2V charging coordination.
{"title":"Vehicle-to-Vehicle Charging Coordination over Information Centric Networking","authors":"Robert Thompson, Muhammad Ismail, Susmit Shannigrahi","doi":"10.1109/LCN53696.2022.9843207","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843207","url":null,"abstract":"Cities around the world are increasingly promoting electric vehicles (EV) to reduce and ultimately eliminate greenhouse gas emissions. A huge number of EVs will put unprecedented stress on the power grid. To efficiently serve the increased charging load, these EVs need to be charged in a coordinated fashion. One promising coordination strategy is vehicle-to-vehicle (V2V) charging coordination, enabling EVs to sell their surplus energy in an ad-hoc, peer to peer manner. This paper introduces an Information Centric Networking (ICN)-based protocol to support ad-hoc V2V charging coordination (V2V-CC). Our evaluations demonstrate that V2V-CC can provide added flexibility, fault tolerance, and reduced communication latency than a conventional centralized cloud based approach. We show that V2V-CC can achieve a 93% reduction in protocol completion time compared to a conventional approach. We also show that V2V-CC also works well under extreme packet loss, making it ideal for V2V charging coordination.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124096694","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-01-25DOI: 10.1109/LCN53696.2022.9843531
Eric Lanfer, T. Hänel, R. V. Rijswijk-Deij, N. Aschenbruck
Due to the COVID-19 pandemic, smartphone-based proximity tracing systems became of utmost interest. Many of these systems use Bluetooth Low Energy (BLE) signal strength data to estimate the distance between two persons. The quality of this method depends on many factors and, therefore, does hardly deliver accurate results. We present a multi-channel approach to improve proximity classification, and a novel, publicly available data set that contains matched IEEE 802.11 (2.4 & 5 GHz) and BLE signal strength data, measured in four different environments. We utilize these data to train machine learning models. The evaluation showed significant improvements in the distance classification and consequently also the contact tracing accuracy. However, we also encountered privacy problems and limitations due to the consistency and interval at which such probes are sent. We discuss these limitations and sketch how our approach could be improved to make it suitable for real-world deployment.
{"title":"Improving Proximity Classification for Contact Tracing using a Multi-channel Approach","authors":"Eric Lanfer, T. Hänel, R. V. Rijswijk-Deij, N. Aschenbruck","doi":"10.1109/LCN53696.2022.9843531","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843531","url":null,"abstract":"Due to the COVID-19 pandemic, smartphone-based proximity tracing systems became of utmost interest. Many of these systems use Bluetooth Low Energy (BLE) signal strength data to estimate the distance between two persons. The quality of this method depends on many factors and, therefore, does hardly deliver accurate results. We present a multi-channel approach to improve proximity classification, and a novel, publicly available data set that contains matched IEEE 802.11 (2.4 & 5 GHz) and BLE signal strength data, measured in four different environments. We utilize these data to train machine learning models. The evaluation showed significant improvements in the distance classification and consequently also the contact tracing accuracy. However, we also encountered privacy problems and limitations due to the consistency and interval at which such probes are sent. We discuss these limitations and sketch how our approach could be improved to make it suitable for real-world deployment.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133513633","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
扫码关注我们
求助内容：
应助结果提醒方式：