A more efficient link-state routing algorithm for telecommunication networks

An efficient K-shortest paths routing algorithm for computer networks is presented. The Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF, which is only focusing on finding the shortest path route by Dijkstra algorithm. The desire effect to achieve is ma...

Full description

Saved in:
Bibliographic Details
Main Authors: Song Yanwei, Zeng Guangzhou, Lian Jian, MingQu Fan
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Approximation algorithms
Computer networks
Educational institutions
K-shortest paths
OSPF
Quality of service
Routing
routing algorithm
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An efficient K-shortest paths routing algorithm for computer networks is presented. The Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF, which is only focusing on finding the shortest path route by Dijkstra algorithm. The desire effect to achieve is mainly through the use of K-shortest paths algorithm, which has been implemented successfully in some fields like traffic engineering. The correctness of this Algorithm is discussed as long as the comparison with OSPF.
DOI:10.1109/ITiME.2011.6132130