tewg-7----Page:4
1 2 3 4 5 6 7 8 9
|
Preemption Heuristic Heuristic cost function: H(l) = ? (cost of LSP l) + ? + ? (b(l) – r)2 ? (cost of LSP l) represents the cost of preempting an LSP with a certain priority ? represents the choice of a minimum number of LSPs for preemption ? (b(l) – r)2 penalizes a choice of an LSP that would result in high bandwidth wastage Calculate H(l) for each LSP l Sort H(l) in increasing order and by increasing bandwidth Select the LSPs with smaller H that add enough bandwidth to accommodate r |