Abstract
Link-state Internet routing protocols such as OSPF and IS-IS currently implement extra nodes called pseudo-nodes in their link-state databases to represent networks. This letter studies the effect that this has on the run-time of Dijkstra's algorithm which is implemented alongside these protocols, and analytically determines a crossover point for the number of routers per network below which pseudo-nodes do not improve the efficiency of routing calculations. The results suggest that pseudo-nodes are not necessary or desirable for any practical network with a mean of less than six routers per Ethernet, contradicting popular belief.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
