首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 281 毫秒
1.
张连明  邓晓衡  余建平  伍祥生 《中国物理 B》2011,20(4):48902-048902
This paper theoretically and empirically studies the degree and connectivity of the Internet's scale-free topology at an autonomous system (AS) level. The basic features of scale-free networks influence the normalization constant of degree distribution p(k). It develops a new mathematic model for describing the power-law relationships of Internet topology. From this model we theoretically obtain formulas to calculate the average degree, the ratios of the kmin-degree (minimum degree) nodes and the kmax-degree (maximum degree) nodes, and the fraction of the degrees (or links) in the hands of the richer (top best-connected) nodes. It finds that the average degree is larger for a smaller power-law exponent λ and a larger minimum or maximum degree. The ratio of the kmin-degree nodes is larger for larger λ and smaller kmin or kmax. The ratio of the kmax-degree ones is larger for smaller λ and kmax or larger kmin. The richer nodes hold most of the total degrees of Internet AS-level topology. In addition, it is revealed that the increased rate of the average degree or the ratio of the k_min-degree nodes has power-law decay with the increase of kmin. The ratio of the kmax-degree nodes has a power-law decay with the increase of kmax, and the fraction of the degrees in the hands of the richer 27% nodes is about 73% (the '73/27 rule'). Finally, empirically calculations are made, based on the empirical data extracted from the Border Gateway Protocol, of the average degree, ratio and fraction using this method and other methods, and find that this method is rigorous and effective for Internet AS-level topology.  相似文献   

2.
Bo Xiao 《Physica A》2009,388(4):529-540
To measure the IPv6 internet AS-level topology, a network topology discovery system, called Dolphin, was developed. By comparing the measurement result of Dolphin with that of CAIDA’s Scamper, it was found that the IPv6 Internet at AS level, similar to other complex networks, is also scale-free but the exponent of its degree distribution is 1.2, which is much smaller than that of the IPv4 Internet and most other scale-free networks. In order to explain this feature of IPv6 Internet we argue that the degree exponent is a measure of uniformity of the degree distribution. Then, for the purpose of modeling the networks, we propose a new model based on the two major factors affecting the exponent of the EBA model. It breaks the lower bound of degree exponent which is 2 for most models. To verify the validity of this model, both theoretical and experimental analyses have been carried out. Finally, we demonstrate how this model can be successfully used to reproduce the topology of the IPv6 Internet.  相似文献   

3.
基于无标度网络拓扑结构变化的舆论演化模型   总被引:3,自引:0,他引:3       下载免费PDF全文
基于BA无标度网络,构建了舆论和网络结构相互影响的自适应舆论演化模型.舆论的演化不仅受制于网络拓扑结构,而且也导致拓扑结构的变化.研究表明,演化达到稳态后,网络结构不再是初始的无标度网络而呈现泊松分布,而且随着时间的推移,系统中的舆论演化表现出很强的趋同效应,原来初始状态的几十个舆论,在长时间的演化后,大部分舆论灭亡,只有少数的舆论存留,且发展壮大.这种趋向与社会上的舆论、意见、信仰的演化大体上是符合的.  相似文献   

4.
The Internet creates multidimensional and complex relationships in terms of the composition, application and mapping of social users. Most of the previous related research has focused on the single-layer topology of physical device networks but ignored the study of service access relationships and the social structure of users on the Internet. Here, we propose a composite framework to understand how the interaction between the physical devices network, business application network, and user role network affects the robustness of the entire Internet. In this paper, a multilayer network consisting of a physical device layer, business application layer and user role layer is constructed by collecting experimental network data. We characterize the disturbance process of the entire multilayer network when a physical entity device fails by designing nodal disturbance to investigate the interactions that exist between the different network layers. Meanwhile, we analyze the characteristics of the Internet-oriented multilayer network structure and propose a heuristic multilayer network topology generation algorithm based on the initial routing topology and networking pattern, which simulates the evolution process of multilayer network topology. To further analyze the robustness of this multilayer network model, we combined a total of six target node ranking indicators including random strategy, degree centrality, betweenness centrality, closeness centrality, clustering coefficient and network constraint coefficient, performed node deletion simulations in the experimental network, and analyzed the impact of component types and interactions on the robustness of the overall multilayer network based on the maximum component change in the network. These results provide new insights into the operational processes of the Internet from a multi-domain data fusion perspective, reflecting that the coupling relationships that exist between the different interaction layers are closely linked to the robustness of multilayer networks.  相似文献   

