DiffServ/MPLS网络中最小化抢占的路由算法  

Routing with Preemption Minimization for DiffServ/MPLS Networks

作　　者：禹可[1] 刘星照[1] 张惠民[1] 

机构地区：[1]北京邮电大学信息工程学院,北京100876

出　　处：《计算机工程与应用》2005年第33期156-158,205,共4页Computer Engineering and Applications

摘　　要：在支持具有不同优先级和不同QoS需求的多业务网络中,抢占是带宽分配和管理的有效策略,但同时也对网络造成了振荡。在路径选择策略中引入抢占信息可最小化重路由,提高网络的稳定性。论文给出了最小化抢占的路由问题的数学规划模型。在此基础上提出了简单的启发式算法以运用于大型实际网络。策略是将路径选择和连接建立过程有效地结合起来,对现有的MPLS信令协议仅做了少许扩展。仿真证明该算法能达到抢占最小化的优化目标,有效地提高网络性能。In a multi-service network in which multiple classes with different priorities and different QoS requirements exist,preemption is an efficient mechanism for bandwidth allocation and management.However,preemption of many lower priority connections can lead to network fluctuation.By considering preemption-related information in the path selection procedure,we can minimize rerouting and improve network stability.In this paper,we have provided a mathematical programming formulation for the routing with preemption minimization problem.In view of the computational intractability of the problem,a simple distributed heuristic is proposed.Our mechanism combines the path selection procedure and connection setup procedure,and reasonably extends the current MPLS signaling protocols.Simulations show that our proposed algorithm can achieve preemption minimization,and improve overall network performance.

关 键 词：DIFFSERV 流量工程 抢占 路由算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]