Name
Abstract | ||
|---|---|---|
This paper proposes two multi-path constraint-based routing algorithms for Internet traffic engineering using MPLS. In a normal constraint-based shortest path first (CSPF) routing algorithm, there is a high probability that it can not find a feasible path through networks for a large bandwidth constraint which is one of the most important constraints for traffic engineering. The proposed algorithms can divide the bandwidth constraint into two or more subconstraints and find a constrained path for each subconstraint, if there is no single path satisfying the whole constraint. Extensive simulations show that they enhance the success probability of path setup and the utilization of network resources. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/ICC.2003.1203941 | 2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5: NEW FRONTIERS IN TELECOMMUNICATIONS |
Keywords | Field | DocType |
internet traffic engineering,internet,tellurium,routing protocols,internet traffic,quality of service,mpls,multiprotocol label switching,bandwidth | Equal-cost multi-path routing,Link-state routing protocol,Shortest path problem,Multiprotocol Label Switching,Computer science,Path vector protocol,Computer network,Constrained Shortest Path First,Algorithm,Private Network-to-Network Interface,K shortest path routing | Conference |
Citations | PageRank | References |
6 | 0.63 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ho Young Cho | 1 | 46 | 4.96 |
| Jae Yong Lee | 2 | 97 | 23.87 |
| Byung-Chul Kim | 3 | 81 | 13.59 |