Clans Aggregation for Verification of Networking Protocols on Parallel Architectures

Petri nets represent a convenient and powerful tool for networking protocols verification as a basic task of cybersecurity domain. Composition of clans speeds-up process of protocols verification reduced to solving linear Diophantine systems. Varying minimal clan size brings in certain imbalance when solving a system on parallel architectures using PaAd software. The present paper studies a task of preliminary balancing the clan size via their aggregation represented as a special case of graph partitioning. Variants of the task are considered and solved using heuristic techniques: a fast bin packing with the first fit on a sorted array algorithm and a multi-objective graph partitioning with software package METIS. A case study for the clans aggregation on TCP and IOTP protocols and hypertorus communication structures shows that aggregation of clans brings in an additional 3 times speed-up.