|Table of Contents|

Solution to the Maximum-flow Problem of Network Transmission Based on MPLS(PDF)

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2003年01期
Page:
20-23
Research Field:
Publishing date:

Info

Title:
Solution to the Maximum-flow Problem of Network Transmission Based on MPLS
Author(s):
WangHua SunYamin
Department of Computer Science and Technology,NUST,Nanjing 210094
Keywords:
MPLS t raf fic eng ineering max imum-flow problem
PACS:
TP393.03
DOI:
-
Abstract:
A solut ion to the max imum-flow problem of netw ork transmission via MPLS is proposed in this paper. Mathemat ic method is first put forw ard to address the problem, an int roduct ion to a unique method of dividing the data-flow into micro-branch f low s. The process of sett ing up LSP on the basis of expanding RSVP is described. The simulation results of the a-l gorithm are given.

References:

1 Rosen E, Viswanathan A, Callo n R. Multiprotocol label switching architecture. IETF RFC 3031, http: / / www . ietf. or g/ RFC/ RFC3031. tx t, 2001.
2 Xiao Xipeng, Hannan Alan. Traffic engineering w ith MPLS in the internet[ J] . IEEE Network, 2000, 14( 2) : 29~ 33.
3 谢金星, 邢文训. 网络优化[ M] . 北京: 清华大学出版社, 2000.
4 Awduche D. RSVP- TE: ex tensio ns to RSVP for LSP tunnels. IETF, Internet Draft, http: / / ww w. ietf. org/ Internet- draft/ draft- iet-f mpls- rsv p- lsp- tunne-l 04. txt, 2001.
5 UCB, LBNL, VINnT netwo rk simulator- ns2. http: / / w ww . isi. edu/ nsnam/ ns.

Memo

Memo:
-
Last Update: 2013-03-17