摘要
建立了一种通用最小化抢占路径选择的数学模型,给出了最小化抢占路径选择的目标函数,并提出一种新的基于路径的最小化抢占方法.该方法考虑了被选择抢占的标记交换路径(LSP)跨越全网的链路数及与选定路径共享链路的程度,在每段需要抢占的链路上选择被抢占的LSP时,总是优先选择那些共享选定路径的链路段数多、跨越全网的链路段数少的LSP,总体上表现出较低的路径抢占代价.仿真结果表明,该最小化抢占方法比只考虑单段链路的抢占最小化算法具有更小的抢占代价,能逼近目标函数的优化解,且具有更低的计算复杂度,易于在设备上实现.
A universal mathematical model for path selection to minimize preemption is established. The objective function for minimizing preemption cost is given. And a new method based on the select- ed path to minimize preemption is proposed. It lets, in priority, the label switched paths（LSPs） share more segments of links with the selected path and, in selecting LSPs to be preempted, also cross through the whole network with fewer segments of links so that the overall preemption cost is less. Simulations show that the proposed method can gain less preemption cost along the given path than in only considering single segment of link, it can approximate the optimization of the objective function for minimizing preemption cost simultaneously. It has much less computational complexity and is easier to be implemented by router as well.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2009年第1期19-23,共5页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(69972015)
广东省自然科学基金项目(31391)
关键词
多协议标记交换流量工程
路径选择
最小化抢占
目标函数
multiprotocol label switching traffic engineering
path selection
minimizing preemption
objective function
