基于韧性度的低轨卫星通信网络抗毁性度量及优化

低轨卫星通信网络的抗毁性是描述网络安全可靠的有效工具,在网络体系结构设计和路由策略等领域得到了广泛的应用。根据低轨卫星通信网络中卫星在轨道平面内移动,需要不断进行切换的特点,从建立抗毁性测度模型以及网络抗毁性优化两个角度来评估和提高网络抗毁性,提出一种基于韧性度的低轨卫星通信网络抗毁性度量方法。通过对移动模型以及切换模型的结构分析,对每种结构以一定概率出现的低轨卫星通信网络,应用韧性度函数,求得网络在某个时刻及某一段时间段内的抗毁性,并针对切换模型的不足之处进行优化,用赋权韧性度来体现优化的效果,得到了优化后的网络抗毁性。以铱星系统为应用实例进行仿真,结果表明:任意时刻网络的抗毁性跟拓扑结构的韧性度值有关,并且是一种线性关系,即随着韧性度的增加,其抗毁性也增加。通过对铱星通信系统切换模型的优化,网络的抗毁性与平均抗毁性都得到了提升,说明本文所构建模型的有效性和实用性。     

A cross entropy approach to design of reliable networks

One of the most important parameters determining the performance of communication networks is network reliability. The network reliability strongly depends on not only topological layout of the communication networks but also reliability and availability of the communication facilities. The selection of optimal network topology is an NP-hard problem so that computation time of enumeration-based methods grows exponentially with network size. This paper presents a new solution approach based on cross-entropy method, called NCE, to design of communication networks. The design problem is to find a network topology with minimum cost such that all-terminal reliability is not less than a given level of reliability. To investigate the effectiveness of the proposed NCE, comparisons with other heuristic approaches given in the literature for the design problem are carried out in a three-stage experimental study. Computational results show that NCE is an effective heuristic approach to design of reliable networks.     

企业研发组织沟通网络实证及优化策略研究

鉴于企业研发组织内部沟通网络对研发组织中高效、低成本地实现技术信息共享的重要性,本文首先介绍了结构洞的测度方法,并对中间中心性方法进行改进;其次分析了某企业研发组织沟通网络的结构洞情况,指出非正式沟通网络和专业沟通网络的相关性;然后通过比较改进的中心度算法、传统的中心度算法与限制度指标的相似性,验证了该算法的有效性;最后提出一种削弱沟通网络中“核心人物”垄断地位的“搭桥”策略。结果发现:改进的中心度算法适用于带权值沟通网络结构洞的测定,验证了该算法加权方法的有效性,并给出通过非正式组织促进技术信息共享的对策     

Accessibility in transportation networks probabilistic versus deterministic approach

Existing accessibility measures imply either a perfectly legible structure of the communication network, or a perfectly informed “visitor”. In the study of transportation networks (as well as in the study of large architectural complexes, for example) this implied assumption is extremely unrealistic. Markov chain is interpreted as a model of communication process, and an information-theoretic measure is derived for the measurement of accesibility in conditions of uncertainty of the visitor about the structure of the communication network. A number of elementary network patterns are compared using deterministic and probabilistic measures of accessibility. It is claimed that different patterns differ in the degree of susceptibility to uncertainty in the communication process.     

Cucker–Smale flocking under rooted leadership and time-varying heterogeneous delays

In this paper, a Cucker–Smale model with time-varying heterogeneous delays in the communication process is investigated, where the delay on each communication link is time-varying and independent of other communication links. A general update rule based on the distance between agents is used to determine the edge weights of the communication network. The method of constructing augmented system is used so that the system stability is transformed into a product convergence problem of time-varying sub-stochastic matrices equivalently. By analyzing this convergence problem, a sufficient condition is established to achieve flocking, which relates to the initial states, the structure of communication network and the upper bound of time delays.     

Path delays in communication networks

A communication network is modelled by a weighted graph. The vertices of the graph represent stations with storage capabilities, while the edges of the graph represent communication channels (or other information processing media). Channel capacity weights are assigned to the edges of the network. The network is assumed to operate in a store-and-forward manner, so that when a channel is busy the messages directed into it are stored at the station, joining there a queue which is governed by a first-come first-served service discipline. Assuming messages, with fixed length, to arrive at random at the network, following the statistics of a Poisson point process, we calculate the statistical characteristics of the message time-delays along a path in a communication network. We solve for the steadystate distributions of the message waiting-times along the path, for the distribution of the overall message delay-time, for the average memory size requirements at the stations, as well as for other statistical characteristics of the message flow and the queueing processes along a communication path.     

Communication and Cooperation in Public Network Situations

