【摘要】 原有V-PREPT(Versatile Preemption)算法关心的是抢占总代价最小化,灵活性较好但带宽利用率不高。为此,在研究DS-TE环境下的抢占机制及现行的抢占算法基础上,提出了BH-PREPT(Bandwidth Preemption)算法。该算法能在最小化抢占总代价的条件下提高带宽的利用率,在保证被抢占的总带宽满足需求带宽的前提下,通过采取枚举法找出抢占总代价最小的LSP(Label Switching Path)组合,且优先选择被抢占LSP数目最少的组合实施抢占。通过Matlab的仿真结果表明,BH-PREPT算法在提高带宽利用率方面比V-PREPT算法更具有优势。更多还原

【Abstract】 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.更多还原