Synchronization of complex switched delay dynamical networks with simultaneously diagonalizable coupling matrices

This paper studies local exponential synchronization of complex delayed networks with switching topology via switched system stability theory. First, by a common unitary matrix, the problem of synchronization is transformed into the stability analysis of some linear switched delay systems. Then, when all subnetworks are synchronizable, a delay-dependent sufficient condition is given in terms of linear matrix inequalities （LMIs） which guarantees the solvability of the synchronization problem under an average dwell time scheme. We extend this result to the case that not all subnetworks are synchronizable. It is shown that in addition to average dwell time, if the ratio of the total activation time of synchronizable and non-synchronizable subnetworks satisfy an extra condition, then the problem is also solvable. Two numerical examples of delayed dynamical networks with switching topology are given, which demonstrate the effectiveness of obtained results.

Relay switched, scalable topology control for mobile robot networks based on motion synchronization

A mobile robot network is said to be easily scalable to any number of robots if its performance is keptalmost fixed after these robots are added or some fail in the network. An interaction dynamics modelbased on motion synchronization is first established. Considering the mobility of mobile robot networks,we propose a relay switched, distributed topology control for the scalable network to drive newly addedrobots to the most suitable positions with more neighbor's as well as self-heal the blank positions of failedrobots, and give a metric of the topology structure for evaluating the performance of network topologies.Then, we prove the stability of motion synchronization with the individual control based on Lyapunov exponent.Finally, the results of simulations have demonstrated the validity of the proposed modeling and controlmethods.

Real-time Performance Evaluation of Line Topology Switched Ethernet

Recently,switched Ethernet has become an active area of research because of its wide uses in industry.However,its uses have various real-time constraints on data communications.This paper analyzes the performance of the line topology switched Ethernet as a data acquisition network.Network calculus theory,which has been successfully applied to assess the real-time performance of packet-switched networks,is used to analyze the networks.To properly describe the activity of switches,a novel approach of modeling data flows into or out of switches is addressed.Based on our model,a concisely analytical expression of the maximal end-to-end delay in line topology switched Ethernet is derived.Finally,the relative simulation results are demonstrated.These results agree well with the analytical results,and thus they validate the data flow modeling techniques.

A Study of Optimum Switching Problem for Production Systems Considering Efficiency, Delivery Time and Green Evaluation

This paper aims to derive the optimal switching strategy for production system considering efficiency, delivery time and green evaluation. Nowadays more and more manufacturing and logistics systems not only pursue better work efficiency, but also focus on green energy evaluation issues. Cost reduction and shortening of delivery time are always important management issues in pursuit of efficiency and optimization of the entire production system because of global production competition. In a market situation where customer needs change in various ways, in particular, due to inadequate quality, changes in the local environment, natural disasters and so on. Therefore, prompt planning of management measures such as switching work processes and changing production methods has become an important issue. On the other hand, since the Paris Agreement came into effect, the construction of an environment-friendly production system has been required as an approach to environmental problems such as global warming. In this paper, we propose an optimum switching model of production systems considering efficiency, delivery time and green evaluation using a green evaluation index (GEC: Green Energy Coefficient). We also discuss the optimal switching strategy by numerical observation.

Data-Driven Leader-Follower Output Synchronization for Networked Non-Linear Multi-Agent Systems with Switching Topology and Time-Varying Delays

这份报纸与交换拓扑学和变化时间的延期为联网的非线性的多代理人系统的一个类学习输出同步问题。同步产量，一个领导人被介绍其到追随者的连接基于模型与时间，和一个新奇数据驱动的一致协议变化免费适应控制被建议，在每个追随者的引用输入被设计是的地方，附近的代理人的变化时间的一般水准输出。两盒子领导人什么时候另外与规定参考书输入和盒子，被考虑。建议协议允许变化时间的延期，切换的拓扑学，并且不含蓄地或明确地使用代理人结构或动力学信息。足够的条件被导出保证为一致集中的靠近环的稳定性，和条件被获得，在仅仅一棵联合跨越树被要求的地方。数字模拟和实际实验被进行表明建议协议的有效性。

An Improved Data-Driven Topology Optimization Method Using Feature Pyramid Networks with Physical Constraints

