Name
Abstract | ||
|---|---|---|
Maňuch and Stacho (Theoret Inform Appl 37 (2003), 255–270) introduced the problem of designing f-tolerant routings in optical networks, i.e. routings which still satisfy the given requests even if f failures occur in the network. In this article, we provide f-tolerant routings in complete and complete balanced bipartite optical networks, optimal according to two parameters: the arc-forwarding index and the optical index. These constructions use tools from design theory and graph theory and improve previous results of Dinitz et al. (Networks 48 (2006), 47–54) for the complete network, and Gupta et al. (J Combin Design 14 (2006), 25–40) for the complete balanced bipartite network. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010 |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1002/net.v56:2 | Networks |
Keywords | Field | DocType |
balanced bipartite optical network,arc-forwarding index,design theory,wdm network,complete network,forwarding and optical indices,inc. networks,f-tolerant routings,optical index,routing,complete balanced bipartite network,optical network,optical networks,fault tolerant routings,graph theory,fault tolerance,fault tolerant,satisfiability,indexation | Graph theory,Wavelength-division multiplexing,Mathematical optimization,Telecommunications network,Network routing,Bipartite graph,Theoretical computer science,Fault tolerance,Design process,Designtheory,Mathematics,Distributed computing | Journal |
Volume | Issue | Citations |
56 | 2 | 3 |
PageRank | References | Authors |
0.43 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stéphane Bessy | 1 | 117 | 19.68 |
| Clément Lepelletier | 2 | 3 | 0.43 |