Semisupervised Graph Neural Networks for Traffic Classification in Edge Networks by Yang Yang, Rui Lyu, Zhipeng Gao, Lanlan Rui, Yu Yan

“…In this paper, a semisupervised graph neural network traffic classifier is proposed for cloud-edge architecture so that cloud servers and edge nodes could cooperate to perform the traffic classification tasks in order to deliver low latency and save bandwidth on the edge nodes. …”
Get full text

Radio and Radial Radio Numbers of Certain Sunflower Extended Graphs by Mohammed K. A. Kaabar, Kins Yenoke

“…In this research work, the relationship between the radio number and radial radio number is studied for any connected graph. Then, several sunflower extended graphs are defined, and the upper bounds of the radio number and radial radio number are investigated for these graphs.…”
Get full text

An association optimization algorithm for wireless access points based on graph transformation by Wen TAO, Yan SHEN, Xinjie GUAN, Xili WAN

“…Wireless access point association problem is one of the fundamental problems for Wi-Fi systems.Existing studies focus on the AP association problems under the bandwidth capacity constrain,without considering bandwidth demand for users.Considering the user bandwidth demands,the access point association problem for a Wi-Fi system under hybrid network architecture was studied,with the objective of maximum bandwidth allocation.Different from existing studies,by utilizing graph transformation techniques,this optimization problem was transformed to a network flow optimization problem on a flow graph.Then,an algorithm was proposed based on the maximum network flow problem.Theoretic proof for the optimality of the algorithm was presented and simulations results further validated the superiority of the proposed algorithm.…”
Get full text

Service function chain deployment algorithm based on optimal weighted graph matching by Dan LI, Julong LAN, Peng WANG, Yuxiang HU

“…Service function chain can support flexible network service requirement by linking virtual network functions.Aiming at the problem of service function chain deployment in a resource-constrained network,an algorithm for service function chain deployment based on optimal weighted graph matching was proposed.The service function chains was composed into graphs of functional topography,and the optimal matching results between graphs of functional topology and physical topology was obtained using eigendecomposition approach,and furtherly the matching results by hill-climbing method was optimized.Simulation results show that,the proposed algorithm can reduce the required bandwidth to deploy service function chains,balance the load of nodes and bandwidth of links,and support more service requests.What is more,the algorithm has a lower computation complexity and higher time efficience.…”
Get full text

A robust encrypted traffic identification scheme based on graph neural network by LI Mengxiang, PENG Chuang, WANG Hao, HUANG Chaoming, TAN Xiaobin

“…A robust traffic recognition algorithm based on graph neural networks was proposed for achieving accurate traffic recognition in practical network scenarios. …”
Get full text

Dynamic spectrum allocation for cognitive radio sensor networks based on improved genetic algorithm by Chang CAI, Yafang WANG, Bingmei MIAO, Hui JIANG

“…ISM (industrial scientific and medical) bands where wireless sensor network works faced with the shortage of spectrum resources problems.Aimed at this case,dynamic spectrum allocation in cognitive radio technology was applied in wireless sensor network.A dynamic frequency spectrum allocation scheme was proposed.The algorithm was a modified adaptive genetic algorithm which was based on graph coloring model.In addition,the objective functions of the algorithm were maximum bandwidth gains and minimum spectrum handoff,besides,in the crossover and mutation process,adaptive crossover probability and mutation probability was used instead of the fixed.Experimental results confirm that compared with the traditional genetic algorithm and color sensitive graph coloring algorithm,the proposed algorithm can achieve the expected goal of improving the spectral efficiency and reducing energy consumption.…”
Get full text

Random Dissemination Algorithm of Stete-Updating Message for Distributed Virtual Environments of P2P Architecture by Tao Li, Hua Hu, Haiyang Hu

“…By considering the limited network bandwidth and communication delay, which may affect the users' sensing of the real-life experience and the real-time interaction for the participants, the method was given based on the pre-established random geometric graph to distribute the state-updating messages. …”
Get full text

Research on elastic handover algorithm of 6G network based on fine-grained slicing by Xiaorong ZHU, Kang CHEN

“…With the emergence of high-bandwidth services such as holographic communication and augmented reality in the future, high-bandwidth services will be divided into finer-grained service slices according to the rates to meet diverse requirements of users.For the problem of how to complete network switching in a fine-grained slicing of large bandwidth services, an elastic handover algorithm of 6G network based on bipartite graph stable matching was proposed.By optimizing “user-network slice-base station” association, the total rate of users was maximized, and the access problem was modeled as a hierarchical bipartite graph stable matching problem.Then by using the two matching ideas of “slice base station” integration and “slice first and then base station”, the adaptive handoff of the network was realized by using Gale-Shapley algorithm.Simulation results show that the access success rates of the proposed integrated and two-stage matching algorithms are 15% and 10% higher respectively than that of the traditional method, and the total rate of users is also significantly improved.…”
Get full text

Peningkatan Performa Komputasi Sistem Navigasi Transportasi Publik Pada Perangkat Bergerak Melalui Penerapan Teknik Kompresi Data dan Penyederhanaan Graf by Aryo Pinandito, Agi Putra Kharisma, Muhammad Aminul Akbar, Mochamad Chandra Saputra

“…The plans are generated from the implementation of Dijkstra's algorithm, which is modeled in the graph data structure. This study determines the effectiveness of using JSON format, the bandwidth saved for distributing data on the Internet from Zlib data compression and Base64 encoding, and analyzes additional memory usage due to compression and the impact of data simplification through a visual approach on transport network graphs with the Douglas-Peucker algorithm. …”
Get full text

Graphene metamaterial solar absorber using Al-TiN-Fe for efficient solar thermal energy conversion and optimization using machine learning by Khaled Aliqab, Bo Bo Han, Om Prakash Kumar, Meshari Alsharari, Ammar Armghan, Shobhit K. Patel

