The deflection self-routing Banyan network: a large-scale ATM switch using the fully adaptive self-routing and its performance analyses
The deflection self-routing Banyan network: a large-scale ATM switch using the fully adaptive self-routing and its performance analyses
复制标题
偏转自路由Banyan网络：采用全自适应自路由的大规模ATM交换机及其性能分析
DOI：
10.1109/90.793032
复制
发表时间：
1999
期刊：
影响因子：
--
通讯作者：
Heung
中科院分区：
文献类型：
--
作者：
Jae;H. Yoon;Heung
由于将成为宽带综合业务数字网络的主要流量的互联网流量在多级交换网络中进行交换时是突发的，因此通过不同的入站链路同时到达交换单元的多个单元可能必须沿着同一出站链路转发。针对这种链路争用问题，提出了一种高性能的大型ATM交换机。它是一种采用全自适应自路由控制的新型无缓冲增强型榕树网络：偏转自路由榕树网络。为了利用网络的所有链路作为备选路径，我们在每个交换元素中使用偏转路由算法，这样，未能被选定为预期链路的单元将沿着不同的链路发送，希望它们稍后返回，或者绕道竞争链路并继续其旅程到目的地。在交换网络中，单元永远不会被丢弃，而交换机没有多个单元缓冲区。所提出的路由与一般的Banyan网络一样简单，并且所有的交换单元（se）具有统一的结构。为了设计所提出的网络及其自路由，我们使用了Banyan网络的所有se在拓扑上按规则模式排列的拓扑特性。我们用代数形式来表述和证明这些性质。我们还进行了性能分析，以提供与Banyan网络和复制Banyan网络的定量比较。结果表明，新网络具有比其他网络更好的性能和可扩展性。
Because the Internet traffic, that will be the major traffic of broadband integrated services digital networks, is bursty when cells are being switched within the multistage switching network, it has a higher possibility that multiple cells arriving simultaneously at a switching element through different incoming links may have to be forwarded along the same outgoing link. We propose a high-performance large-scale ATM switch dealing with such link contention problem. It is a new unbuffered augmented Banyan network using fully adaptive self-routing control: the deflection self-routing Banyan network. To utilize all the links of the network as alternate paths, we employ the deflection-routing algorithm in each switching element, such that cells failing to get selected for the intended link are sent along different links, in the hope that they later return, or detour the contended link and continue their journey to the destination. Cells are never dropped within the switching network, whereas the switch has no multiple cell buffers. The proposed routing is as simple as that of the generic Banyan network, and all the switch elements (SEs) have a uniform structure. To design the proposed network and its self-routing, we use the topological properties that all the SEs of the Banyan network are arranged in a regular pattern topologically. We formulate and prove these properties through an algebraic formalism. We also ran a performance analysis to provide quantitative comparison against the Banyan network and the replicated Banyan networks. As a result, we show that the new network has a far better performance and scalability than the other networks.