Performance Improvement of LSU Algorithms in QoS Routing
Author(s) -
Kang-Hong Cho
Publication year - 2009
Publication title -
the journal of the korea contents association
Language(s) - English
Resource type - Journals
eISSN - 2508-6723
pISSN - 1598-4877
DOI - 10.5392/jkca.2009.9.3.049
Subject(s) - computer science , routing (electronic design automation) , blocking (statistics) , quality of service , overhead (engineering) , routing algorithm , algorithm , metric (unit) , computer network , routing protocol , engineering , operations management , operating system
This paper has proposed Flow Holding Time based Link State Update(LSU) Algorithm that can improve the performance of the existing LSU algorithms. As the existing LSU algorithms are based on the network traffic information, the proposed algorithm is based on flow holding time so we can minimize the LSU message overhead and has not had a strong influence on the depreciation of QoS routing performance. We apply a flow holding time in order to decrease the number of LSU message. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom