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 条
  • [21] Lattice varieties with non-elementary amalgamation classes
    Ouwehand, P
    Rose, H
    ALGEBRA UNIVERSALIS, 1999, 41 (04) : 317 - 336
  • [22] Large geometric phases and non-elementary monopoles
    Leboeuf, P
    Mouchet, A
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2003, 36 (11): : 2847 - 2856
  • [23] The choice of the best among the shortest routes in transparent optical networks
    Duraes, Gilvan M.
    Soares, Andre
    Amazonas, Jose R.
    Giozza, William
    COMPUTER NETWORKS, 2010, 54 (14) : 2400 - 2409
  • [24] On p-quaternionic pairings of non-elementary type
    Kula, M
    MANUSCRIPTA MATHEMATICA, 2000, 101 (01) : 39 - 47
  • [25] Non-elementary lower bound for Propositional Duration Calculus
    Rabinovich, A
    INFORMATION PROCESSING LETTERS, 1998, 66 (01) : 7 - 11
  • [26] Non-elementary speed-ups in logic calculi
    Arai, Toshiyasu
    MATHEMATICAL LOGIC QUARTERLY, 2008, 54 (06) : 629 - 640
  • [27] Classifying Non-elementary Movements in Vietnamese Mo Dances
    Bourahla, Mustapha
    Telli, Abdelmoutia
    Benferhat, Salem
    Chau, Ma Thi
    DIGITAL HUMAN MODELING AND APPLICATIONS IN HEALTH, SAFETY, ERGONOMICS AND RISK MANAGEMENT. HUMAN BODY AND MOTION, DHM 2019, PT I, 2019, 11581 : 128 - 139
  • [28] On p-quaternionic pairings of non-elementary type
    M. Kula
    manuscripta mathematica, 2000, 101 : 39 - 47
  • [29] BICYCLIC COMMUTATOR QUOTIENTS WITH ONE NON-ELEMENTARY COMPONENT
    Mayer, Daniel C.
    MATHEMATICA BOHEMICA, 2023, 148 (02): : 149 - 180
  • [30] Non-elementary lower bound for Propositional Duration Calculus
    Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel
    Inf. Process. Lett., 1 (7-11):