New Parameter for Balancing Two Independent Measures in Routing Path

The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. If the parameter we concern is to measure the delay on that link, then the shortest path algorithm obtains the least delay path PLD. Also, if the parameter is to measure of the link cost, then the shortest path algorithm calculates the least cost path PLC . The delay constrained least cost (DCLC) path problem has been shown to be NP-hard. The path cost of PLD is relatively more expensive than that of PLC , and the path delay of PLC is relatively higher than that of PLD in DCLC problem. In this paper, we propose an effective parameter that is the probabilistic combination of cost and delay. It significantly contributes to ide...

• Type: Conference
• Year: 2004
• Where: ICCSA
• Authors: Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
• Keywords: Applied Computing, Delay Path Pld, ICCSA 2004, Path Cost, Shortest Path Algorithm