A multi-tree generating routing scheme using acyclic orientations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1276, Issue , 1997, Pages 18-22

  Annexstein, Fred S ^a   Berman, Kenneth A ^a   Swaminathan, Ram ^b  

^a 705 Engineering Research Center   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; NETWORK ROUTING; ROUTING PROTOCOLS;

ACYCLIC ORIENTATION; DESTINATION NODES; DYNAMIC NETWORK; GREEDY ALGORITHMS; MODEL-BASED OPC; MONOCHROMATIC TREES; OPTIMAL CAPACITY; UNDERLYING NETWORKS;

TREES (MATHEMATICS);

EID: 1842801481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0045068     Document Type: Conference Paper

References (7)

1. D. Bertsekas and R. Gatlager, 1992. Data Networks, Prentice Hall, New York.
2. J. Cheriyan and S.N. Maheshwari, 1988. Finding non-separating induced cycles and independent spanning trees in 3-connected graphs, Journal of Algorithms 9, pp. 507-537.
3. R. Cohen, B.V. Patel, F. Schaffa, M. Willebeek-LeMair, 1996. The sink tree paradigm: ¢onnectionless traffic support on ATM LAN's IEEE/ACM Trans. on Networking 4, pp. 363-374.
4. Garey and Johnson, 1977. Computers and Intraetibitty, W.H. Freeman and Company, New York.
5. A. Hack, 1995. Disproof of a conjecture about Independent branchings in k-connected directed graphs. Journal of Graph Theory, 20, pp. 235-239.
6. A. Itai and M. Rodeh, 1988. The multi-tree approach to reliability in distributed networks, Information and Computation 79, pp. 43-59.
7. A. Zehavi and A. Itai, 1989. Three tree-pathss. Journal of Graph Theory 13, pp. 175-188.