An efficient route generation algorithm for distributed multi-layered network

Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

Volumn , Issue , 1998, Pages 418-422

  Sato, M ^a   Nakamura, M ^b  

^a JustSystems Corporation   (Japan)

^b FUJITSU LABORATORIES LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

DIJKSTRA; HIERARCHICAL NETWORK; MULTI-LAYERED; NUMBER OF LAYERS; ROUTE GENERATION; SCALING-UP; SHORTEST PATH;

NETWORK LAYERS;

EID: 48649097923     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.1998.702558     Document Type: Conference Paper

References (5)

1. T. A. F. T. Committee. Private Network-Network Specification Interface v1.0 (PNNI 1.0), March 1996
2. E. Dijkstra. A note on two problems in connection with graphs. Numer. Math., 1:269-271, 1959
3. D. B. Johnson. Efficient algorithm for shortest paths in sparse network. J. ACM, 24:1-13, January 1977
4. G. Malkin. RIPng for IPv6. IETF draft, April 1995
5. J. Moy. OSPF Version 2. RFC 1583, March 1994