Network Efficient Multi-metric Routing Algorithm for QoS Requiring Application 


Vol. 27,  No. 11, pp. 1055-1063, Nov.  2002


PDF
  Abstract

In this paper, we have studied path selection problem using multiple metric. Current Internet selects a path using only one metric. The path selected by one metric is a best-effon service that can satisfy one requirements. In order to satisfy a call with various Quality-of-Service(QoS) requirements, the path must satisfy multiple constraints. In many cases, path selection is NP-complete. The proposed algorithm is widest-least cost routing algorithm that selects a path based on cost metric which is basically a delay metric influenced by the network status. The proposed algorithm is a multiple metric path selection algorithm that has traffic distribution ability to select shortest path when network load is light and move traffic to other alternate path when the link load is high. We have compared the results with other routing algorithms.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Jeon, S. Kim, J. Lee, D. Kim, Y. Kim, "Network Efficient Multi-metric Routing Algorithm for QoS Requiring Application," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 11, pp. 1055-1063, 2002. DOI: .

[ACM Style]

HahnEarl Jeon, Sung-Dae Kim, Jai-yong Lee, Dong-Yeon Kim, and Young-Joon Kim. 2002. Network Efficient Multi-metric Routing Algorithm for QoS Requiring Application. The Journal of Korean Institute of Communications and Information Sciences, 27, 11, (2002), 1055-1063. DOI: .

[KICS Style]

HahnEarl Jeon, Sung-Dae Kim, Jai-yong Lee, Dong-Yeon Kim, Young-Joon Kim, "Network Efficient Multi-metric Routing Algorithm for QoS Requiring Application," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 11, pp. 1055-1063, 11. 2002.