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 条
  • [31] Non-elementary exegesis of Twardowski's theory of presentation
    Vasyukov, VL
    LVOV-WARSAW SCHOOL AND CONTEMPORARY PHILOSOPHY, 1998, 273 : 153 - 167
  • [32] Non-elementary speedups between different versions of tableaux
    Baaz, M
    Fermuller, CG
    THEOREM PROVING WITH ANALYTIC TABLEAUX AND RELATED METHODS, 1995, 918 : 217 - 230
  • [33] Non-Elementary Complexities for Branching VASS, MELL, and Extensions
    Lazic, Ranko
    Schmitz, Sylvain
    PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
  • [34] ERGODIC GEOMETRY FOR NON-ELEMENTARY RANK ONE MANIFOLDS
    Link, Gabriele
    Picaud, Jean-Claude
    DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS, 2016, 36 (11) : 6257 - 6284
  • [35] FILTER CONVERGENCE IN NON-STANDARD ANALYSIS OF NON-ELEMENTARY FUNCTIONS
    DOPP, K
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1984, 30 (04): : 353 - 384
  • [36] Non-elementary speed-ups in default reasoning
    Egly, U
    Tompits, H
    QUALITATIVE AND QUANTITATIVE PRACTICAL REASONING, 1997, 1244 : 237 - 251
  • [37] A NON-ELEMENTARY PROOF BY DIFFERENTIAL EQUATION FOR THE CENTRAL LIMIT THEOREM
    Korkmaz, Adil
    Onemli, Muharrem Burak
    PAKISTAN JOURNAL OF STATISTICS, 2013, 29 (03): : 307 - 313
  • [38] USING ELEMENTARY OF NON-ELEMENTARY MODELS IN CONTINGENCY TABLE ANALYSIS - APPLICATION TO MEDICAL PROBLEMS
    ENKE, H
    BIOMETRICAL JOURNAL, 1987, 29 (01) : 11 - 19
  • [39] New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines
    Ibarra, Oscar H.
    McQuillan, Ian
    INFORMATION AND COMPUTATION, 2023, 292
  • [40] C*-SIMPLICITY FOR GROUPS WITH NON-ELEMENTARY CONVERGENCE GROUP ACTIONS
    Matsuda, Yoshifumi
    Oguni, Shin-ichi
    Yamagata, Saeko
    HOUSTON JOURNAL OF MATHEMATICS, 2013, 39 (04): : 1291 - 1299