DocumentCode
2738806
Title
A preferred link functions for delay-constrained least-cost routing
Author
Chen, Liu ; Hua-An, Zhao
Author_Institution
Nanjing Univ. of Post & Telecommun., China
Volume
2
fYear
2003
fDate
14-17 Dec. 2003
Firstpage
1582
Abstract
This paper presents two new preferred link functions: LBC(low bound on cost) and LBC/sub RDM/ (low bound on cost-residual delay maximum). Based on LBC and LBC/sub RDM/, we propose two algorithms DCLC LBC and DCLC LBCRDM for delay constrained least cost routing. The computation results of random networks show that the performances of DCLC LBC and DCLC LBCRDM are comparable, and they are obviously better than the algorithm DCLC-RDM.
Keywords
linear programming; quality of service; telecommunication network routing; delay constrained least cost routing; linear programming; link functions; low bound on cost-residual delay maximum; quality of service; random networks; Call admission control; Communication system traffic control; Computer networks; Cost function; Delay; Heuristic algorithms; Joining processes; Quality of service; Routing; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks and Signal Processing, 2003. Proceedings of the 2003 International Conference on
Conference_Location
Nanjing
Print_ISBN
0-7803-7702-8
Type
conf
DOI
10.1109/ICNNSP.2003.1281182
Filename
1281182
Link To Document