检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:林丹楠 LIN Dannan(School of Information Technology,Fujian Business University,Fuzhou 350012,China)
出 处:《常熟理工学院学报》2025年第2期84-90,共7页Journal of Changshu Institute of Technology
摘 要:依据数据资源业务需求量优化后得到的最优路由路径忽略了路径拥塞状态对通信效果的影响,导致优化结果虚拟队列积压度较高.因此,提出基于拥塞感知的移动通信网络最短路径路由优化方法.引入拥塞感知技术分析移动通信网络路径的拥塞状态,计算得出对应的拥塞因子.构建移动通信网络信息传输模型,基于该模型的损失函数,进行最短路径选择和动态映射的双优化,实现路由优化.实验结果表明:所提方法应用后得出的路由优化结果,虚拟队列积压度较低,优化效果较优,满足了移动通信网络现实通信需求.Optimizing the optimal routing path based on the demand for data resource business neglects the impact of path congestion on communication performance,resulting in high virtual queue backlog in the optimization results.Therefore,a congestion aware shortest path routing optimization method for mobile communication networks is proposed.Congestion perception technology is introduced to analyze the congestion status of mobile communication network paths and calculate the corresponding congestion factor.A mobile communication network information transmission model is constructed,and based on the loss function of the model,it is set to perform dual optimization of shortest path selection and dynamic mapping to achieve routing optimization.The experimental results show that the routing optimization results obtained after the application of the proposed method have a low virtual queue backlog and excellent optimization effect,meeting the real communication needs of mobile communication networks.
关 键 词:移动通信网络 网络路径 路由优化 拥塞感知 最短路径 优化方法
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.62