TY - GEN
T1 - A new QoS routing approach for multimedia applications based on genetic algorithms
AU - Barolli, L.
AU - Koyama, A.
AU - Sawada, H.
AU - Suganuma, T.
AU - Shiratori, N.
N1 - Publisher Copyright:
© 2002 IEEE.
PY - 2002
Y1 - 2002
N2 - In order to support multimedia communication over high speed networks, it is necessary to develop routing algorithms which use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting systems require better QoS. However, the problem of QoS routing is difficult and to find a feasible route with two independent path constraints is NP-complete. Therefore, QoS routing algorithms for high speed networks must be adaptive, flexible, and intelligent for efficient network management. In a previous work, we proposed a genetic algorithm (GA) based routing method. This method used only the delay time as a routing parameter. In this paper we improve the previous work in three aspects. The new QoS routing method uses two QoS parameters for routing. We implemented a new tree generating algorithm which generates and reduces the tree automatically. Furthermore, we carried out the simulations for different kinds of networks. The simulation results show that the proposed method has a better performance than a conventional GA based routing algorithm.
AB - In order to support multimedia communication over high speed networks, it is necessary to develop routing algorithms which use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting systems require better QoS. However, the problem of QoS routing is difficult and to find a feasible route with two independent path constraints is NP-complete. Therefore, QoS routing algorithms for high speed networks must be adaptive, flexible, and intelligent for efficient network management. In a previous work, we proposed a genetic algorithm (GA) based routing method. This method used only the delay time as a routing parameter. In this paper we improve the previous work in three aspects. The new QoS routing method uses two QoS parameters for routing. We implemented a new tree generating algorithm which generates and reduces the tree automatically. Furthermore, we carried out the simulations for different kinds of networks. The simulation results show that the proposed method has a better performance than a conventional GA based routing algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84961827944&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84961827944&partnerID=8YFLogxK
U2 - 10.1109/CW.2002.1180892
DO - 10.1109/CW.2002.1180892
M3 - Conference contribution
AN - SCOPUS:84961827944
T3 - Proceedings - 1st International Symposium on Cyber Worlds, CW 2002
SP - 289
EP - 295
BT - Proceedings - 1st International Symposium on Cyber Worlds, CW 2002
A2 - Peng, Shietung
A2 - Yukita, Shuichi
A2 - Savchenko, Vladimir V.
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1st International Symposium on Cyber Worlds, CW 2002
Y2 - 6 November 2002 through 8 November 2002
ER -