Name
Title | ||
|---|---|---|
Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices |
Abstract | ||
|---|---|---|
The design of fault-tolerant routings with levelled minimum optical indices plays an important role in the context of optical networks. However, not much is known about the existence of optimal routings with levelled minimum optical indices besides the results established by Dinitz, Ling and Stinson via the partitionable Steiner quadruple systems approach. In this paper, we introduce a new concept of a large set of even levelled P"3@?-design of order v and index 2, denoted by (v,P"3@?,2)-LELD, which is equivalent to an optimal, levelled (v-2)-fault-tolerant routing with levelled minimum optical indices of the complete network with v nodes. On the basis of the theory of three-wise balanced designs and partitionable candelabra systems, several infinite classes of (v,P"3@?,2)-LELDs are constructed. As a consequence, the existence problem for optimal routings with levelled minimum optical indices is solved for nearly a third of the cases. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.dam.2009.12.008 | Discrete Applied Mathematics |
Keywords | Field | DocType |
partitionable steiner quadruple system,large set of p 3 ⃗ -design,candelabra p 3 ⃗ -system,order v,routing,optimal routings,fault-tolerant routing,partitionable candelabra system,optical network,fault-tolerant routings,combinatorial construction,levelled minimum optical index,existence problem,fault tolerance,three-wise balanced design,levelled minimum optical indices,indexation,fault tolerant | Discrete mathematics,Combinatorics,Systems design,Fault tolerance,Mathematics,Steiner system | Journal |
Volume | Issue | ISSN |
158 | 8 | Discrete Applied Mathematics |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiande Zhang | 1 | 52 | 15.19 |
| Gennian Ge | 2 | 904 | 95.51 |