Pseudo-node reduction on multi-access networks for algorithmic simplification

Matthew R. Thomas

doi:10.1109/LCOMM.2008.080351

Pseudo-node reduction on multi-access networks for algorithmic simplification

2008-07-01

0

PRE

AI

DOI：10.1109/LCOMM.2008.080351

原文链接

原文求助

摘要

En 中文

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.

Keyword:

communication system routing

complexity theory

computer network performance

computer networks

Pseudo-node reduction on multi-access networks for algorithmic simplification

摘要

AI总结

期刊

机构

引用论文