Self-routing permutation networks based on de Bruijn digraphs
    22.
    发明授权
    Self-routing permutation networks based on de Bruijn digraphs 失效
    基于de Bruijn有向图的自路由置换网络

    公开(公告)号:US06721311B1

    公开(公告)日:2004-04-13

    申请号:US09631206

    申请日:2000-08-01

    CPC classification number: H04L49/25 H04L49/101 H04L49/1515 H04L49/3009

    Abstract: Permutation networks based on de Bruijn digraphs exhibit constant control complexity (wide sense non-blocking) and constant control complexity (self-routing). The cost in terms of the cross-points used for such networks is an optimal O(N log N). This non-blocking network uses fast algorithms to control in the Terabit bandwidth while providing for cost-effective switching. The network has expandable (i.e., scalable) architecture, i.e., the network can be built by interconnecting smaller non-blocking networks (e.g., small crossbars).

    Abstract translation: 基于de Bruijn有向图的置换网络呈现出恒定的控制复杂度(广义无阻塞)和恒定控制复杂度(自路由)。 用于这种网络的交叉点的成本是最佳的O(N log N)。 这种非阻塞网络使用快速算法来控制Terabit带宽,同时提供成本有效的切换。 网络具有可扩展(即可扩展)架构,即,可以通过互连较小的非阻塞网络(例如,小十字形网络)来构建网络。

Patent Agency Ranking