期刊文献+

Link-Vertex Topology Aggregation for Multi-domain Path Computation with Hierarchical PCE Architecture 被引量:1

Link-Vertex Topology Aggregation for Multi-domain Path Computation with Hierarchical PCE Architecture
下载PDF
导出
摘要 Inter-domain path computing is one big issue in multi-domain networks. The Hierarchical Path Computing Element (H-PCE) is a semi-central architecture for computing inter-domain path. To facilitate H-PCE in inter-domain path computing, this paper proposed a topology aggregation scheme to abstract the edge nodes and their connected inter-domain link as one vertex to achieve more optimal paths and confidentiality guarantee. The effectiveness of the scheme has been demonstrated on solving wavelength routing in multi-domain Wavelength Division Multiplexing (WDM) network via simulation. Simulation results show that this scheme reduces at least 10% inter-domain blocking probability, compared with the traditional Domain-to-the-Node (DtN) scheme. Inter-domain path computing is one big issue in multi-domain networks. The Hierarchical Path Computing Element (H-PCE) is a semi-central architecture for computing inter-domain path. To facilitate H-PCE in inter-domain path computing, this paper proposed a topology aggregation scheme to abstract the edge nodes and their connected inter-domain link as one vertex to achieve more optimal paths and confidentiality guarantee. The effectiveness of the scheme has been demonstrated on solving wavelength routing in multi-domain Wavelength Division Multiplexing (WDM) network via simulation. Simulation results show that this scheme reduces at least 10% inter-domain blocking probability, compared with the traditional Domain-to-the-Node (DtN) scheme.
出处 《China Communications》 SCIE CSCD 2012年第1期86-91,共6页 中国通信(英文版)
基金 Acknowledgements This work was supported by Chang Jiang Scholars Program of the Ministry of Education of China, National Science Fund for Distinguished Young Scholars under Grant No.60725104 the National Basic Research Program of China under Grant No. 2007CB310706 the National Natural Science Foundation of China under Ca'ant No. 60932002, No. 60932005, No. 61071101 the Hi-Tech Research and Development Program of China under Grant No. 2009AA01Z254, No. 2009AA01Z215 NCEF Program of MoE of China, and Sichuan Youth Science and Technology Foundation under Crant No. 09ZQ026-032.
关键词 ROUTING PCE link-vertex aggregation inter-domain path computation multi-domain network topology aggregation 路径计算 四氯乙烯 拓扑聚集 顶点 建筑 链接 边缘节点 计算单元
  • 相关文献

参考文献6

  • 1DASGUPTA S, DE OUVEIRA J, VASSEUR J, et at. Path?Corrputation-Elernent-Based Architecture for Inter-domain MPLS/CMPLS Traffic Engineering: Overview and Perform?ance[J]. IEEE Network, 2007, 21(4): 38-45. 被引量:1
  • 2FARREL A, VASSEUR J, ASH J, et at. A Path Computation Elerrent (pCE)-Based Architecture[R]. Internet Engineering Task Force (IEfF), IETF RFC 4655, Aug. 2006. 被引量:1
  • 3ZHANG R, BITAR N, LE ROUX J, et at. A Backward- Re?cursive PCE-Based Computation (BRPC) Procedure to Com?pute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths [R]. Internet Engineering Task Force (IEfF), IETF RFC 5441, Apr. 2009. 被引量:1
  • 4PFROILO J, HEMANDEZ-SOIA G, AGRAZ F, et at. Scalable Path Corrputation Flooding Approach for PCE-Based Multi?dorrain Networks[J]. ETRI Journal, 2010, 32(4): 622-625. 被引量:1
  • 5KING D, FARREL A. The Application of the Path CoIl1'U?tation Elerrent Architecture to the Determination of a Se?quence of Domains in MPLS and CMPLS [R]. IETF draft draft-king-pce-hierarchy-fwk-OO.txt, Oct. 2011. 被引量:1
  • 6UU Q, GHANI N, KOK M, et at. Application of Topology Abstraction Techniques in Multi-Domain Optical Networks [C]II Proceedings of 15th International Conference on Com?puter Corrrnmications and Networks: October 9-11, 2006, Arlington, VA. IEEE ICCCN, 2006:1-6. 被引量:1

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部