Deep learning for topology optimization has been extensively studied to reduce the cost of calculation in recent years.However,the loss function of the above method is mainly based on pixel-wise errors from the image perspective,which cannot embed the physical knowledge of topology optimization.Therefore,this paper presents an improved deep learning model to alleviate the above difficulty effectively.The feature pyramid network(FPN),a kind of deep learning model,is trained to learn the inherent physical law of topology optimization itself,of which the loss function is composed of pixel-wise errors and physical constraints.Since the calculation of physical constraints requires finite element analysis(FEA)with high calculating costs,the strategy of adjusting the time when physical constraints are added is proposed to achieve the balance between the training cost and the training effect.Then,two classical topology optimization problems are investigated to verify the effectiveness of the proposed method.The results show that the developed model using a small number of samples can quickly obtain the optimization structure without any iteration,which has not only high pixel-wise accuracy but also good physical performance.

A Controller-Based Architecture for Information Centric Network Construction and Topology management

Information-Centric Networking(ICN) has recently emerged as a result of the increased demand to access contents regardless of their location in the network services. This new approach facilitates content distribution as a service of the network with lower delay and higher security in comparison with the current IP network. Applying ICN in current IP infrastructure leads to major complexities. One approach to deploy ICN with less complexity is to integrate ICN with Software Defined Networking(SDN). The SDN controller manages the content distribution, caching, and routing based on the users' requests. In this paper, we extend these context by addressing the ICN topology management problem over the SDN network to achieve an improved user experience as well as network performance. In particular, a centralized controller is designed to construct and manage the ICN overlay. Experimental results indicate that this adopted topology management strategy achieves high performance, in terms of low failure in interest satisfaction and reduced download time compared to a plain ICN.

Extended consensus analysis of multi-agent systems with switching topologies

Theoretical analysis of consensus for networked multi-agent systems with switching topologies was conducted.Supposing that information-exchange topologies of networked system are dynamic,a modified linear protocol is proffered which is more practical than existing ones.The definition of trajectory consensus is given and a new consensus protocol is exhibited such that multi-agent system achieves trajectory consensus.In addition,a formation control strategy is designed.A common Lyapunov function is proposed to analyze the consensus convergence of networked multi-agent systems with switching topologies.Simulations are provided to demonstrate the effectiveness of the theoretical results.

Optimizing Fiber Topologies for WDM Optical Networks Based on Multi-Granularity Optical Switching Technology

For the quality of service （QoS） and fairness considerations, the hop counts of various lightpaths in a wavelength division multiplexing （WDM） optical network should be short and compact. The development of multi-granularity optical switching technology has made it possible to construct various fiber topologies over a fixed physical topology. This paper describes a fiber topology design （FTD） problem, which minimizes the maximum number of required fibers in the physical links for a maximum lightpath hop count in the fiber topology. After the formular description for the FTD problem, a method was given to obtain the lower bound on the maximum number of required fibers. For large or moderate scale networks, three heuristic algorithms are given to efficiently solve the FTD problem. This study gives a new way to optimize the resource configuration performance in WDM optical networks at the topology level and proves its effectiveness via both analyses and numerical experiments.

Synchronized output regulation of switching networks based on synchronization observer

This paper studies the synchronized output regulation （SOR） problem of networked dynamic systems with switching topology that is uniformly connected and leader-rooted. In these networked systems, the tracked signal or the rejected disturbance is generated by the same exosystem, and however, the state of the exosystem is only available for leader nodes. First, a synchronization observer of the exosystem is proposed in this paper to overcome the difficulty caused by the unavailable state of the exosystem for follower nodes with directed switching information flow. It is shown that the observer state will synchronize to the state of the exosystem. Then, two feedback controllers based on decentralized dynamic error and state are presented to solve this SOR problem. Furthermore, the main idea in this paper will provide a promising way for realizing the multirobot systems＇ tracking and formation requirement. Numerical simulation results are presented to demonstrate the effectiveness of the theoretical results.

A Clustering-tree Topology Control Based on the Energy Forecast for Heterogeneous Wireless Sensor Networks

How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks(HWSN).In this paper, a clustering-tree topology control algorithm based on the energy forecast(CTEF) is proposed for saving energy and ensuring network load balancing, while considering the link quality, packet loss rate, etc. In CTEF, the average energy of the network is accurately predicted per round(the lifetime of the network is denoted by rounds) in terms of the difference between the ideal and actual average residual energy using central limit theorem and normal distribution mechanism, simultaneously. On this basis, cluster heads are selected by cost function(including the energy, link quality and packet loss rate) and their distance.The non-cluster heads are determined to join the cluster through the energy, distance and link quality. Furthermore, several noncluster heads in each cluster are chosen as the relay nodes for transmitting data through multi-hop communication to decrease the load of each cluster-head and prolong the lifetime of the network. The simulation results show the efficiency of CTEF. Compared with low-energy adaptive clustering hierarchy(LEACH), energy dissipation forecast and clustering management(EDFCM) and efficient and dynamic clustering scheme(EDCS)protocols, CTEF has longer network lifetime and receives more data packets at base station.

