Networks


We provide several networks consisting of a set of nodes V, a set of edges E, and a set of communication demands D with |D| <= |V|*(|V|-1). All networks (with default traffic matrices) can be downloaded as a TGZ file containig native ASCII files or as a TGZ file containing XML files. Links to dynamic traffic matrices (native ASCII and XML) are provided where available in the table below.


When using the data for publications, please cite SNDlib: [1], [2].


No. Network |V| |E| |D|
1. abilene 12 15 132
2. atlanta 15 22 210
3. brain 161 332 14311
4. cost266 37 57 1332
5. dfn-bwin 10 45 90
6. dfn-gwin 11 47 110
7. di-yuan 11 42 22
8. france 25 45 300
9. geant 22 36 462
10. germany50 50 88 662
11. giul39 39 172 1471
12. india35 35 80 595
13. janos-us 26 84 650
14. janos-us-ca 39 122 1482
15. newyork 16 49 240
16. nobel-eu 28 41 378
17. nobel-germany 17 26 121
18. nobel-us 14 21 91
19. norway 27 51 702
20. pdh 11 34 24
21. pioro40 40 89 780
22. polska 12 18 66
23. sun 27 102 67
24. ta1 24 55 396
25. ta2 65 108 1869
26. zib54 54 81 1501


© 2023 Poznan University of Technology (PUT)
www.put.poznan.pl