Network Performance Analysis Based on Quotient Space Theory

Autor:	Yuan-Ting Yan, Ling Zhang, Shu Zhao, Yanping Zhang
Rok vydání:	2013
Předmět:	Mathematical optimization Dynamic network analysis Granular computing Shortest path problem Maximum flow problem Weighted network Quotient space (topology) Complex network Average path length Mathematics
Zdroj:	Lecture Notes in Computer Science ISBN: 9783642412172 RSFDGrC
DOI:	10.1007/978-3-642-41218-9_23
Popis:	Some 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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::426f0d5375cb5faa78ee52574f4444ca https://doi.org/10.1007/978-3-642-41218-9_23 Zobrazit plný text záznamu