An Optimization Algorithm of Network Topology Discovery Based on SNMP Protocol

Through the analysis of network topology discovery algorithm used ICMP protocol and FDB address, a novel layer topology discovery and link layer topology discovery algorithm which is suitable for campus network environment is proposed based on SNMP protocol. This algorithm can rapidly and accurately calculate the second and third floors topology of the whole pipe network.

Day-ahead Voltage-stability-constrained Network Topology Optimization with Uncertainties

A day-ahead voltage-stability-constrained network topology optimization(DVNTO)problem is proposed to find the day-ahead topology schemes with the minimum number of operations(including line switching and bus-bar splitting)while ensuring the sufficient hourly voltage stability margin and the engineering operation requirement of power systems.The AC continuation power flow and the uncertainty from both renewable energy sources and loads are incorporated into the formulation.The proposed DVNTO problem is a stochastic,largescale,nonlinear integer programming problem.To solve it tractably,a tailored three-stage solution methodology,including a scenario generation and reduction stage,a dynamic period partition stage,and a topology identification stage,is presented.First,to address the challenges posed by uncertainties,a novel problem-specified scenario reduction process is proposed to obtain the representative scenarios.Then,to obtain the minimum number of necessary operations to alter the network topologies for the next 24-hour horizon,a dynamic period partition strategy is presented to partition the hours into several periods according to the hourly voltage information based on the voltage stability problem.Finally,a topology identification stage is performed to identify the final network topology scheme.The effectiveness and robustness of the proposed three-stage solution methodology under different loading conditions and the effectiveness of the proposed partition strategy are evaluated on the IEEE 118-bus and 3120-bus power systems.

Implementing an Artificial Neural Network Computer

Based on the implementation of NNSPC (Neural NetWork Synchronous Parallel Computer) developed by NJU, this paper discusses two schemes for implementing artificial neural network computer withdistributed memories: One is Switch Network Structure; the other is Ring Topology Structure. This papergives a comparison betWeen the two schemes and the principles of scheme selection.

分数阶时滞切换网络的全局同步

本文研究一类具有切换拓扑的Reimann-Liouville型分数阶时滞网络的同步问题,其中,时滞和无时滞耦合的结构矩阵不需要是可交换的。利用图论、Kronecker积和共同Lyapunov函数方法,提出了一种有效便捷的方法处理网络的全局同步,给出了一些简单的代数准则。本文所提出的方法可以很好地克服切换拓扑、时延和分数阶微积分带来的困难,数值结果验证了理论方法的有效性。

Passivity-based consensus for linear multi-agent systems under switching topologies

This paper studies the passivity-based consensus analysis and synthesis problems for a class of stochastic multi-agent systems with switching topologies. Based on Lyapunov methods, stochastic theory, and graph theory, new different storage Lyapunov functions are proposed to derive sufficient conditions on mean-square exponential consensus and stochastic passivity for multi-agent systems under two different switching cases, respectively. By designing passive time-varying consensus protocols, the solvability conditions for the passivity-based consensus protocol synthesis problem, i.e., passification, are derived based on linearization techniques. Numerical simulations are provided to illustrate the effectiveness of the proposed methods.

航天任务系统容灾备份技术应用

传统航天任务系统面临多代并存、部署不灵活、容灾手段不完善、应急切换速度慢等问题,难以适应后续云架构下一体化融合管控模式,必须解决容灾备份体系设计和系统级迁移切换难题。分析了传统航天任务系统存在的安全风险和特点规律,设计了云架构下异地容灾备份体系,提出了虚拟化迁移、网络层控制改造、应用层域名改造、通信配置集成管理等解决方法,形成了迁移部署流程和快速切换建链方法。试验表明,相比传统备份手段,云架构下异地容灾备份系统能够有效缩短系统级部署与切换时间至3小时,明显提升异常应对能力,可为后续一体化管控模式下容灾备份体系建设与特殊场景应用提供技术支持。