牵制控制含噪声的多延迟超网络的结构识别

本文研究了含噪声的多延迟超网络的结构识别问题,利用随机微分时滞方程的LaSalle不变原理和Lyapunov稳定性理论,获得了通过牵制控制进行超网络结构辨识的理论.通过数值仿真验证了理论结果的有效性.以三层网络为例,仅控制一个节点就可以成功识别出该网络的未知拓扑结构,同时,驱动网络和响应网络达到了同步.     

基于线性规划的网络流量流向控制策略

互联网的快速发展给运营商带来了网络流量流向控制的需求.控制网络流量流向不但要保证服务质量,而且要尽可能降低运营费用,更要保证各网络链路具备裕量能应对突发变化.在网络流量流向控制中结合成熟的线性规划方法从能全局角度实现网络流量流向的多目标控制,保障网络的健康运行.     

基于需求的实时网络定价策略

价格作为一种网络拥塞控制管理与资源分配的机制不断地表现出较高的效率。基于对网络使用实际流量的信息，本提出了一种实时的网络定价策略——基于需求的实时网络定价策略。该定价策略由三部分构成：固定连接费、资源使用费及网络拥塞费。与传统的定价策略相比，基于需求的实时网络定价策略更能反映实际的需求情况，在网络拥塞控制管理与网络资源分配等方面有更高的效率。     

基于网络控制的供应链库存系统的稳定性分析

针对一类供应链库存系统,研究了系统的闭环稳定性问题.创新点在于通过引入网络控制的思想,把供应链库存系统建模成网络时滞控制系统.在网络诱导时滞的上下界和丢包率已知的前提下,通过网络控制器的设计,分析了供应链库存系统的稳定性,并利用自由权矩阵和Lyapunov稳定性理论,给出了供应链库存系统渐近稳定的充分条件,并通过数值仿真验证了所提控制方案的可行性和有效性.     

分配网络的一个最小费用流算法

分配网络流广泛应用于解决水源、电力的调度及工厂的产品运输、分配、合成等问题.本文提出一个分配网络流的最小费用流算法.     

软件定义网络中的控制器研究综述

软件定义网络因其控制平面与转发平面分离的体系使得网络具备快速创新、敏捷编程以及易于管理等特性而备受关注.控制平面被转移到单独的主机或服务器上形成控制器.软件定义网络的核心,控制器因支撑着大量网络应用的运行以及控制着网络的行为而成为学术界和工业界的研究热点.从控制器框架、可编程性、控制模块的管理和编排、控制器的分布式部署等方面进行综述.最后,给出了下一步控制器领域的研究方向.     

无标度网络模型的局部笛卡尔积北大核心

本文首先给出网络的最小控制集的概念,先从理论上用笛卡尔积算法引入对两个网络的最小控制集做笛卡尔积算法的具体方式,进而给出对两个网络中的最小控制集做笛卡尔积的过程,并说明所得笛卡尔积网络的拓扑结构.最后,例举两个网络模型来解释做笛卡尔积运算的方式,并计算了笛卡尔积网络的平均度,进而验证了笛卡尔积网络的无标度性.     

关于耦合网络间同步控制的一个注记

本文旨在研究具有相互作用的两个网络间的同步及其控制问题,从理论上我们证明了通过选择适当的控制项,两个网络可以达到同步．文中没有限制两个网络具有相同的动力学,针对两个网络的拓扑结构和网络问的作用矩阵,我们提出了两种自适应同步格式,最后通过数值算例来阐述我们得到的理论结果．     

乳腺癌易感基因蛋白质网络的构建与研究

本文从复杂网络理论出发,在分析原有乳腺癌易感基因数据的基础上,综合统计分析易感基因彼此之间的关联与乳腺癌疾病之间的关系,并以此构建乳腺癌致病基因蛋白质网络．通过计算和研究网络度,聚类系数等指标发现,此网络具有高度聚集性,即少数核心节点控制着整个网络结构的稳定性．这将为进一步研究和发现乳腺癌致病基因提供新的理论依据和方法．     

