Findings on a least hop (s) path using Bellman-Ford algorithm

Md Taujuddin, Nik Shahidah Afifi and Abd Wahab, Mohd Helmy and Mohd. Mujib, Siti Zarina and Tukiran, Zarina (2007) Findings on a least hop (s) path using Bellman-Ford algorithm. In: First Regional Conference On Computational Science and Technologies, 29 - 30 Nov 2007, Shangri-La Tanjung Aru Kota Kinabalu, Sabah.

[img]
Preview
PDF
472Kb

Abstract

As one of the most challenging problems in the next generation high-speed network constrain on service on routing. Bellman-Ford routing algorithm is one of the approach techniques being used to provide best strategy for QoS routing problems. This paper present the powerful of Bellman-Ford in solving most multiple constrained routing problems arise in the network. The discussions also highlight the application, advantages, and potential problems of the Bellman Ford as well as comparison with Dijikstra routing algorithm.

Item Type:Conference or Workshop Item (Paper)
Subjects:T Technology > T58.6-58.62 Management information systems
ID Code:1839
Deposited By:M.Iqbal Zainal A
Deposited On:04 Oct 2011 11:02
Last Modified:04 Oct 2011 11:02

Repository Staff Only: item control page