K-窗口输入缓存ATM交换网的仿真  

Simulation of K-Window Input Buffer for ATM Switching Network

作　　者：石海[1] 方勇[1] 

机构地区：[1]上海大学通信与信息工程学院,上海200072

出　　处：《上海大学学报（自然科学版）》2005年第3期230-233,共4页Journal of Shanghai University:Natural Science Edition

基　　金：上海市科委自然科学基金资助项目(00ZD14019)

摘　　要：针对N×N端口内部无阻塞输入缓存ATM交换网络的队头(HOLHeadofLine)阻塞现象,该文采用称为K窗口输入缓存交换方式,并且对该交换方法进行了仿真分析.该方法在每一时隙内,依次检测输入缓存队列中前K个信元的目的地址,从中选择满足无阻塞交换条件的信元作为该时隙的交换信元,以减少HOL阻塞,从而提高互联网中该类ATM交换网络的信元通过率.当网络端口数N=512、窗口宽度K=14时,其信元通过率将达到90%以上.To solve HOL (Head of Line) blocking for N×N port ATM switch network without internal blocking, an algorithm, termed the K-windows input-buffered switching schedule, is adopted. Simulation for evaluating performance of the switch network is also presented. In the described algorithm, the first K packets in the input-buffered queues are successively examined within a time slot, and the packets that meet no-blocking switching are selected as the switching packets in the next time slot in order to reduce the HOL blocking and increase the packet throughput of the input-buffered ATM switches network. To evaluate the algorithm, simulation results of the packet throughput and loss probabilities are given. The throughput can exceed 90% with the buffer size K=14 and the switch size N=512.

关 键 词：ATM交换 K-窗口 输入缓存 队头阻塞 

分 类 号：TN918[电子电信—通信与信息系统]