摘要
研究了最小长度最大汇聚时间算法在现场可编程门阵列中的实现方法。在实现过程中,使用了状态机控制组装流程。在缓存的使用上,提出了共享缓存的做法以节省存储资源,即根据输入数据流的随机性,实际设置的汇聚缓存数目小于总的突发包类型数目。
How to assemble TCP/IP packets into data burst in OBS edge nodes is discussed. Min-burst-length-max-assembly-period algorithm is preferred and implemented on Xilinx VirtexII Pro FPGA. A state machine controls the assembly process. Sharing buffer memory is proposed to save memory resources. That is, the number of physical burst queues is less than that of burst types since the inputs is random.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2004年第6期697-700,共4页
Journal of University of Electronic Science and Technology of China
基金
国家863计划资助项目(2002AA122021)