On algorithm for efficiently combining two independent measures in routing paths

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 w plays on important role in combining the two measures. If the w approaches 0, then the path delay is low. Otherwise the path cost is low. Therefore if we decide an w, we then find the efficient routing path. A case study shows various routing paths for each w. We also use simulations to show the variety of paths for each w. When network users have various QoS requirements, the proposed weight parameter is very informative. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Kim, M., Bang, Y. C., & Choo, H. (2005). On algorithm for efficiently combining two independent measures in routing paths. In Lecture Notes in Computer Science (Vol. 3483, pp. 989–998). Springer Verlag. https://doi.org/10.1007/11424925_103

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free