基于变分不等式的生态工业链网络均衡问题研究

以变分不等式为基础提出生态工业链网络均衡模型。生态工业链是通过仿照自然生态系统中的物质循环方式与生物群体之间的竞争与共生模式,使不同企业之间形成共享资源和互换副产品从而实现园区各企业经济与环境效益的最大化。针对生态工业链网络的多产品(主副产品和废弃物)多层次的网络结构,模仿自然生态系统中的生产者、消费者和分解者,分别对各层决策者的独立优化决策行为及其相互作用进行分析,利用变分不等式分析各层均衡条件进而构建生态工业链网络均衡模型,得到系统达到均衡的条件并给出相应的经济解释。在证明系统变分不等式的解存在的基础上,通过数值算例验证模型的合理性与有效性。     

Instantaneous control for traffic flow

The solution methods for optimal control problems with coupled partial differential equations as constraints are computationally costly and memory intensive; in particular for problems stated on networks, this prevents the methods from being relevant. We present instantaneous control problems for the optimization of traffic flow problems on road networks. We derive the optimality conditions, investigate the relation to the full optimal control problem and prove that certain properties of the optimal control problem carry over to the instantaneous one. We propose a solution algorithm and compare quality of the computed controls and run‐times. Copyright © 2006 John Wiley & Sons, Ltd.     

The achievable region method in the optimal control of queueing systems; formulations,bounds and policies

We survey a new approach that the author and his co-workers have developed to formulate stochastic control problems (predominantly queueing systems) asmathematical programming problems. The central idea is to characterize the region of achievable performance in a stochastic control problem, i.e., find linear or nonlinear constraints on the performance vectors that all policies satisfy. We present linear and nonlinear relaxations of the performance space for the following problems: Indexable systems (multiclass single station queues and multiarmed bandit problems), restless bandit problems, polling systems, multiclass queueing and loss networks. These relaxations lead to bounds on the performance of an optimal policy. Using information from the relaxations we construct heuristic nearly optimal policies. The theme in the paper is the thesis that better formulations lead to deeper understanding and better solution methods. Overall the proposed approach for stochastic control problems parallels efforts of the mathematical programming community in the last twenty years to develop sharper formulations (polyhedral combinatorics and more recently nonlinear relaxations) and leads to new insights ranging from a complete characterization and new algorithms for indexable systems to tight lower bounds and nearly optimal algorithms for restless bandit problems, polling systems, multiclass queueing and loss networks.     

Real-time data gathering in sensor networks

Wireless sensor networks represent a new generation of real-time traffic communications and high data rate sensor applications, such as structural health monitoring and control. We study some problems related to data gathering in sensor networks when the sensors collect the sensed data about their environment and this information should be delivered to a collecting central Base Station. We prove that scheduling messages through the network to minimize the maximal delivery time with restrictions on the total idle time allowed is NP-hard. We also refer to a special case of linear network topology for which we present two polynomial time optimization algorithms: One is for minimizing the maximal lateness and maximal delay, while the other is for minimizing the number of tardy messages.     

增长网络的形成机理和度分布计算

关于增长网络的形成机理,着重介绍由线性增长与择优连接组成的BA模型, 以及加速增长模型.此外,我们提出了一个含反择优概率删除旧连线的模型,这个模型能自组织演化成scale-free(SF)网络.关于计算SF网络的度分布,简要介绍文献上常用的基于连续性理论的动力学方法(包括平均场和率方程)和基于概率理论的主方程方法.另外,我们基于马尔可夫链理论还首次尝试了数值计算方法.这一方法避免了复杂方程的求解困难,所以较有普适性,因此可用于研究更为复杂的网络模型.我们用这种数值计算方法研究了一个具有对数增长的加速增长模型,这个模型也能自组织演化成SF网络.     

