Improved LSP Preemption Algorithm for DS-TE Networks
Wei Jina · Jisuanji gongcheng · 2011
Because of the problem of preempting more Label Switched Path(LSP) with higher priority when Min_BW algorithm optimizes the priority of LSPs to be preempted,this paper proposes Improved_Min_BW(I_Min_BW) algorithm based on Min_BW algorithm.In order to optimize the priority of LSPs to be preempted,I_Min_BW algorithm considers the number of LSPs to be preempted and the highest priority of LSPs to be preempted and the sum of priority of LSPs to be preempted.It analyzes and compares two algorithms from the perspective of theory and simulation study and shows that the performance of I_Min_BW algorithm is better than Min_BW algorithm in optimizing the priority of LSPs to be preempted as well as the number of LSPs to be preempted.