Optical path accommodation efficiency with provisioning order in Least Fragmentation algorithm

We propose a novel evaluation of optical path accommodation efficiency, and use it to quantify the effectiveness of the Least Fragmentation (LF) algorithm with reference to the optimal solution obtained by Integer Linear Programming (ILP). The evaluations show that the efficiency of the LF algorithm is close to the limit of path accommodation. Specifically, we indicate an advantage relative to the most path-provisioning order that LF algorithm achieves the high performance path-provisioning compared with the other algorithms.