Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2009, Vol. 32 ›› Issue (2): 119-122.doi: 10.13190/jbupt.200902.119.caoch

• Reports • Previous Articles     Next Articles

Scheduling Algorithm of Multi-Level Services Based on T-MPLS Network

Chang Cao Yong-jun Zhang LI Bin shanguo huang wanyi gu   

  • Received:2008-06-25 Revised:2008-12-25 Online:2009-04-28 Published:2009-04-28
  • Contact: Chang Cao

Abstract:

An algorithm is proposed for scheduling different types of services and for improving bandwidth utilization of links in transport multiprotocol label switching network. This algorithm is implemented in a simulation testbed based on OPNET modeler for performance evaluation. Simulation is shown that, compared with traditional scheduling algorithms, the complexity of this algorithm is notincreased. And a better timedelay performance of the high class services is also verified.

Key words: transport multimso-hansi-font-family: 宋体">protocol label switching, scheduling algorithm, priority queuinfont-size: 10.5pt, mso-fareast-font-family: 宋体, mso-ansi-language: EN-US, mso-fareast-language: ZH-CN, mso-bidi-language: AR-SA, mso-bidi-font-family: 宋体, mso-hansi-font-family: 宋体, mso-font-kerning: 1.0pt, mso-bidi-font-size: 12.0pt" lang="EN-US">g, weight fair queuing, classfont-size: 10.5pt, mso-ansi-language: EN-US, mso-fareast-language: ZH-CN, mso-bidi-language: AR-SA, mso-bidi-font-family: 宋体, mso-ascii-font-family: 'Times New Roman', mso-font-kerning: 1.0pt, mso-bidi-font-size: 12.0pt">font-size: 10.5pt, mso-fareast-font-family: 宋体, mso-ansi-language: EN-US, mso-fareast-language: ZH-CN, mso-bidi-language: AR-SA, mso-bidi-font-family: 宋体, mso-hansi-font-family: 宋体, mso-font-kerning: 1.0pt, mso-bidi-font-size: 12.0pt" lang="EN-US">weight fair queuing