Update games and update networks

In this paper we model infinite processes with finite configurations as infinite games over finite graphs. We investigate those games, called update games, in which each configuration occurs an infinite number of times during a two-person play. We also present an efficient polynomial-time algorithm (and partial characterization) for deciding if a graph is an update network.     

Analysis and stability of consensus in networked control systems

In this paper, the consensus problem in networks of integrators is investigated. After recalling the classical diffusive protocol, we present in a unified framework some results on the rate of convergence previously presented in the literature. Then, we introduce two switching communication protocols, one based on a switching coupling law between neighboring nodes, the other on the conditional activation of links in the network. We show that the former protocol induces the monotonicity of each system in the network, enhancing the speed of convergence to consensus. Moreover, adopting this novel protocol, we are able to control the network, steering the nodes’ dynamics to a desired consensus value. The aim of the latter protocol is instead to select adaptively the activation of the edges of the network, in accordance with the dynamics of the network. After showing the effectiveness of both approaches through numerical simulations, the stability properties of these protocols are discussed.     

Large deviations analysis of the generalized processor sharing policy

In this paper we consider a stochastic server (modeling a multiclass communication switch) fed by a set of parallel buffers. The dynamics of the system evolve in discrete-time and the generalized processor sharing (GPS) scheduling policy of [25] is implemented. The arrival process in each buffer is an arbitrary, and possibly autocorrelated, stochastic process. We obtain a large deviations asymptotic for the buffer overflow probability at each buffer. In the standard large deviations methodology, we provide a lower and a matching (up to first degree in the exponent) upper bound on the buffer overflow probabilities. We view the problem of finding a most likely sample path that leads to an overflow as an optimal control problem. Using ideas from convex optimization we analytically solve the control problem to obtain both the asymptotic exponent of the overflow probability and a characterization of most likely modes of overflow. These results have important implications for traffic management of high-speed networks. They extend the deterministic, worst-case analysis of [25] to the case where a detailed statistical model of the input traffic is available and can be used as a basis for an admission control mechanism. This revised version was published online in June 2006 with corrections to the Cover Date.     

A new model for gas flow in pipe networks

We introduce a new model for gas dynamics in pipe networks by asymptotic analysis. The model is derived from the isothermal Euler equations. We present the derivation of the model as well as numerical results illustrating the validity and its properties. We compare the new model with existing models from the mathematical and engineering literature. We further give numerical results on a sample network. Copyright © 2009 John Wiley & Sons, Ltd.     

Quality of service statistics over heterogeneous networks: Analysis and applications

Heterogeneous wireless/wired networks and ubiquitous environments are gaining ever more attention by research community. To properly control and manage such puzzles a deep knowledge of quality of service parameters is needed and, therefore, a complete and robust performance assessment is necessary. This paper deals with a performance evaluation and measurement of a number of heterogeneous end-to-end paths taking into account a wide range of statistics. To study the behavior of QoS parameters, an active measurement approach has been introduced for the analysis of properties we called (i) concise statistics (mean, standard deviation, inter quantile range, minimum, maximum, and median) and (ii) detailed statistics (Probability Density Function, Auto-correlation Function, Entropy, Complementary Cumulative Distribution Function, and Bivariate Probability Density Function). We show how, thanks to this view on QoS statistics, a more complete understanding of QoS parameters behavior is possible. In addition, we show how the measured statistics can be fruitfully used in the context of network control and management. More precisely, we present two proof of concepts regarding frameworks for QoS-based anomaly detection and for QoS-based identification of network elements.     

An approximation algorithm for the wireless gathering problem

The Wireless Gathering Problem is to find an interference-free schedule for data gathering in a wireless network in minimum time. We present a 4-approximate polynomial-time on-line algorithm for this NP-hard problem. We show that no shortest path following algorithm can have an approximation ratio better than 4.