Algorithm for cataloging topologies in the Common Information Model (CIM)

Authors:
Imre I. Lendak;Aleksandar M. Erdeljan;Dragan S. Popović
Affiliations:
Faculty of Technical Sciences, Trg Dositeja Obradovića 6, 21000 Novi Sad, Serbia;Faculty of Technical Sciences, Trg Dositeja Obradovića 6, 21000 Novi Sad, Serbia;Telvent DMS Llc, Sremska 4, 21000 Novi Sad, Serbia
Venue:
Computers & Mathematics with Applications
Year:
2011

Citing 4
Cited 0

An Eigendecomposition Approach to Weighted Graph Matching Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Metalevel Component-Based Framework for Distributed Computing Applications

Proceedings of the Fourth Annual ACIS International Conference on Computer and Information Science

Quantified Score

Hi-index	0.10

Visualization

Abstract

This paper presents a novel algorithm for finding the catalog of topologies in a power system's model in the Common Information Model (CIM) format. The algorithm prepares the models of complex, large-scale power systems (e.g., Smart Grids with renewable energy sources) and allows analytic Distribution Management System (DMS) functions to achieve high performance and optimize the power system operation in real time. It utilizes the Ullmann graph isomorphism algorithm to find unique topologies. In addition, it is optimized for parallel execution on 64-bit, multi-processor computers. Its ability to handle large amounts of data was verified on detailed, real-life electric power system data.