Alternative route search algorithm for robust and balanced traffic in telecommunication network

Abstract

: This paper discusses routing policy in optical transport networks. Dijkstra’s shortest path algorithm is compared to a new path computation technique based on heuristics originated from human behavior combined with spectral graph embedding. The two-step procedure allows one to separate the computationally expensive and computationally cheap parts for efficient implementation in network infrastructure.