Name
Abstract | ||
|---|---|---|
In this paper, we describe the results of simulation of very large (up to 109 nodes), planetary-scale networks using ns-3 simulator. The modeled networks consist of the small-world core graph of network routers and an equal number of the leaf nodes (one leaf node per router). Each bidirectional link in the simulation carries on-off traffic. Using LLNL's high-performance computing (HPC) clusters, we conducted strong and weak scaling studies, and investigated on-node scalability for MPI nodes. The scaling relations for both runtime and memory are derived. In addition we examine the packet transmission rate in the simulation and its scalability. Performance of the default ns-3 parallel scheduler is compared to the custom-designed NULL-message scheduler. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2756509.2756525 | WNS3 |
Keywords | Field | DocType |
algorithms,experimentation,high-performance computing,measurement,mpi,network communications,network simulation,network topology,ns-3,parallel architecture,performance,performance measures,high performance computing | Cluster (physics),Graph,Supercomputer,Computer science,Tree (data structure),Parallel computing,Network simulation,Router,Scaling,Scalability | Conference |
Citations | PageRank | References |
2 | 0.45 | 9 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergei Nikolaev | 1 | 7 | 2.66 |
| Eddy Banks | 2 | 2 | 0.79 |
| Peter D. Barnes, Jr. | 3 | 85 | 8.44 |
| David R. Jefferson | 4 | 1136 | 213.09 |
| Steven Smith | 5 | 2 | 0.45 |