In QoS routing, load balancing routing algorithm for long-lived traffic can be used efficiently to minimize the number of routing update, control traffic overhead and computational overhead which mainly come from network traffic fluctuation. The congestion problem from short-lived traffic is however difficult to handle. A simple and robust algorithm is needed for short-lived traffic to reduce the traffic loss probability. In the paper, we proposed a new hybrid routing schemes for short-lived traffic and long-lived traffic. An alternate routing algorithm is applied for the short-lived traffic when congestion occurs. We restricted the number of additional hops in the path to minimize the negative effect of alternate routing algorithm. The proposed algorithm reduces packet loss probability from 0.6% to 1.7% under various link utilizations. We also compare our proposed algorithms with and without crank-back.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ilhyung JUNG, Hwa Jong KIM, Jun Kyun CHOI, "Alternate Route Selection Algorithm for Short-Lived Traffic (ARSAST) in MPLS Network" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 6, pp. 2456-2464, June 2005, doi: 10.1093/ietcom/e88-b.6.2456.
Abstract: In QoS routing, load balancing routing algorithm for long-lived traffic can be used efficiently to minimize the number of routing update, control traffic overhead and computational overhead which mainly come from network traffic fluctuation. The congestion problem from short-lived traffic is however difficult to handle. A simple and robust algorithm is needed for short-lived traffic to reduce the traffic loss probability. In the paper, we proposed a new hybrid routing schemes for short-lived traffic and long-lived traffic. An alternate routing algorithm is applied for the short-lived traffic when congestion occurs. We restricted the number of additional hops in the path to minimize the negative effect of alternate routing algorithm. The proposed algorithm reduces packet loss probability from 0.6% to 1.7% under various link utilizations. We also compare our proposed algorithms with and without crank-back.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.6.2456/_p
Copy
@ARTICLE{e88-b_6_2456,
author={Ilhyung JUNG, Hwa Jong KIM, Jun Kyun CHOI, },
journal={IEICE TRANSACTIONS on Communications},
title={Alternate Route Selection Algorithm for Short-Lived Traffic (ARSAST) in MPLS Network},
year={2005},
volume={E88-B},
number={6},
pages={2456-2464},
abstract={In QoS routing, load balancing routing algorithm for long-lived traffic can be used efficiently to minimize the number of routing update, control traffic overhead and computational overhead which mainly come from network traffic fluctuation. The congestion problem from short-lived traffic is however difficult to handle. A simple and robust algorithm is needed for short-lived traffic to reduce the traffic loss probability. In the paper, we proposed a new hybrid routing schemes for short-lived traffic and long-lived traffic. An alternate routing algorithm is applied for the short-lived traffic when congestion occurs. We restricted the number of additional hops in the path to minimize the negative effect of alternate routing algorithm. The proposed algorithm reduces packet loss probability from 0.6% to 1.7% under various link utilizations. We also compare our proposed algorithms with and without crank-back.},
keywords={},
doi={10.1093/ietcom/e88-b.6.2456},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Alternate Route Selection Algorithm for Short-Lived Traffic (ARSAST) in MPLS Network
T2 - IEICE TRANSACTIONS on Communications
SP - 2456
EP - 2464
AU - Ilhyung JUNG
AU - Hwa Jong KIM
AU - Jun Kyun CHOI
PY - 2005
DO - 10.1093/ietcom/e88-b.6.2456
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2005
AB - In QoS routing, load balancing routing algorithm for long-lived traffic can be used efficiently to minimize the number of routing update, control traffic overhead and computational overhead which mainly come from network traffic fluctuation. The congestion problem from short-lived traffic is however difficult to handle. A simple and robust algorithm is needed for short-lived traffic to reduce the traffic loss probability. In the paper, we proposed a new hybrid routing schemes for short-lived traffic and long-lived traffic. An alternate routing algorithm is applied for the short-lived traffic when congestion occurs. We restricted the number of additional hops in the path to minimize the negative effect of alternate routing algorithm. The proposed algorithm reduces packet loss probability from 0.6% to 1.7% under various link utilizations. We also compare our proposed algorithms with and without crank-back.
ER -