Generated Network Topologies and Network Capacity Calculation for QKD Key Relaying Strategies Evaluation

The dataset contains a collection of generated network topologies, produced through a constrained topology generation process, designed for evaluating Quantum Key Distribution (QKD) key relaying strategies under controlled structural constraints. The topologies are generated using the NetworkX library [1] and represent undirected, connected graphs. This dataset accompanies a study analyzing the scalability of two key distribution strategies — on-demand hop-by-hop key relaying [2] and a decentralized key flooding protocol [3, 4] — under realistic and randomly generated network topologies. To ensure a fair comparison across such heterogeneous topologies, each network's capacity is first derived by formulating a Maximum Multi-Commodity Flow (MMCF) optimization problem. This capacity is then used to calibrate the simulated key demand from cryptographic applications, so that traffic load is scaled consistently relative to what each topology can actually support. Accordingly, the dataset includes the topology generation process, the resulting generated topologies, the formulation, python code, and results of the MMCF optimization problem for each considered topology and the corresponding key relaying simulation results. For more information, check the README.md file.