Abstract
This paper investigates the routing efficiency problem with quality of service (QoS). A solution to this problem is needed to provide real-time communication service to connection-oriented applications, such as video and voice transmissions. We propose a new weight parameter by efficiently combining two independent measures, the cost and the delay. The weight ω plays on important role in combining the two measures. If the ω approaches 0, then the path delay is low. Otherwise the path cost is low. Therefore if we decide an ω, we then find the efficient routing path. A case study shows various routing paths for each ω. We also use simulations to show the variety of paths for each ω. When network users have various QoS requirements, the proposed weight parameter is very informative.
This work was supported in parts by Brain Korea 21 and the Ministry of Information and Communication in Republic of Korea. Dr. H. Choo is the corresponding author.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Kim, M., Bang, Y.-C., Choo, H.: Estimated Link Selection for DCLC Problem. In: IEEE ICC 2004, June 2004, vol. 4, pp. 1937–1941 (2004)
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)
Papoulis, A., Pillai, S.U.: Probability, Random Variables, and Stochastic Processes, 4th edn. McGraw-Hill, New York (2002)
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. In: 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. INFOVCOM 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). On Algorithm for Efficiently Combining Two Independent Measures in Routing Paths. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_103
Download citation
DOI: https://doi.org/10.1007/11424925_103
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25863-6
Online ISBN: 978-3-540-32309-9
eBook Packages: Computer ScienceComputer Science (R0)