Performance Monitoring of Large Communication Networks using Maximum Common Subgraphs
Measuring similarity of graphs is an important task in graph mining for matching, comparing, and evaluating patterns in huge graph databases. In managing huge-enterprise communication networks, the ability to measure similarity is an important performance monitoring function. It is possible to draw certain significant conclusions regarding effective utilization of networks by characterizing a computer network as a time series of graphs with IP addresses as nodes and communication between nodes as edges. The maximum common subnets of k network time series graphs give a measure of the utilization of network nodes at different intervals of time. The problem of finding the nodes in the communication network which are always active can be formulated as a Maximum Common Subgraph (MCS) detection problem which would be useful for various decision making tasks such as devising better routing algorithms. This paper presents a novel MCS detection algorithm that introduces a new heap-based data structure to find all MCS of k graphs in a graph database efficiently. The series of experiments performed and the comparison of empirical results with the existing algorithms further ensure the efficiency of the proposed algorithm.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.thentic information.