Share Email Print
cover

Proceedings Paper

Tree-based shortest-path routing algorithm
Author(s): Y. H. Long; T. K. Ho; A. B. Rad; S. P. S. Lam
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A tree-based shortest path routing algorithm is introduced in this paper. With this algorithm, every network node can maintain a shortest path routing tree topology of the network with itself as the root. In this algorithm, every node constructs its own routing tree based upon its neighbors' routing trees. Initially, the routing tree at each node has the root only, the node itself. As information exchanges, every node's routing tree will evolve until a complete tree is obtained. This algorithm is a trade-off between distance vector algorithm and link state algorithm. Loops are automatically deleted, so there is no count-to- infinity effect. A simple routing tree information storage approach and a protocol data until format to transmit the tree information are given. Some special issues, such as adaptation to topology change, implementation of the algorithm on LAN, convergence and computation overhead etc., are also discussed in the paper.

Paper Details

Date Published: 16 December 1998
PDF: 11 pages
Proc. SPIE 3529, Internet Routing and Quality of Service, (16 December 1998); doi: 10.1117/12.333726
Show Author Affiliations
Y. H. Long, Hong Kong Polytechnic Univ. (Hong Kong)
T. K. Ho, Hong Kong Polytechnic Univ. (Hong Kong)
A. B. Rad, Hong Kong Polytechnic Univ. (Hong Kong)
S. P. S. Lam, National Semiconductor Hong Kong Ltd. (Hong Kong)


Published in SPIE Proceedings Vol. 3529:
Internet Routing and Quality of Service
Raif O. Onvural; Seyhan Civanlar; Paul J. Doolan; Seyhan Civanlar; Paul J. Doolan; James V. Luciani; James V. Luciani, Editor(s)

© SPIE. Terms of Use
Back to Top