Journal of Northeastern University ›› 2010, Vol. 31 ›› Issue (2): 193-196.DOI: -

• OriginalPaper • Previous Articles     Next Articles

On the adaptive preemption algorithm in DS-TE networks

Du, Li (1); Li, Hai-Tao (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-20 Revised:2013-06-20 Online:2010-02-15 Published:2013-06-20
  • Contact: Du, L.
  • About author:-
  • Supported by:
    -

Abstract: In the DS-TE networks the preemption provides the high priority business with reliable service quality, and it will be more effective especially when a network overload or node and link failure occurs. An adaptive preemption algorithm is therefore proposed to adapt to the bandwidth demand for new LSP by strengthening the control of the LSR over LSP resources. To avoid the setting of parameters, the adaptive preemption algorithm is divided into A-minconn and A-minpri. Simulation results showed that the adaptive preemption algorithm is obviously superior to the conventional algorithm in the preemption performance including bandwidth, priority and the numbers required.

CLC Number: