Đang chuẩn bị liên kết để tải về tài liệu:
A new localized multi-constraint QoS routing algorithm

In this paper, we propose a new and effective localized QoS routing algorithm, compare its performance with those of other localized algorithms and a traditional QoS routing algorithm under the same type of network topology, QoS requirements and traffic patterns. The simulations results show that our proposed algorithm can perform better than other routing algorithms. | Research and Development on Information and Communication Technology A New Localized Multi-Constraint QoS Routing Algorithm Tran Minh Anh and Nguyen Chien Trinh Posts and Telecommunications Institute of Technology, Hanoi, Vietnam E-mail: anhtm.dng@vnpt.vn, trinhnc@ptit.edu.vn Correspondence: Tran Minh Anh Communication: received 3 June 2016, revised 31 May 2017, accepted 31 June 2017 flow routing using the localized view of the network QoS state. By this approach, each node maintains a predetermined set of candidate paths to each possible destination and routes flows along these paths. The localized routing algorithm will perform differently for each different type of sets of the candidate paths. Therefore, investigating efficient methods to build sets of paths for localized routing algorithms is an important task at present. Abstract: The scheme of Quality of Service (QoS) routing algorithms based on local state information has recently been proposed as an alternative approach to the traditional QoS routing algorithms. By implementing this localized QoS routing algorithm, each source node predetermines and maintains a set of candidate paths for each destination. These sets of paths will help the source node to decide the most appropriate path for a connection request. Hence, it helps to avoid the problems associated with the maintenance of the global network state information. In this paper, we propose a new and effective localized QoS routing algorithm, compare its performance with those of other localized algorithms and a traditional QoS routing algorithm under the same type of network topology, QoS requirements and traffic patterns. The simulations results show that our proposed algorithm can perform better than other routing algorithms. In this paper, we first survey some QoS routing approaches and related works. Then we consider the global QoS routing algorithms which need to periodically update the network state, and some other routing algorithms .