Robust Routing for Local Area Optical Access Networks
Abstract:
We present a robust optical layer routing for LAN's. We avoid buffering, merging, and using switches for local traffic. The routing consists of collection and distribution portions that perform recovery independently.
Citations
| 97 | An algorithm for planarity testing of graphs – Lempel, Even, et al. - 1967 |
| 36 | The multi-tree approach to reliablity in distributed networks – Itai, Rodeh - 1988 |
| 26 | Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs – Medard, Finn, et al. - 1999 |
| 16 | Three tree-paths – Zehavi, Itai - 1989 |