This paper focuses on sharing the costs and revenues of maintaining a public network communication structure. Revenues are assumed to be bilateral and communication links are publicly available but costly. It is assumed that agents are located at the vertices of an undirected graph in which the edges represent all possible communication links. We take the approach from cooperative game theory and focus on the corresponding network game in coalitional form which relates any coalition of agents to its highest possible net benefit, i.e., the net benefit corresponding to an optimal operative network. Although finding an optimal network in general is a difficult problem, it is shown that corresponding network games are (totally) balanced. In the proof of this result a specific relaxation, duality and techniques of linear production games with committee control play a role. Sufficient conditions for convexity of network games are derived. Possible extensions of the model and its results are discussed. The research of Jeroen Suijs has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences.     

树形广播网络的最佳源点和最佳源点对

广播就是通信风格中的某些已知消息的成员（称为源点）将消息传递给其它所有成员的过程．通信网络一般用图来描述．从不同的网络成员广播一条消息所需的最少时间一般是不同的．本文在树网络中设计了选取一个或一对源点使广播时间最短的算法，这样的一个或一对源点称为最佳源点或最佳源点对．     

The impact of socio-technical communication styles on the diversity and innovation potential of global science collaboratories

Emerging cyber-infrastructure tools are enabling scientists to transparently co-develop, share, and communicate about real-time diverse forms of knowledge artifacts. In these environments, communication preferences of scientists are posited as an important factor affecting innovation capacity and robustness of social and knowledge network structures. Scientific knowledge creation in such communities is called global participatory science (GPS). Recently, using agent-based modeling and collective action theory as a basis, a complex adaptive social communication network model (CollectiveInnoSim) is implemented. This work leverages CollectiveInnoSim implementing communication preferences of scientists. Social network metrics and knowledge production patterns are used as proxy metrics to infer innovation potential of emergent knowledge and collaboration networks. The objective is to present the underlying communication dynamics of GPS in a form of computational model and delineate the impacts of various communication preferences of scientists on innovation potential of the collaboration network. Gained insight can ultimately help policy-makers to design GPS environments and promote innovation.     

Communication and organizational social networks: a simulation model

Recent management research has evidenced the significance of organizational social networks, and communication is believed to impact the interpersonal relationships. However, we have little knowledge on how communication affects organizational social networks. This paper studies the dynamics between organizational communication patterns and the growth of organizational social networks. We propose an organizational social network growth model, and then collect empirical data to test model validity. The simulation results agree well with the empirical data. The results of simulation experiments enrich our knowledge on communication with the findings that organizational management practices that discourage employees from communicating within and across group boundaries have disparate and significant negative effect on the social network’s density, scalar assortativity and discrete assortativity, each of which correlates with the organization’s performance. These findings also suggest concrete measures for management to construct and develop the organizational social network.     

复杂通信网络的结构分解法及其在可靠性分析中的应用

对复杂通信网络拓扑结构的恰当描述与刻画是研究其可靠性及确定信号流在其中有效的传输方式的前提。通过引进适当的数据结构并采用递归分解的技巧，本给出了将任意复杂通信网络分解为环、弦、链等基本网络结构的某种组合与连接的结构分解法，并由此得到了研究网络可靠性的新的两阶段法，即先分析各基本结构的可靠性，再由此给出原网络可靠性的估计。     

Decomposition of network communication games

Using network control structures, this paper introduces a general class of network communication games and studies their decomposition into unanimity games. We obtain a relation between the dividends in any network communication game and its underlying transferable utility game, which depends on the structure of the communication network. Moreover, we introduce a new class of network control values which contains both the Myerson value and the position value. The decomposition results are used to explicitly express these values in terms of dividends.     

Exploring communication networks to understand organizational crisis using exponential random graph models

In recent social network studies, exponential random graph (ERG) models have been used comprehensively to model global social network structure as a function of their local features. In this study, we describe the ERG models and demonstrate its use in modelling the changing communication network structure at Enron Corporation during the period of its disintegration. We illustrate the modelling on communication networks, and provide a new way of classifying networks and their performance based on the occurrence of their local features. Among several micro-level structures of ERG models, we find significant variation in the appearance of A2P (Alternating k-two-paths) network structure in the communication network during crisis period and non-crisis period. We also notice that the attribute of hierarchical positions of actors (i.e., high rank versus low rank staff) have impact on the evolution process of networks during crisis. These findings could be used in analyzing communication networks of dynamic project groups and their adaptation process during crisis which could lead to an improved understanding how communications network evolve and adapt during crisis.     

诺贝尔物理学奖得主知识交流网络结构研究

