摘要
基于光突发交换边缘节点在组装数据包前要采用交换阵对其进行突发汇聚,描述了交换阵常用的串行输入轮循算法,根据边缘节点中数据包变长突发汇聚的特点提出了变长串行输入轮循算法,并介绍了其在现场可编程门阵列上的实现。最后比较了两种算法在现场可编程门阵列上实现的资源占用与工作频率。
Crossbar is used to classify data packets in optical burst switching (OBS) edge nodes. This paper introduces input serial polling (ISP) algorithm, which is usually adopted in crossbar. An algorithm, named variable input serial polling (VISP), is proposed to support variable length data packets assembling. The details of the implementation of VISP algorithm in field programmable gate array (FPGA) is presented. Resource occupation and working frequency are compared between ISP and VISP.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2004年第6期734-737,共4页
Journal of University of Electronic Science and Technology of China
基金
国家863计划资助项目(2002AA122021)
