首页> 外文期刊>Computer Networks >Design and analysis of the Stacked-Banyan ATM switch fabric
【24h】

Design and analysis of the Stacked-Banyan ATM switch fabric

机译:堆叠式榕树ATM交换结构的设计和分析

获取原文
获取原文并翻译 | 示例
       

摘要

ATM switches in future broadband networks will be required to support multigigabits/sec port speeds. At such high switching speeds, space-division switch architectures are more competitive than currently implemented shared-memory switch architectures. In this paper, we present the design and analysis of a new switch architecture, named Stacked- Banyan (SB), which utilizes parallel Banyan planes and supports K QoS levels with output queuing. The Banyans are composed of 2 × 4 switching elements (SEs). The SE is implemented by 0.35 μ CMOS logic gates. Circuit simulations of the SE show satisfactory performance at 1 Gbps. The non-blocking behavior of the SB fabric is verified by VHDL. The proposed fabric uses output queuing to resolve contention. In general, the output buffer handles K QoS levels by K virtual queues. Focusing on the case K = 2, we propose a buffer management and channel allocation strategy that can be adjusted to meet the delay and loss requirements of the two types of traffic. The output buffer is managed as two virtual queues, each handling a different traffic type. To meet the delay QoS of one traffic type, the channel is allocated to the respective queue with a probability that depends on the congestion level in that queue. We present a model and analysis of the output queues and calculate the waiting time and loss performance under two specific allocation strategies. The results indicate that the proposed channel allocation strategy is quite effective in maintaining a balance between the QoS objectives of the two traffic types.
机译:未来宽带网络中的ATM交换机将需要支持数千兆位/秒的端口速度。在如此高的交换速度下,空分交换架构比当前实现的共享内存交换架构更具竞争力。在本文中,我们介绍了一种名为Stacked-Banyan(SB)的新交换机体系结构的设计和分析,该体系结构利用了并行的Banyan平面并通过输出排队支持K QoS级别。榕树由2×4个开关元件(SE)组成。 SE由0.35μCMOS逻辑门实现。 SE的电路仿真显示了1 Gbps时的令人满意的性能。 VHDL验证了SB结构的非阻塞行为。拟议的结构使用输出队列解决争用。通常,输出缓冲区通过K个虚拟队列处理K个QoS级别。针对情况K = 2,我们提出了一种缓冲区管理和信道分配策略,可以对其进行调整以满足两种流量的延迟和丢失要求。将输出缓冲区作为两个虚拟队列进行管理,每个虚拟队列处理不同的流量类型。为了满足一种业务量类型的延迟QoS,将信道分配给相应队列的概率取决于该队列中的拥塞级别。我们提出了输出队列的模型和分析,并根据两种特定的分配策略计算了等待时间和损失表现。结果表明,提出的信道分配策略在保持两种流量类型的QoS目标之间保持平衡方面非常有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号