5.
In this paper, by the help of evolutionary algorithm and using Hindmarsh-Rose (HR) neuron model, we investigate the effect of topology structures on synchronization transition between different states in coupled neuron cells system. First, we build different coupling structure with N cells, and found the effect of synchronized transition contact not only closely with the topology of the system, but also with whether there exist the ring structures in the system. In particular, both the size and the number of rings have greater effects on such transition behavior. Secondly, we introduce synchronization error to qualitative analyze the effect of the topology structure. Furthermore, by fitting the simulation results, we find that with the increment of the neurons number, there always exist the optimization structures which have the minimum number of connecting edges in the coupling systems. Above results show that the topology structures have a very crucial role on synchronization transition in coupled neuron system. Biological system may gradually acquire such efficient topology structures through the long-term evolution, thus the systems' information process may be optimized by this scheme.  相似文献   

6.
Studying the topology of infrastructure communication networks(e.g., the Internet) has become a means to understand and develop complex systems. Therefore, investigating the evolution of Internet network topology might elucidate disciplines governing the dynamic process of complex systems. It may also contribute to a more intelligent communication network framework based on its autonomous behavior. In this paper, the Internet Autonomous Systems(ASes) topology from 1998 to 2013 was studied by deconstructing and analysing topological entities on three different scales(i.e., nodes,edges and 3 network components: single-edge component M1, binary component M2 and triangle component M3). The results indicate that: a) 95% of the Internet edges are internal edges(as opposed to external and boundary edges); b) the Internet network consists mainly of internal components, particularly M2 internal components; c) in most cases, a node initially connects with multiple nodes to form an M2 component to take part in the network; d) the Internet network evolves to lower entropy. Furthermore, we find that, as a complex system, the evolution of the Internet exhibits a behavioral series,which is similar to the biological phenomena concerned with the study on metabolism and replication. To the best of our knowledge, this is the first study of the evolution of the Internet network through analysis of dynamic features of its nodes,edges and components, and therefore our study represents an innovative approach to the subject.  相似文献   

7.
A P Balachandran 《Pramana》2001,56(2-3):223-237
Any two infinite-dimensional (separable) Hilbert spaces are unitarily isomorphic. The sets of all their self-adjoint operators are also therefore unitarily equivalent. Thus if all self-adjoint operators can be observed, and if there is no further major axiom in quantum physics than those formulated for example in Dirac’s ‘quantum mechanics’, then a quantum physicist would not be able to tell a torus from a hole in the ground. We argue that there are indeed such axioms involving observables with smooth time evolution: they contain commutative subalgebras from which the spatial slice of spacetime with its topology (and with further refinements of the axiom, its C K - and C --structures) can be reconstructed using Gel’fand-Naimark theory and its extensions. Classical topology is an attribute of only certain quantum observables for these axioms, the spatial slice emergent from quantum physics getting progressively less differentiable with increasingly higher excitations of energy and eventually altogether ceasing to exist. After formulating these axioms, we apply them to show the possibility of topology change and to discuss quantized fuzzy topologies. Fundamental issues concerning the role of time in quantum physics are also addressed.  相似文献   

8.
蔡开泉  唐焱武  张学军  管祥民 《中国物理 B》2016,25(12):128904-128904
The genetic algorithm(GA) is a nature-inspired evolutionary algorithm to find optima in search space via the interaction of individuals. Recently, researchers demonstrated that the interaction topology plays an important role in information exchange among individuals of evolutionary algorithm. In this paper, we investigate the effect of different network topologies adopted to represent the interaction structures. It is found that GA with a high-density topology ends up more likely with an unsatisfactory solution, contrarily, a low-density topology can impede convergence. Consequently, we propose an improved GA with dynamic topology, named DT-GA, in which the topology structure varies dynamically along with the fitness evolution. Several experiments executed with 15 well-known test functions have illustrated that DT-GA outperforms other test GAs for making a balance of convergence speed and optimum quality. Our work may have implications in the combination of complex networks and computational intelligence.  相似文献   

