{"title":"Evolutionary Algorithm with Phenotype Diversity for Virtual Network Embedding","authors":"Tatsuya Otoshi, M. Murata","doi":"10.1109/ICNC57223.2023.10074545","DOIUrl":"https://doi.org/10.1109/ICNC57223.2023.10074545","url":null,"abstract":"With the diversification of applications using the Internet, network virtualization technologies that flexibly allocate network resources are attracting attention. In network virtualization, virtual network embedding is important to properly map the requirements of the virtual network to the physical network. However, it takes time to calculate the solution by optimization, and recalculation of the embedding becomes a problem when the environment of the virtual and physical networks changes. Therefore, a method of having multiple solution candidates in advance and switching the solution depending on the situation is considered, but the design and updating of the solution candidates themselves remain an issue. Such a relationship between solution candidates and solution selection is similar to the relationship between genotype and phenotype in biological evolution, and it is a shortcut to get hints from evolution. In biological evolution, the phenotype searches for short-term practical solutions while the genotype continues to search for optimal solutions. By introducing this mechanism into the network, it is possible to select a quasi-optimal solution in a fluctuating environment while continuing the search for a better solution candidate itself. In this paper, we propose a dynamic virtual network embedding method in which the solution candidates themselves can be dynamically updated based on the evolution of genotype and phenotype. In this method, candidate solutions are encoded as genotypes, and phenotypes are decoded by attractor selection using noise-induced fluctuations. Through evaluation, we show that the attractor selection by individuals leads to the discovery of appropriate solutions faster than when using neural networks.","PeriodicalId":174051,"journal":{"name":"2023 International Conference on Computing, Networking and Communications (ICNC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114410933","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 Reservation-based Adaptive MAC Protocol for OFDM Physical Layers in Underwater Networks","authors":"Sara Falleni, T. Melodia, S. Basagni","doi":"10.1109/ICNC57223.2023.10074103","DOIUrl":"https://doi.org/10.1109/ICNC57223.2023.10074103","url":null,"abstract":"The more we understand the importance of the oceans for human well-being and survival, the more research on the Internet of Underwater Things becomes imperative. This prompts us to investigate technologies for underwater communication and networking, namely, technologies that enable the collection of data that are vital for “Blue Economy” applications. Among these technologies, Orthogonal Frequency-Division Multiplexing (OFDM)-extensively used in terrestrial networks- is being considered because of its high spectral efficiency, low inter-symbol interference and fading, and low sensitivity to time synchronization errors. In this paper, we investigate how OFDM physical layers affect protocol design and performance at higher layers of the protocol stack. Particularly, we present a Reservation-based Adaptive MAC (RAMAC) protocol that leverages the capabilities of OFDM physical layers. Using information about channel conditions, RAMAC selects the OFDM frequencies to use on a per-packet basis. We evaluate the performance of RAMAC via DESERT-based simulations on a variety of underwater scenarios with models of real OFDM-enabled underwater acoustic modems. Results show that, especially when outside interference is present (e.g., sonars), RAMAC provides robust data delivery while keeping latency at bay.","PeriodicalId":174051,"journal":{"name":"2023 International Conference on Computing, Networking and Communications (ICNC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114918086","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":"Membership Management in Collaborative Intrusion Detection Systems","authors":"C. Ezelu, Ulrich Bühler","doi":"10.1109/ICNC57223.2023.10073989","DOIUrl":"https://doi.org/10.1109/ICNC57223.2023.10073989","url":null,"abstract":"Collaborative Intrusion Detection Systems (CIDS) has gained traction in recent years owing to the growth in the sophistication of attacks in a networked environment, which has overwhelmed isolated Intrusion Detection Systems (IDS). However, communication between IDSs gives rise to the possibility of communicating with a compromised or malicious node, which can adversely affect the effectiveness of the collaboration. The proposed scheme provides a framework for effectively managing membership in a collaborative system through trust. A novel trust function for challenge-based trust management was proposed and evaluated. Furthermore, additional state management policies were incorporated to manage members’ permission sets. The experiment results show an effective response of the proposed scheme to reflect the state of the CIDS node.","PeriodicalId":174051,"journal":{"name":"2023 International Conference on Computing, Networking and Communications (ICNC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116003547","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":"AFFIRM: Privacy-by-Design Blockchain for Mobility Data in Web3 using Information Centric Fog Networks with Collaborative Learning","authors":"J. Khan, K. Ozbay","doi":"10.1109/ICNC57223.2023.10074160","DOIUrl":"https://doi.org/10.1109/ICNC57223.2023.10074160","url":null,"abstract":"Micromobility IoT devices and Connected Vehicles generate massive mobility data, crucial for time-critical safety-related data analytics. It is challenging to study and understand such data without compromising user privacy. We propose AFFIRM, a secure privacy-preserving blockchain framework for efficient, scalable and lightweight mobility data generation, validation, storage and retrieval in future Web3 applications. AFFIRM enables nearby devices to self-organize as a fog network and collaboratively train machine learning algorithms locally to securely generate, validate, store and retrieve mobility data via consensus leveraging Information Centric Networking as the underlying architecture. The proposed collaborative learning enables nodes to learn and adapt with respect to parameters related to scalability, timeliness, security, privacy, and resource consumption. We evaluate AFFIRM using mobility data from New York city and results shows it to scalably store mobility data from up to 700 devices with lower delays and overhead.","PeriodicalId":174051,"journal":{"name":"2023 International Conference on Computing, Networking and Communications (ICNC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126128317","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":"ECEA Based Joint Circular Design of Reconfigurable Intelligent Surfaces with Drone During Disaster","authors":"S. Newaz, Xingya Liu","doi":"10.1109/ICNC57223.2023.10074153","DOIUrl":"https://doi.org/10.1109/ICNC57223.2023.10074153","url":null,"abstract":"Strong communication networks that can function even in the face of tragedy will be the foundation of contemporary societies. Drone-mounted base stations (DBSs) can assist mobile users quickly by reestablishing connectivity in a disaster-stricken environment. In past decade, numerous drone-based base station studies have been proposed to ensure connectivity, however they are not cost-effective. To improve this, we try to use fewest DBSs possible while increasing coverage area. Since each DBS can only service a certain number of terrestrial users due to coverage limitations, we offer an argument using Multiple Reconfigurable Intelligent Surfaces (RIS) with drones. We employ RIS because, with relatively low deployment costs, it provides coverage expansion, interference reduction, and energy savings. In this study, we propose a circular RIS-assisted single DBS for communications during disaster. In contrast to the conventional DBS model, power loss has not decreased but rather has remained constant in the expanded coverage area. We also derived an optimized distance (DBS to User distance) to achieve the maximum serving area and coverage enhancement has been compared with existing method. An Enhanced Coverage Enrichment Algorithm (ECEA) has been proposed to analyze model. Our research validates the results of our simulation with theoretical discoveries.","PeriodicalId":174051,"journal":{"name":"2023 International Conference on Computing, Networking and Communications (ICNC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125671599","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":"Blockchain-enabled Efficient and Secure Federated Learning in IoT and Edge Computing Networks","authors":"Ranwa Al Mallah, David López, Talal Halabi","doi":"10.1109/ICNC57223.2023.10074277","DOIUrl":"https://doi.org/10.1109/ICNC57223.2023.10074277","url":null,"abstract":"Federated learning (FL) has proven to be a promising solution to enable on-device machine learning over massive data generated by Internet of Things (IoT) devices at the network edge. However, the wide vulnerability space of the IoT network increases the risk of model poisoning attacks carried out by malicious or compromised IoT devices against FL model training. This paper proposes to exploit the use of blockchain technology to perform optimized monitoring of the behavior of IoT devices and select only reliable ones to provide model updates to the global FL model while preserving network performance. We formulate our worker device monitoring problem as an optimization problem and solve it to produce the optimal number of monitoring miners in the blockchain network in order to reduce the latency, bandwidth and energy consumption in the overall IoT network. Our results show that the optimal monitoring solution was able to reduce by 75% the total delay incurred by the IoT devices during training.","PeriodicalId":174051,"journal":{"name":"2023 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130971501","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":"Optimal Codes for Distributed Storage","authors":"Jian Ren, Jian Li, Tongtong Li","doi":"10.1109/ICNC57223.2023.10074312","DOIUrl":"https://doi.org/10.1109/ICNC57223.2023.10074312","url":null,"abstract":"Regenerating codes are a class of distributed storage codes that allow for efficient repair of failed nodes, as compared to traditional erasure codes, which enables it to achieve high data reliability, security, and cost-efficiency and a critical infrastructure of the computing system. Existing data storage largely depends on a centralized cloud, which is not only costly but also vulnerable to single points of failure and other types of security attacks. To provide data security, data encryption has to be used, which requires extensive computing power and cumbersome key management. Distributed storage system (DSS) is being widely viewed as a natural solution to future online data storage due to improved access time and lower storage cost. However, the existing DSS also has the limitations of low storage efficiency and lack of data security. In this paper, we investigate multi-layer code-based distributed data storage systems that can achieve inherit content confidentiality and optimal storage efficiency. Our comprehensive shows that the optimal code can improve the reliable data storage by nearly 50% comparing to the existing state-of-art research.","PeriodicalId":174051,"journal":{"name":"2023 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130434197","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}
S. Banerjee, Sarada Prasad Gochhayat, Sachin Shetty
{"title":"Performance Analysis of Fixed Broadband Wireless Access in mmWave Band in 5G","authors":"S. Banerjee, Sarada Prasad Gochhayat, Sachin Shetty","doi":"10.1109/ICNC57223.2023.10074306","DOIUrl":"https://doi.org/10.1109/ICNC57223.2023.10074306","url":null,"abstract":"An end-to-end fiber-based network has the potential to offer multi-gigabit fixed access to end users. However, a fiber network’s biggest hurdle is delivering that fiber access to the end user. Especially in places where fiber is non-existent, it can be time-consuming and costly to deploy, resulting in Operators experiencing a long delay in realizing a return on their investment.This work investigates transmission data from fixed broadband wireless access in the mmWave band in 5G. With the increasing interest in this domain, it is worth investigating the transmission characteristic of the data and utilizing the same to build more sophisticated capabilities. Existing datasets for the mmWave band are detailed but generated from simulated environments. In this work, we introduce a dataset built from the collection of real-world transmission data from fixed broadband wireless access in mmWave band device(RWM6050). The goal of this data is to enable self-configuration capability based on transmission characteristics. Towards this goal, we present an online machine learning-based approach that can classify transmission characteristics with real-time training. We also present two more advanced temporal models for more accurate classifications. We demonstrate that it is possible to detect the transmission angle and distance directly from the analysis of transmission data with very high accuracy. We achieved up to 99% accuracy on the combined classification task. Finally, we outline some interesting future research scopes based on the collected data.","PeriodicalId":174051,"journal":{"name":"2023 International Conference on Computing, Networking and Communications (ICNC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125368317","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":"Ergodic Capacity of the Cloud Radio Access Network: A General Solution","authors":"Xian Liu","doi":"10.1109/ICNC57223.2023.10074371","DOIUrl":"https://doi.org/10.1109/ICNC57223.2023.10074371","url":null,"abstract":"In this paper, we derive a closed-form for the uplink ergodic capacity of C-RAN with arbitrary pathloss exponents. This result is an ultimate solution since it is analytically exact, while in previous studies only the lower bound for general parameters or exact formulas for some selected parameters were reported. The present work is based on the integral of a product of two Meijer’s G-functions. Both analytical proof and simulation results are provided.","PeriodicalId":174051,"journal":{"name":"2023 International Conference on Computing, Networking and Communications (ICNC)","volume":"312 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122986458","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}
Caitlin Sim, K. Wu, A. Sim, I. Monga, C. Guok, F. Würthwein, Diego Davila, Harvey Newman, J. Balcas
{"title":"Effectiveness and predictability of in-network storage cache for Scientific Workflows","authors":"Caitlin Sim, K. Wu, A. Sim, I. Monga, C. Guok, F. Würthwein, Diego Davila, Harvey Newman, J. Balcas","doi":"10.1109/ICNC57223.2023.10074058","DOIUrl":"https://doi.org/10.1109/ICNC57223.2023.10074058","url":null,"abstract":"Large scientific collaborations often have multiple scientists accessing the same set of files while doing different analyses, which create repeated accesses to the large amounts of shared data located far away. These data accesses have long latency due to distance and occupy the limited bandwidth available over the wide-area network. To reduce the wide-area network traffic and the data access latency, regional data storage caches have been installed as a new networking service. To study the effectiveness of such a cache system in scientific applications, we examine the Southern California Petabyte Scale Cache for a high-energy physics experiment. By examining about 3TB of operational logs, we show that this cache removed 67.6% of file requests from the wide-area network and reduced the traffic volume on wide-area network by 12. 3TB (or 35.4%) an average day. The reduction in the traffic volume (35.4%) is less than the reduction in file counts (67.6%) because the larger files are less likely to be reused. Due to this difference in data access patterns, the cache system has implemented a policy to avoid evicting smaller files when processing larger files. We also build a machine learning model to study the predictability of the cache behavior. Tests show that this model is able to accurately predict the cache accesses, cache misses, and network throughput, making the model useful for future studies on resource provisioning and planning.","PeriodicalId":174051,"journal":{"name":"2023 International Conference on Computing, Networking and Communications (ICNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122187369","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}