سال انتشار: ۱۳۸۵

محل انتشار: دوازدهمین کنفرانس سالانه انجمن کامپیوتر ایران

تعداد صفحات: ۴

نویسنده(ها):

Mohammad Javad Rostami – Department of Computer Engineering, Faculty of Computer Engineering Shahid Bahonar University,Kerman,Iran
Siavash Khorsandi – Computer Engineering and IT Department Amirkabir University of Technology, Tehran , Iran
Ali Asghar Khodaparast – Computer Engineering and IT Department Amirkabir University of Technology, Tehran , Iran

چکیده:

SRLG is a group of network links that share a common physical resource whose failure will cause the failure of all links of the group. To protect a logical connection in a network from a single SRLG failure, two different paths are usually assigned to the connection. The two paths must be disjoint to avoid synchronous failure. In this paper, weextend a high-performance link-disjoint routing algorithm called CoLE to SRLG-disjoint routing. The analysis and the simulation results demonstrate improvement over the previous algorithms.