Network Performance Analysis Based on Quotient Space Theory

Abstract

AbstractSome performance analyses in complex network (e.g., shortest path, etc.) are complicated. Generally, human have natural ability to solve complex problems by approximating the optimal solution step by step. The granular computing model based on QST (Quotient Space Theory) provides not only a hierarchical description from fine to coarse but also an effective approach from coarse to fine to solve these complex problems. This paper proposes some methods on complex network performance analysis based on QST. Firstly, maximum cover network chain is used to solve the shortest path problem. Then, a method to find the optimal path of a weighted network is put forward. Finally, dynamic network is decomposed into a series of static networks to solve the maximum flow problem in dynamic network. Theoretical proofs and experimental results show that QST is an effective tool for complex problem solving.KeywordsQuotient SpacePerformance AnalysisShortest PathOptimal PathDynamic Network