OALib Journal期刊
ISSN: 2333-9721
费用:99美元
避免抢占的多协议标记交换路由算法
, PP. 820-824
Keywords: 通信技术 ,多协议标记交换 ,区分感知的流量工程 ,避免抢占 ,负载均衡
Abstract:
?目前流量工程的主要算法大多不能克服对不同类型业务流顺序的影响以及对各流类型带宽比例的影响,且很少在为业务请求计算路由时便考虑避免LSP抢占的问题。为此,提出一种避免抢占的MPLSDS-TE路由算法PA-DTE(PreemptingAlgorithm-DiffServawareTrafficEngineering).新算法综合考虑各类业务流的带宽比例,优先选择相对空闲的链路,从而减少了被抢占的LSP数目。为验证新算法的性能,在NS2仿真平台上实现了该算法的仿真,仿真结果表明,与在为业务请求计算路由时未考虑避免LSP抢占问题的算法相比,新算法在负载均衡、维持链路各CT(ClassType)流量比例、保证业务QoS和避免抢占等方面表现出了一定的优势。
References
[1] [5] Apostolopoulos G, Kamat S, Orda A, et al. QoS routing mechanisms and OSPF extensions[S]. Internet, RFC2676, 1999.
[2] [6] Kodialam M, Lakshman T V. Minimum interference routing with applications to MPLS traffic engineering [C]∥IEEE INFOCOM 2000, Tel-Aviv, 2000: 884-893.
[3] [7] Suri S, Waldvogel M, Warkhede P R. Profile-based routing: a new framework for MPLS traffic engineering[R]. Washington University Computer Science Technical Report WUCS-00-21, 2000.
[4] [8] UCB/LBNL/VINT. Network simulator (NS2) [EB/OL]. (2000-2006)[2008-10-01]. http:∥www.isi.edu /nsnam/dist.
[5] [9] Gaeil Ahn, Woojik Chun Architecture of MPLS network simulator (MNS) for the setup of CR-LSP[D]. Korea: Chungnam National University, 2001.
[6] [10] Le F. Faucheur, E d. Russian dolls bandwidth constraints model for DiffServ-aware MPLS traffic engineering [S]. Internet, RFC4127, 2005.
[7] [1] Rosen E, Viswanathan A, Callon R. Multi-protocol label switching architecture[S]. Internet, RFC3031, 2001.
[8] [2] Faucheur F Le, Wu L, Davie B, et al. Multi-protocol label switching (MPLS) support of differentiated services[S]. Internet, RFC3270, 2002.
[9] [3] Awduche D. Requirements for traffic engineering over MPLS[S]. Internet, IETF RFC2702, 1999.
[10] [4] Le F, Lai F, W. Requirements for support of DiffServ-aware MPLS traffic engineering[S]. Internet, RFC3564, 2003.
Full-Text
Contact Us
service@oalib.com
QQ:3279437679
WhatsApp +8615387084133