Estimated path selection for the delay constrained least cost path

Authors:
Moonseong Kim;Young-Cheol Bang;Hyunseung Choo
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Department of Computer Engineering, Korea Polytechnic University, Gyeonggi-Do, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Year:
2005

Citing 11
Cited 0

Data networks (2nd ed.)

Data networks (2nd ed.)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
A distributed algorithm for delay-constrained unicast routing

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Stochastic models for the Web graph

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On generating random network structures: trees

ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Performance evaluation of crossover switch discovery algorithms for wireless ATM LANs

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
On algorithm for efficiently combining two independent measures in routing paths

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Modeling Internet topology

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

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.