Routing Permutations in Partitioned Optical Passive Star Networks
<|reference_start|>Routing Permutations in Partitioned Optical Passive Star Networks: 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.<|reference_end|>
@article{mei2001routing,
    title={Routing Permutations in Partitioned Optical Passive Star Networks},
    author={Alessandro Mei and Romeo Rizzi},
    journal={arXiv preprint arXiv:cs/0109027},
    year={2001},
    archivePrefix={arXiv},
    eprint={cs/0109027},
    primaryClass={cs.DC cs.DS}
}