将诺贝尔物理学奖得主作为结点，在有知识交流的两位得主间添加一条连接，由此得到诺贝尔物理学奖得主知识交流网络。本文对此网络的结构特征进行研究，结果表明该网络的结构具有一般社会网络共有的Seale-free、度协调、负相关特征，而直径较一般社会网络大，聚集系数则明显较小。     

Chance and necessity in sociological theory

This paper proposes a mathematical model of financial markets as networks. The model examines the effect of network structure on market behavior (price volatility and trading volume). In the model, investors are arrayed in various network configurations through which they gather information to make trading decisions. The basic network considered is a chain graph with two parameters, number of investors (n) and the length of time in which information is transmitted (k). Closed‐form expressions for price volatility and expected trading volume are provided. The model is generalized to more complex networks, focusing on the hub‐and‐spoke network. The network configurations analyzed do not represent the real (and unknown) communication network among investors, but predictions from the model are consistent with price and volume patterns observed in sociological and economic research on financial markets. The main result is that network structure alone influences price volatility and expected trading volume even though investors are homogeneous and the information introduced into the system is unbiased and random. This result suggests that the structure of the real communication network among investors may influence market behavior.     

Stabilization of complex dynamical networks with noise disturbance under performance constraint

Under given performance constraint, this paper studies the stabilization problem of general dynamical network subject to noise disturbance. The newly presented dynamical network model includes both intrinsic disturbance of single node and communication noise over the network connections, which appear typically in a network environment. Single controller is pinned into one of the nodes for the exponential stabilization of dynamical network, and the prescribed performance constraint is satisfied. The reason why only one controller is valid for stabilization of dynamical network is the full utilization of network’s local connections. One important feature of this paper is the introduction of the performance constraint concept into the stabilization of complex dynamical network with intrinsic and communication noises. The derived criteria are expressed in terms of linear matrix inequalities (LMIs), which are easy to be verified by resorting to recently developed algorithm. Numerical example is utilized to illustrate the effectiveness of the proposed results.     

Computation of a Redundant Ring in a Hierarchical Communication System

A hierarchical communication network, i.e., a multicommodity-flow star network, is considered. An exact bound is derived for the necessary and sufficient ring redundancy that guarantees attainment of the liveness upper bound.     

Integrity of Total Graphs via Certain Parameters

Communication networks have been characterized by high levels of service reliability. Links cuts, node interruptions, software errors or hardware failures, and transmission failures at various points can interrupt service for long periods of time. In communication networks, greater degrees of stability or less vulnerability is required. The vulnerability of communication network measures the resistance of the network to the disruption of operation after the failure of certain stations or communication links. If we think of a graph G as modeling a network, many graph-theoretic parameters can be used to describe the stability of communication networks, including connectivity, integrity, and tenacity. We consider two graphs with the same connectivity, but with unequal orders of theirs largest components. Then these two graphs must be different in respect to stability. How can we measure that property? The idea behind the answer is the concept of integrity, which is different from connectivity. Total graphs constitute a large class of graphs. In this paper, we study the integrity of total graphs via some graph parameters.

     

The medium access control problem for wireless communication networks modelled as hybrid dynamical systems

The paper considers the medium access control problem for a class of wireless communication networks. We apply mathematical models in terms of hybrid dynamical systems to analyze such networks. We introduce the concept of stabilizability for such systems which guarantees that any data packet in the wireless network will reach its destination within finite time. We obtain conditions for a wireless communication network to be stabilizable.     

Tradeoffs between quality-of-control and quality-of-service in large-scale nonlinear networked control systems

In this paper we study input-to-state stability (ISS) of large-scale networked control systems (NCSs) in which sensors, controllers and actuators are connected via multiple (local) communication networks which operate asynchronously and independently of each other. We model the large-scale NCS as an interconnection of hybrid subsystems, and establish rather natural conditions which guarantee that all subsystems are ISS, and have an associated ISS Lyapunov function. An ISS Lyapunov function for the overall system is constructed based on the ISS Lyapunov functions of the subsystems and the interconnection gains. The control performance, or “quality-of-control”, of the overall system is then viewed in terms of the convergence rate and ISS gain of the associated ISS Lyapunov function. Additionally, the “quality-of-service” of the communication networks is viewed in terms of the maximum allowable transmission interval (MATI) and the maximum allowable delay (MAD) of the network, and we show that the allowable quality-of-service of the communication networks is constrained by the required ISS gains and convergence rate of the hybrid subsystem corresponding to that network. Our results show that the quality-of-control of the overall system can be improved (or degraded) by improving (or relaxing) the quality-of-service of the communication networks. Alternatively, when relaxing the quality-of-service of one communication network, we can retain the quality-of-control of the overall system by improving the quality-of-service of one or more of the other communication networks. Our general framework will formally show these intuitive and insightful tradeoffs.