An Implementation for Parallel Computing SPT in Cluster Router
Youjian Zhao · Dianzi xuebao · 2007
To keep up with the pace of fast development of Internet,cluster architecture has been proposed for next genera- tion 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-Di- jkstra Algorithm)for computing SPT,analyzes the performance of D-D,and finally validates the D-D performance by experiments.