A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper a heuristic algorithm for finding an optical path in elastic optical path networks is proposed. The proposed algorithm for connection requests finds a spectrum required from an aggregated spectrum of the path belonging to a set of shortest paths measured by the number of links. It has been shown that the proposed algorithm rejects definitely fewer connection requests than the well-known algorithms solving the same problem. Streszczenie. W pracy zaproponowano heurystyczny algorytmdoi:10.15199/48.2015.07.34 fatcat:f4rditd2o5bptmfrvfpd5krtb4