Load balancing using modified cost function for constraint-based routing over MPLS networks

Sung Dae Kim, Hahnearl Jeon, Jai Yong Lee, Yong Joon Kim, Hyung Taek Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

As the traffic grows rapidly in the Internet, the QoS (Quality of Service) guarantee of the flows and the traffic engineering problems have become very important issues. MPLS (MultiProtocol Label Switching) has more advantages to solve the problems than existing IP routing because of more free using of multiple paths between the source and destination pairs. Particularly the availability of Constraint-based Routing and explicit route in MPLS made the problems referred above solved efficiently. But the CSPF algorithm used in Constraint-based Routing has the characteristic that it selects the shortest path of all paths which meet the traffics’ QoS constraints. So, even though Best-effort traffic which is only routed to the shortest path can be routed to alternative path, it is dropped by the intermediate nodes during congestion period. Therefore, if we reroute the best-effort traffic to the alternative path when congestion happens, the network resource could be used efficiently and the load on intermediate router in the path can be less. In this paper, we present the modified cost function used in path computation for best-effort traffic and verify that the using of that cost function make traffic engineering more effective through simulation.

Original languageEnglish
Title of host publicationInformation Networking
Subtitle of host publicationWired Communicationsand Management - International Conference, ICOIN 2002, Revised Papers
EditorsIlyoung Chong, Ilyoung Chong
PublisherSpringer Verlag
Pages539-548
Number of pages10
ISBN (Print)3540442561
Publication statusPublished - 2002 Jan 1
EventInternational Conference on Information Networking, ICOIN 2002 - Cheju Island, Korea, Republic of
Duration: 2002 Jan 302002 Feb 1

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2343
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Conference on Information Networking, ICOIN 2002
CountryKorea, Republic of
CityCheju Island
Period02/1/3002/2/1

Fingerprint

Label Switching
Switching networks
Load Balancing
Telecommunication traffic
Cost functions
Resource allocation
Cost Function
Labels
Quality of service
Routing
Path
Traffic
Routers
Traffic Engineering
Availability
Internet
Congestion
Shortest path
Quality of Service
Alternatives

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kim, S. D., Jeon, H., Lee, J. Y., Kim, Y. J., & Kim, H. T. (2002). Load balancing using modified cost function for constraint-based routing over MPLS networks. In I. Chong, & I. Chong (Eds.), Information Networking: Wired Communicationsand Management - International Conference, ICOIN 2002, Revised Papers (pp. 539-548). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2343). Springer Verlag.
Kim, Sung Dae ; Jeon, Hahnearl ; Lee, Jai Yong ; Kim, Yong Joon ; Kim, Hyung Taek. / Load balancing using modified cost function for constraint-based routing over MPLS networks. Information Networking: Wired Communicationsand Management - International Conference, ICOIN 2002, Revised Papers. editor / Ilyoung Chong ; Ilyoung Chong. Springer Verlag, 2002. pp. 539-548 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3406ac7c7cd040d6bd0f4d400ace916f,
title = "Load balancing using modified cost function for constraint-based routing over MPLS networks",
abstract = "As the traffic grows rapidly in the Internet, the QoS (Quality of Service) guarantee of the flows and the traffic engineering problems have become very important issues. MPLS (MultiProtocol Label Switching) has more advantages to solve the problems than existing IP routing because of more free using of multiple paths between the source and destination pairs. Particularly the availability of Constraint-based Routing and explicit route in MPLS made the problems referred above solved efficiently. But the CSPF algorithm used in Constraint-based Routing has the characteristic that it selects the shortest path of all paths which meet the traffics’ QoS constraints. So, even though Best-effort traffic which is only routed to the shortest path can be routed to alternative path, it is dropped by the intermediate nodes during congestion period. Therefore, if we reroute the best-effort traffic to the alternative path when congestion happens, the network resource could be used efficiently and the load on intermediate router in the path can be less. In this paper, we present the modified cost function used in path computation for best-effort traffic and verify that the using of that cost function make traffic engineering more effective through simulation.",
author = "Kim, {Sung Dae} and Hahnearl Jeon and Lee, {Jai Yong} and Kim, {Yong Joon} and Kim, {Hyung Taek}",
year = "2002",
month = "1",
day = "1",
language = "English",
isbn = "3540442561",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "539--548",
editor = "Ilyoung Chong and Ilyoung Chong",
booktitle = "Information Networking",
address = "Germany",

}

