Topology aggregation for directed graphs
IEEE/ACM Transactions on Networking (TON)
Towards an optimized abstracted topology design in cloud environment
Future Generation Computer Systems
Hi-index | 0.24 |
In a hierarchical network, each subnetwork advertises its topology information (i.e., topology graph) to the other subnetworks. Lots of work has been done to minimize the amount of advertised topology information. With the existing methods, however, the amount of advertised information linearly increases to the order of the number of link-state parameters. To solve this problem, using graph theory, we show how to convert multiple non-isomorphic topology-advertising subgraphs into an isomorphic graph.