A new algorithm for diameter of double loop network

Presents a new algorithm for diameter of double loop network(DLN) by which two new classes of infinite families of tight DLN of the known twelve infinie families of tight DLNs, under 3.3 in [1] including eleven are constructed.

A Routing Algorithm for Distributed Optimal Double Loop Computer Networks

A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The proposed algorithm is shown to be optimal and robust for optimal double loop. In the absence of failures,the algorithm can send a packet along the shortest path to destination; when there are failures,the packet can bypasss failed nodes and links.

DISTRIBUTED OPTIMAL LOCAL DOUBLE LOOP NETWORK

A distibuted optimal local double loop(DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter (d) and average hop distance (a) for this class of networks are [square-root 3N -2] less-than-or-equal-to d less-than-or-equal-to [square-root 3N+1] and (5N/9(N-1)) (square-root 3N-1.8) < a < (5N/9 (N-1)). (square-root 3N - 0.23), respectively (N is the number of nodes in the network. (3 less-than-or-equal-to N less-than-or-equal-to 10(4)). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed. The correctness of the algorithm has been also verified by simulating.

AN ASYMPTOTIC PROPERTY OF THE NUMBER OF SPANNING TREES OF DOUBLE FIXED STEP LOOP NETWORKS

Let T(C(p,1,q)) be the number of spanning trees of circulant graph C(p,1,q). In this note we show that T(C(p+1,1,q))T(C(p,1,q))→2, p→+∞.

基于DK2-PLF的主动配电网馈线合环电流评估

合环电流评估技术对于配电网馈线合环转供电操作具有重要意义,为了提高主动配电网馈线合环电流计算的准确性,文中从融入源荷数据分布特性及预测的角度,提出基于双重K2算法和概率潮流(double K2 algorithm and probability load flow,DK2-PLF)的主动配电网馈线合环电流评估方法。首先,采用基于DK2算法的贝叶斯网络描述源荷相关性样本;其次,利用Cholesky分解方法处理获得的源荷相关性样本,以半不变量法计算主动配电网馈线合环电流的累积概率分布;然后,对主动配电网馈线合环电流从合环成功率和越限程度两方面进行安全性评估;最后,以贵州某城市为算例,对10 kV配电网系统开展馈线合环电流评估研究。得出以下结论:一是从概率密度、累积分布、最大误差三方面比较,相比于K2算法,DK2算法源荷预测值的概率密度、累积分布误差较小,验证了DK2算法的优越性;二是从累积分布、最大误差两方面比较,采用Cholesky分解的半不变量法对比未采用Cholesky分解的半不变量法、蒙特卡洛法,其累积分布误差较小,采用Cholesky分解的半不变量法满足主动配电网馈线合环电流评估要求;三是从合环成功率、合环越限程度两方面比较,采用半不变量法计算的合环电流安全性指标结果与仿真结果偏差在电网经验误差5%范围内,说明基于DK2-PLF的主动配电网馈线合环电流评估方法可为合环辅助决策提供参考。

ON THE FAULT-TOLERANT ROUTING IN DISTRIBUTED LOOP NETWORKS

Based on their "Theorem 2", an O(δ)-time algorithm of searching for the shortest path between each pair of nodes in a double loop network was proposed by K.Mukhopadyaya, et al.(1995). While, unfortunately, it will be proved that both "Theorem 2" and its proof are in error. A new and more faster O(△)-time, △≤δ, algorithm will be presented in this paper.

An infinite family of 4-tight optimal double loop networks

An infinite family of 4-tight optimal double loop networks is given in this paper.

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.

The construction of infinite families of any k-tight optimal and singular k-tight optimal directed double loop networks

The double loop network(DLN)is a circulant digraph with n nodes and outdegree 2.It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems.Given the number n of nodes,how to construct a DLN which has minimum diameter?This problem has attracted great attention.A related and longtime unsolved problem is:for any given non-negative integer k,is there an infinite family of k-tight optimal DLN?In this paper,two main results are obtained:(1)for any k≥0,the infinite families of k-tight optimal DLN can be constructed,where the number n(k,e,c)of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c.(2)for any k≥0, an infinite family of singular k-tight optimal DLN can be constructed.

基于双环自适应滑模控制的高速列车运行追踪

针对列车高速运行跟踪控制问题,提出了一种基于双环结构的RBF神经网络自适应滑模控制算法。首先系统结构分为位移与速度控制子系统,防止列车因单个控制器故障而失控;在此基础上采用积分滑模控制,加强控制器的鲁棒性;同时在速度子系统中引入参数自适应算法与RBF神经网络自适应算法削弱列车受到基本阻力、附加阻力以及不确定性阻力带来的影响;最后通过Lyapunov稳定性分析证明系统的稳定性。通过仿真实验结果表明,位移误差在[-3.3×10^(-4),1.9×10^(-4)]范围以内,速度误差在[-2.1×10^(-2),3.1×10^(-2)]范围以内,该算法可以实现对列车的速度与位移精确追踪。

基于RBF神经网络补偿的ROV运动控制算法

针对作业型遥控水下航行器(ROV)在模型参数不确定和外部环境干扰下的运动控制问题,提出了一种基于径向基函数(RBF)神经网络的自适应双环滑模控制策略。首先,对于ROV外环位置控制采用改进趋近律的积分滑模控制方法,对于ROV内环速度控制采用指数趋近律的积分滑模控制方法;其次,为进一步改善滑模控制的抖振问题,引入双曲正切函数作为滑模切换项;然后,利用RBF神经网络控制技术对ROV模型的不确定参数和外部扰动进行估计与补偿;最后,利用李雅普诺夫稳定性理论证明了整个闭环系统的稳定性,并对作业型ROV的运动控制进行了数值仿真。仿真结果验证了所设计的控制器可以实现ROV航行的精确控制,并能够有效抑制模型不确定参数和外部扰动对ROV运动的影响。

2族3-紧优的有向双环网络无限族

该文给出一种寻找k-紧优的双环网络无限族(k≥0)的方法,利用此方法得到了2族 3-紧优的有向双环网络无限族．

关于有向双环网络L-形瓦的四个参数

对于有向双环网络G(n;s1,s2),四个参数k1,k2,j1,j2定义如下:(1)k1=min{k|ks2≡js1(mod n)且k≥j≥0,k=1,2,…,n-1};(2 j1=min{j|k1s2≡js1(mod n),j≥0};(3)j2=min{j|ks2≡js1(mod n)且j>k≥0,j=1,2,…,n-1};(4)k2=min{k|ks2≡j2s1(mod n),k≥0};则k1,k2,j1,j2恰好是由G(n;s1,s2)决定的L-形瓦的四个参数,并且(j2-j1,k1-k2)是同余方程xs1+ys2≡0(mod n)的最小正解.

8族新的2-紧优的有向双环网络无限族

给出了8族新的2-紧优的有向双环网络无限族.

奇异k-紧整数无限族

设n,s1,s2是3个正整数,使得s1<s2<n,gcd(n,s1,s2)=1.双环网G(n;s1,s2)是个有向图,其结点集为V={0,1,2,L,n?1},其弧集为A={i→i+s1(modn),i→i+s2(modn)|i∈V},s1和s 2称为步长.设d(n;s1,s2)为双环网G(n;s1,s2)的直径.令d(n)=min{d(n;s1,s2)|s1<s2<n},d 1(n)=min{d(n;1,s)|1<s<n}.已知d 1(n)≥d(n)≥?3n??2=lb(n).若d(n;s1,s2)=d(n)=lb(n)+k(k≥0),则称G(n;s1,s2)是个k-紧优的双环网.虽然等式d 1(n)=d(n)对于无限多个整数n成立,但也存在无限多个整数n使得d 1(n)>d(n),这样的n称为奇异整数.若d 1(n)>d(n)=lb(n)+k,k≥0,则这样的n称为奇异k-紧整数.本文给出构造奇异k-紧整数无限族的方法,并对于k=1,2,L,20,构造出这样的无限族.

一类3-紧优双环网无限族

到给定顶点数的双环网的最小直径是图论和计算机工作者广泛研究的问题。虽然大多数双环网可以达到紧优,但仍然有一部分双环网不能达到。本文给出了一类3-紧优的双环网无限族。

一类4-紧优双环网无限族

找出给定顶点数的双环网的最小直径是图论和计算机工作者重点研究的问题之一.虽然大多数双环网可以达到紧优,但仍然有一部分双环网不能达到.本文给出了一类4-紧优的双环网无限族.

一类7-紧优双环网无限族

到给定顶点数的双环网的最小直径是图论和计算机工作者广泛研究的问题。虽然大多数双环网可以达到紧优,但仍然有一部分双环网不能达到。给出了一类7-紧优的双环网无限族。

一类1-紧优双环网无限族

目的找到新的1-紧优双环网无限族。方法利用双环网的k-紧瓦母型理论进行推导。结果给出了一类新的1-紧优双环网无限族。结论拓展了双环网无限族类。

6G数字孪生网络分布式架构及关键技术

面对新一轮科技与产业变革,新型信息领域创新性技术正在不断脱颖而出,以数字孪生等为代表的新型技术正在为6G网络的发展打开新的格局。数字孪生作为支撑网络统一规划、编排和管理的发展范式,是赋能6G演进的重要技术方向。文章深入分析数字孪生网络的现状和发展态势,提出面向6G的数字孪生网络分布式架构体系,并针对数据、建模和编排预验证三大核心技术进行详细研究,提出创新性的解决方案,可有效应对数字孪生网络面临的关键挑战。