基于光突发控制包缓存的批调度算法

Batch-scheduling algorithm based on optical BCP buffering

在光突发交换(OBS)网络中,数据信道调度算法是提高网络性能的重要措施之一。提出了一种基于光突发控制包(BCP)缓存的批调度算法,其主要思想是对到达的突发控制包进行缓存,当设定的最大缓冲时间到了,首先按照业务的优先级,再按照突发到达顺序对缓冲区中的BCP进行批调度处理,并采用LAUC-VF来调度数据突发(DB)。该算法通过缓冲较多的BCP,获得更多的突发信息,有利于优化调度DB,从而降低了突发丢失率。仿真结果表明该算法具有比LAUC-VF还要低的DB丢失率,并能有效支持QoS。

In optical burst switching fOBS） networks, the data channel scheduling algorithm is one of the key meas ures to improve the network performance. An effective batch-scheduling algorithm based on optical burst control packet （BCP） buffering is presented in this paper. The main idea of the algorithm is introduced as follows. In the OBS core node, the arriving burst control packets are cached to different buffers according to their priorities. When the buffer timer expires, the burst control packets in the high priority buffers are scheduled and then ones in the low priority buffers. The burst control packets in the same priority buffer are scheduled by LAUC-VF with the order of burst arrival time. The batch-scheduling algorithm can efficiently schedule the data burst and decrease the burst dropping probability by buffering many burst control packets and acquiring more information about data bursts. Numerical simulation shows that the proposed algorithm outperforms LAUC-VF in terms of the burst drop probability. In addition, it can support the QoS efficiently.