基于节点多样性的域内路由保护算法

已有的路由保护方案都没有考虑网络中节点的重要程度,然而在实际网络中不同节点在网络中的重要程度是不相同的。针对该问题,提出一种基于节点多样性的域内路由保护算法（intra-domain routing protection algorithm based on node diversity,RPBND）。计算节点构造以目的为根的最短路径树（shortest path tree,SPT）,从而保证RPBND算法和目前互联网部署的路由算法的兼容性;在该最短路径树的基础上构造特定结构的有向无环图（directed acyclic graph,DAG）,从而最大化路由可用性。实验结果表明,RPBND极大地提高了路由可用性,降低了故障造成的网络中断时间,为ISP部署域内路由保护方案提供了充分的依据。     

内容中心网络中基于区域集中化控制的协作缓存路由机制*

针对在内容中心网络(Content Centric Networking, CCN)中如何合理放置与高效利用应答数据的问题,该文将集中化控制的思想引入到内容缓存与查找中,提出一种协作缓存路由机制。缓存决策时,通过兴趣包和数据包携带标签的方式,确定沿途最大缓存收益区域;在最大缓存收益区域内,结合内容全局活跃度和节点可用缓存空间,选择内容最佳放置位置。路由查找时,将区域内容放置与路由转发相结合,增大缓存资源可用性。仿真结果表明,与经典算法相比,该机制以少量额外的开销提高了缓存命中率和跳数减少率,改善了缓存负载分布均衡性,提升了CCN网络缓存和传输效率。     

Network routing control with G-networks

The aim of this paper is to detail a control scheme for packet computer networks whose purpose is to minimise a quality-of-service oriented performance metric by re-routing the traffic. The model is based on G-networks with triggered customer movement to represent traffic re-routing, and on a gradient descent based optimisation algorithm. The model and the algorithm are presented and we show that the gradient descent algorithm is of computational complexity O(N³) where N is the number of nodes in the packet network. Via the use of multiple classes of normal traffic and multiple classes of triggers, our approach allows one not only to evaluate the effect of the control, but also to incorporate the overhead that the control traffic will induce, and the consequences of the delays or possible losses of the control traffic. Similarly, these effects will naturally be incorporated when one considers both the impact of the control traffic on the cost function, and the details of this control traffic in the control algorithm itself.     

On centralized optimal control

It can be argued that the Holy Grail of control theory is the determination of the optimal feedback control law or simply the feedback control law. This is understandable given the huge success of the linear quadratic Gaussian (LQG) theory and applications for the past half-century. It is not an exaggeration to say that the entire aerospace industry, from the Apollo moon landing to the latest global positioning system (GPS), owe a debt to this control-theoretic development in the late 1950s and early 1960s. As a result, the curse of dimensionality notwithstanding, finding the optimal control law for more general dynamic systems remains an idealized goal for all problem solvers. We continue to hope that with each advance in computer hardware and mathematical theory, we will move one step closer to this ultimate goal. Efforts such as feedback linearization and multimode adaptive control can be viewed as such successful attempts. It is the thesis of this note to argue that this idealized goal of control theory is somewhat misplaced. We have been seduced by our early successes with the LQG theory and its extensions. The simple but often not emphasized fact is this: It is extremely difficult to specify and impossible to implement a general multivariable function even if the function is known.     

基于无线Mesh网络的集中式自愈路由算法研究

针对现有无线Mesh网络路由算法寻路洪泛严重、自愈性能较差等问题,引入集中式路由的思想,结合多路径策略,提出了一种集中式自愈路由算法(Centralized Self-healing Routing Protocol,CSRP),即通过各节点主动上传链路状态消息至Root节点的方式得到全网最新加权拓扑,并为源目节点之间计算全局最优路由。采用节点不相交多路径备份策略,实现失效路由的快速自愈。加入基于链路质量感知的Root节点切换机制,保证路由申请及分发的可靠性。仿真结果表明,CSRP算法有效抑制了洪泛现象、提升了网络性能,相比于现有经典相关算法路由开销至少降低67%,时延平均降低45%,包递交率平均提升8%。     