Kim, SD, Jeon, H, Lee, JY, Kim, YJ & Kim, HT 2002, Load balancing using modified cost function for constraint-based routing over MPLS networks. in I Chong & I Chong (eds), Information Networking: Wired Communicationsand Management - International Conference, ICOIN 2002, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2343, Springer Verlag, pp. 539-548, International Conference on Information Networking, ICOIN 2002, Cheju Island, Korea, Republic of, 02/1/30.

Load balancing using modified cost function for constraint-based routing over MPLS networks. / Kim, Sung Dae; Jeon, Hahnearl; Lee, Jai Yong; Kim, Yong Joon; Kim, Hyung Taek.

Information Networking: Wired Communicationsand Management - International Conference, ICOIN 2002, Revised Papers. ed. / Ilyoung Chong; Ilyoung Chong. Springer Verlag, 2002. p. 539-548 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2343).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Load balancing using modified cost function for constraint-based routing over MPLS networks

AU - Kim, Sung Dae

AU - Jeon, Hahnearl

AU - Lee, Jai Yong

AU - Kim, Yong Joon

AU - Kim, Hyung Taek

PY - 2002/1/1

Y1 - 2002/1/1

N2 - As the traffic grows rapidly in the Internet, the QoS (Quality of Service) guarantee of the flows and the traffic engineering problems have become very important issues. MPLS (MultiProtocol Label Switching) has more advantages to solve the problems than existing IP routing because of more free using of multiple paths between the source and destination pairs. Particularly the availability of Constraint-based Routing and explicit route in MPLS made the problems referred above solved efficiently. But the CSPF algorithm used in Constraint-based Routing has the characteristic that it selects the shortest path of all paths which meet the traffics’ QoS constraints. So, even though Best-effort traffic which is only routed to the shortest path can be routed to alternative path, it is dropped by the intermediate nodes during congestion period. Therefore, if we reroute the best-effort traffic to the alternative path when congestion happens, the network resource could be used efficiently and the load on intermediate router in the path can be less. In this paper, we present the modified cost function used in path computation for best-effort traffic and verify that the using of that cost function make traffic engineering more effective through simulation.

AB - As the traffic grows rapidly in the Internet, the QoS (Quality of Service) guarantee of the flows and the traffic engineering problems have become very important issues. MPLS (MultiProtocol Label Switching) has more advantages to solve the problems than existing IP routing because of more free using of multiple paths between the source and destination pairs. Particularly the availability of Constraint-based Routing and explicit route in MPLS made the problems referred above solved efficiently. But the CSPF algorithm used in Constraint-based Routing has the characteristic that it selects the shortest path of all paths which meet the traffics’ QoS constraints. So, even though Best-effort traffic which is only routed to the shortest path can be routed to alternative path, it is dropped by the intermediate nodes during congestion period. Therefore, if we reroute the best-effort traffic to the alternative path when congestion happens, the network resource could be used efficiently and the load on intermediate router in the path can be less. In this paper, we present the modified cost function used in path computation for best-effort traffic and verify that the using of that cost function make traffic engineering more effective through simulation.

UR - http://www.scopus.com/inward/record.url?scp=84944060082&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84944060082&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540442561

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 539

EP - 548

BT - Information Networking

A2 - Chong, Ilyoung

A2 - Chong, Ilyoung

PB - Springer Verlag

ER -

Kim SD, Jeon H, Lee JY, Kim YJ, Kim HT. Load balancing using modified cost function for constraint-based routing over MPLS networks. In Chong I, Chong I, editors, Information Networking: Wired Communicationsand Management - International Conference, ICOIN 2002, Revised Papers. Springer Verlag. 2002. p. 539-548. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).