On algorithm for efficiently combining two independent measures in routing paths

Moonseong Kim; Young Cheol Bang; Hyunseung Choo

doi:10.1007/11424925_103

On algorithm for efficiently combining two independent measures in routing paths

Moonseong Kim, Young Cheol Bang, Hyunseung Choo

Department of Computer Science and Engineering

Research output: Contribution to journal › Conference article › peer-review

4 Scopus citations

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.

Original language	English
Pages (from-to)	989-998
Number of pages	10
Journal	Lecture Notes in Computer Science
Volume	3483
Issue number	IV
DOIs	https://doi.org/10.1007/11424925_103
State	Published - 2005
Event	International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore Duration: 9 May 2005 → 12 May 2005

Access to Document

10.1007/11424925_103

Cite this

@article{01eaceaca71f489baec63e58190d69f6,

title = "On algorithm for efficiently combining two independent measures in routing paths",

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.",

author = "Moonseong Kim and Bang, \{Young Cheol\} and Hyunseung Choo",

year = "2005",

doi = "10.1007/11424925\_103",

language = "English",

volume = "3483",

pages = "989--998",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

number = "IV",

note = "International Conference on Computational Science and Its Applications - ICCSA 2005 ; Conference date: 09-05-2005 Through 12-05-2005",

}

TY - JOUR

T1 - On algorithm for efficiently combining two independent measures in routing paths

AU - Kim, Moonseong

AU - Bang, Young Cheol

AU - Choo, Hyunseung

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/24944587298

U2 - 10.1007/11424925_103

DO - 10.1007/11424925_103

M3 - Conference article

AN - SCOPUS:24944587298

SN - 0302-9743

VL - 3483

SP - 989

EP - 998

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

IS - IV

T2 - International Conference on Computational Science and Its Applications - ICCSA 2005

Y2 - 9 May 2005 through 12 May 2005

ER -

On algorithm for efficiently combining two independent measures in routing paths

Abstract

Access to Document

Other files and links

Fingerprint

Cite this