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 条
  • [1] Thermodynamics of non-elementary chemical reaction networks
    Avanzini, Francesco
    Falasco, Gianmaria
    Esposito, Massimiliano
    NEW JOURNAL OF PHYSICS, 2020, 22 (09):
  • [2] An elementary construction for a non-elementary procedure
    Marx M.
    Mikulás S.
    Studia Logica, 2002, 72 (2) : 253 - 263
  • [3] ON NON-ELEMENTARY SINGULAR POINTS
    AGGARWAL, JK
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1966, 281 (01): : 41 - &
  • [4] NON-ELEMENTARY CLASSES OF REPRESENTABLE POSETS
    Egrot, Rob
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2017, 145 (11) : 4675 - 4685
  • [5] ON MINIMAL NON-ELEMENTARY LIE ALGEBRAS
    Towers, David A.
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2015, 143 (01) : 117 - 120
  • [6] Non-elementary solutions of difference equations
    Nishioka, Seiji
    JOURNAL OF DIFFERENCE EQUATIONS AND APPLICATIONS, 2013, 19 (01) : 54 - 58
  • [7] Efficient elementary and restricted non-elementary route pricing
    Martinelli, Rafael
    Pecin, Diego
    Poggi, Marcus
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 239 (01) : 102 - 111
  • [8] Dependence relations in non-elementary classes
    Kolesnikov, AS
    Logic and Its Applications, 2005, 380 : 203 - 230
  • [9] NON-ELEMENTARY CATASTROPHE-THEORY
    STEWART, I
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1983, 30 (09): : 663 - 670
  • [10] FADDEEV EQUATIONS FOR NON-ELEMENTARY PARTICLES
    HAN, CS
    CHUU, DS
    LIN, DL
    BULLETIN OF THE AMERICAN PHYSICAL SOCIETY, 1972, 17 (04): : 609 - &