Research on LFS Algorithm in Software Network

Betweenness centrality helps researcher to master the changes of the system from the overall perspective in software network. The existing betweenness centrality algorithm has high time complexity but low accuracy. Therefore, Layer First Searching (LFS) algorithm is proposed that is low in time complexity and high in accuracy. LFS algorithm searches the nodes with the shortest to the designated node, then travels all paths and calculates the nodes on the paths, at last get the times of each node being traveled which is betweenness centrality. The time complexity of LFS algorithm is O(V2).

[1]  Fei Dai,et al.  The Resource Optimization of Software Evolution Processes , 2009, 2009 International Conference on Advanced Computer Control.

[2]  Meir M. Lehman,et al.  Software Evolution and Software Evolution Processes , 2002, Ann. Softw. Eng..

[3]  Andrea Bondavalli,et al.  A Decomposition-Based Modeling Framework for Complex Systems , 2009, IEEE Transactions on Reliability.

[4]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[5]  Walid Ben-Ameur,et al.  Internet Routing and Related Topology Issues , 2003, SIAM J. Discret. Math..

[6]  Michal Pióro,et al.  On open shortest path first related network optimisation problems , 2002, Perform. Evaluation.

[7]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Hissam Tawfik,et al.  Path planning in construction sites: performance evaluation of the Dijkstra, A*, and GA search algorithms , 2002, Adv. Eng. Informatics.

[9]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[10]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[11]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[12]  K. Madhavi,et al.  A Framework for Visualizing Model-Driven Software Evolution , 2009, 2009 IEEE International Advance Computing Conference.

[13]  Sergi Valverde,et al.  Network motifs in computational graphs: a case study in software architecture. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Tibor Cinkler,et al.  Practical OSPF traffic engineering , 2004, IEEE Communications Letters.

[15]  Barry W. Boehm,et al.  Some future trends and implications for systems and software engineering processes , 2006, Syst. Eng..

[16]  Douglas C. Schmidt,et al.  Automating Hardware and Software Evolution Analysis , 2009, 2009 16th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems.

[17]  Jing Liu,et al.  A Complexity Metrics Set for Large-Scale Object-Oriented Software Systems , 2006, The Sixth IEEE International Conference on Computer and Information Technology (CIT'06).

[18]  S. N. Dorogovtsev,et al.  Scaling properties of scale-free evolving networks: continuous approach. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Zheng Wang,et al.  Internet QoS: Architectures and Mechanisms for Quality of Service , 2001 .

[20]  Li Chao.  Research on CFR algorithm for Internet , 2006 .

[21]  Edward P. F. Chan,et al.  Finding shortest paths in large network systems , 2001, GIS '01.

[22]  D. Torrieri,et al.  Algorithms for finding an optimal set of short disjoint paths in a communication network , 1991, MILCOM 91 - Conference record.

[23]  P. Boehm,et al.  Some Future Trends and Implications for Systems and Software Engineering , 2006 .