A Vectorised Packing Algorithm for Efficient Generation of Custom Traffic Matrices
Christoper W. F. Parsonson, Joshua L. Benjamin, Georgios Zervas

TL;DR
This paper introduces a vectorised packing algorithm that significantly accelerates the generation of custom network traffic matrices, achieving up to 70 times faster performance on large networks.
Contribution
The paper presents a novel vectorised packing algorithm that substantially improves the efficiency of generating custom traffic matrices for large-scale networks.
Findings
Achieves up to 70x faster generation times on large networks.
Demonstrates scalability with network size from 64 to 1024 nodes.
Outperforms prior methods in speed by significant margins.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · graph theory and CDMA systems · Advanced Optical Network Technologies
