A Vectorised Packing Algorithm for Efficient Generation of Custom Traffic Matrices
February 20, 2023 Β· Declared Dead Β· π Optical Fiber Communications Conference and Exhibition
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Christoper W. F. Parsonson, Joshua L. Benjamin, Georgios Zervas
arXiv ID
2302.09970
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.NI
Citations
0
Venue
Optical Fiber Communications Conference and Exhibition
Last Checked
5 months ago
Abstract
We propose a new algorithm for generating custom network traffic matrices which achieves 13x, 38x, and 70x faster generation times than prior work on networks with 64, 256, and 1024 nodes respectively.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted