Achieving maximum throughput with a minimum number of label switched paths in MPLS networks

@article{Wang2005AchievingMT,
  title={Achieving maximum throughput with a minimum number of label switched paths in MPLS networks},
  author={Hua Wang and Jianyu Lou and Yu Chen and Ya-Min Sun and Xiaojun Shen},
  journal={Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.},
  year={2005},
  pages={187-192}
}
MPLS (multi-protocol label switching) networks allow multiple LSPs (label-switched paths) be established from a source to a destination to satisfy throughput required by an application. Given a MPLS network, where each link is associated with a maximum available bandwidth, a fundamental traffic engineering problem is how we can find minimum number of paths to achieve the maximum throughput. Optimally solving this problem can save huge amount of valuable network resources including available… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

and C

T. Cormen, C. Leiserson, R. Rivest
Stein, “Introduction to Algorithms,” second edition, MIT press, Cambridge MA, • 2001
View 4 Excerpts
Highly Influenced

J

K. Kompella
Lang, “Procedure for Modifying the Resource reSerVation Protocol (RSVP)”, RFC 3936, Oct. • 2004
View 1 Excerpt

B

L. Anderson, P. Doolan, N. Feldman, A. Fredette
Thomas, “LDP Specification”, RFC 3036, • 2001
View 1 Excerpt

and R

E. Rosen, A. Viswanathan
Callon, “Multiprotocol Label Switching Architecture”, RFC 3031, • 2001
View 1 Excerpt

Issues on Loop Prevention in MPLS Networks

Y. Ohba
IEEE Communications Magazine, • 1999
View 1 Excerpt

Data Structures and Network Algorithms”, CBMS 44, Society for Industrial and Applied

R. E. Tarjan
1983
View 1 Excerpt

Similar Papers

Loading similar papers…