一种利用最佳路径搜索的PDU容错定界算法

Algorithm for error-tolerant delimitation for the protocol data unit based on best path searching

针对在无线网络中因高误比特率而使协议数据单元定界易出错的问题,提出一种基于最佳路径搜索的协议数据单元容错定界算法.通过针对两类与协议数据单元定界相关的协议冗余的分析,在提出粗定界算法的基础上,将协议数据单元定界问题转化为路径搜索问题,给出了一种基于最佳路径搜索的协议数据单元容错定界算法.以无线异步传输模式网络中AAL5/IP网络协议为例进行仿真分析,仿真结果表明,该算法能有效降低协议数据单元的定界错误率,能克服常规定界方法对差错敏感的缺陷,具有良好的容错定界能力.

Aiming at the error delimitation caused by the high bit error rate in a wireless network, an algorithm for error-tolerant delimitation for the Protocol Data Unit （PDU） based on best path searching is proposed. With the analysis of the protocol redundancy in delimitation, the PDU delimitating is treated as a path searching problem exploiting the rough delimitation result, then an algorithm based on best path searching is provided. Simulation and analysis of the ATM Adaption Layer 5 （AALS） and Internet Protocol （IP） protocols in the Asynchronous Transfer Mode （ATM） network show that this method can decrease the rate of error delimitation, overcoming the conventional one＇s sensitivity to error and achieving a better errortolerant performance.