Routing Permutations in Partitioned Optical Passive Star Networks
Alessandro Mei, Romeo Rizzi
TL;DR
This paper demonstrates that partitioned optical passive star (POPS) networks can efficiently route any permutation with optimal or near-optimal slot usage, improving understanding of their routing capabilities.
Contribution
It provides a method to efficiently route any permutation in POPS networks with optimal or near-optimal resource usage, advancing network routing theory.
Findings
Optimal worst-case slot usage for permutation routing
Near-optimal slot usage for permutations without fixed points
Enhanced understanding of POPS network routing efficiency
Abstract
It is shown that a POPS network with g groups and d processors per group can efficiently route any permutation among the n=dg processors. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations p such that p(i)<>i for all i.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optical Network Technologies · graph theory and CDMA systems · Optical Network Technologies