摘要
近年来,大量研究发现,网络流量呈现自相似性,自相似会导致数据分组延迟增大,丢包率增加,网络性能恶化。着重论述了在OBS固定时间汇聚算法下,用于汇聚成突发数据分组的IP分组长度对业务流自相似影响的问题。突发数据分组的汇聚算法是光突发交换的关键技术之一,其中,固定时间汇聚(FAP)算法可以平滑流量、降低流量自相似性。用于汇聚成突发数据分组的IP分组,其自身长度对固定汇聚(FAP)算法的流量整形有一定影响。仿真结果表明,存在最佳汇聚时间门限,能极大地降低业务流自相似程度,且最佳汇聚时间门限与IP分组长度均值有着密切关系。
The recent studies show that network traffic presents self-similarity. The self-similarity brings down the network efficiency and performance, increasing the data packet delay and the packet dropping probability. The impact of IP packet length assembled into a burst on self- similarity of traffic is elaborated under fixed-assembly period （FAP） algorithm of optical burst switching （OBS）. Burst assembly algorithms are one of the critical techniques of OBS. Among these algorithms, the fixed assembly-period algorithm can smooth traffic and degrade traffic self-similarity. The simulation shows that the average length of IP packets assembled into a burst has impact on the traffic shaping of the FAP algorithm to some extent. The simulation result demonstrates the existence of the optimum fixed assembly period which can reduce the degree of self-similarity greatly. Furthermore, it reveals that there is a close relationship between the average length of IP packets and the optimum fixed assembly period.
出处
《重庆邮电大学学报（自然科学版）》
2007年第1期119-122,共4页
Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基金
重庆市科委项目(2005BB2062
2005A2089)
重庆市教委项目(KJ060508
KJ060513)
重庆邮电大学通信学院青年基金资助。
关键词
光突发交换
自相似
汇聚算法
optical burst switching （OBS）
self similarity
assembly algorithm
