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 language | English |
|---|---|
| Title of host publication | Information Networking |
| Subtitle of host publication | Wired Communicationsand Management - International Conference, ICOIN 2002, Revised Papers |
| Editors | Ilyoung Chong, Ilyoung Chong |
| Publisher | Springer Verlag |
| Pages | 539-548 |
| Number of pages | 10 |
| ISBN (Print) | 3540442561 |
| Publication status | Published - 2002 Jan 1 |
| Event | International Conference on Information Networking, ICOIN 2002 - Cheju Island, Korea, Republic of Duration: 2002 Jan 30 → 2002 Feb 1 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 2343 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | International Conference on Information Networking, ICOIN 2002 |
|---|---|
| Country | Korea, Republic of |
| City | Cheju Island |
| Period | 02/1/30 → 02/2/1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
}
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 proceeding › Conference 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
AN - SCOPUS:84944060082
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 -