A novel PCE-based algorithm for P2MP inter-domain traffic engineering in optical networks
暂无分享,去创建一个
Wanyi Gu | Yongli Zhao | Jie Zhang | Dajiang Wang | Koubo Wu | Xuping Cao | Ziyan Yu
[1] Victor J. Rayward-Smith,et al. On finding steiner vertices , 1986, Networks.
[2] Jean-Louis Le Roux,et al. A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths , 2009, RFC.
[3] V. J. Rayward-Smith,et al. The computation of nearly minimal Steiner trees in graphs , 1983 .
[4] George Markowsky,et al. A fast algorithm for Steiner trees , 1981, Acta Informatica.
[5] Dimitri Papadimitriou,et al. Extensions to Resource Reservation Protocol - Traffic Engineering (RSVP-TE) for Point-to-Multipoint TE Label Switched Paths (LSPs) , 2007, RFC.
[6] BERNARD M. WAXMAN,et al. Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..
[7] A.L. Chapin. Standards for bridges and gateways , 1988, IEEE Network.
[8] Zafar Ali,et al. PCE-based Computation Procedure To Compute Shortest Constrained P2MP Inter-domain Traffic Engineering Label Switched Paths , 2011 .
[9] Biswanath Mukherjee,et al. Multicast routing algorithms and protocols: a tutorial , 2000, IEEE Netw..
[10] Adrian Farrel,et al. Applicability of the Path Computation Element (PCE) to Point-to-Multipoint (P2MP) MPLS and GMPLS Traffic Engineering (TE) , 2009, RFC.
[11] Jean-Philippe Vasseur,et al. A Per-Domain Path Computation Method for Establishing Inter-Domain Traffic Engineering (TE) Label Switched Paths (LSPs) , 2008, RFC.
[12] Adrian Farrel,et al. Applicability of the Path Computation Element (PCE) to Point-to-Multipoint (P2MP) Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) Traffic Engineering (TE) , 2009 .
[13] Anees Shaikh,et al. Destination-Driven Routing for Low-Cost Multicast , 1997, IEEE J. Sel. Areas Commun..