The Analysis Of Availability Of Self-similar Network Based On Topological Simplification

As the rapid development of technology of computer and communication, the computer network has penetrate to every aspects of our social life, who is playing a more and more important role to the development of business and promotion of our society, it also has changed the style of our daily life. Because of the repaid increasing of the network scale, the complexity and the heterogeneity of network is also leaped, the acquirement of network capability is becoming more and more complex and time-wasted.It is scarcely enough to get the capability of networks. People want the computing procedure of capability indexes become more quickly for a real-time show of network states and leads to a real-time control of network states. So, how to get the availability of networks more quickly and more reliably is becoming a key problem which needs to be solved.To simplify the scale of networks is an efficient and intuitional method, use the capability of the networks after-simplification to stand for the capability of pre-simplification one can decrease the scale of networks, accelerate the computing process without loosing any reliability. According to this idea, there are three topics need to be researched: building the model of networks availability, the method of simplification of topology, and the consistence of availability of networks. At the same time, the model of self-similar flux becomes the best choice during the research process to reflect the properties of flux in real-world networks.Two operational capability indexes have been choosing during research: the stationary queue length and stationary package loss rate (PLR), and to build the model of networks availability. The topological structure of networks has been analyzed; the model of nodes buffer and queuing loads of pre and after-simplification networks have also been built, at the same ,the change of every parameter during this process is also been discussed. An algorithm of topological simplification is given with the discussion of the complexity change. All those works were done under a given topological structure, at last, the process of networks simplification has been explained with a case. To proving the availability of this algorithm, according to research work of related simulation analysis of the availability of pre and after-simplification, an availability simulator of self-similar networks based on the dynamic routine scheduling algorithm (DRSNAS) has been developed.