arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0502093cs.DC
收藏

分块无源星型光网络中的在线置换路由

Online Permutation Routing in Partitioned Optical Passive Star Networks

Alessandro Mei, Romeo Rizzi

摘要:

本文建立了现有的技术水平,在确定性和随机在线置换路由的POPS网络。事实上,我们表明,任何排列可以在网上的POPS网络上的$O(\frac{d}{g}\log g)$确定性插槽,或以高概率,与$5c\lceil d/g\rceil+o(d/g)+O(\log\log g)$随机插槽,其中常数$c=\exp (1+e^{-1})\approx 3.927$。当$d=Θ(g)$,我们声称是“有趣”的情况下,随机算法是指数快于任何其他算法在文献中,确定性和随机的。在实践中也是如此。事实上,实验表明,即使从像POPS(2,2)这样小的网络开始,它也优于其竞争对手,并且差距随着网络的大小呈指数级增长。我们还可以证明,在适当的假设下,没有确定性算法可以渐近匹配其性能。

英文摘要:

This paper establishes the state of the art in both deterministic and randomized online permutation routing in the POPS network. Indeed, we show that any permutation can be routed online on a POPS network either with $O(\frac{d}{g}\log g)$ deterministic slots, or, with high probability, with $5c\lceil d/g\rceil+o(d/g)+O(\log\log g)$ randomized slots, where constant $c=\exp (1+e^{-1})\approx 3.927$. When $d=Θ(g)$, that we claim to be the "interesting" case, the randomized algorithm is exponentially faster than any other algorithm in the literature, both deterministic and randomized ones. This is true in practice as well. Indeed, experiments show that it outperforms its rivals even starting from as small a network as a POPS(2,2), and the gap grows exponentially with the size of the network. We can also show that, under proper hypothesis, no deterministic algorithm can asymptotically match its performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