检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵晓碧[1] 魏海平[1] 王福威[1] 高哲[1]
机构地区:[1]辽宁石油化工大学计算机与通信工程学院,辽宁抚顺113001
出 处:《辽宁石油化工大学学报》2008年第2期67-70,共4页Journal of Liaoning Petrochemical University
摘 要:IP分片以及TCP流的串行重组技术已经不能满足当今高速发展的网络,同时,网络上每个完整的会话都比较类似,而且不同应用层协议之间的差别也很小。因此重组工作通过并行来完成是很适宜的。采用多机并行的重组并行算法成为一种可行的实现方案。介绍了一种应用层并行重组技术,通过并行的方法将TCP/IP流重组工作负载进行合理分流,采用二维链表保存关键信息,从而避免NIDS工作负载过重的情形发生,同时以SMTP协议为例对其进行了深入地研究。最后,针对原算法的不足,提出了进一步的改进思想,细化任务颗粒,充分利用了各个结点的计算能力,有效实现了问题的并行化,并与原算法进行比较测试,性能有所提高。Nowadays, the procedure of IP fragments and TCP flows serial reassembling technology have not been satisfied with the high speed network requirements. Meanwhile, every whole conversation in the network is almost similar from each other. Little distinctions exist among protocols of different application layers. It is suitable for adopting parallel reassembling algorithm. A parallel reassembling algorithm in application layer was introduced. Through this method, the balance of IP fragments and TCP flows reassembling was distributed reasonably in parallel reassembly process. A two--dimensional linked list was used to save key information. Too heavy work load of NIDS was avoided. An example of SMTP protocol was analyzed thoroughly. At last, in the light of the weakness of original algorithm, an improved algorithm was put forward. The whole mission was distributed in parts and computing ability of each node was fully used. So the parallel reassembling was reached. The test result shows that the improved algorithm is much more efficient than that of the original algorithm.
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249