Abstract：To keep up with the pace of fast development of Internet,cluster architecture has been proposed for next generation core routers.In a cluster router,parallel computation is expected.Computing shortest path tree (SPT) is a fundamental problem implementing OSPF,which is one of the most popular routing protocols.This paper presents a parallel algorithm D-D(Divisional-Dijkstra Algorithm)for computing SPT,analyzes the performance of D-D,and finally validates the D-D performance by experiments.
张小平;吴建平;周兴;史峰;赵有健;吴鲲. 可扩展路由器中SPT并行计算的实现[J]. 电子学报, 2007, 35(11): 2129-2134.
ZHANG Xiao-ping;WU Jian-ping;ZHOU Xing;SHI Feng;ZHAO You-jian;Wu kun. An Implementation for Parallel Computing SPT in Cluster Router. Chinese Journal of Electronics, 2007, 35(11): 2129-2134.
2007, Vol. 35 