“…With the displacement of wavelength and bandwidth configuration, the current absorber is observed at 97.32% (more than 97%) for 1.5–2.5 µm wavelength range (1000 nm bandwidth) and above 95% rate (95.38%) is displayed by the 2000 nm bandwidth due to 0.5 and 2.5 µm wavelength separation. …”
Get full text

Uncertainty analysis of linear and non-linear regression models in the modeling of water quality in the Caspian Sea basin: Application of Monte-Carlo method by Sahar Heidari Masteali, Mahmoud Bayat, Pete Bettinger, Mansour Ghorbanpour

“…The results indicated that the CO3 model had the lowest uncertainty bandwidth and the highest R2 among other models. Additionally, the K models had less bandwidth than the other models developed. …”
Get full text

Efficient and safe software defined network topology discovery protocol by Dong LI, Junqing YU, Yongpu GU, Pengcheng ZHAO

“…The network topology discovery in OpenFlow-based software-defined networks is mainly achieved by utilizing the OpenFlow discovery protocol (OFDP).However, it has been observed in existing research that OFDP exhibits low updating efficiency and is susceptible to network topology pollution attacks.To address the efficiency and safety concerns of the network topology discovery protocol, an in-depth investigation was conducted on the mechanism and safety of OFDP network topology discovery.The characteristics of network topology establishment and updating in OFDP were analyzed, and an improved protocol named Im-OFDP (improved OpenFlow discovery protocol) based on the minimum vertex covering problem in graph theory was proposed.In Im-OFDP, the switch port table and network link table were initially established using prior information obtained from OFDP network topology discovery.Subsequently, a graph model of the network topology was constructed, and the minimum vertex covering algorithm in graph theory was employed to select specific switches for the reception and forwarding of topology discovery link layer discovery protocol (LLDP) packets.Multi-level flow tables were designed based on the network topology structure, and these flow entries were installed on the selected switches by the controller to process LLDP packets.To address security issues, dynamic check code verification in LLDP packets was employed to ensure the safety of network links.Additionally, a network equipment information maintenance mechanism was established based on known network topologies to ensure the safety of the network equipment.Experimental results demonstrate a significant reduction in the number of network topology discovery messages, bandwidth overhead, and CPU overhead through the deployment of Im-OFDP.Moreover, the response time for node failures and link recovery time after mode failure is substantially reduced.Im-OFDP also effectively mitigates various network topology pollution attacks, such as link fabrication and switch forgery attacks.Overall, Im-OFDP has the capability to enhance the efficiency and safety of SDN topology discovery.…”
Get full text

Approach for distributed BPEL engine placement using K-means by Rong-heng LIN, Bu-dan WU, Yao ZHAO, Fang-chun YANG

“…Results show that the proposed method can provide a more opti-mized bandwidth usage of combined BPEL service execution.…”
Get full text

Early Fault Diagnosis of Gear Box based on Variational Mode Decomposition and Fast Spectral Kurtosis by Zhao Wei

“…Then,according to the correlation coefficient criterion,the spectral kurtosis is calculated for the components with large correlation coefficient,and the best center frequency and bandwidth are determined by spectral kurtosis graph. …”
Get full text

An Energy-Efficient Multisite Offloading Algorithm for Mobile Devices by Ruifang Niu, Wenfang Song, Yong Liu

“…Moreover, our proposed EMSO algorithm adopts the multi-way graph partitioning based algorithm to solve it. Experimental results demonstrate that our algorithm can significantly reduce more energy consumption as well as execution time and better adapt to the unreliability of wireless networks (such as the network bandwidth changes), compared with the existing algorithms.…”
Get full text

Downlink wireless resource allocation method of V2X based on wireless sensing assistance by Zhimin HE, Yuzhe LIN, Yujie CHENG, Shi YAN

“…In vehicle-to-everything, the high-speed distribution and sharing of perception and safety data is crucial to road safety.However, the instability of communication links caused by high-speed vehicle movement will make the existing communication resource allocation methods based on vehicle location information reporting no longer efficient.Therefore, a downlink wireless resource allocation method based on wireless sensing assistance of communication nodes was proposed.Firstly, a joint optimization problem of communication mode selection and wireless resource allocation under the orthogonality of communication and sensing resources was constructed.Then, a communication mode selection based on clustering by Delaunay triangulation and a resource allocation strategy based on improved graph coloring to improve the downlink throughput was proposed to solve the problem of construction.Finally, the impact of wireless sensing estimation error and the number of vehicles on the performance of the algorithm was simulated and analyzed.Simulation results show that compared with traditional methods, the proposed algorithm can obtain better downlink communication performance gain under the same proportion of sensing bandwidth resources, and can withstand the impact of larger sensing errors on performance.At the same time, the computational complexity of the proposed algorithm is lower and the network computing resources can be saved.…”
Get full text

FSB-DReViSeR: Flow Splitting-Based Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Heterogeneous Networks by Jean Frédéric Myoupo, Vianney Kengne Tchendji, Yannick Florian Yankam, Joël Casimir Tagne

“….), exploit various amounts of resources (bandwidth, computing power, servers, etc.), and have topologies different from those of the substrate network. …”
Get full text

NOMA-Based Rate Optimization for Multi-UAV-Assisted D2D Communication Networks by Guowei Wu, Guifen Chen, Xinglong Gu

“…With the proliferation of smart devices and the emergence of high-bandwidth applications, Unmanned Aerial Vehicle (UAV)-assisted Device-to-Device (D2D) communications and Non-Orthogonal Multiple Access (NOMA) technologies are increasingly becoming important means of coping with the scarcity of the spectrum and with high data demand in future wireless networks. …”
Get full text