New Bandwidth Guaranteed Routing Algorithms based on K-Shortest Algorithm 


Vol. 28,  No. 11, pp. 972-984, Nov.  2003


PDF
  Abstract

In this paper, new on-line routing algorithms with a bandwidth constraint are proposed. The proposed algorithms may be used for a dynamic LSP setup in MPLS network. We extend the WSP algorithm, the SWP algorithm and a utilization-based routing algorithm into the proposed algorithms by slightly modified K-shortest loopless path algorithms. The performances such as accepted bandwidth, accepted request number and average path length of the proposed and the previous algorithms are evaluated through extensive simulations. All simulations are. conducted under the condition that any node can be an ingress or egress node for a LSP setup. The simulation results show that the proposed algorithms have the good performances in most cases in comparison to the previous algorithms. Under the heavy load condition, the algorithms based on the minimum hop path perform better than any other 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]

J. Lee and S. Lee, "New Bandwidth Guaranteed Routing Algorithms based on K-Shortest Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 11, pp. 972-984, 2003. DOI: .

[ACM Style]

Jun-Ho Lee and Seong-Ho Lee. 2003. New Bandwidth Guaranteed Routing Algorithms based on K-Shortest Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 28, 11, (2003), 972-984. DOI: .

[KICS Style]

Jun-Ho Lee and Seong-Ho Lee, "New Bandwidth Guaranteed Routing Algorithms based on K-Shortest Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 11, pp. 972-984, 11. 2003.