The spectrally and spatially flexible optical networks (SS-FON) are the promising solution for future optical transport networks. The joint switching (J-Sw) paradigm is one of the possible switching schemes for SS-FON that brings optical component integration alongside with acceptable networking performance. The network planning of J-Sw is investigated in this paper. The formulation of resource allocation for J-Sw is introduced as in integer linear programming to find the optimal solution. To find the near-optimal solution, the heuristic algorithms are initiated with sorted connection demands. The way connection demands are sorted to initiate the heuristic algorithms affects the accuracy of algorithms. Therefore, six different sorting policies are introduced for J-Sw. Moreover, the heuristic algorithm called joint switching resource allocation (JSRA) algorithm is introduced, especially for J-Sw. The heuristic algorithm performance initiated with different sorting policies is investigated through simulation for a small-size network. The optimality gap is the most important indicator that shows the effect of each sorting policy on the near-optimal solution. The new sorting policy of connection demands called descending frequency width (DFW) policy achieved the least optimality gap. Also, the JSRA performance initiated with these sorting policies is investigated for a real network topology. The obtained results indicate that DFW shows better performance than other sorting policies in realistic networks, too.

Keywords: Optical transport networks, SS-FON, Space division multiplexing, Joint switching, Network planning, Static traffic, Resource allocation, RMLSSA, Sorting policies.

Full-Text [PDF 1062 kb]   (1049 Downloads)