An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks

被引：0
作者：
José M. F. Craveirinha
João C. N. Clímaco
Lúcia M. R. A. Martins
Marta M. B. Pascoal
机构：
[1] Faculty of Sciences and Technology,Department of Electrical and Computer Engineering
[2] University of Coimbra,Department of Mathematics, Faculty of Sciences and Technology
[3] University of Coimbra,undefined
[4] Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra),undefined
来源：
Telecommunication Systems | 2016年 / 62卷
关键词：
WDM networks; Spanning trees; Multicriteria optimization; Reliable collective communication (RCC); Shared risk link group (SRLG);
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the objectives of which are the minimization of the total number of different SRLGs of the tree links (seeking to maximise reliability) and the minimization of the total bandwidth usage cost. An exact algorithm for generating the whole set of non-dominated solutions and methods for selecting a final solution in various decision environments are put forward. An extensive experimental study on the application of the model, including two sets of experiments based on reference transport network topologies, with random link bandwidth occupations and with random SRLG assignments to the links, is also presented, together with a discussion on potential advantages of the model.
引用
收藏
页码：327 / 346
页数：19
相关论文
共 78 条
  • [1] Van Mieghem P(2005)Influence of the link weight structure on the shortest path Physical Review E 71 056113-215
  • [2] van Langen S(2013)A bi-criteria minimum spanning tree routing model for MPLS/overlay networks Telecommunication Systems 52 203-494
  • [3] Craveirinha J(2003)Diverse routing in optical mesh networks IEEE Transactions on Communications 51 489-336
  • [4] Clímaco J(1984)A quick method for finding shortest pairs of disjoint paths Networks 14 325-12
  • [5] Martins L(2010)An algorithm for enumerating SRLG diverse path pairs Journal of Telecommunications and Information Technology 3 5-2898
  • [6] Silva CG(2009)Finding non-dominated bicriteria shortest pairs of disjoint simple paths Computers & Operations Research 36 2892-749
  • [7] Ferreira N(2013)Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost Telecommunication Systems 52 737-38
  • [8] Hu Jian Qiang(2006)Heuristics for diverse routing in wavelength-routed networks with shared risk link groups Photonic Network Communications 11 29-2693
  • [9] Suurballe JW(2003)Trap avoidance and protection schemes in networks with shared risk link groups Journal of Lightwave Technology 21 2683-16
  • [10] Tarjan RE(2014)Resilient network design: Challenges and future directions Telecommunication Systems 56 5-736
12345678