تطوير خوارزمية ROSPF لإيجاد المسار البديل في الشبكات الحاسوبية

Abstract EN

ROSPF is one of the most recently & used algorithms to find the alternate routing path in computer networks in case of failure in the network at the beginning and during convergence toward on agreement on new shortest paths tree in order to keep data flowing i.e to keep network reliable ( for real- time networks where voice & picture are transmitted(.

The alternate path – found eartier and saved in routing table- is used, but this algorithm didn’t consider the effects of diameter & connectivity of the graph represented the network.

In this paper we analyze this effect and discuss the results.