QoS Routing Algorithm Based on Multiclasses Traffic Load

Hedia KOCHKAR; Takeshi IKENAGA; Yuji OIE

QoS Routing Algorithm Based on Multiclasses Traffic Load

Hedia KOCHKAR, Takeshi IKENAGA, Yuji OIE

Full Text Views

0

Cite this

Summary :

Most of the QoS-based routing schemes proposed so far focus on improving the performance of individual service classes. In a multi-class network where high priority QoS traffic coexists with best-effort traffic, routing decision for QoS sessions will have an effect on lower ones. A mechanism that allows dynamic sharing of link resources among multiple classes of traffic is needed. In this paper we propose a multi-class routing algorithm based on inter-class sharing resources among multiple class of traffic. Our algorithm is based on the concept of "the virtual residual bandwidth," which is derived from the real residual bandwidth. The virtual residual bandwidth is greater than the residual bandwidth when the load of lower priority traffic is light, and smaller when the load of lower priority traffic is heavy. The idea of our approach is simple since the routing algorithm for individual traffic doesn't change, but the only change is the definition of the link cost. We demonstrate through some extensive simulations the effectiveness of our approach when the best effort distribution is uneven and when its load is heavy. Also better performance is noticed when using topology with large number of alternative paths.

Publication: IEICE TRANSACTIONS on Information Vol.E85-D No.8 pp.1219-1225

Publication Date: 2002/08/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on New Technologies in the Internet and their Applications)

Category

Cite this

Copy

Hedia KOCHKAR, Takeshi IKENAGA, Yuji OIE, "QoS Routing Algorithm Based on Multiclasses Traffic Load" in IEICE TRANSACTIONS on Information, vol. E85-D, no. 8, pp. 1219-1225, August 2002, doi: .
Abstract: Most of the QoS-based routing schemes proposed so far focus on improving the performance of individual service classes. In a multi-class network where high priority QoS traffic coexists with best-effort traffic, routing decision for QoS sessions will have an effect on lower ones. A mechanism that allows dynamic sharing of link resources among multiple classes of traffic is needed. In this paper we propose a multi-class routing algorithm based on inter-class sharing resources among multiple class of traffic. Our algorithm is based on the concept of "the virtual residual bandwidth," which is derived from the real residual bandwidth. The virtual residual bandwidth is greater than the residual bandwidth when the load of lower priority traffic is light, and smaller when the load of lower priority traffic is heavy. The idea of our approach is simple since the routing algorithm for individual traffic doesn't change, but the only change is the definition of the link cost. We demonstrate through some extensive simulations the effectiveness of our approach when the best effort distribution is uneven and when its load is heavy. Also better performance is noticed when using topology with large number of alternative paths.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_8_1219/_p

Copy

@ARTICLE{e85-d_8_1219,
author={Hedia KOCHKAR, Takeshi IKENAGA, Yuji OIE, },
journal={IEICE TRANSACTIONS on Information},
title={QoS Routing Algorithm Based on Multiclasses Traffic Load},
year={2002},
volume={E85-D},
number={8},
pages={1219-1225},
abstract={Most of the QoS-based routing schemes proposed so far focus on improving the performance of individual service classes. In a multi-class network where high priority QoS traffic coexists with best-effort traffic, routing decision for QoS sessions will have an effect on lower ones. A mechanism that allows dynamic sharing of link resources among multiple classes of traffic is needed. In this paper we propose a multi-class routing algorithm based on inter-class sharing resources among multiple class of traffic. Our algorithm is based on the concept of "the virtual residual bandwidth," which is derived from the real residual bandwidth. The virtual residual bandwidth is greater than the residual bandwidth when the load of lower priority traffic is light, and smaller when the load of lower priority traffic is heavy. The idea of our approach is simple since the routing algorithm for individual traffic doesn't change, but the only change is the definition of the link cost. We demonstrate through some extensive simulations the effectiveness of our approach when the best effort distribution is uneven and when its load is heavy. Also better performance is noticed when using topology with large number of alternative paths.},
keywords={},
doi={},
ISSN={},
month={August},}

Copy

TY - JOUR
TI - QoS Routing Algorithm Based on Multiclasses Traffic Load
T2 - IEICE TRANSACTIONS on Information
SP - 1219
EP - 1225
AU - Hedia KOCHKAR
AU - Takeshi IKENAGA
AU - Yuji OIE
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2002
AB - Most of the QoS-based routing schemes proposed so far focus on improving the performance of individual service classes. In a multi-class network where high priority QoS traffic coexists with best-effort traffic, routing decision for QoS sessions will have an effect on lower ones. A mechanism that allows dynamic sharing of link resources among multiple classes of traffic is needed. In this paper we propose a multi-class routing algorithm based on inter-class sharing resources among multiple class of traffic. Our algorithm is based on the concept of "the virtual residual bandwidth," which is derived from the real residual bandwidth. The virtual residual bandwidth is greater than the residual bandwidth when the load of lower priority traffic is light, and smaller when the load of lower priority traffic is heavy. The idea of our approach is simple since the routing algorithm for individual traffic doesn't change, but the only change is the definition of the link cost. We demonstrate through some extensive simulations the effectiveness of our approach when the best effort distribution is uneven and when its load is heavy. Also better performance is noticed when using topology with large number of alternative paths.
ER -