[1] Faucheur F L, Wu Liwen, Davie B, et al. IETF RFC 3270—2002,Multi-protocol label switching (MPLS) support of diferentiated services[S]. 2002. [2] Faucheur F L, Lai Waisun. IETF, RFC 3564—2003, Requirements for support of differentiated services-aware MPLS traffic engineering[S]. 2003. [3] Szviatovszki B, Szentesi A, Juttner A. Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing[J]. Computer Communications, 2002(25): 1076-1083. [4] Yu Ke, Zhang Lin, Zhang Huimin. A preemption-aware path selection algorithm for diffServ/MPLS networks//2004 IEEE International Workshop on IP Operations and Management (IPOM 2004). Beijing: , 2004: 129-133. [5] 禹可, 刘星照, 张惠民. DiffServ/MPLS网络中最小化抢占的路由算法. 计算机工程与应用, 2005, 41(33): 160-162. Yu Ke, Liu Xingzhao, Zhang Huimin. Routing with preemption minimization for diffServ/MPLS networks[J]. Computer Engineering and Applications, 2005, 41(33): 160-162. [6] 魏仰苏, 蒋国明, 宋瑾钰. 基于MPLS-DiffServ的LSP动态抢占算法研究[J]. 计算机工程与应用, 2006, 42(30): 145-147. Wei Yangsu, Jiang Guoming, Song Jinyu. Study on dynamic LSP-preemption algorithm supporting MPLS-DiffServ[J]. Computer Engineering and Applications, 2006, 42(30): 145-147. [7] Oliveira J C, Scoglio C, Akyildiz I F, et al. New preemption policies for diffServ-aware traffic engineering to minimize rerouting in MPLS networks[J]. IEEE/ACM Trans Networking, 2004, 12(4): 733-745. [8] He Xiaoming, Chu Qingxin, Zhu Mingying. Minimizing preemption cost for path selection in diffserv-ware MPLS networks[J]. Computer Communications, 2006, 29(18): 3825-3832. |