一种光突发交换网络中降低填充开销的突发组装算法(英文)  

A Burst Assembly Algorithm with Padding Reduction in Optical Burst Switching

作　　者：刘建平[1] 文爱军[1] 刘增基[1] 

机构地区：[1]西安电子科技大学综合业务网国家重点实验室,西安710071

出　　处：《光子学报》2007年第B06期1-4,共4页Acta Photonica Sinica

摘　　要：针对光突发交换(OBS)网络现有组装算法在输入业务量较小时组装填充开销较大的性能缺陷,提出了一种新的突发组装算法,称之为BPRA算法.该组装算法通过改变突发生成时间,在不增加端到端时延的条件下利用偏置时间来延长突发组装时间,从而可以有效降低填充空闲比特的数目.同时提出一个近似分析模型来计算空闲比特填充概率.分析和仿真结果表明BPRA算法可以明显降低组装填充开销.In order to solve burst padding in OBS networks with light-load, a novel burst assembly algorithm, called Padding Reduction Burst Assembly algorithm （PRBA）, is proposed to minimize the amount of padding overhead while maintaining the end-to-end delay requirement of IP packets. The BPRA determines the burst generating time according to the burst length and use the offset-time to prolong the assembly time. An approximate analytical model is also presented to calculate the probability of burst padding. The analytical and simulation results show that the BPRA algorithm can significantly reduce the padding overhead and improve the loss performance of OBS network in light-load scenarios.

关 键 词：光突发交换 突发组装 填充开销 

分 类 号：TN929.11[电子电信—通信与信息系统]