Abstract
The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The path cost of the least delay (LD) path is relatively more expensive than that of the least cost (LC) path, and the path delay of the LC path is relatively higher than that of the LD path. In this paper, we propose an effective parameter that is the probabilistic combination of cost and delay. It significantly contributes to identify the low cost and low delay unicasting path, and improves the path cost with the acceptable delay.
This paper was supported in part by Brain Korea 21 and University ITRC project. Dr. H. Choo is the corresponding author.
Chapter PDF
Similar content being viewed by others
References
Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)
Garey, M., Johnson, D.: Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Reeves, D.S., Salama, H.F.: A distributed algorithm for delay-constrained unicast routing. IEEE/ACM Transac. 8, 239–250 (2000)
Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Trees. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2658, pp. 879–887. Springer, Heidelberg (2003)
Widyono, R.: The Design and Evaluation of Routing Algorithms for Real-Time Channels. International Computer Science Institute, Univ. of California at Berkeley, Tech. Rep. ICSI TR-94-024 (June 1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, M., Bang, YC., Choo, H. (2004). On Balancing Delay and Cost for Routing Paths. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24685-5_100
Download citation
DOI: https://doi.org/10.1007/978-3-540-24685-5_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22114-2
Online ISBN: 978-3-540-24685-5
eBook Packages: Springer Book Archive