Moon-Seong Kim, Young-Cheol Bang, Hyun-Seung Choo, Journal of Internet Computing and Services, Vol. 8, No. 1, pp. 25-32, Feb. 2007
Full Text:  HTML
Keywords: Unicost Routing, Delay Constrained Least Cost (DCLC) Path Problem, Delay Constrained Unicast Routing (DCUR) Algorithm

Abstract

The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.

Statistics
Cite this article