9.
基于演化博弈的社交网络模型演化研究   总被引:1,自引:0,他引:1       下载免费PDF全文
刘群  易佳 《物理学报》2013,62(23):238902-238902
社会网络研究的兴起,为网络演化规律研究提供了有效工具,但大多数研究集中从宏观机制评估网络演化的动态过程. 本文基于公共品博弈,通过演化博弈与网络拓扑共演化方式,从微观角度提出了多社区动态网络演化模型(dMCPGG). 即以节点间演化博弈为动力,修改节点间边的关系,驱动网络拓扑演化. 考虑到网络异质性,采用基于拓扑势的偏好规则更准确全面的描述节点影响力. 通过数值模拟和仿真实验,验证了本模型的合理性,不仅重现了无标度网络及随机网络的节点度、聚类系数及平均路径长度的结构特性,还准确捕捉到真实社交网络的演化过程. 关键词: 公共品博弈 拓扑势 偏好选择 共演化  相似文献   

10.
Evolution of the Internet AS-level ecosystem   总被引:1,自引:0,他引:1  
We present an analytically tractable model of Internet evolution at the level of autonomous systems (ASs). We call our model the multiclass preferential attachment (MPA) model. As its name suggests, it is based on preferential attachment. All of its parameters are measurable from available Internet topology data. Given the estimated values of these parameters, our analytic results predict a definitive set of statistics characterizing the AS topology structure. These statistics are not part of the model formulation. The MPA model thus closes the “measure-model-validate-predict” loop, and provides further evidence that preferential attachment is a driving force behind Internet evolution.  相似文献   

11.
Nodes in the wireless sensor networks(WSNs) are prone to failure due to energy depletion and poor environment,which could have a negative impact on the normal operation of the network. In order to solve this problem, in this paper, we build a fault-tolerant topology which can effectively tolerate energy depletion and random failure. Firstly, a comprehensive failure model about energy depletion and random failure is established. Then an improved evolution model is presented to generate a fault-tolerant topology, and the degree distribution of the topology can be adjusted. Finally, the relation between the degree distribution and the topological fault tolerance is analyzed, and the optimal value of evolution model parameter is obtained. Then the target fault-tolerant topology which can effectively tolerate energy depletion and random failure is obtained. The performances of the new fault tolerant topology are verified by simulation experiments. The results show that the new fault tolerant topology effectively prolongs the network lifetime and has strong fault tolerance.  相似文献   

12.
张盛  王剑  唐朝京  张权 《中国物理 B》2011,20(8):80306-080306
As an important application of the quantum network communication,quantum multiparty conference has made multiparty secret communication possible.Previous quantum multiparty conference schemes based on quantum data encryption are insensitive to network topology.However,the topology of the quantum network significantly affects the communication efficiency,e.g.,parallel transmission in a channel with limited bandwidth.We have proposed two distinctive protocols,which work in two basic network topologies with efficiency higher than the existing ones.We first present a protocol which works in the reticulate network using Greeberger-Horne-Zeilinger states and entanglement swapping.Another protocol,based on quantum multicasting with quantum data compression,which can improve the efficiency of the network,works in the star-like network.The security of our protocols is guaranteed by quantum key distribution and one-time-pad encryption.In general,the two protocols can be applied to any quantum network where the topology can be equivalently transformed to one of the two structures we propose in our protocols.  相似文献   

13.
由Internet构成的复杂网络的动力学特性主要受到用户需求行为的影响,具备时域的统计规律性. 通过对区域群体用户需求行为的时域实验统计分析,发现用户对Web网站的访问频度及其生成的二分网络的入度分布也呈现幂律分布和集聚现象,其幂指数介于1.7到1.8之间. 建立了虚拟资源网络VRN和物理拓扑网络PTN双层模型,分析了双层模型映射机理,并对网络用户需求行为进行建模. 虚拟资源网络VRN对物理拓扑网络PTN映射过程的不同机理,模拟了Internet资源网络到物理网络的不同影响模式. 幂律分布的用户需求特性会 关键词: 复杂网络 无标度拓扑 用户需求 相变  相似文献   

14.
The Internet of Things (IoT) is a revolutionary technique of sharing data for smart devices that generates huge amounts of data from smart healthcare systems. Therefore, healthcare systems utilize the convergence power and traffic analysis of sensors that cannot be satisfactorily handled by the IoT. In this article, a novel mutation operator is devised and incorporated with the differential evolution (DE) algorithm. Two tests have been conducted in the validation process. Firstly, the newly dual adaption-based operators incorporated with the differential evolution algorithm are being proposed. The proposed approach provides sufficient diversity and enhances the search speed of nature’s local and global search environments in the problem. The proposed method incorporates the application of IoT-based smart healthcare. Second, an application-based test has been conducted, in which the proposed approach is applied to the application in the smart healthcare system. Therefore, IoT sensor deployment is an optimization problem to minimize service time, delay, and energy loss by considering the communication constraint between sensors(objects). The proposed algorithm is applied in this article to solve this optimization problem. Further, in the experimentation and comparative study, the proposed method is superior to the standard evolutionary algorithms in IoT applications concerning the minimum number of function evaluations and minimization of traffic services. The proposed approach also achieves efficiency in the minimum loss of energy in each service and reduces load and delay.  相似文献   

