There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.conferencePlace | KO | - |
dc.citation.conferencePlace | 제주 | - |
dc.citation.endPage | 548 | - |
dc.citation.startPage | 539 | - |
dc.citation.title | International Conference on Information Networking, ICOIN 2002 | - |
dc.contributor.author | Kim, Sung-Dae | - |
dc.contributor.author | Jeon, Hahnearl | - |
dc.contributor.author | Lee, Jaiyong | - |
dc.contributor.author | Kim, Yong-Joon | - |
dc.contributor.author | Kim, Hyung-Taek | - |
dc.date.accessioned | 2023-12-20T06:09:28Z | - |
dc.date.available | 2023-12-20T06:09:28Z | - |
dc.date.created | 2020-05-12 | - |
dc.date.issued | 2002-01-30 | - |
dc.description.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. | - |
dc.identifier.bibliographicCitation | International Conference on Information Networking, ICOIN 2002, pp.539 - 548 | - |
dc.identifier.doi | 10.1007%2F3-540-45803-4_48 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.scopusid | 2-s2.0-84944060082 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/47810 | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007%2F3-540-45803-4_48 | - |
dc.language | 영어 | - |
dc.publisher | ICOIN 2002 | - |
dc.title | Load balancing using modified cost function for constraint-based routing over MPLS networks | - |
dc.type | Conference Paper | - |
dc.date.conferenceDate | 2002-01-30 | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.