Detour path optimization algorithm based on traffic duration time in MPLS network

Authors:
Ilhyung Jung;Hwa Jong Kim;Jun Kyun Choi
Affiliations:
Information and Communications University (ICU), Yusong, Daejon, Korea;Kangwon National University, Kangwon-Do, Korea;Information and Communications University (ICU), Yusong, Daejon, Korea
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 7
Cited 0

Fast and scalable layer four switching

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Efficient policies for carrying Web traffic over flow-switched networks

IEEE/ACM Transactions on Networking (TON)
Evaluating the impact of stale link state on quality-of-service routing

IEEE/ACM Transactions on Networking (TON)
On the Cost of Using MPLS for Interdomain Traffic

QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
On path selection for traffic with bandwidth guarantees

ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Invited A new traffic engineering manager for DiffServ/MPLS networks: design and implementation on an IP QoS Testbed

Computer Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

For QoS control, traffic engineering (TE) of large IP backbone networks becomes a critical issue. However, provisioning network resource efficiently through TE is very difficult for ISPs because the traffic volume usually fluctuates widely over time. The congestion especially from short-lived traffic is difficult to handle due to its bursty arrival process. In the paper, we propose a detour routing schemes for short-lived traffic when congestion occurs. Our study shows that additional hops in detour paths should be carefully restricted to avoid network resource waste under heavy load. The proposed algorithm has less packet loss probability and less resource waste because we restricted the hop count by one or two.