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 cost, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cost (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 more 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 Estimated Path Selection (EPS) algorithm 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 EPS with the DCUR in various network situations. It significantly affects the performance that the normalized surcharge is improved up to about 105%. The time complexity is O(l + nlogn) which is comparable to well-known previous works.
This work was supported in parts by Brain Korea 21 and the Ministry of Information and Communication in Republic of Korea. Dr. Choo is the corresponding author and Dr. Bang is the co-corresponding author.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ajuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)
Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)
Calvert, K.L., Doar, M.: Modelling Internet Topology. IEEE Communications Magazine, 160–163 (June 1997)
Doar, M.: Multicast in the ATM environment. PhD thesis, Cambridge Univ., Computer Lab. (September 1993)
Doar, M.: A Better Mode for Generating Test Networks. In: IEEE Proc. GLOBECOM 1996, pp. 86–93 (1996)
Garey, M., Johnson, D.: Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Hedrick, C.: Routing information protocol (June 1988), http://www.ietf.org/rfc/rfc1058.txt
Kim, M., Bang, Y.-C., Choo, H.: New Parameter for Balancing Two Independent Measures in Routing Path. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3046, pp. 56–65. Springer, Heidelberg (2004)
Kim, M., Bang, Y.-C., Choo, H.: Estimated Link Selection for DCLC Problem. In: IEEE International Conference on Communications 2004, Proc. ICC 2004, June 2004, vol. 4, pp. 1937–1941 (2004)
Kim, M., Bang, Y.-C., Choo, H.: On Algorithm for Efficiently Combining Two Independent Measures in Routing Paths. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3483, pp. 989–998. Springer, Heidelberg (2005)
Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE/ACM Trans. Networking 1(3), 286–292 (1993)
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the Web graph. In: Proc. 41st Annual Symposium on Foundations of Computer Science, pp. 57–65 (2000)
Moy, J.: OSPF Version 2 (March 1994), http://www.ietf.org/rfc/rfc1583.txt
Reeves, D.S., Salama, H.F.: A distributed algorithm for delay-constrained unicast routing. IEEE/ACM Transactions on Networking 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)
Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 483–491. Springer, Heidelberg (2004)
Toh, C.-K.: Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs. In: IEEE Proc. INFOCOM 1996, pp. 1380–1387 (1993)
Waxman, B.M.: Routing of Multipoint Connections. IEEE JSAC 9, 1617–1622 (1993)
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)
Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an Internetwork. In: Proc. INFOCOM 1996, pp. 594–602 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, M., Bang, YC., Choo, H. (2005). Estimated Path Selection for the Delay Constrained Least Cost Path. In: Bozanis, P., Houstis, E.N. (eds) Advances in Informatics. PCI 2005. Lecture Notes in Computer Science, vol 3746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11573036_11
Download citation
DOI: https://doi.org/10.1007/11573036_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29673-7
Online ISBN: 978-3-540-32091-3
eBook Packages: Computer ScienceComputer Science (R0)