欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了降低突发丢失率和调度复杂度,提出了一种基于LAUC的批调度算法。该算法首先缓存多个突发控制包,当最大缓存时间到达时,根据突发到达顺序批调度处理缓存中的突发控制包,并采用LAUC算法来为突发预留信道资源。其优势在于：计算复杂度与LAUC一样低,因为它只增加了突发控制包缓存和改变了LAUC算法的调度顺序;突发丢失率比较低,仿真结果表明它的突发丢失率比LAUC算法要低,当最大缓存时间大于偏置时间的最大差值时,它的突发丢失率比LAUC-VF算法还要低。
英文摘要：
In order to decrease the burst dropping probability and computational complexity, a batching scheduling algorithm based on LAUC（BS-LAUC） is proposed. The algorithm at first buffers more than one burst control packets（BCP）, and then schedules the data bursts（DB） by LAUC with burst arrival order. Compared with LAUC algorithm, BS-LAUC only adds buffering and changes the scheduling order. So BS-LAUC is as simple as LAUC. And it has another merit of low burst dropping probability. Simulation results show that BS-LAUC not only outperforms LAUC in terms of burst dropping probability, but also outperforms LAUC-VF in the condition that the maximum buffer time is longer than the max difference of the offset time.
同期刊论文项目
同项目期刊论文
期刊信息
位置：