15.
Almost all natural, social and man-made-engineered systems can be represented by a complex network to describe their dynamic behaviors. To make a real-world complex network controllable with its desired topology, the study on network controllability has been one of the most critical and attractive subjects for both network and control communities. In this paper, based on a given directed–weighted network with both state and control nodes, a novel optimization tool with extremal dynamics to generate an optimal network topology with minimum control nodes and complete controllability under Kalman’s rank condition has been developed. The experimental results on a number of popular benchmark networks show the proposed tool is effective to identify the minimum control nodes which are sufficient to guide the whole network’s dynamics and provide the evolution of network topology during the optimization process. We also find the conclusion: “the sparse networks need more control nodes than the dense, and the homogeneous networks need fewer control nodes compared to the heterogeneous” (Liu et al., 2011  [18]), is also applicable to network complete controllability. These findings help us to understand the network dynamics and make a real-world network under the desired control. Moreover, compared with the relevant research results on structural controllability with minimum driver nodes, the proposed solution methodology may also be applied to other constrained network optimization problems beyond complete controllability with minimum control nodes.  相似文献   

16.
作为下一代通信网络,无线认知网络已成为当前的研究热点。由于节点的移动性,无线网络拓扑结构动态变化,拓扑控制一直是无线网络的难点问题。通过借鉴移动自组织网络(MANETS)中的拓扑控制方法,提出了无线认知网络中基于博弈论和认知功能相结合的拓扑控制方法。无线认知节点能够通过主动决策调节自身节点位置,在保证网络连通性的基础上实现网络覆盖面积最大。仿真实验结果验证了方法的有效性和收敛性。  相似文献   

17.
This Letter investigates synchronization issues of complex dynamical networks with switching topology. By constructing a common Lyapunov function, we show that local and global synchronization for a linearly coupled network with switching topology can be evaluated by the time average of second smallest eigenvalues corresponding to the Laplacians of switching topology. This result is quite powerful and can be further used to explore various switching cases for complex dynamical networks. Numerical simulations illustrate the effectiveness of the obtained results in the end.  相似文献   

18.
调研了传统光传(FBL)网络的几种拓扑结构, 就可靠性和实时性两方面对它们进行了分析和比较。选择采用一个包含256个节点的mesh光交换网络, 它具有冗余拓扑结构能承受3处链路故障, 保证了网络的可靠性。以网络中发生链路故障的数目, 及多个故障同时发生时故障的邻近程度来衡量网络故障的严重性。对所有链路故障情形进行仿真, 测试端到端的通信延迟。仿真结果表明, 采用这种网络拓扑结构的光传网络, 即使在发生较为严重的故障的情况下, 端到端通信路由的跳数增加不大, 仍能满足实时通信的要求。  相似文献   

19.
Elastic network models in their different flavors have become useful models for the dynamics and functions of biomolecular systems such as proteins and their complexes. Perturbation to the interactions occur due to randomized and fixated changes (in molecular evolution) or designed modifications of the protein structures (in bioengineering). These perturbations are modifications in the topology and the strength of the interactions modeled by the elastic network models. We discuss how a naive approach to compute properties for a large number of perturbed structures and interactions by repeated diagonalization can be replaced with an identity found in linear algebra. We argue about the computational complexity and discuss the advantages of the protocol. We apply the proposed algorithm to the acetylcholinesterase, a well-known enzyme in neurobiology, and show how one can gain insight into the “breathing dynamics” of a structural funnel necessary for the function of the protein. The computational speed-up was a 60-fold increase in this example.  相似文献   

20.
The performance of DWDM ring network topology is investigated with 13 × 15 Gbps channels without using dispersion compensating fiber among the 3 channels are added and droped using OADM, respectively. Each OADM node having 70 km distance between each other. This ring network topology is evaluated by considering the signal quality factor and BER for different input power at all nodes. Further, this ring network topology is also investigated for different data rate at all nodes.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号