【摘要】：針對(duì)高速網(wǎng)絡(luò)流量并行處理的需求,提出一種流級(jí)別的高效動(dòng)態(tài)流量劃分算法DTP-PM.討論了DTP-PM算法設(shè)計(jì)的基本思想,并分析了其中的關(guān)鍵問題—會(huì)話表設(shè)計(jì).為提升算法性能,通過定義會(huì)話標(biāo)識(shí)符設(shè)計(jì)了會(huì)話表的哈希函數(shù)PRH,同時(shí)應(yīng)用MTF啟發(fā)法改進(jìn)會(huì)話表的哈希沖突解決方法.在引入負(fù)載度量化網(wǎng)絡(luò)流量分析負(fù)載輕重程度的基礎(chǔ)上,給出流量劃分算法DTP-PM的實(shí)現(xiàn)流程.借助高速網(wǎng)絡(luò)流量樣本對(duì)該算法性能進(jìn)行了實(shí)驗(yàn)評(píng)估.實(shí)驗(yàn)結(jié)果表明,DTP-PM算法在均衡性和高效性方面明顯優(yōu)于經(jīng)典的流量劃分算法.
[Abstract]:In order to meet the requirement of parallel processing of high-speed network traffic, an efficient dynamic traffic partitioning algorithm, DTP-PM., is proposed in this paper. The basic idea of DTP-PM algorithm design is discussed, and the key problem, session table design, is analyzed. In order to improve the performance of the algorithm, the hash function PRH, of the session table is designed by defining the session identifier and the MTF heuristic method is applied to improve the hash conflict resolution of the session table. On the basis of introducing the load quantized network traffic to analyze the degree of load, the flow chart of the traffic partition algorithm DTP-PM is given. With the help of high-speed network traffic samples, the performance of the algorithm is evaluated experimentally. The experimental results show that the DTP-PM algorithm is superior to the classical traffic partition algorithm in terms of balance and efficiency.
【作者單位】： 長沙理工大學(xué)計(jì)算機(jī)與通信工程學(xué)院;華中科技大學(xué)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院;
【基金】：國家自然科學(xué)基金項(xiàng)目(61001004,61163053)資助 湖南省教育廳科研項(xiàng)目(11C0036)資助 長沙理工大學(xué)人才引進(jìn)基金項(xiàng)目資助
【分類號(hào)】：TP393.06

【參考文獻(xiàn)】

相關(guān)期刊論文 前4條

1 楊際祥;譚國真;王榮生;;并行與分布式計(jì)算動(dòng)態(tài)負(fù)載均衡策略綜述[J];電子學(xué)報(bào);2010年05期

2 呂志軍,鄭t，

本文編號(hào)：2445425