.png){kind=icon}
.png){kind=icon}
Return
Pseudo-node reduction on multi-access networks for algorithmic simplification
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2008.080351.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
communication system routing
complexity theory
computer network performance
computer networks