MLaR: machine-learning-assisted centralized link-state routing in software-defined-based wireless networks

Neural Computing and Applications - Software-defined networking (SDN) is a flexible networking paradigm that provides isolation of control and data planes from each other, proposes control...     

Performance analysis of centralized databases with optimistic concurrency control

In this paper we analyze Optimistic Concurrency Control (OCC) schemes based on certification. We allow two data access schemes referred to as static and dynamic. A static data access scheme implies that all data items are accessed at the beginning of transaction processing, while data items are accessed on demand during the processing of a transaction in a dynamic scheme. After completing its processing, each transaction is validated, i.e., checked as to whether it has encountered a data conflict. Validated transactions commit; otherwise, they are restarted. A variant of the regular (silent) commit scheme where a committing transaction notifies conflicted transactions to restart immediately (broadcast commit scheme) is also considered. System efficiency or the fraction of useful work as affected by data contention is used as the main performance measure. We develop an iterative solution method to analyze the performance of OCC schemes in the framework of a system with a fixed number of transactions in multiple classes with given occurrence frequencies. The model is analyzed by (iteratively) solving a set of nonlinear equations which relate per class efficiencies to system efficiency. The iterative solution method is validated against simulation and shown to be highly accurate even for high data contention. An advantage of the iterative solution method is that it separates the analysis of data contention from hardware resource contention and provides per class efficiencies. We present graphs/tables, which are used to determine how system performance is affected by: (i) various OCC schemes, (ii) the distribution of transaction processing times, (iii) transaction size and its distribution, and (iv) the throughput characteristics of the system (as determined by hardware contention).     

Reliable regulation in centralized control systems

This paper addresses the design of a reliable control system for a linear, asymptotically stable plant. Specifically, the considered problem consists in finding a regulator which guarantees asymptotic stability, signal tracking and disturbance rejection when all the instrumentation is operational, and ensures that these properties are preserved, to the maximum possible extent, when an arbitrary number of sensors and/or actuators faults occur, that is, some of the feedback loops open. With reference to a centralized control structure and exogenous signals with multiple poles on the imaginary axis, the paper supplies a necessary and sufficient condition for the problem to admit a solution, and a possible least order regulator.     

基于Xen的域间切换方法研究

为解决开源虚拟化系统的桌面切换问题,提出一种基于Xen的域间切换方法。利用Xen虚拟化支持Intel VT-x的硬件,使用RFB协议根据配置文件连接到VNC Server端,以显示虚拟机桌面,通过加密切换指令验证信息,从而完成域间切换。实验结果表明,该方法能实现Windows域和Linux域的桌面切换。     

LSC2: An extended link state protocol with centralized control

Peer-to-Peer Networking and Applications - Current link state routing is based on routing decisions made through distributed interactions among routers. Link state is disseminated by means of...     

Anomaly detection and resilient control of networked control system with multi-hop routing

With the wide application of networked control systems, how to deal with data injection attacks and maintain the stability of control systems including wireless multi-hop networks is a problem that the researchers and technological workers must consider and solve. Based on the construction of a control system including wireless multi-hop networks, the data transmission mode between routing nodes and the stability condition of the control system are given. Considering the existence of data injection attacks to routing nodes, a real-time detection method for anomaly behaviours is presented on the basis of chi-square goodness-of-fit test. In the case of data injection actions taking place, a strategy of switching paths in turn is used to execute the control task. The strategy is satisfied with the resilient stability of the control system. The simulation results show that the detection method can detect the data injection actions in real time, and the control strategy can restore control variables to proper values when the data injection actions exist. These methods have certain application prospects and popularisation values.     

基于PIM-SM的域内组播设计

PIM-SM是一个不依赖于某一特定单播路由协议的组播路由协议,为组播数据转发提供路由信息。介绍了IP组播原理,分析了组播通信的优点,概述了组播路由协议。研究了基于PIM-SM的组播网络设计与实现方法,并给出了相关的网络配置方案。     

Multi-objective clustered-based routing with coverage control in wireless sensor networks

