Non-Elementary Routes for Multicasting in Transparent Optical Networks

被引:0
|
作者
Molnar, Miklos [1 ]
机构
[1] Univ Montpellier, LIRMM, 161 Rue Ada, F-34095 Montpellier 5, France
关键词
multicast routing; light-tree; light-hierarchy; protection; p-cycle; non-elementary cycle; WDM NETWORKS;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Connection based networking is a basic technology for data transmission in Transparent Optical Networks (TON). In this kind of networks, important elements of the network design and management are related to the routing decisions in the optical level. To diminish the use of resources, multicasting is required for a lot of applications. Usually, multicast routes are light-trees in TONs. These trees should satisfy the known optical constraints. If it is not possible by a unique tree, "light-forests" are proposed. An alternative and more ergonomic solution called "light-hierarchy" was proposed to solve the multicast routing in constrained cases. We present this non-elementary structure and discuss the advantages and the difficulties of its computation. A related issue is the protection of multicast routes. Mainly segment-based and cycle-based protection schemes are proposed to protect routes against link and eventually node failures. The protection of branching nodes in multicast routes is more difficult. The route should re-established for all successors of the failed branching node and the optical constraints should be satisfied after the re-routing. To improve the protection, we also present non-elementary protection schemes for multicast routes. The aim of the propositions is to eliminate unnecessary constraints in route computations.
引用
收藏
页数:4
相关论文
共 50 条
  • [41] Optimal routes and flows in multicasting over ad hoc networks
    O'Neill, DC
    Li, Y
    VTC2004-SPRING: 2004 IEEE 59TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, PROCEEDINGS, 2004, : 2126 - 2130
  • [42] Non-elementary speed up for model checking synchronous perfect recall
    Cohen, Mika
    Lomuscio, Alessio
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 1077 - +
  • [43] Mixing Shifts of Finite Type with Non-Elementary Surjective Dimension Representations
    Nicholas Long
    Acta Applicandae Mathematicae, 2013, 126 : 277 - 295
  • [44] Multicasting techniques for optical packet networks
    Lee, HL
    Politi, C
    O'Mahony, MJ
    Simeonidou, D
    LONG-HAUL AND ACCESS NETWORKS, OPTICAL METRO AND WDM, 2001, : 225 - 232
  • [45] Lower bound on growth of non-elementary subgroups in relatively hyperbolic groups
    Cui, Yu-Miao
    Jiang, Yue-Ping
    Yang, Wen-Yuan
    JOURNAL OF GROUP THEORY, 2022, 25 (05) : 799 - 822
  • [46] Equivalent transformation of non-elementary arithmetics in automatic test input generation
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing
    100876, China
    Beijing Youdian Daxue Xuebao, 4 (63-67):
  • [47] Mathematical modeling of absorption accompanied by a non-elementary reversible chemical reaction
    Jangara, Hossein
    Shayesteh, Keivan
    Asl, Mehdi Shahedi
    CHEMICAL ENGINEERING RESEARCH & DESIGN, 2020, 157 (157): : 58 - 64
  • [48] Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries
    Bruck, Bruno P.
    Iori, Manuel
    OPERATIONS RESEARCH, 2017, 65 (06) : 1597 - 1614
  • [49] Mixing Shifts of Finite Type with Non-Elementary Surjective Dimension Representations
    Long, Nicholas
    ACTA APPLICANDAE MATHEMATICAE, 2013, 126 (01) : 277 - 295
  • [50] The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable
    Myasnikov, Alexei
    Ushakov, Alexander
    Won, Dong Wook
    JOURNAL OF ALGEBRA, 2011, 345 (01) : 324 - 342