针对现有电力通信网路由算法不能为业务分配双路由的问题,提出一种最可靠环路策略下的最大不相交双路由算法(the maximally disjoint routing algorithm under the most reliable loop strategy,MRMLS)。研究了公共通信网中三种类型的...针对现有电力通信网路由算法不能为业务分配双路由的问题,提出一种最可靠环路策略下的最大不相交双路由算法(the maximally disjoint routing algorithm under the most reliable loop strategy,MRMLS)。研究了公共通信网中三种类型的双路由算法,考虑了双路由算法可能面临的网络结构,阐述了采用最大不相交双路由算法的必要性。分析了最大不相交双路由的可靠性,并采用最可靠环路策略完成最大不相交双路由的分配工作。改进了原有最大不相交双路由算法,使所提算法充分考虑节点与链路的可靠性。仿真实验将MRMLS与其他两种方法进行对比,验证了MRMLS的可行性与有效性。展开更多
Let {E<sub>i</sub>:i∈I}be a family of Archimedean Riesz spaces.The Riesz product space is denoted by Π<sub>i∈I</sub> E<sub>i</sub>.The main result in this paper is the following ...Let {E<sub>i</sub>:i∈I}be a family of Archimedean Riesz spaces.The Riesz product space is denoted by Π<sub>i∈I</sub> E<sub>i</sub>.The main result in this paper is the following conclusion:There exists a completely regular Hausdorff space X such that Π<sub>i∈I</sub> E<sub>i</sub> is Riesz isomorphic to C（X）if and only if for every i ∈ I there exists a completely regular Hausdorff space X<sub>i</sub> such that E<sub>i</sub> is Riesz isomorphic to C（X<sub>i</sub>）.展开更多
文摘针对现有电力通信网路由算法不能为业务分配双路由的问题,提出一种最可靠环路策略下的最大不相交双路由算法(the maximally disjoint routing algorithm under the most reliable loop strategy,MRMLS)。研究了公共通信网中三种类型的双路由算法,考虑了双路由算法可能面临的网络结构,阐述了采用最大不相交双路由算法的必要性。分析了最大不相交双路由的可靠性,并采用最可靠环路策略完成最大不相交双路由的分配工作。改进了原有最大不相交双路由算法,使所提算法充分考虑节点与链路的可靠性。仿真实验将MRMLS与其他两种方法进行对比,验证了MRMLS的可行性与有效性。
基金Supported by the National Natural Science Foundation of China
文摘Let {E<sub>i</sub>:i∈I}be a family of Archimedean Riesz spaces.The Riesz product space is denoted by Π<sub>i∈I</sub> E<sub>i</sub>.The main result in this paper is the following conclusion:There exists a completely regular Hausdorff space X such that Π<sub>i∈I</sub> E<sub>i</sub> is Riesz isomorphic to C（X）if and only if for every i ∈ I there exists a completely regular Hausdorff space X<sub>i</sub> such that E<sub>i</sub> is Riesz isomorphic to C（X<sub>i</sub>）.
