In this research paper, a routing problem of undirected networks has been solved. The problem was to determine the optimal routes of a telecommunication network. A heuristic approach has been adopted,due to the specif...In this research paper, a routing problem of undirected networks has been solved. The problem was to determine the optimal routes of a telecommunication network. A heuristic approach has been adopted,due to the specific uature of the problem.The problem is only concerned withdistant(remote) nodes of the network which are indirectly linked through a single intermediate node.To determine the optimal routes,the devised heuristic has been coded in FORTRAN language. Forthe validation of developed heuristic,it has been implemented on two sample networks. Finally, ithas been applied to the actual(gived) network. The achieved results have proved its application insepcific networking problem. It can also enhance the effective utilization of available resources.展开更多
文章提出了几个保持可靠度不变的将边可靠、结点不可靠的无向网络化简以及转化成有向网络的原则，并将这些原则与已有的不交和或容斥原理方法相结合给出了一个新的计算无线通讯网络（Radio Communication Network，简称RCN）两终端可靠...文章提出了几个保持可靠度不变的将边可靠、结点不可靠的无向网络化简以及转化成有向网络的原则，并将这些原则与已有的不交和或容斥原理方法相结合给出了一个新的计算无线通讯网络（Radio Communication Network，简称RCN）两终端可靠度的有效算法。由于文章所给的化简与转化使RCN中指定两结点之间的路径数大大减少，因此该文算法使其可靠度的计算得到很大简化。展开更多
提出新的无向双环网络G(N;±1,±s)的直径求解法——分步法,并得到一种新的直观图——螺旋环,研究了螺旋环的性质,给出无向双环网络的直径d(N;±1,±s)的显式公式,给出N,s都固定的直径算法。给出N固定,2≤s≤N?1这样一...提出新的无向双环网络G(N;±1,±s)的直径求解法——分步法,并得到一种新的直观图——螺旋环,研究了螺旋环的性质,给出无向双环网络的直径d(N;±1,±s)的显式公式,给出N,s都固定的直径算法。给出N固定,2≤s≤N?1这样一族无向双环网络的直径算法。利用VB6.0和SQL Server 2000来仿真2≤s≤N?1,找出了该族无向双环网络直径的分布特点:具有最大值、最小值和中间对称性;对任意N,有不少s使得G(N;±1,±s)紧优或几乎紧优。验证了Boesch和Wang等提出的无向双环网络G(N;±1,±S)的直径下界,给出了一个新的直径上界公式。展开更多
文摘In this research paper, a routing problem of undirected networks has been solved. The problem was to determine the optimal routes of a telecommunication network. A heuristic approach has been adopted,due to the specific uature of the problem.The problem is only concerned withdistant(remote) nodes of the network which are indirectly linked through a single intermediate node.To determine the optimal routes,the devised heuristic has been coded in FORTRAN language. Forthe validation of developed heuristic,it has been implemented on two sample networks. Finally, ithas been applied to the actual(gived) network. The achieved results have proved its application insepcific networking problem. It can also enhance the effective utilization of available resources.
文摘文章提出了几个保持可靠度不变的将边可靠、结点不可靠的无向网络化简以及转化成有向网络的原则，并将这些原则与已有的不交和或容斥原理方法相结合给出了一个新的计算无线通讯网络（Radio Communication Network，简称RCN）两终端可靠度的有效算法。由于文章所给的化简与转化使RCN中指定两结点之间的路径数大大减少，因此该文算法使其可靠度的计算得到很大简化。
文摘提出新的无向双环网络G(N;±1,±s)的直径求解法——分步法,并得到一种新的直观图——螺旋环,研究了螺旋环的性质,给出无向双环网络的直径d(N;±1,±s)的显式公式,给出N,s都固定的直径算法。给出N固定,2≤s≤N?1这样一族无向双环网络的直径算法。利用VB6.0和SQL Server 2000来仿真2≤s≤N?1,找出了该族无向双环网络直径的分布特点:具有最大值、最小值和中间对称性;对任意N,有不少s使得G(N;±1,±s)紧优或几乎紧优。验证了Boesch和Wang等提出的无向双环网络G(N;±1,±S)的直径下界,给出了一个新的直径上界公式。
