随着IP技术架构的播出控制系统在广播电视制播系统建设中的应用逐步深入,传统数字分量串行接口(Serial Digital Interface,SDI)基带视频信号转码成IP数据流,日常的视频信号监测流程发生了改变。对此,从测量的目的、思路、方法、顺序、...随着IP技术架构的播出控制系统在广播电视制播系统建设中的应用逐步深入,传统数字分量串行接口(Serial Digital Interface,SDI)基带视频信号转码成IP数据流,日常的视频信号监测流程发生了改变。对此,从测量的目的、思路、方法、顺序、指标等方面出发,针对IP数据流技术架构下需要监测的指标、测量的方法以及遇到故障时的处理方法进行分析和探讨。展开更多
Packet classification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packet classification (PPC) is the popular one. This paper analyz...Packet classification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packet classification (PPC) is the popular one. This paper analyzes the problem of ruler conflict, and then presents a TCAM-based two-dimensional PPC algorithm. This algorithm makes use of the parallelism of TCAM to lookup the longest prefix in one instruction cycle. Then it uses a memory image and associated data structures to eliminate the conflicts between rulers, and performs a fast two-dimeusional PPC. Compared with other algorithms, this algorithm has the least time complexity and less space complexity.展开更多
文摘随着IP技术架构的播出控制系统在广播电视制播系统建设中的应用逐步深入,传统数字分量串行接口(Serial Digital Interface,SDI)基带视频信号转码成IP数据流,日常的视频信号监测流程发生了改变。对此,从测量的目的、思路、方法、顺序、指标等方面出发,针对IP数据流技术架构下需要监测的指标、测量的方法以及遇到故障时的处理方法进行分析和探讨。
基金Foundation item: supported by Intel Corporation (No. 9078)
文摘Packet classification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packet classification (PPC) is the popular one. This paper analyzes the problem of ruler conflict, and then presents a TCAM-based two-dimensional PPC algorithm. This algorithm makes use of the parallelism of TCAM to lookup the longest prefix in one instruction cycle. Then it uses a memory image and associated data structures to eliminate the conflicts between rulers, and performs a fast two-dimeusional PPC. Compared with other algorithms, this algorithm has the least time complexity and less space complexity.
