Tree-based shortest-path routing algorithm

Y. H. Long; T. K. Ho; A. B. Rad; S. P. S. Lam

doi:10.1117/12.333726

16 December 1998 Tree-based shortest-path routing algorithm

Y. H. Long, T. K. Ho, A. B. Rad, S. P. S. Lam

Proceedings Volume 3529, Internet Routing and Quality of Service; (1998) https://doi.org/10.1117/12.333726
Event: Photonics East (ISAM, VVDC, IEMB), 1998, Boston, MA, United States

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.

Citation Download Citation

Y. H. Long, T. K. Ho, A. B. Rad, and S. P. S. Lam "Tree-based shortest-path routing algorithm", Proc. SPIE 3529, Internet Routing and Quality of Service, (16 December 1998); https://doi.org/10.1117/12.333726

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available