EDGE ADMISSION CONTROL IN MPLS NETWORK
Admission control and routing are two key mechanisms for advanced Quality of Service (QoS) and Traffic engineering (TE) support in the data networks. However, traditional QoS and TE solutions usually focus exclusively on routing to achieve network resource usage optimization, while often neglect to give adequate attention to admission control. To provide a more comprehensive solution, a novel approach for admission control in MPLS network was proposed in Ref. 2, which can be applied at network edges to provide the necessary QoS. However, the previously proposed admission control algorithm favors the QoS traffic without considering the influence on the huge amount of existing best-effort traffics. In this paper, we propose a new approach of computing admission thresholds, which takes into account both the best-effort traffics performance and QoS traffics constraints. Simulation results show that our new framework can provide additional performance protection for best effort traffic and improve throughput performance of the entire network.
MPLS Traffic Engineering QoS Constraint-based Routing K shortest paths virtual residual bandwidth
Zhaopeng Meng Lianfang Zhang Jifa Zhou
School of Computer Science and Technology, Tianjin University, Tianjin 300072, China
国际会议
北京
英文
213-216
2009-11-06（万方平台首次上网日期，不代表论文的发表时间）