Robust routing for local area optical access networks

LEOS Summer Topical Meeting

Volumn , Issue , 2000, Pages 39-40

  Médard, Muriel ^a   Lumetta, Steven S ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; GRAPH THEORY; LOCAL AREA NETWORKS; NETWORK PROTOCOLS; OPTICAL SWITCHES; PACKET SWITCHING; ROUTERS; TELECOMMUNICATION TRAFFIC;

BUFFERING; DEPTH FIRST SEARCH; LOCAL AREA OPTICAL ACCESS NETWORK; ROBUST ROUTING;

FIBER OPTIC NETWORKS;

EID: 0033711198     PISSN: 10994742     EISSN: None     Source Type: Journal    
DOI: 10.1109/LEOSST.2000.869757     Document Type: Article

References (4)

1. A. Itai M. Rodeh The Multi-Tree Approach to Reliability in Distributed Networks Information and Computation 79 43 59 1988
2. A. Lempel S. Even I. Cederbaum An Algorithm for Planarity Testing of Graphs Theory of Graphs, International Symposium 215 232 Theory of Graphs, International Symposium 1966-July
3. M. Médard S. G. Finn R. A. Barry R. G. Gallager Redundant Trees for Preplanned Recovery in Arbitrary Vertex-Redundant or Edge-Redundant Graphs IEEE/ACM Transactions on Networking 1999
4. A. Zehavi A. Itai Three Tree-Paths Journal of Graph Theory 13 2 175 188 1989