Design methodology of networked software evolution growth based on software patterns

被引:8
作者
He K. [1 ]
Peng R. [1 ]
Liu J. [1 ]
He F. [2 ]
Liang P. [1 ]
Li B. [1 ]
机构
[1] State Key Laboratory of Software Engineering, Wuhan University
[2] Fukazawa Laboratory, Graduate School of Computer Science, Waseda University
基金
中国国家自然科学基金;
关键词
Complex networks; Evolution growth design method; Growth characteristics of software patterns; Networked software; OO software network; Types and modulation of preferential attachment;
D O I
10.1007/s11424-006-0157-6
中图分类号
学科分类号
摘要
Recently, some new characteristics of complex networks attract the attentions of scientists in different fields, and lead to many kinds of emerging research directions. So far, most of the research work has been limited in discovery of complex network characteristics by structure analysis in large-scale software systems. This paper presents the theoretical basis, design method, algorithms and experiment results of the research. It firstly emphasizes the significance of design method of evolution growth for network topology of Object Oriented (OO) software systems, and argues that the selection and modulation of network models with various topology characteristics will bring un-ignorable effect on the process of design and implementation of OO software systems. Then we analyze the similar discipline of "negation of negation and compromise" between the evolution of network models with different topology characteristics and the development of software modelling methods. According to the analysis of the growth features of software patterns, we propose an object-oriented software network evolution growth method and its algorithms in succession. In addition, we also propose the parameter systems for OO software system metrics based on complex network theory. Based on these parameter systems, it can analyze the features of various nodes, links and local-world, modulate the network topology and guide the software metrics. All these can be helpful to the detailed design, implementation and performance analysis. Finally, we focus on the application of the evolution algorithms and demonstrate it by a case study. Comparing the results from our early experiments with methodologies in empirical software engineering, we believe that the proposed software engineering design method is a computational software engineering approach based on complex network theory. We argue that this method should be greatly beneficial for the design, implementation, modulation and metrics of functionality, structure and performance in large-scale OO software complex system. © Springer Science + Business Media, Inc. 2006.
引用
收藏
页码:157 / 181
页数:24
相关论文
共 31 条
[1]  
Watts D.J., Strogatz S.H., Collective dynamics of 'small world' networks, Nature, 393, pp. 400-442, (1998)
[2]  
Barabasi A.L., Albert R., Emergence of scaling in random networks, Science, 286, pp. 509-512, (1999)
[3]  
Barabasi A.L., Albert R., Jeong H., Mean-field theory for scale-free random networks, Physica A, 272, pp. 173-187, (1999)
[4]  
Barabasi A.L., Albert R., Jeong H., Bianconi G., Power-law distribution of the World Wide Web: Response, Science, 287, (2000)
[5]  
Albert R., Barabasi A.L., Statistical mechanics of complex networks, Reviews of Modern Physics, 74, pp. 47-97, (2002)
[6]  
Bianconi G., Barabasi A.L., Topology of evolving networks: Local events and universality, Phys. Rev. Lett, 85, pp. 5234-5237, (2000)
[7]  
Bianconi G., Barabasi A.L., Competition and multiscaling in evolving networks, Europhysics Letters, 54, 4, pp. 436-442, (2001)
[8]  
Jost J., Joy M.P., Evolving networks with distance preferences, Phys. Rev. E, 66, pp. 1-7, (2002)
[9]  
Krapivsky P.L., Redner S., Leyvraz F., Connectivity of growing random networks, Phys. Rev. Lett., 85, pp. 4629-4632, (2000)
[10]  
Dorogovstsev S.N., Mendes J.F.F., Evolution of reference networks with aging, Phys. Rev. E, 62, pp. 1842-1845, (2000)