J4 ›› 2010, Vol. 37 ›› Issue (5): 801-807.doi: 10.3969/j.issn.1001-2400.2010.05.005

• Original Articles • Previous Articles     Next Articles

Dynamic traffic grooming algorithm with the adaptively differentiated  weight for holding-time-aware services in IP over WDM networks

XU Zhan-qi1;DING Qiu-ju1;CHEN Xiao-hui2;DING Zhe1
  

  1. (1. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an  710071, China;
    2. Wuhan Research Inst. of Post & Telecom., Wuhan  430074, China)
  • Received:2010-04-23 Online:2010-10-20 Published:2010-10-11
  • Contact: XU Zhan-qi E-mail:zqxu@mail.xidian.edu.cn

Abstract:

On the basis of the feature of the holding-time awareness for services requested and for reducing network congestion through network load balancing, this paper proposes a dynamic traffic routing algorithm with the adaptively differentiated weight of the grooming for hold-time-aware services(DWG-HTA), in which the link-weight assignment relies on the residual lifetime and future congestion of network links. We design the procedure of the proposed DWG-HTA and develop an integer linear programming(ILP) model to solve dynamic traffic grooming problems in IP over WDM networks. Simulation results show that DWG-HTA could reduce the traffic blocking probability by 24 percent at most compared with typical routing algorithms used in IP over WDM networks, and validate the effectiveness for network load balancing. We also present the blocking probabilities of DWG-HTA and the ILP model based on the scenario of a small-size network topology and the scheduled traffic, and the performance improvement possibility of the DWG-HTA algorithm.

Key words: dynamic traffic grooming, routing algorithms, holding time aware(HTA), load balancing, integer linear programming(ILP) model