New Preempting Algorithm of LSP for DS-TE Networks
Junzhu Wang · Journal of Jilin University · 2013
The V-PREPT(Versatile Preemption) algorithm,which has better flexibility,but only concerns with minimizing the total cost of preemption.Its utilization of bandwidth is not good.Under the premise of minimizing the total cost of preemption an algorithm named BH-PREPT(Bandwidth Preemption) to improve the utilization of bandwidth is proposed.The BH-PREPT algorithm ensures that the total bandwidth preempted meets the bandwidth demand finds out the minimum total cost of preempted LSP(Label Switching Path)by taking the enumeration method.And the combination with the minimum number of preempted LSP will have priority when preemption occurs.By Matlab simulation the BH-PREPT algorithm is proved to have better properties concerning with minimizing the total cost of preemption than V-PREPT.