关键词: 区分服务, 流量工程, 抢占算法, 标签交换路径

Abstract:

The BH-PREPT ( Bandwidth Preemption) algorithm only concerns with minimizing the waste ofbandwidth without considering the computational complexity and the current development of optical fibercommunication, leading to excessive increase of delay in the networks. An algorithm greatly reducing the delay ofthe networks, named DH-PREPT(Delay and Bandwidth Preemption) is proposed. The DH-PREPT algorithmmakes the computational complexity lower under the premise of minimizing the utilization rate of bandwidth. Itconsiders the delay indicator by the bound of forwarding equivalence class and LSPs(Label Switching Paths) andfast forward the data of custom. Simulation results show that the proposed algorithm significantly outperforms the BH-PREPT algorithm when preemption occurs in the network.

Key words: differentiated services, traffic engineering, preemption algorithm, label switching path