28 April 2017 in IEEE/ACM Transactions on Networking
In elastic optical networks, two lightpaths sharing common fiber links might have to be isolated in the spectrum domain with a proper guard-band to prevent crosstalk and/or reduce physical-layer security threats. Meanwhile, the actual requirements on guard-band sizes can vary for different lightpath pairs, because of various reasons. Therefore, in this paper, we consider the situation in which the actual guardband requirements for different lightpath pairs are different, and formulate the distance spectrum assignment (DSA) problem to investigate how to assign the spectrum resources efficiently in such a situation. We first define the DSA problem formally and prove its NP-hardness and inapproximability. Then, we analyze and provide the upper and lower bounds for the optimal solution of DSA, and prove that they are tight. In order to solve the DSA problem time-efficiently, we develop a two-phase algorithm. In its first phase, we obtain an initial solution and then the second phase improves the quality of the initial solution with random optimization. We prove that the proposed two-phase algorithm can get the optimal solution in bipartite DSA conflict graphs and can ensure an approximate ratio of O(log(|V|)) in complete DSA conflict graphs, where |V| is the number of vertices in the conflict graph, i.e., the number of lightpaths to be considered. Numerical results demonstrate our proposed algorithm can find near-optimal solutions for DSA in various conflict graphs.
16 June 2020 in IEEE Transactions on Network and Service Management
Network virtualization provides a promising solution to overcome the ossification of current networks, allowing multiple Virtual Network Requests (VNRs) to be embedded on a common infrastructure. The major challenge in network virtualization is the Virtual Network Embedding (VNE) problem, which is to embed VNRs onto a shared substrate network and known to be NP-hard. The topological heterogeneity of VNRs is one important factor hampering the performance of the VNE. However, in many specialized applications and infrastructures, VNRs are of some common structural features e.g., paths and cycles. To achieve better outcomes, it is thus critical to design dedicated algorithms for these applications and infrastructures by taking into accounting topological characteristics. Besides, paths and cycles are two of the most fundamental topologies that all network structures consist of. Exploiting the characteristics of path and cycle embeddings is vital to tackle the general VNE problem. In this paper, we investigate the path and cycle embedding problems. For path embedding, we prove its NP-hardness and inapproximability. Then, by utilizing Multiple Knapsack Problem (MKP) and Multi-Dimensional Knapsack Problem (MDKP), we propose an efficient and effective MKP-MDKP-based algorithm. For cycle embedding, we propose a Weighted Directed Auxiliary Graph (WDAG) to develop a polynomial-time algorithm to determine the least-resource-consuming embedding. Numerical results show our customized algorithms can boost the acceptance ratio and revenue compared to generic embedding algorithms in the literature.