As far as the minimal spanning tree problem for the digraph with asymmetric weightsis concerned, an explicit integer programming model is proposed, which could be solved successfullyusing the integer programming packa...As far as the minimal spanning tree problem for the digraph with asymmetric weightsis concerned, an explicit integer programming model is proposed, which could be solved successfullyusing the integer programming packages such as LINDO, and furthermore this model is extendedinto the stochastic version, that is, the minimal spanning tree problem for the digraph with theweights is not constant but random variables. Several algorithms are also developed to solve themodels. Finally, a numerical demonstration is given.展开更多
覆盖网能有效分离网络应用与底层网络基础设施,提升服务质量(quality of service,QoS)和用户体验(quality of users’experience,QoE)。设计了一种普适性较强的覆盖网拓扑构建算法——基于最小生成树(minimum spanning tree,MST)的拓扑...覆盖网能有效分离网络应用与底层网络基础设施,提升服务质量(quality of service,QoS)和用户体验(quality of users’experience,QoE)。设计了一种普适性较强的覆盖网拓扑构建算法——基于最小生成树(minimum spanning tree,MST)的拓扑感知度约束(minimum spanning tree-based topology-aware degree bound,MST-TADB)覆盖网构建算法。该方法感知网络拓扑,逐步生成MST,同时参考节点的转发和计算能力作为节点度约束收敛算法。由仿真结果可知,和同类算法相比,本文方法的故障恢复率、恢复路径跳数惩罚、服务节点平均节点度和时间复杂度综合权衡较好,并保证了所构建的覆盖网的自愈性。展开更多
文摘As far as the minimal spanning tree problem for the digraph with asymmetric weightsis concerned, an explicit integer programming model is proposed, which could be solved successfullyusing the integer programming packages such as LINDO, and furthermore this model is extendedinto the stochastic version, that is, the minimal spanning tree problem for the digraph with theweights is not constant but random variables. Several algorithms are also developed to solve themodels. Finally, a numerical demonstration is given.