A wireless sensor network (WSN) generally consists of a large number of inexpensive power constrained sensors that are small in size and communicate over short distances to perform a predefined task. Realizing the full potential of WSN poses many design problems, especially those which involve tradeoffs between multiple conflicting optimization objectives such as coverage preservation and energy conservation. While both energy conservation routing protocols in a cluster-based WSNs and coverage-maintenance problems have been extensively studied in the literature, these two problems have not been integrated in a multi-objective optimization (MOO) manner. This paper employs a recently developed MOO algorithm, the so-called multi-objective evolutionary algorithm based on decomposition (MOEA/D) to solve simultaneously the energy conservation and coverage preservation design problems in cluster-based WSNs. The performance of the proposed approach, in terms of network lifetime and coverage is compared with the heuristic LEACH and SEP clustering protocols and with another prominent MOEA, the so-called non-dominated sorting genetic algorithm II (NSGA II). Simulation results reveal that MOEA/D provides a more efficient and reliable behavior over other approaches.     

Exact convergence of a parallel textured algorithm for data networkoptimal routing problems

In our earlier paper (1991), a textured decomposition based algorithm is developed to solve the optimal routing problem in data networks; a few examples were used to illustrate the speedup advantage and the convergence conditions for the textured algorithm to converge to a global minimum. The speedup advantage is investigated in Huang et al. (1993). However, the theoretical foundation is not provided. In this paper, we provide the foundation. First, we show that for any textured decomposition, the algorithm always converges to a stationary point, which may not be a global minimum. And then, we prove that if the conditions of the exact convergence theorem are satisfied, the textured algorithm will converge to a global minimum     

Adaptive neural control for a tilting quadcopter with finite-time convergence

Neural Computing and Applications - This paper addresses the tracking control problem of the tilting quadcopter with unknown nonlinearities. A novel tilting quadcopter conception is proposed with a...     

基于优化链路权值的域内路由保护方案

目前,互联网部署的域内链路状态路由协议,如开放最短路径优先(Open Shortest Path First,OSPF)和中间系统到中间系统(Intermediate System-to-Intermediate System,IS-IS),采用被动恢复方案应对网络故障。随着网络的发展,大量的实时应用部署在互联网上,OSPF的收敛时间无法满足这些实时应用对收敛时间的需求。因此,学术界和工业界提出采用路由保护方案来应对网路中出现的故障。然而,已有的路由保护方案存在两个方面的问题:1)默认路径和备份路径的交叉度较高,如LFA；2)为了计算两条交叉度低的路径,对默认路径加以限制,即默认路径不采用最短路径,如Color Tree。为了解决上述两个问题,首先将上述问题归结为整数规划模型,接着利用启发式方法计算近似最优解,最后在实际网络和模拟网络中对所提算法进行了大量实验。实验结果表明,所提算法可以降低默认路径和备份路径的交叉度,极大地提高网络的可用性。     

Minimization of the delay in a data-communication network with centralized control under uncertainty

An adaptive algorithm which minimizes the delay in a data communication network with centralized control under uncertainty is presented. The model considered in Segall [5] is adopted. Additionally it is assumed that each measurement (observation) of the entering traffic to the network, the delays and the gradient of the delays are accompanied with some noise which is a random variable with unknown distribution.     

Adaptive attitude tracking control for rigid spacecraft with finite-time convergence

In this paper, the finite-time attitude tracking control problem for rigid spacecraft with external disturbances and inertia uncertainties is addressed. First, a novel fast nonsingular terminal sliding mode surface (FNTSMS) without any constraint is designed, which not only avoids the singularity problem, but also contains the advantages of the nonsingular terminal sliding mode (NTSM) and the conventional sliding-mode together. Second, the proposed FNTSM control laws (FNTSMCLs) by employing FNTSMS associated with adaptation provide finite-time convergence, robustness, faster, higher control precision. The proposed FNTSMCLs in light of novel adaptive control architecture are continuous. Thus, they are chattering-free. Finally, simulation results are presented to illustrate effectiveness of the control strategies. In addition, digital simulations of satellite Hubble Space Telescope (HST) are presented to verify the practical feasibility of the reorientation/ slew maneuvers mission.