TopologyBench is a systematic graph theoretical approach to benchmarking optical network topologies. Network datasets are combined with their corresponding graph theoretical analysis to provide a systematic methodology for selecting diverse sets of optical networks for benchmarking. This topology benchmark is comprised of a network dataset and a systematic graph theoretic analysis. The dataset provides (a) 105 real optical networks and (b) synthetic topologies, generated by the SNR-BA model, divided into (i) Syn-small of 900 synthetic networks and (ii) Syn-large of 270,000 synthetic networks. The systematic graph theoretical analysis identifies and analyses structural, spatial and spectral properties of both the real world and synthetic networks. The graph theoretical correlation analysis reveal network design strategies leading to sparse yet efficient networks. An outlier analysis identifies networks that deviate from standard network designs. The analysis also identifies the limitations of real data in terms of network diversity and provides a justification for using synthetic data to complement the real dataset. We conclude the paper by providing a systematic methodology to cluster networks based on unsupervised machine learning and to select a diverse set of topologies for benchmarking. TopologyBench is a novel, high-quality and unified benchmark designed to facilitate research collaborations in long-haul fibre infrastructure by providing a systematic graph theoretical approach to benchmarking optical networks.

TopologyBench is a systematic graph theoretical approach to benchmarking optical network topologies. Network datasets are combined with their corresponding graph theoretical analysis to provide a systematic methodology for selecting diverse sets of optical networks for benchmarking. This topology benchmark is comprised of a network dataset and a systematic graph theoretic analysis. The dataset provides (a) 105 real optical networks and (b) synthetic topologies, generated by the SNR-BA model, divided into (i) Syn-small of 900 synthetic networks and (ii) Syn-large of 270,000 synthetic networks. The systematic graph theoretical analysis identifies and analyses structural, spatial and spectral properties of both the real world and synthetic networks. The graph theoretical correlation analysis reveal network design strategies leading to sparse yet efficient networks. An outlier analysis identifies networks that deviate from standard network designs. The analysis also identifies the limitations of real data in terms of network diversity and provides a justification for using synthetic data to complement the real dataset. We conclude the paper by providing a systematic methodology to cluster networks based on unsupervised machine learning and to select a diverse set of topologies for benchmarking. TopologyBench is a novel, high-quality and unified benchmark designed to facilitate research collaborations in long-haul fibre infrastructure by providing a systematic graph theoretical approach to benchmarking optical networks.

TopologyBench is a systematic graph theoretical approach to benchmarking optical network topologies. Network datasets are combined with their corresponding graph theoretical analysis to provide a systematic methodology for selecting diverse sets of optical networks for benchmarking. This topology benchmark is comprised of a network dataset and a systematic graph theoretic analysis. The dataset provides (a) 105 real optical networks and (b) synthetic topologies, generated by the SNR-BA model, divided into (i) Syn-small of 900 synthetic networks and (ii) Syn-large of 270,000 synthetic networks. The systematic graph theoretical analysis identifies and analyses structural, spatial and spectral properties of both the real world and synthetic networks. The graph theoretical correlation analysis reveal network design strategies leading to sparse yet efficient networks. An outlier analysis identifies networks that deviate from standard network designs. The analysis also identifies the limitations of real data in terms of network diversity and provides a justification for using synthetic data to complement the real dataset. We conclude the paper by providing a systematic methodology to cluster networks based on unsupervised machine learning and to select a diverse set of topologies for benchmarking. TopologyBench is a novel, high-quality and unified benchmark designed to facilitate research collaborations in long-haul fibre infrastructure by providing a systematic graph theoretical approach to benchmarking optical networks.

This set of data houses a test set of 1000 graphs with locally skewed traffic at a rate of gamma=0.8. The throughput labels are calculated with the same methodology as the other beta sets just subjected to different traffic conditions.

This set of data houses a test set of 1000 graphs with locally skewed traffic at a rate of gamma=0.4. The throughput labels are calculated with the same methodology as the other beta sets just subjected to different traffic conditions.

This set of data houses a test set of 1000 graphs with locally skewed traffic at a rate of gamma=0.4. The throughput labels are calculated with the same methodology as the other beta sets just subjected to different traffic conditions.

This set of data houses a test set of 1000 graphs with locally skewed traffic at a rate of gamma=0.2. The throughput labels are calculated with the same methodology as the other beta sets just subjected to different traffic conditions.

This set of data houses a test set of 1000 graphs with locally skewed traffic at a rate of gamma=0.2. The throughput labels are calculated with the same methodology as the other beta sets just subjected to different traffic conditions.

This dataset consists of 25-45 node graphs generated via ER [1] with uniformly randomly scattered nodes over a grid the size of north america with a minimim of 100km between nodes. This is a test dataset to test how the model reacts to different structures of graphs.
[1] P. Erdos and A. Renyi, ‘On the Evolution of Random Graphs’, in Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 1960, pp. 17–61.

This dataset consists of 25-45 node graphs generated via ER [1] with uniformly randomly scattered nodes over a grid the size of north america with a minimim of 100km between nodes. This is a test dataset to test how the model reacts to different structures of graphs.
[1] P. Erdos and A. Renyi, ‘On the Evolution of Random Graphs’, in Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 1960, pp. 17–61.