MPI (Message Passing Interface) plays a crucial role in the field of parallel computing. In the Allreduce algorithm of the OpenMPI communication library, there are some issues in handling communication scenarios with a number of processes that is non-power-of-two. The two existing algorithms address this by excluding some processes to achieve a power-of-two process count. However, the consideration factors are too simplistic, resulting in an imbalanced distribution of participating processes on nodes, greatly impacting communication efficiency. To address this problem, the layout of processes on nodes is taken into consideration, and the range of excluded processes is redefined. Both algorithms are subjected to generic load balancing optimizations and adaptations for domestic architectures, resulting in improved load balancing. Experimental results show that, under a communication scale of 16 nodes, the recursive_doubling algorithm achieves performance improvements of up to 30%, while the reduce_scatter_allgather algorithm achieves performance improvements of up to 21%.
{"title":"Allreduce algorithm optimization of OpenMPI communication library","authors":"Guangyao Zhang, Wei Wan, Junhong Li","doi":"10.1117/12.3031959","DOIUrl":"https://doi.org/10.1117/12.3031959","url":null,"abstract":"MPI (Message Passing Interface) plays a crucial role in the field of parallel computing. In the Allreduce algorithm of the OpenMPI communication library, there are some issues in handling communication scenarios with a number of processes that is non-power-of-two. The two existing algorithms address this by excluding some processes to achieve a power-of-two process count. However, the consideration factors are too simplistic, resulting in an imbalanced distribution of participating processes on nodes, greatly impacting communication efficiency. To address this problem, the layout of processes on nodes is taken into consideration, and the range of excluded processes is redefined. Both algorithms are subjected to generic load balancing optimizations and adaptations for domestic architectures, resulting in improved load balancing. Experimental results show that, under a communication scale of 16 nodes, the recursive_doubling algorithm achieves performance improvements of up to 30%, while the reduce_scatter_allgather algorithm achieves performance improvements of up to 21%.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141369749","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}
Most current network devices have multiple network interfaces, and multipath transport protocols can utilize multiple network paths (e.g., WiFi and cellular) to improve the performance and reliability of network transmission. The scheduler of the multipath transmission protocol determines the path to which each data packet should be transmitted, and is a key module that affects multipath transmission. However, current multipath schedulers cannot adapt well to various user usage scenarios. In this paper, we propose DRLMS, a deep reinforcement learning based multipath scheduler. DRLMS uses deep reinforcement learning to train neural networks to generate packet scheduling policies. It optimizes the scheduling strategy through feedback to the neural network through the reward function based on the current user usage scenario and QoS. We implement DRLMS in the MPQUIC protocol and compared it with current multipath schedulers. The results show that DRLMS's adaptability to user usage scenarios is significantly outperforms other schedulers.
{"title":"DRLMS: a multipath scheduler based on deep reinforcement learning","authors":"Mengyang Zhang, Kaiguo Yuan, Xiaoyong Li","doi":"10.1117/12.3031955","DOIUrl":"https://doi.org/10.1117/12.3031955","url":null,"abstract":"Most current network devices have multiple network interfaces, and multipath transport protocols can utilize multiple network paths (e.g., WiFi and cellular) to improve the performance and reliability of network transmission. The scheduler of the multipath transmission protocol determines the path to which each data packet should be transmitted, and is a key module that affects multipath transmission. However, current multipath schedulers cannot adapt well to various user usage scenarios. In this paper, we propose DRLMS, a deep reinforcement learning based multipath scheduler. DRLMS uses deep reinforcement learning to train neural networks to generate packet scheduling policies. It optimizes the scheduling strategy through feedback to the neural network through the reward function based on the current user usage scenario and QoS. We implement DRLMS in the MPQUIC protocol and compared it with current multipath schedulers. The results show that DRLMS's adaptability to user usage scenarios is significantly outperforms other schedulers.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141368607","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}
This paper proposes a hybrid algorithm of particle swarm optimization and genetic algorithm named PSO-GA, which combines the advantages of genetic algorithm’s population diversity and stochastic global search and particle swarm optimization algorithm’s memory and fast convergence. The hybrid algorithm is then used to build an automatic replenishment model to help replenishment decisions by combining the idea of solving 0-1 knapsack problem. Using the sales data of a supermarket, we verify the feasibility and accuracy of the model, and the proposed algorithm can well solve practical problems in life.
{"title":"A hybrid algorithm of particle swarm optimization and genetic algorithm with application in automatic replenishment model","authors":"Xingyan Cai, Xiaolu Sun, Yueyue Fan, Tao Liu","doi":"10.1117/12.3031966","DOIUrl":"https://doi.org/10.1117/12.3031966","url":null,"abstract":"This paper proposes a hybrid algorithm of particle swarm optimization and genetic algorithm named PSO-GA, which combines the advantages of genetic algorithm’s population diversity and stochastic global search and particle swarm optimization algorithm’s memory and fast convergence. The hybrid algorithm is then used to build an automatic replenishment model to help replenishment decisions by combining the idea of solving 0-1 knapsack problem. Using the sales data of a supermarket, we verify the feasibility and accuracy of the model, and the proposed algorithm can well solve practical problems in life.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141369019","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}
The integration of satellite and ground networks (SGIN) represents a significant advancement in the evolution of 6G mobile technologies. The rapid movement of satellites leads to swift changes in network topology. By adjusting the Service Function Chain (SFC) to these frequent changes, it's possible to diminish SFC delay and enhance the user experience. This study addresses the challenge of SFC migration within the dynamic SGIN framework. We initially developed a mathematical formulation for the VNF migration and SFC reconfiguration task, with the objective of optimizing the total system benefits. An enhanced genetic algorithm was introduced as a solution, striking an optimal compromise between SFC delay and the expenses associated with migration. When we compare our findings to previous algorithms, it's clear that our method substantially reduces the costs linked to network migration, enhances the overall profitability of services, and achieves a more favorable balance between SFC latency and migration costs.
{"title":"Cost-aware service function chain migration in satellite-ground integrated networks","authors":"Zhiyu Fu, Jing Ran, Hefei Hu","doi":"10.1117/12.3031967","DOIUrl":"https://doi.org/10.1117/12.3031967","url":null,"abstract":"The integration of satellite and ground networks (SGIN) represents a significant advancement in the evolution of 6G mobile technologies. The rapid movement of satellites leads to swift changes in network topology. By adjusting the Service Function Chain (SFC) to these frequent changes, it's possible to diminish SFC delay and enhance the user experience. This study addresses the challenge of SFC migration within the dynamic SGIN framework. We initially developed a mathematical formulation for the VNF migration and SFC reconfiguration task, with the objective of optimizing the total system benefits. An enhanced genetic algorithm was introduced as a solution, striking an optimal compromise between SFC delay and the expenses associated with migration. When we compare our findings to previous algorithms, it's clear that our method substantially reduces the costs linked to network migration, enhances the overall profitability of services, and achieves a more favorable balance between SFC latency and migration costs.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141369563","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}
With the rapid popularity of social media and the Internet, network security issues are becoming increasingly prominent. More and more people are accustomed to expressing their emotions and opinions online, and the expression of netizens’ emotions is becoming more and more diversified. Accurate analysis of netizens’ emotions is particularly important. Traditional emotion recognition methods are mainly based on text analysis, but with the diversification of network media, single text analysis has been unable to meet the actual needs. Therefore, continuously exploring the application of multimodal deep learning in netizen emotion recognition has become an inevitable choice for public security organs. This paper aims to explore the application of multimodal deep learning in netizen emotion recognition research. Therefore, this study uses multimodal datasets of text and images, and constructs BERT and VGG-16(fine-tuning) models to extract emotional features from text mode and image mode respectively. By introducing the multi-head attention mechanism, the two modes are combined to establish a fusion model, and explores how to combine them to improve classification performance. The final accuracy of text modality is 0.70, the accuracy of image modality is 0.58, and the accuracy of multimodal fusion model is 0.73, which is 0.03 and 0.15 higher than that of text modality and image modality, respectively, proving the scientific nature of multimodal fusion model. It can provide new ideas and methods for the analysis and early warning of public security organs, and also provide reference and inspiration for the research in other fields.
{"title":"Research on netizen sentiment recognition based on multimodal deep learning","authors":"Nan Jia, Tianhao Yao","doi":"10.1117/12.3032110","DOIUrl":"https://doi.org/10.1117/12.3032110","url":null,"abstract":"With the rapid popularity of social media and the Internet, network security issues are becoming increasingly prominent. More and more people are accustomed to expressing their emotions and opinions online, and the expression of netizens’ emotions is becoming more and more diversified. Accurate analysis of netizens’ emotions is particularly important. Traditional emotion recognition methods are mainly based on text analysis, but with the diversification of network media, single text analysis has been unable to meet the actual needs. Therefore, continuously exploring the application of multimodal deep learning in netizen emotion recognition has become an inevitable choice for public security organs. This paper aims to explore the application of multimodal deep learning in netizen emotion recognition research. Therefore, this study uses multimodal datasets of text and images, and constructs BERT and VGG-16(fine-tuning) models to extract emotional features from text mode and image mode respectively. By introducing the multi-head attention mechanism, the two modes are combined to establish a fusion model, and explores how to combine them to improve classification performance. The final accuracy of text modality is 0.70, the accuracy of image modality is 0.58, and the accuracy of multimodal fusion model is 0.73, which is 0.03 and 0.15 higher than that of text modality and image modality, respectively, proving the scientific nature of multimodal fusion model. It can provide new ideas and methods for the analysis and early warning of public security organs, and also provide reference and inspiration for the research in other fields.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141368671","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}
The development of 6G has led to the need for communication systems to realize low latency, high throughput and stable connectivity. To achieve these goals, Reconfigurable Intelligent Surface has emerged. However, for RIS with massive elements, the overhead caused by channel estimation and feedback is not negligible. In this article, we address this problem using irregular RIS, which essentially involves irregularly rationing a specified number of reflective elements on an RIS surface, by providing additional spatial degrees of freedom to achieve performance gains. To this end, we formulate the problem of joint topology and precoding matrix joint optimization with tabu-based adaptive large neighborhood search for channel capacity maximization.
{"title":"Tabu-based adaptive large neighborhood search aids irregular reconfigurable intelligent surface capacity enhancement","authors":"Songyue Yang, Zhiguo Sun, Rongchen Sun","doi":"10.1117/12.3032019","DOIUrl":"https://doi.org/10.1117/12.3032019","url":null,"abstract":"The development of 6G has led to the need for communication systems to realize low latency, high throughput and stable connectivity. To achieve these goals, Reconfigurable Intelligent Surface has emerged. However, for RIS with massive elements, the overhead caused by channel estimation and feedback is not negligible. In this article, we address this problem using irregular RIS, which essentially involves irregularly rationing a specified number of reflective elements on an RIS surface, by providing additional spatial degrees of freedom to achieve performance gains. To this end, we formulate the problem of joint topology and precoding matrix joint optimization with tabu-based adaptive large neighborhood search for channel capacity maximization.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141369284","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}
An information routing planning model based on cloud computing and hybrid particle swarm optimisation is proposed to address the problems of traditional routing planning for smart grids. The model constructs a smart grid routing and transmission channel model in an optical communication network in a cloud computing environment and uses a hybrid particle swarm optimisation approach to find the optimal routing distribution. Dynamic neighbourhood decision making and adaptive updating of node positions improves smart grid management, reduces BER and increases information transmission load.
{"title":"Analysis of routing algorithm for smart grid optical communication network based on cloud computing","authors":"Zhifeng Tian, Xiaoqi Huang, Jia Chen","doi":"10.1117/12.3032064","DOIUrl":"https://doi.org/10.1117/12.3032064","url":null,"abstract":"An information routing planning model based on cloud computing and hybrid particle swarm optimisation is proposed to address the problems of traditional routing planning for smart grids. The model constructs a smart grid routing and transmission channel model in an optical communication network in a cloud computing environment and uses a hybrid particle swarm optimisation approach to find the optimal routing distribution. Dynamic neighbourhood decision making and adaptive updating of node positions improves smart grid management, reduces BER and increases information transmission load.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141369449","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}
This paper addresses the issues of wavelength selection and isolation for underwater full-duplex laser communication automatic tracking of beacon light signals. A method for four-wavelength reception and transmission isolation in the blue-green light band is proposed, which utilizes watt-level semiconductor lasers to achieve beacon light signals with orders of magnitude divergence angles, aiding in rapid acquisition and alignment. The underwater transmission distance of beacon light is close to that of signal light with small divergence angles. Additionally, the hemispherical dome used for waterproof sealing in the underwater laser communication ATP device has a significant impact on the alignment consistency of beacon light and signal light axes. This paper simulates the non-parallelism of underwater optical axes using ray tracing and corrects the non-parallelism of underwater optical axes by presetting a reverse bias angle, addressing the feasibility issue of independent beacon light application in underwater ATP devices and improving the performance of underwater laser communication.
本文探讨了水下全双工激光通信自动跟踪信标光信号的波长选择和隔离问题。提出了一种在蓝绿光波段实现四波长接收和传输隔离的方法，利用瓦特级半导体激光器实现发散角数量级的信标光信号，有助于快速采集和对准。信标光的水下传输距离与小发散角信号光的传输距离接近。此外，水下激光通信 ATP 设备中用于防水密封的半球形穹顶对信标光和信号光轴的对准一致性有很大影响。本文利用光线跟踪模拟了水下光轴的不平行现象，并通过预设反向偏置角修正了水下光轴的不平行现象，解决了独立信标光应用于水下 ATP 设备的可行性问题，提高了水下激光通信的性能。
{"title":"Wavelength design and optical axis correction for bidirectional underwater laser communication with ATP","authors":"Juan Wang, Zhe Li","doi":"10.1117/12.3032098","DOIUrl":"https://doi.org/10.1117/12.3032098","url":null,"abstract":"This paper addresses the issues of wavelength selection and isolation for underwater full-duplex laser communication automatic tracking of beacon light signals. A method for four-wavelength reception and transmission isolation in the blue-green light band is proposed, which utilizes watt-level semiconductor lasers to achieve beacon light signals with orders of magnitude divergence angles, aiding in rapid acquisition and alignment. The underwater transmission distance of beacon light is close to that of signal light with small divergence angles. Additionally, the hemispherical dome used for waterproof sealing in the underwater laser communication ATP device has a significant impact on the alignment consistency of beacon light and signal light axes. This paper simulates the non-parallelism of underwater optical axes using ray tracing and corrects the non-parallelism of underwater optical axes by presetting a reverse bias angle, addressing the feasibility issue of independent beacon light application in underwater ATP devices and improving the performance of underwater laser communication.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141370539","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}
Carbon dioxide emissions are an important cause of dramatic changes in climate. Therefore, the control of carbon emission rights of relevant subjects is a necessary prerequisite for mitigating climate change. However, the existing carbon trading and auditing framework has not yet completed the control of relevant entities under the premise of considering privacy, and adversaries may infer the privacy information of emission entities based on carbon emission data. In response to this challenge, this paper proposes a novel carbon data collection, carbon trading and auditing method based on block chain and the Internet of Things. This method realizes the trusted storage of carbon data through block chain technology. At the same time, in order to protect user privacy, the interaction of carbon data is carried out through HE. Security analysis shows that our method can prevent user privacy leakage. Experimental analysis shows that the method still maintains good availability while having high security.
二氧化碳排放是造成气候剧烈变化的重要原因。因此，控制相关主体的碳排放权是减缓气候变化的必要前提。然而，现有的碳交易与审核框架尚未在考虑隐私的前提下完成对相关主体的控制，对手可能根据碳排放数据推断出排放主体的隐私信息。针对这一挑战，本文提出了一种基于区块链和物联网的新型碳数据采集、碳交易与审计方法。该方法通过区块链技术实现了碳数据的可信存储。同时，为了保护用户隐私，碳数据的交互通过 HE 进行。安全分析表明，我们的方法可以防止用户隐私泄露。实验分析表明，该方法在具有高安全性的同时，仍然保持了良好的可用性。
{"title":"A privacy preserving carbon quota trading and auditing method","authors":"Hao Huo, Cunpei Li, Boyi Wang, Yipeng Yang, Yuhan Chen, Peng Liu","doi":"10.1117/12.3032048","DOIUrl":"https://doi.org/10.1117/12.3032048","url":null,"abstract":"Carbon dioxide emissions are an important cause of dramatic changes in climate. Therefore, the control of carbon emission rights of relevant subjects is a necessary prerequisite for mitigating climate change. However, the existing carbon trading and auditing framework has not yet completed the control of relevant entities under the premise of considering privacy, and adversaries may infer the privacy information of emission entities based on carbon emission data. In response to this challenge, this paper proposes a novel carbon data collection, carbon trading and auditing method based on block chain and the Internet of Things. This method realizes the trusted storage of carbon data through block chain technology. At the same time, in order to protect user privacy, the interaction of carbon data is carried out through HE. Security analysis shows that our method can prevent user privacy leakage. Experimental analysis shows that the method still maintains good availability while having high security.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141368125","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}
Low-orbit satellite communication has the advantages of global coverage and low latency, and the satellite network is developing in the direction of gigantism, low orbital altitude, tilted orbit, and inter-satellite link networking, which brings more challenges to the design of routing algorithms. Aiming at the characteristics of mega-constellation networks (MCNs), this paper proposes a local flooding-based survivable routing algorithm (LFSA) that obtains the local link-state information by limiting the flooding range, to reduce the flooding and computation overheads of the network. Based on the topological characteristics of MCNs, a next-hop selection mechanism based on minimum Manhattan distance is proposed. Simulation results show that the LFSA algorithm improves the pathfinding capability and reduces end-to-end delay in the face of random link failure and regional satellite failure.
{"title":"A local flooding-based survivable routing algorithm for mega-constellations networks with inclined orbits","authors":"Jun He, Hefei Hu, Simin Feng","doi":"10.1117/12.3032089","DOIUrl":"https://doi.org/10.1117/12.3032089","url":null,"abstract":"Low-orbit satellite communication has the advantages of global coverage and low latency, and the satellite network is developing in the direction of gigantism, low orbital altitude, tilted orbit, and inter-satellite link networking, which brings more challenges to the design of routing algorithms. Aiming at the characteristics of mega-constellation networks (MCNs), this paper proposes a local flooding-based survivable routing algorithm (LFSA) that obtains the local link-state information by limiting the flooding range, to reduce the flooding and computation overheads of the network. Based on the topological characteristics of MCNs, a next-hop selection mechanism based on minimum Manhattan distance is proposed. Simulation results show that the LFSA algorithm improves the pathfinding capability and reduces end-to-end delay in the face of random link failure and regional satellite failure.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141368122","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
扫码关注我们
求助内容：
应助结果提醒方式：