DocumentCode
353765
Title
A tunable QoS routing algorithm
Author
Caixia, Chi ; Shiquan, Wu ; Jianfang, Wang
Author_Institution
Inst. of Appl. Math., Acad. Sinica, Beijing, China
Volume
4
fYear
2000
fDate
2000
Firstpage
2360
Abstract
We propose a new distributed route-selection scheme to look for a feasible route satisfying the quality of service (QoS) constraints without compromising any of the existing guarantees. The performance of the QoS routing algorithm is tunable by choosing different upper bounds of the expected delivery time at every node according to the status of the network. Simulation results are presented to demonstrate the effectiveness of the proposed route-selection scheme
Keywords
optimisation; quality of service; real-time systems; telecommunication channels; telecommunication network management; telecommunication network routing; network routing; optimisation; quality of service; real time communications; route-selection; telecommunication channels; union path; Delay effects; Iterative algorithms; Mathematics; Peer to peer computing; Probes; Routing protocols; Runtime; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on
Conference_Location
Hefei
Print_ISBN
0-7803-5995-X
Type
conf
DOI
10.1109/WCICA.2000.862439
Filename
862439
Link To Document